@stackmemoryai/stackmemory 0.3.6 → 0.3.7

package/dist/core/retrieval/graph-retrieval.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/core/retrieval/graph-retrieval.ts"],
-  "sourcesContent": ["/**\n * Graph-Based Retrieval with Explicit Semantic Navigation\n * Models documents as nodes with explicit relationships\n * Query traverses edges instead of embedding space\n *\n * The \"nuclear option\" for next-gen RAG\n */\n\nimport Database from 'better-sqlite3';\nimport { logger } from '../monitoring/logger.js';\nimport { Trace, CompressedTrace } from '../trace/types.js';\nimport { Frame, Anchor } from '../context/frame-manager.js';\nimport crypto from 'crypto';\n\nexport type NodeType =\n  | 'document'\n  | 'concept'\n  | 'entity'\n  | 'event'\n  | 'decision'\n  | 'constraint'\n  | 'topic';\n\nexport type EdgeType =\n  | 'citation' // Document cites another\n  | 'topic_overlap' // Shares topics\n  | 'temporal' // Time sequence\n  | 'causal' // Causality chain\n  | 'semantic' // Semantic similarity\n  | 'structural' // Code structure relation\n  | 'dependency' // Depends on\n  | 'evolution' // Evolves from\n  | 'contradiction' // Contradicts\n  | 'implementation'; // Implements concept\n\nexport interface GraphNode {\n  id: string;\n  type: NodeType;\n  label: string;\n  content?: string;\n  importance: number; // 0-1, affects node size\n  metadata: {\n    created: number;\n    modified: number;\n    accessed: number;\n    accessCount: number;\n    traceIds?: string[];\n    frameIds?: string[];\n    tags?: string[];\n    embeddings?: number[];\n  };\n}\n\nexport interface GraphEdge {\n  id: string;\n  source: string;\n  target: string;\n  type: EdgeType;\n  weight: number; // 0-1, relationship strength\n  metadata: {\n    created: number;\n    evidence?: string[];\n    bidirectional?: boolean;\n  };\n}\n\nexport interface TraversalPath {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  score: number;\n  reasoning: string;\n}\n\nexport interface GraphQuery {\n  startNodes?: string[]; // Start from specific nodes\n  targetNodes?: string[]; // Find paths to targets\n  edgeTypes?: EdgeType[]; // Allowed edge types\n  maxHops?: number; // Max traversal depth\n  minWeight?: number; // Min edge weight\n  nodeTypes?: NodeType[]; // Filter node types\n}\n\nexport interface GraphConfig {\n  maxNodes: number;\n  maxEdges: number;\n  minEdgeWeight: number;\n  importanceThreshold: number;\n  traversalTimeout: number;\n  enableBidirectional: boolean;\n}\n\nexport const DEFAULT_GRAPH_CONFIG: GraphConfig = {\n  maxNodes: 10000,\n  maxEdges: 50000,\n  minEdgeWeight: 0.1,\n  importanceThreshold: 0.3,\n  traversalTimeout: 5000,\n  enableBidirectional: true,\n};\n\n/**\n * Graph-based retrieval system with explicit semantic relationships\n */\nexport class GraphRetrieval {\n  private db: Database.Database;\n  private config: GraphConfig;\n  private nodeIndex: Map<string, GraphNode> = new Map();\n  private adjacencyList: Map<string, GraphEdge[]> = new Map();\n  private reverseAdjacencyList: Map<string, GraphEdge[]> = new Map();\n\n  constructor(db: Database.Database, config: Partial<GraphConfig> = {}) {\n    this.db = db;\n    this.config = { ...DEFAULT_GRAPH_CONFIG, ...config };\n    this.initializeSchema();\n  }\n\n  private initializeSchema(): void {\n    // Nodes table\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS graph_nodes (\n        id TEXT PRIMARY KEY,\n        type TEXT NOT NULL,\n        label TEXT NOT NULL,\n        content TEXT,\n        importance REAL DEFAULT 0.5,\n        created INTEGER DEFAULT (unixepoch() * 1000),\n        modified INTEGER DEFAULT (unixepoch() * 1000),\n        accessed INTEGER DEFAULT (unixepoch() * 1000),\n        access_count INTEGER DEFAULT 0,\n        trace_ids TEXT,\n        frame_ids TEXT,\n        tags TEXT,\n        embeddings BLOB\n      )\n    `);\n\n    // Edges table\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS graph_edges (\n        id TEXT PRIMARY KEY,\n        source TEXT NOT NULL,\n        target TEXT NOT NULL,\n        type TEXT NOT NULL,\n        weight REAL DEFAULT 0.5,\n        created INTEGER DEFAULT (unixepoch() * 1000),\n        evidence TEXT,\n        bidirectional BOOLEAN DEFAULT 0,\n        FOREIGN KEY (source) REFERENCES graph_nodes(id) ON DELETE CASCADE,\n        FOREIGN KEY (target) REFERENCES graph_nodes(id) ON DELETE CASCADE,\n        UNIQUE(source, target, type)\n      )\n    `);\n\n    // Indexes for efficient traversal\n    this.db.exec(`\n      CREATE INDEX IF NOT EXISTS idx_graph_nodes_type ON graph_nodes(type);\n      CREATE INDEX IF NOT EXISTS idx_graph_nodes_importance ON graph_nodes(importance DESC);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_source ON graph_edges(source);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_target ON graph_edges(target);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_type ON graph_edges(type);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_weight ON graph_edges(weight DESC);\n    `);\n  }\n\n  /**\n   * Build graph from traces and frames\n   */\n  async buildGraph(traces: Trace[], frames: Frame[]): Promise<void> {\n    logger.info('Building semantic graph', {\n      traceCount: traces.length,\n      frameCount: frames.length,\n    });\n\n    // Create document nodes from traces\n    for (const trace of traces) {\n      await this.createDocumentNode(trace);\n    }\n\n    // Create concept nodes from frames\n    for (const frame of frames) {\n      await this.createConceptNode(frame);\n    }\n\n    // Establish edges based on relationships\n    await this.establishTemporalEdges(traces);\n    await this.establishCausalEdges(traces);\n    await this.establishSemanticEdges(traces);\n    await this.establishTopicEdges(traces);\n\n    // Load graph into memory for fast traversal\n    await this.loadGraphIntoMemory();\n\n    logger.info('Graph built successfully', {\n      nodes: this.nodeIndex.size,\n      edges: this.adjacencyList.size,\n    });\n  }\n\n  /**\n   * Create document node from trace\n   */\n  private async createDocumentNode(trace: Trace): Promise<GraphNode> {\n    const node: GraphNode = {\n      id: `doc_${trace.id}`,\n      type: 'document',\n      label: trace.summary.substring(0, 100),\n      content: JSON.stringify(trace),\n      importance: trace.score,\n      metadata: {\n        created: trace.metadata.startTime,\n        modified: trace.metadata.endTime,\n        accessed: Date.now(),\n        accessCount: 0,\n        traceIds: [trace.id],\n        tags: [trace.type, ...trace.metadata.filesModified.slice(0, 3)],\n      },\n    };\n\n    await this.insertNode(node);\n    return node;\n  }\n\n  /**\n   * Create concept node from frame\n   */\n  private async createConceptNode(frame: Frame): Promise<GraphNode> {\n    const node: GraphNode = {\n      id: `concept_${frame.id}`,\n      type: 'concept',\n      label: frame.name,\n      importance: frame.score,\n      metadata: {\n        created: frame.created_at,\n        modified: frame.updated_at || frame.created_at,\n        accessed: Date.now(),\n        accessCount: 0,\n        frameIds: [frame.id],\n        tags: [frame.type],\n      },\n    };\n\n    await this.insertNode(node);\n    return node;\n  }\n\n  /**\n   * Establish temporal edges between traces\n   */\n  private async establishTemporalEdges(traces: Trace[]): Promise<void> {\n    // Sort by time\n    const sorted = [...traces].sort(\n      (a, b) => a.metadata.startTime - b.metadata.startTime\n    );\n\n    for (let i = 0; i < sorted.length - 1; i++) {\n      const current = sorted[i];\n      const next = sorted[i + 1];\n\n      // Only link if within reasonable time window (1 hour)\n      const timeDiff = next.metadata.startTime - current.metadata.endTime;\n      if (timeDiff < 60 * 60 * 1000) {\n        const weight = 1 / (1 + timeDiff / (1000 * 60)); // Decay by minutes\n\n        await this.createEdge({\n          id: this.generateId('edge'),\n          source: `doc_${current.id}`,\n          target: `doc_${next.id}`,\n          type: 'temporal',\n          weight,\n          metadata: {\n            created: Date.now(),\n            evidence: [`${timeDiff}ms gap`],\n          },\n        });\n      }\n    }\n  }\n\n  /**\n   * Establish causal edges based on trace relationships\n   */\n  private async establishCausalEdges(traces: Trace[]): Promise<void> {\n    for (const trace of traces) {\n      if (trace.metadata.causalChain && trace.metadata.causalChain.length > 0) {\n        for (const parentId of trace.metadata.causalChain) {\n          const parentExists = traces.find((t) => t.id === parentId);\n          if (parentExists) {\n            await this.createEdge({\n              id: this.generateId('edge'),\n              source: `doc_${parentId}`,\n              target: `doc_${trace.id}`,\n              type: 'causal',\n              weight: 0.9, // Strong causal relationship\n              metadata: {\n                created: Date.now(),\n                evidence: ['explicit causal chain'],\n              },\n            });\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Establish semantic edges based on similarity\n   */\n  private async establishSemanticEdges(traces: Trace[]): Promise<void> {\n    // Compare each pair (expensive but thorough)\n    for (let i = 0; i < traces.length - 1; i++) {\n      for (let j = i + 1; j < traces.length; j++) {\n        const similarity = this.calculateSimilarity(traces[i], traces[j]);\n\n        if (similarity > this.config.minEdgeWeight) {\n          await this.createEdge({\n            id: this.generateId('edge'),\n            source: `doc_${traces[i].id}`,\n            target: `doc_${traces[j].id}`,\n            type: 'semantic',\n            weight: similarity,\n            metadata: {\n              created: Date.now(),\n              evidence: [`similarity: ${similarity.toFixed(2)}`],\n              bidirectional: true,\n            },\n          });\n        }\n      }\n    }\n  }\n\n  /**\n   * Establish topic overlap edges\n   */\n  private async establishTopicEdges(traces: Trace[]): Promise<void> {\n    // Group by topic\n    const topicGroups: Map<string, Trace[]> = new Map();\n\n    for (const trace of traces) {\n      const topic = trace.type;\n      if (!topicGroups.has(topic)) {\n        topicGroups.set(topic, []);\n      }\n      topicGroups.get(topic)!.push(trace);\n    }\n\n    // Connect traces within same topic\n    for (const [topic, group] of topicGroups) {\n      if (group.length < 2) continue;\n\n      // Create topic hub node\n      const topicNode: GraphNode = {\n        id: `topic_${topic}`,\n        type: 'topic',\n        label: topic,\n        importance: 0.7,\n        metadata: {\n          created: Date.now(),\n          modified: Date.now(),\n          accessed: Date.now(),\n          accessCount: 0,\n          tags: [topic],\n        },\n      };\n\n      await this.insertNode(topicNode);\n\n      // Connect all traces to topic hub\n      for (const trace of group) {\n        await this.createEdge({\n          id: this.generateId('edge'),\n          source: `doc_${trace.id}`,\n          target: topicNode.id,\n          type: 'topic_overlap',\n          weight: 0.6,\n          metadata: {\n            created: Date.now(),\n            bidirectional: true,\n          },\n        });\n      }\n    }\n  }\n\n  /**\n   * Traverse graph to find relevant paths\n   */\n  async traverse(query: string, config?: GraphQuery): Promise<TraversalPath[]> {\n    const startTime = Date.now();\n    const queryConfig = config || {};\n    const maxHops = queryConfig.maxHops || 3;\n    const paths: TraversalPath[] = [];\n\n    // Find starting nodes based on query\n    const startNodes = await this.findStartNodes(query, queryConfig);\n\n    if (startNodes.length === 0) {\n      logger.warn('No starting nodes found for query', { query });\n      return [];\n    }\n\n    // Perform BFS/DFS traversal from each start node\n    for (const startNode of startNodes) {\n      const nodePaths = await this.traverseFromNode(\n        startNode,\n        query,\n        maxHops,\n        queryConfig\n      );\n      paths.push(...nodePaths);\n    }\n\n    // Sort by score and limit results\n    paths.sort((a, b) => b.score - a.score);\n    const topPaths = paths.slice(0, 10);\n\n    logger.info('Graph traversal complete', {\n      query: query.substring(0, 50),\n      startNodes: startNodes.length,\n      pathsFound: paths.length,\n      timeMs: Date.now() - startTime,\n    });\n\n    return topPaths;\n  }\n\n  /**\n   * Find starting nodes for traversal\n   */\n  private async findStartNodes(\n    query: string,\n    config: GraphQuery\n  ): Promise<GraphNode[]> {\n    if (config.startNodes) {\n      return config.startNodes\n        .map((id) => this.nodeIndex.get(id))\n        .filter((n) => n !== undefined) as GraphNode[];\n    }\n\n    // Find nodes matching query\n    const queryWords = query.toLowerCase().split(/\\s+/);\n    const candidates: Array<{ node: GraphNode; score: number }> = [];\n\n    for (const node of this.nodeIndex.values()) {\n      if (config.nodeTypes && !config.nodeTypes.includes(node.type)) {\n        continue;\n      }\n\n      const label = node.label.toLowerCase();\n      const tags = (node.metadata.tags || []).join(' ').toLowerCase();\n\n      let score = 0;\n      for (const word of queryWords) {\n        if (label.includes(word)) score += 2;\n        if (tags.includes(word)) score += 1;\n      }\n\n      if (score > 0) {\n        score *= node.importance; // Weight by importance\n        candidates.push({ node, score });\n      }\n    }\n\n    // Sort and return top candidates\n    candidates.sort((a, b) => b.score - a.score);\n    return candidates.slice(0, 5).map((c) => c.node);\n  }\n\n  /**\n   * Traverse from a specific node\n   */\n  private async traverseFromNode(\n    startNode: GraphNode,\n    query: string,\n    maxHops: number,\n    config: GraphQuery\n  ): Promise<TraversalPath[]> {\n    const paths: TraversalPath[] = [];\n    const visited = new Set<string>();\n\n    // BFS queue: [node, path, depth]\n    const queue: Array<{\n      node: GraphNode;\n      path: TraversalPath;\n      depth: number;\n    }> = [\n      {\n        node: startNode,\n        path: {\n          nodes: [startNode],\n          edges: [],\n          score: startNode.importance,\n          reasoning: `Starting from ${startNode.type}: ${startNode.label}`,\n        },\n        depth: 0,\n      },\n    ];\n\n    while (queue.length > 0) {\n      const current = queue.shift()!;\n\n      if (current.depth >= maxHops) {\n        paths.push(current.path);\n        continue;\n      }\n\n      if (visited.has(current.node.id)) {\n        continue;\n      }\n      visited.add(current.node.id);\n\n      // Get outgoing edges\n      const edges = this.adjacencyList.get(current.node.id) || [];\n\n      for (const edge of edges) {\n        // Filter by edge type if specified\n        if (config.edgeTypes && !config.edgeTypes.includes(edge.type)) {\n          continue;\n        }\n\n        // Filter by minimum weight\n        if (config.minWeight && edge.weight < config.minWeight) {\n          continue;\n        }\n\n        const targetNode = this.nodeIndex.get(edge.target);\n        if (!targetNode) continue;\n\n        // Calculate path score\n        const pathScore = this.calculatePathScore(\n          current.path,\n          edge,\n          targetNode,\n          query\n        );\n\n        // Create new path\n        const newPath: TraversalPath = {\n          nodes: [...current.path.nodes, targetNode],\n          edges: [...current.path.edges, edge],\n          score: pathScore,\n          reasoning: `${current.path.reasoning} \u2192 ${edge.type} \u2192 ${targetNode.label}`,\n        };\n\n        queue.push({\n          node: targetNode,\n          path: newPath,\n          depth: current.depth + 1,\n        });\n      }\n    }\n\n    return paths;\n  }\n\n  /**\n   * Calculate path score\n   */\n  private calculatePathScore(\n    currentPath: TraversalPath,\n    edge: GraphEdge,\n    targetNode: GraphNode,\n    query: string\n  ): number {\n    // Base score from current path\n    let score = currentPath.score;\n\n    // Edge weight contribution\n    score *= edge.weight;\n\n    // Target node importance\n    score *= targetNode.importance;\n\n    // Query relevance\n    const queryWords = query.toLowerCase().split(/\\s+/);\n    const targetLabel = targetNode.label.toLowerCase();\n    let relevance = 0;\n    for (const word of queryWords) {\n      if (targetLabel.includes(word)) relevance += 1;\n    }\n    score *= 1 + relevance * 0.2;\n\n    // Path length penalty (prefer shorter paths)\n    score *= Math.pow(0.9, currentPath.nodes.length);\n\n    return score;\n  }\n\n  /**\n   * Calculate similarity between traces\n   */\n  private calculateSimilarity(a: Trace, b: Trace): number {\n    // Type similarity\n    const typeSim = a.type === b.type ? 0.3 : 0;\n\n    // File overlap\n    const filesA = new Set(a.metadata.filesModified);\n    const filesB = new Set(b.metadata.filesModified);\n    const intersection = new Set([...filesA].filter((x) => filesB.has(x)));\n    const union = new Set([...filesA, ...filesB]);\n    const fileSim = union.size > 0 ? (intersection.size / union.size) * 0.3 : 0;\n\n    // Tool overlap\n    const toolsA = new Set(a.tools.map((t) => t.tool));\n    const toolsB = new Set(b.tools.map((t) => t.tool));\n    const toolIntersection = new Set([...toolsA].filter((x) => toolsB.has(x)));\n    const toolUnion = new Set([...toolsA, ...toolsB]);\n    const toolSim =\n      toolUnion.size > 0 ? (toolIntersection.size / toolUnion.size) * 0.2 : 0;\n\n    // Summary text similarity (simple word overlap)\n    const wordsA = new Set(a.summary.toLowerCase().split(/\\s+/));\n    const wordsB = new Set(b.summary.toLowerCase().split(/\\s+/));\n    const wordIntersection = new Set([...wordsA].filter((x) => wordsB.has(x)));\n    const wordUnion = new Set([...wordsA, ...wordsB]);\n    const textSim =\n      wordUnion.size > 0 ? (wordIntersection.size / wordUnion.size) * 0.2 : 0;\n\n    return typeSim + fileSim + toolSim + textSim;\n  }\n\n  /**\n   * Insert node into database\n   */\n  private async insertNode(node: GraphNode): Promise<void> {\n    this.db\n      .prepare(\n        `\n      INSERT OR REPLACE INTO graph_nodes (\n        id, type, label, content, importance,\n        created, modified, accessed, access_count,\n        trace_ids, frame_ids, tags, embeddings\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `\n      )\n      .run(\n        node.id,\n        node.type,\n        node.label,\n        node.content || null,\n        node.importance,\n        node.metadata.created,\n        node.metadata.modified,\n        node.metadata.accessed,\n        node.metadata.accessCount,\n        JSON.stringify(node.metadata.traceIds || []),\n        JSON.stringify(node.metadata.frameIds || []),\n        JSON.stringify(node.metadata.tags || []),\n        node.metadata.embeddings ? Buffer.from(node.metadata.embeddings) : null\n      );\n  }\n\n  /**\n   * Create edge in database\n   */\n  private async createEdge(edge: GraphEdge): Promise<void> {\n    try {\n      this.db\n        .prepare(\n          `\n        INSERT OR IGNORE INTO graph_edges (\n          id, source, target, type, weight,\n          created, evidence, bidirectional\n        ) VALUES (?, ?, ?, ?, ?, ?, ?, ?)\n      `\n        )\n        .run(\n          edge.id,\n          edge.source,\n          edge.target,\n          edge.type,\n          edge.weight,\n          edge.metadata.created,\n          JSON.stringify(edge.metadata.evidence || []),\n          edge.metadata.bidirectional ? 1 : 0\n        );\n    } catch (error) {\n      // Ignore duplicate edges\n    }\n  }\n\n  /**\n   * Load graph into memory for fast traversal\n   */\n  private async loadGraphIntoMemory(): Promise<void> {\n    // Load nodes\n    const nodes = this.db.prepare('SELECT * FROM graph_nodes').all() as any[];\n\n    for (const row of nodes) {\n      const node: GraphNode = {\n        id: row.id,\n        type: row.type as NodeType,\n        label: row.label,\n        content: row.content,\n        importance: row.importance,\n        metadata: {\n          created: row.created,\n          modified: row.modified,\n          accessed: row.accessed,\n          accessCount: row.access_count,\n          traceIds: JSON.parse(row.trace_ids || '[]'),\n          frameIds: JSON.parse(row.frame_ids || '[]'),\n          tags: JSON.parse(row.tags || '[]'),\n        },\n      };\n      this.nodeIndex.set(node.id, node);\n    }\n\n    // Load edges\n    const edges = this.db.prepare('SELECT * FROM graph_edges').all() as any[];\n\n    for (const row of edges) {\n      const edge: GraphEdge = {\n        id: row.id,\n        source: row.source,\n        target: row.target,\n        type: row.type as EdgeType,\n        weight: row.weight,\n        metadata: {\n          created: row.created,\n          evidence: JSON.parse(row.evidence || '[]'),\n          bidirectional: row.bidirectional === 1,\n        },\n      };\n\n      // Add to adjacency list\n      if (!this.adjacencyList.has(edge.source)) {\n        this.adjacencyList.set(edge.source, []);\n      }\n      this.adjacencyList.get(edge.source)!.push(edge);\n\n      // Add to reverse adjacency list\n      if (!this.reverseAdjacencyList.has(edge.target)) {\n        this.reverseAdjacencyList.set(edge.target, []);\n      }\n      this.reverseAdjacencyList.get(edge.target)!.push(edge);\n\n      // If bidirectional, add reverse edge\n      if (edge.metadata.bidirectional) {\n        const reverseEdge = {\n          ...edge,\n          source: edge.target,\n          target: edge.source,\n        };\n        if (!this.adjacencyList.has(reverseEdge.source)) {\n          this.adjacencyList.set(reverseEdge.source, []);\n        }\n        this.adjacencyList.get(reverseEdge.source)!.push(reverseEdge);\n      }\n    }\n  }\n\n  /**\n   * Generate unique ID\n   */\n  private generateId(prefix: string): string {\n    return `${prefix}_${crypto.randomBytes(8).toString('hex')}`;\n  }\n\n  /**\n   * Get graph statistics\n   */\n  getStatistics(): any {\n    const nodeStats = this.db\n      .prepare(\n        `\n      SELECT \n        type,\n        COUNT(*) as count,\n        AVG(importance) as avg_importance,\n        MAX(importance) as max_importance\n      FROM graph_nodes\n      GROUP BY type\n    `\n      )\n      .all();\n\n    const edgeStats = this.db\n      .prepare(\n        `\n      SELECT \n        type,\n        COUNT(*) as count,\n        AVG(weight) as avg_weight,\n        MAX(weight) as max_weight\n      FROM graph_edges\n      GROUP BY type\n    `\n      )\n      .all();\n\n    return {\n      nodes: {\n        total: this.nodeIndex.size,\n        byType: nodeStats,\n        inMemory: this.nodeIndex.size,\n      },\n      edges: {\n        total: edgeStats.reduce((sum: number, e: any) => sum + e.count, 0),\n        byType: edgeStats,\n        adjacencyListSize: this.adjacencyList.size,\n      },\n      connectivity: {\n        avgDegree: this.calculateAverageDegree(),\n        maxDegree: this.calculateMaxDegree(),\n      },\n    };\n  }\n\n  /**\n   * Calculate average node degree\n   */\n  private calculateAverageDegree(): number {\n    if (this.nodeIndex.size === 0) return 0;\n\n    let totalDegree = 0;\n    for (const nodeId of this.nodeIndex.keys()) {\n      const outgoing = this.adjacencyList.get(nodeId)?.length || 0;\n      const incoming = this.reverseAdjacencyList.get(nodeId)?.length || 0;\n      totalDegree += outgoing + incoming;\n    }\n\n    return totalDegree / this.nodeIndex.size;\n  }\n\n  /**\n   * Calculate maximum node degree\n   */\n  private calculateMaxDegree(): number {\n    let maxDegree = 0;\n\n    for (const nodeId of this.nodeIndex.keys()) {\n      const outgoing = this.adjacencyList.get(nodeId)?.length || 0;\n      const incoming = this.reverseAdjacencyList.get(nodeId)?.length || 0;\n      maxDegree = Math.max(maxDegree, outgoing + incoming);\n    }\n\n    return maxDegree;\n  }\n\n  /**\n   * Export graph for visualization\n   */\n  exportForVisualization(): any {\n    const nodes = Array.from(this.nodeIndex.values()).map((node) => ({\n      id: node.id,\n      label: node.label,\n      type: node.type,\n      size: node.importance * 10,\n      color: this.getNodeColor(node.type),\n    }));\n\n    const edges = [];\n    for (const edgeList of this.adjacencyList.values()) {\n      for (const edge of edgeList) {\n        edges.push({\n          source: edge.source,\n          target: edge.target,\n          type: edge.type,\n          weight: edge.weight,\n          color: this.getEdgeColor(edge.type),\n        });\n      }\n    }\n\n    return { nodes, edges };\n  }\n\n  /**\n   * Get node color for visualization\n   */\n  private getNodeColor(type: NodeType): string {\n    const colors: Record<NodeType, string> = {\n      document: '#4A90E2',\n      concept: '#7ED321',\n      entity: '#F5A623',\n      event: '#D0021B',\n      decision: '#9013FE',\n      constraint: '#50E3C2',\n      topic: '#B8E986',\n    };\n    return colors[type] || '#CCCCCC';\n  }\n\n  /**\n   * Get edge color for visualization\n   */\n  private getEdgeColor(type: EdgeType): string {\n    const colors: Record<EdgeType, string> = {\n      citation: '#4A90E2',\n      topic_overlap: '#7ED321',\n      temporal: '#F5A623',\n      causal: '#D0021B',\n      semantic: '#9013FE',\n      structural: '#50E3C2',\n      dependency: '#B8E986',\n      evolution: '#417505',\n      contradiction: '#FF0000',\n      implementation: '#0099FF',\n    };\n    return colors[type] || '#999999';\n  }\n}\n"],
-  "mappings": "AASA,SAAS,cAAc;AAGvB,OAAO,YAAY;AA+EZ,MAAM,uBAAoC;AAAA,EAC/C,UAAU;AAAA,EACV,UAAU;AAAA,EACV,eAAe;AAAA,EACf,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,qBAAqB;AACvB;AAKO,MAAM,eAAe;AAAA,EAClB;AAAA,EACA;AAAA,EACA,YAAoC,oBAAI,IAAI;AAAA,EAC5C,gBAA0C,oBAAI,IAAI;AAAA,EAClD,uBAAiD,oBAAI,IAAI;AAAA,EAEjE,YAAY,IAAuB,SAA+B,CAAC,GAAG;AACpE,SAAK,KAAK;AACV,SAAK,SAAS,EAAE,GAAG,sBAAsB,GAAG,OAAO;AACnD,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEQ,mBAAyB;AAE/B,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAgBZ;AAGD,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAcZ;AAGD,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAOZ;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,QAAiB,QAAgC;AAChE,WAAO,KAAK,2BAA2B;AAAA,MACrC,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO;AAAA,IACrB,CAAC;AAGD,eAAW,SAAS,QAAQ;AAC1B,YAAM,KAAK,mBAAmB,KAAK;AAAA,IACrC;AAGA,eAAW,SAAS,QAAQ;AAC1B,YAAM,KAAK,kBAAkB,KAAK;AAAA,IACpC;AAGA,UAAM,KAAK,uBAAuB,MAAM;AACxC,UAAM,KAAK,qBAAqB,MAAM;AACtC,UAAM,KAAK,uBAAuB,MAAM;AACxC,UAAM,KAAK,oBAAoB,MAAM;AAGrC,UAAM,KAAK,oBAAoB;AAE/B,WAAO,KAAK,4BAA4B;AAAA,MACtC,OAAO,KAAK,UAAU;AAAA,MACtB,OAAO,KAAK,cAAc;AAAA,IAC5B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,mBAAmB,OAAkC;AACjE,UAAM,OAAkB;AAAA,MACtB,IAAI,OAAO,MAAM,EAAE;AAAA,MACnB,MAAM;AAAA,MACN,OAAO,MAAM,QAAQ,UAAU,GAAG,GAAG;AAAA,MACrC,SAAS,KAAK,UAAU,KAAK;AAAA,MAC7B,YAAY,MAAM;AAAA,MAClB,UAAU;AAAA,QACR,SAAS,MAAM,SAAS;AAAA,QACxB,UAAU,MAAM,SAAS;AAAA,QACzB,UAAU,KAAK,IAAI;AAAA,QACnB,aAAa;AAAA,QACb,UAAU,CAAC,MAAM,EAAE;AAAA,QACnB,MAAM,CAAC,MAAM,MAAM,GAAG,MAAM,SAAS,cAAc,MAAM,GAAG,CAAC,CAAC;AAAA,MAChE;AAAA,IACF;AAEA,UAAM,KAAK,WAAW,IAAI;AAC1B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,kBAAkB,OAAkC;AAChE,UAAM,OAAkB;AAAA,MACtB,IAAI,WAAW,MAAM,EAAE;AAAA,MACvB,MAAM;AAAA,MACN,OAAO,MAAM;AAAA,MACb,YAAY,MAAM;AAAA,MAClB,UAAU;AAAA,QACR,SAAS,MAAM;AAAA,QACf,UAAU,MAAM,cAAc,MAAM;AAAA,QACpC,UAAU,KAAK,IAAI;AAAA,QACnB,aAAa;AAAA,QACb,UAAU,CAAC,MAAM,EAAE;AAAA,QACnB,MAAM,CAAC,MAAM,IAAI;AAAA,MACnB;AAAA,IACF;AAEA,UAAM,KAAK,WAAW,IAAI;AAC1B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,uBAAuB,QAAgC;AAEnE,UAAM,SAAS,CAAC,GAAG,MAAM,EAAE;AAAA,MACzB,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS;AAAA,IAC9C;AAEA,aAAS,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;AAC1C,YAAM,UAAU,OAAO,CAAC;AACxB,YAAM,OAAO,OAAO,IAAI,CAAC;AAGzB,YAAM,WAAW,KAAK,SAAS,YAAY,QAAQ,SAAS;AAC5D,UAAI,WAAW,KAAK,KAAK,KAAM;AAC7B,cAAM,SAAS,KAAK,IAAI,YAAY,MAAO;AAE3C,cAAM,KAAK,WAAW;AAAA,UACpB,IAAI,KAAK,WAAW,MAAM;AAAA,UAC1B,QAAQ,OAAO,QAAQ,EAAE;AAAA,UACzB,QAAQ,OAAO,KAAK,EAAE;AAAA,UACtB,MAAM;AAAA,UACN;AAAA,UACA,UAAU;AAAA,YACR,SAAS,KAAK,IAAI;AAAA,YAClB,UAAU,CAAC,GAAG,QAAQ,QAAQ;AAAA,UAChC;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,qBAAqB,QAAgC;AACjE,eAAW,SAAS,QAAQ;AAC1B,UAAI,MAAM,SAAS,eAAe,MAAM,SAAS,YAAY,SAAS,GAAG;AACvE,mBAAW,YAAY,MAAM,SAAS,aAAa;AACjD,gBAAM,eAAe,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,QAAQ;AACzD,cAAI,cAAc;AAChB,kBAAM,KAAK,WAAW;AAAA,cACpB,IAAI,KAAK,WAAW,MAAM;AAAA,cAC1B,QAAQ,OAAO,QAAQ;AAAA,cACvB,QAAQ,OAAO,MAAM,EAAE;AAAA,cACvB,MAAM;AAAA,cACN,QAAQ;AAAA;AAAA,cACR,UAAU;AAAA,gBACR,SAAS,KAAK,IAAI;AAAA,gBAClB,UAAU,CAAC,uBAAuB;AAAA,cACpC;AAAA,YACF,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,uBAAuB,QAAgC;AAEnE,aAAS,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;AAC1C,eAAS,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC1C,cAAM,aAAa,KAAK,oBAAoB,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAEhE,YAAI,aAAa,KAAK,OAAO,eAAe;AAC1C,gBAAM,KAAK,WAAW;AAAA,YACpB,IAAI,KAAK,WAAW,MAAM;AAAA,YAC1B,QAAQ,OAAO,OAAO,CAAC,EAAE,EAAE;AAAA,YAC3B,QAAQ,OAAO,OAAO,CAAC,EAAE,EAAE;AAAA,YAC3B,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,UAAU;AAAA,cACR,SAAS,KAAK,IAAI;AAAA,cAClB,UAAU,CAAC,eAAe,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,cACjD,eAAe;AAAA,YACjB;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,oBAAoB,QAAgC;AAEhE,UAAM,cAAoC,oBAAI,IAAI;AAElD,eAAW,SAAS,QAAQ;AAC1B,YAAM,QAAQ,MAAM;AACpB,UAAI,CAAC,YAAY,IAAI,KAAK,GAAG;AAC3B,oBAAY,IAAI,OAAO,CAAC,CAAC;AAAA,MAC3B;AACA,kBAAY,IAAI,KAAK,EAAG,KAAK,KAAK;AAAA,IACpC;AAGA,eAAW,CAAC,OAAO,KAAK,KAAK,aAAa;AACxC,UAAI,MAAM,SAAS,EAAG;AAGtB,YAAM,YAAuB;AAAA,QAC3B,IAAI,SAAS,KAAK;AAAA,QAClB,MAAM;AAAA,QACN,OAAO;AAAA,QACP,YAAY;AAAA,QACZ,UAAU;AAAA,UACR,SAAS,KAAK,IAAI;AAAA,UAClB,UAAU,KAAK,IAAI;AAAA,UACnB,UAAU,KAAK,IAAI;AAAA,UACnB,aAAa;AAAA,UACb,MAAM,CAAC,KAAK;AAAA,QACd;AAAA,MACF;AAEA,YAAM,KAAK,WAAW,SAAS;AAG/B,iBAAW,SAAS,OAAO;AACzB,cAAM,KAAK,WAAW;AAAA,UACpB,IAAI,KAAK,WAAW,MAAM;AAAA,UAC1B,QAAQ,OAAO,MAAM,EAAE;AAAA,UACvB,QAAQ,UAAU;AAAA,UAClB,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,UAAU;AAAA,YACR,SAAS,KAAK,IAAI;AAAA,YAClB,eAAe;AAAA,UACjB;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,OAAe,QAA+C;AAC3E,UAAM,YAAY,KAAK,IAAI;AAC3B,UAAM,cAAc,UAAU,CAAC;AAC/B,UAAM,UAAU,YAAY,WAAW;AACvC,UAAM,QAAyB,CAAC;AAGhC,UAAM,aAAa,MAAM,KAAK,eAAe,OAAO,WAAW;AAE/D,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO,KAAK,qCAAqC,EAAE,MAAM,CAAC;AAC1D,aAAO,CAAC;AAAA,IACV;AAGA,eAAW,aAAa,YAAY;AAClC,YAAM,YAAY,MAAM,KAAK;AAAA,QAC3B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,YAAM,KAAK,GAAG,SAAS;AAAA,IACzB;AAGA,UAAM,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACtC,UAAM,WAAW,MAAM,MAAM,GAAG,EAAE;AAElC,WAAO,KAAK,4BAA4B;AAAA,MACtC,OAAO,MAAM,UAAU,GAAG,EAAE;AAAA,MAC5B,YAAY,WAAW;AAAA,MACvB,YAAY,MAAM;AAAA,MAClB,QAAQ,KAAK,IAAI,IAAI;AAAA,IACvB,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,eACZ,OACA,QACsB;AACtB,QAAI,OAAO,YAAY;AACrB,aAAO,OAAO,WACX,IAAI,CAAC,OAAO,KAAK,UAAU,IAAI,EAAE,CAAC,EAClC,OAAO,CAAC,MAAM,MAAM,MAAS;AAAA,IAClC;AAGA,UAAM,aAAa,MAAM,YAAY,EAAE,MAAM,KAAK;AAClD,UAAM,aAAwD,CAAC;AAE/D,eAAW,QAAQ,KAAK,UAAU,OAAO,GAAG;AAC1C,UAAI,OAAO,aAAa,CAAC,OAAO,UAAU,SAAS,KAAK,IAAI,GAAG;AAC7D;AAAA,MACF;AAEA,YAAM,QAAQ,KAAK,MAAM,YAAY;AACrC,YAAM,QAAQ,KAAK,SAAS,QAAQ,CAAC,GAAG,KAAK,GAAG,EAAE,YAAY;AAE9D,UAAI,QAAQ;AACZ,iBAAW,QAAQ,YAAY;AAC7B,YAAI,MAAM,SAAS,IAAI,EAAG,UAAS;AACnC,YAAI,KAAK,SAAS,IAAI,EAAG,UAAS;AAAA,MACpC;AAEA,UAAI,QAAQ,GAAG;AACb,iBAAS,KAAK;AACd,mBAAW,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA,MACjC;AAAA,IACF;AAGA,eAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC3C,WAAO,WAAW,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,iBACZ,WACA,OACA,SACA,QAC0B;AAC1B,UAAM,QAAyB,CAAC;AAChC,UAAM,UAAU,oBAAI,IAAY;AAGhC,UAAM,QAID;AAAA,MACH;AAAA,QACE,MAAM;AAAA,QACN,MAAM;AAAA,UACJ,OAAO,CAAC,SAAS;AAAA,UACjB,OAAO,CAAC;AAAA,UACR,OAAO,UAAU;AAAA,UACjB,WAAW,iBAAiB,UAAU,IAAI,KAAK,UAAU,KAAK;AAAA,QAChE;AAAA,QACA,OAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,MAAM;AAE5B,UAAI,QAAQ,SAAS,SAAS;AAC5B,cAAM,KAAK,QAAQ,IAAI;AACvB;AAAA,MACF;AAEA,UAAI,QAAQ,IAAI,QAAQ,KAAK,EAAE,GAAG;AAChC;AAAA,MACF;AACA,cAAQ,IAAI,QAAQ,KAAK,EAAE;AAG3B,YAAM,QAAQ,KAAK,cAAc,IAAI,QAAQ,KAAK,EAAE,KAAK,CAAC;AAE1D,iBAAW,QAAQ,OAAO;AAExB,YAAI,OAAO,aAAa,CAAC,OAAO,UAAU,SAAS,KAAK,IAAI,GAAG;AAC7D;AAAA,QACF;AAGA,YAAI,OAAO,aAAa,KAAK,SAAS,OAAO,WAAW;AACtD;AAAA,QACF;AAEA,cAAM,aAAa,KAAK,UAAU,IAAI,KAAK,MAAM;AACjD,YAAI,CAAC,WAAY;AAGjB,cAAM,YAAY,KAAK;AAAA,UACrB,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAGA,cAAM,UAAyB;AAAA,UAC7B,OAAO,CAAC,GAAG,QAAQ,KAAK,OAAO,UAAU;AAAA,UACzC,OAAO,CAAC,GAAG,QAAQ,KAAK,OAAO,IAAI;AAAA,UACnC,OAAO;AAAA,UACP,WAAW,GAAG,QAAQ,KAAK,SAAS,WAAM,KAAK,IAAI,WAAM,WAAW,KAAK;AAAA,QAC3E;AAEA,cAAM,KAAK;AAAA,UACT,MAAM;AAAA,UACN,MAAM;AAAA,UACN,OAAO,QAAQ,QAAQ;AAAA,QACzB,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,mBACN,aACA,MACA,YACA,OACQ;AAER,QAAI,QAAQ,YAAY;AAGxB,aAAS,KAAK;AAGd,aAAS,WAAW;AAGpB,UAAM,aAAa,MAAM,YAAY,EAAE,MAAM,KAAK;AAClD,UAAM,cAAc,WAAW,MAAM,YAAY;AACjD,QAAI,YAAY;AAChB,eAAW,QAAQ,YAAY;AAC7B,UAAI,YAAY,SAAS,IAAI,EAAG,cAAa;AAAA,IAC/C;AACA,aAAS,IAAI,YAAY;AAGzB,aAAS,KAAK,IAAI,KAAK,YAAY,MAAM,MAAM;AAE/C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,GAAU,GAAkB;AAEtD,UAAM,UAAU,EAAE,SAAS,EAAE,OAAO,MAAM;AAG1C,UAAM,SAAS,IAAI,IAAI,EAAE,SAAS,aAAa;AAC/C,UAAM,SAAS,IAAI,IAAI,EAAE,SAAS,aAAa;AAC/C,UAAM,eAAe,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AACrE,UAAM,QAAQ,oBAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;AAC5C,UAAM,UAAU,MAAM,OAAO,IAAK,aAAa,OAAO,MAAM,OAAQ,MAAM;AAG1E,UAAM,SAAS,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACjD,UAAM,SAAS,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACjD,UAAM,mBAAmB,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AACzE,UAAM,YAAY,oBAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;AAChD,UAAM,UACJ,UAAU,OAAO,IAAK,iBAAiB,OAAO,UAAU,OAAQ,MAAM;AAGxE,UAAM,SAAS,IAAI,IAAI,EAAE,QAAQ,YAAY,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAM,SAAS,IAAI,IAAI,EAAE,QAAQ,YAAY,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAM,mBAAmB,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AACzE,UAAM,YAAY,oBAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;AAChD,UAAM,UACJ,UAAU,OAAO,IAAK,iBAAiB,OAAO,UAAU,OAAQ,MAAM;AAExE,WAAO,UAAU,UAAU,UAAU;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WAAW,MAAgC;AACvD,SAAK,GACF;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOF,EACC;AAAA,MACC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,WAAW;AAAA,MAChB,KAAK;AAAA,MACL,KAAK,SAAS;AAAA,MACd,KAAK,SAAS;AAAA,MACd,KAAK,SAAS;AAAA,MACd,KAAK,SAAS;AAAA,MACd,KAAK,UAAU,KAAK,SAAS,YAAY,CAAC,CAAC;AAAA,MAC3C,KAAK,UAAU,KAAK,SAAS,YAAY,CAAC,CAAC;AAAA,MAC3C,KAAK,UAAU,KAAK,SAAS,QAAQ,CAAC,CAAC;AAAA,MACvC,KAAK,SAAS,aAAa,OAAO,KAAK,KAAK,SAAS,UAAU,IAAI;AAAA,IACrE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WAAW,MAAgC;AACvD,QAAI;AACF,WAAK,GACF;AAAA,QACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMF,EACC;AAAA,QACC,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK,SAAS;AAAA,QACd,KAAK,UAAU,KAAK,SAAS,YAAY,CAAC,CAAC;AAAA,QAC3C,KAAK,SAAS,gBAAgB,IAAI;AAAA,MACpC;AAAA,IACJ,SAAS,OAAO;AAAA,IAEhB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,sBAAqC;AAEjD,UAAM,QAAQ,KAAK,GAAG,QAAQ,2BAA2B,EAAE,IAAI;AAE/D,eAAW,OAAO,OAAO;AACvB,YAAM,OAAkB;AAAA,QACtB,IAAI,IAAI;AAAA,QACR,MAAM,IAAI;AAAA,QACV,OAAO,IAAI;AAAA,QACX,SAAS,IAAI;AAAA,QACb,YAAY,IAAI;AAAA,QAChB,UAAU;AAAA,UACR,SAAS,IAAI;AAAA,UACb,UAAU,IAAI;AAAA,UACd,UAAU,IAAI;AAAA,UACd,aAAa,IAAI;AAAA,UACjB,UAAU,KAAK,MAAM,IAAI,aAAa,IAAI;AAAA,UAC1C,UAAU,KAAK,MAAM,IAAI,aAAa,IAAI;AAAA,UAC1C,MAAM,KAAK,MAAM,IAAI,QAAQ,IAAI;AAAA,QACnC;AAAA,MACF;AACA,WAAK,UAAU,IAAI,KAAK,IAAI,IAAI;AAAA,IAClC;AAGA,UAAM,QAAQ,KAAK,GAAG,QAAQ,2BAA2B,EAAE,IAAI;AAE/D,eAAW,OAAO,OAAO;AACvB,YAAM,OAAkB;AAAA,QACtB,IAAI,IAAI;AAAA,QACR,QAAQ,IAAI;AAAA,QACZ,QAAQ,IAAI;AAAA,QACZ,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA,QACZ,UAAU;AAAA,UACR,SAAS,IAAI;AAAA,UACb,UAAU,KAAK,MAAM,IAAI,YAAY,IAAI;AAAA,UACzC,eAAe,IAAI,kBAAkB;AAAA,QACvC;AAAA,MACF;AAGA,UAAI,CAAC,KAAK,cAAc,IAAI,KAAK,MAAM,GAAG;AACxC,aAAK,cAAc,IAAI,KAAK,QAAQ,CAAC,CAAC;AAAA,MACxC;AACA,WAAK,cAAc,IAAI,KAAK,MAAM,EAAG,KAAK,IAAI;AAG9C,UAAI,CAAC,KAAK,qBAAqB,IAAI,KAAK,MAAM,GAAG;AAC/C,aAAK,qBAAqB,IAAI,KAAK,QAAQ,CAAC,CAAC;AAAA,MAC/C;AACA,WAAK,qBAAqB,IAAI,KAAK,MAAM,EAAG,KAAK,IAAI;AAGrD,UAAI,KAAK,SAAS,eAAe;AAC/B,cAAM,cAAc;AAAA,UAClB,GAAG;AAAA,UACH,QAAQ,KAAK;AAAA,UACb,QAAQ,KAAK;AAAA,QACf;AACA,YAAI,CAAC,KAAK,cAAc,IAAI,YAAY,MAAM,GAAG;AAC/C,eAAK,cAAc,IAAI,YAAY,QAAQ,CAAC,CAAC;AAAA,QAC/C;AACA,aAAK,cAAc,IAAI,YAAY,MAAM,EAAG,KAAK,WAAW;AAAA,MAC9D;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,QAAwB;AACzC,WAAO,GAAG,MAAM,IAAI,OAAO,YAAY,CAAC,EAAE,SAAS,KAAK,CAAC;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAqB;AACnB,UAAM,YAAY,KAAK,GACpB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASF,EACC,IAAI;AAEP,UAAM,YAAY,KAAK,GACpB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASF,EACC,IAAI;AAEP,WAAO;AAAA,MACL,OAAO;AAAA,QACL,OAAO,KAAK,UAAU;AAAA,QACtB,QAAQ;AAAA,QACR,UAAU,KAAK,UAAU;AAAA,MAC3B;AAAA,MACA,OAAO;AAAA,QACL,OAAO,UAAU,OAAO,CAAC,KAAa,MAAW,MAAM,EAAE,OAAO,CAAC;AAAA,QACjE,QAAQ;AAAA,QACR,mBAAmB,KAAK,cAAc;AAAA,MACxC;AAAA,MACA,cAAc;AAAA,QACZ,WAAW,KAAK,uBAAuB;AAAA,QACvC,WAAW,KAAK,mBAAmB;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,yBAAiC;AACvC,QAAI,KAAK,UAAU,SAAS,EAAG,QAAO;AAEtC,QAAI,cAAc;AAClB,eAAW,UAAU,KAAK,UAAU,KAAK,GAAG;AAC1C,YAAM,WAAW,KAAK,cAAc,IAAI,MAAM,GAAG,UAAU;AAC3D,YAAM,WAAW,KAAK,qBAAqB,IAAI,MAAM,GAAG,UAAU;AAClE,qBAAe,WAAW;AAAA,IAC5B;AAEA,WAAO,cAAc,KAAK,UAAU;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKQ,qBAA6B;AACnC,QAAI,YAAY;AAEhB,eAAW,UAAU,KAAK,UAAU,KAAK,GAAG;AAC1C,YAAM,WAAW,KAAK,cAAc,IAAI,MAAM,GAAG,UAAU;AAC3D,YAAM,WAAW,KAAK,qBAAqB,IAAI,MAAM,GAAG,UAAU;AAClE,kBAAY,KAAK,IAAI,WAAW,WAAW,QAAQ;AAAA,IACrD;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,yBAA8B;AAC5B,UAAM,QAAQ,MAAM,KAAK,KAAK,UAAU,OAAO,CAAC,EAAE,IAAI,CAAC,UAAU;AAAA,MAC/D,IAAI,KAAK;AAAA,MACT,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,MAAM,KAAK,aAAa;AAAA,MACxB,OAAO,KAAK,aAAa,KAAK,IAAI;AAAA,IACpC,EAAE;AAEF,UAAM,QAAQ,CAAC;AACf,eAAW,YAAY,KAAK,cAAc,OAAO,GAAG;AAClD,iBAAW,QAAQ,UAAU;AAC3B,cAAM,KAAK;AAAA,UACT,QAAQ,KAAK;AAAA,UACb,QAAQ,KAAK;AAAA,UACb,MAAM,KAAK;AAAA,UACX,QAAQ,KAAK;AAAA,UACb,OAAO,KAAK,aAAa,KAAK,IAAI;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO,EAAE,OAAO,MAAM;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,MAAwB;AAC3C,UAAM,SAAmC;AAAA,MACvC,UAAU;AAAA,MACV,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,OAAO;AAAA,IACT;AACA,WAAO,OAAO,IAAI,KAAK;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,MAAwB;AAC3C,UAAM,SAAmC;AAAA,MACvC,UAAU;AAAA,MACV,eAAe;AAAA,MACf,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,eAAe;AAAA,MACf,gBAAgB;AAAA,IAClB;AACA,WAAO,OAAO,IAAI,KAAK;AAAA,EACzB;AACF;",
+  "sourcesContent": ["/**\n * Graph-Based Retrieval with Explicit Semantic Navigation\n * Models documents as nodes with explicit relationships\n * Query traverses edges instead of embedding space\n *\n * The \"nuclear option\" for next-gen RAG\n */\n\nimport Database from 'better-sqlite3';\nimport { logger } from '../monitoring/logger.js';\nimport { Trace, CompressedTrace } from '../trace/types.js';\nimport { Frame, Anchor } from '../context/frame-manager.js';\nimport crypto from 'crypto';\n\nexport type NodeType =\n  | 'document'\n  | 'concept'\n  | 'entity'\n  | 'event'\n  | 'decision'\n  | 'constraint'\n  | 'topic';\n\nexport type EdgeType =\n  | 'citation' // Document cites another\n  | 'topic_overlap' // Shares topics\n  | 'temporal' // Time sequence\n  | 'causal' // Causality chain\n  | 'semantic' // Semantic similarity\n  | 'structural' // Code structure relation\n  | 'dependency' // Depends on\n  | 'evolution' // Evolves from\n  | 'contradiction' // Contradicts\n  | 'implementation'; // Implements concept\n\nexport interface GraphNode {\n  id: string;\n  type: NodeType;\n  label: string;\n  content?: string;\n  importance: number; // 0-1, affects node size\n  metadata: {\n    created: number;\n    modified: number;\n    accessed: number;\n    accessCount: number;\n    traceIds?: string[];\n    frameIds?: string[];\n    tags?: string[];\n    embeddings?: number[];\n  };\n}\n\nexport interface GraphEdge {\n  id: string;\n  source: string;\n  target: string;\n  type: EdgeType;\n  weight: number; // 0-1, relationship strength\n  metadata: {\n    created: number;\n    evidence?: string[];\n    bidirectional?: boolean;\n  };\n}\n\nexport interface TraversalPath {\n  nodes: GraphNode[];\n  edges: GraphEdge[];\n  score: number;\n  reasoning: string;\n}\n\nexport interface GraphQuery {\n  startNodes?: string[]; // Start from specific nodes\n  targetNodes?: string[]; // Find paths to targets\n  edgeTypes?: EdgeType[]; // Allowed edge types\n  maxHops?: number; // Max traversal depth\n  minWeight?: number; // Min edge weight\n  nodeTypes?: NodeType[]; // Filter node types\n}\n\nexport interface GraphConfig {\n  maxNodes: number;\n  maxEdges: number;\n  minEdgeWeight: number;\n  importanceThreshold: number;\n  traversalTimeout: number;\n  enableBidirectional: boolean;\n}\n\nexport const DEFAULT_GRAPH_CONFIG: GraphConfig = {\n  maxNodes: 10000,\n  maxEdges: 50000,\n  minEdgeWeight: 0.1,\n  importanceThreshold: 0.3,\n  traversalTimeout: 5000,\n  enableBidirectional: true,\n};\n\n/**\n * Graph-based retrieval system with explicit semantic relationships\n */\nexport class GraphRetrieval {\n  private db: Database.Database;\n  private config: GraphConfig;\n  private nodeIndex: Map<string, GraphNode> = new Map();\n  private adjacencyList: Map<string, GraphEdge[]> = new Map();\n  private reverseAdjacencyList: Map<string, GraphEdge[]> = new Map();\n\n  constructor(db: Database.Database, config: Partial<GraphConfig> = {}) {\n    this.db = db;\n    this.config = { ...DEFAULT_GRAPH_CONFIG, ...config };\n    this.initializeSchema();\n  }\n\n  private initializeSchema(): void {\n    // Nodes table\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS graph_nodes (\n        id TEXT PRIMARY KEY,\n        type TEXT NOT NULL,\n        label TEXT NOT NULL,\n        content TEXT,\n        importance REAL DEFAULT 0.5,\n        created INTEGER DEFAULT (unixepoch() * 1000),\n        modified INTEGER DEFAULT (unixepoch() * 1000),\n        accessed INTEGER DEFAULT (unixepoch() * 1000),\n        access_count INTEGER DEFAULT 0,\n        trace_ids TEXT,\n        frame_ids TEXT,\n        tags TEXT,\n        embeddings BLOB\n      )\n    `);\n\n    // Edges table\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS graph_edges (\n        id TEXT PRIMARY KEY,\n        source TEXT NOT NULL,\n        target TEXT NOT NULL,\n        type TEXT NOT NULL,\n        weight REAL DEFAULT 0.5,\n        created INTEGER DEFAULT (unixepoch() * 1000),\n        evidence TEXT,\n        bidirectional BOOLEAN DEFAULT 0,\n        FOREIGN KEY (source) REFERENCES graph_nodes(id) ON DELETE CASCADE,\n        FOREIGN KEY (target) REFERENCES graph_nodes(id) ON DELETE CASCADE,\n        UNIQUE(source, target, type)\n      )\n    `);\n\n    // Indexes for efficient traversal\n    this.db.exec(`\n      CREATE INDEX IF NOT EXISTS idx_graph_nodes_type ON graph_nodes(type);\n      CREATE INDEX IF NOT EXISTS idx_graph_nodes_importance ON graph_nodes(importance DESC);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_source ON graph_edges(source);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_target ON graph_edges(target);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_type ON graph_edges(type);\n      CREATE INDEX IF NOT EXISTS idx_graph_edges_weight ON graph_edges(weight DESC);\n    `);\n  }\n\n  /**\n   * Build graph from traces and frames\n   */\n  async buildGraph(traces: Trace[], frames: Frame[]): Promise<void> {\n    logger.info('Building semantic graph', {\n      traceCount: traces.length,\n      frameCount: frames.length,\n    });\n\n    // Create document nodes from traces\n    for (const trace of traces) {\n      await this.createDocumentNode(trace);\n    }\n\n    // Create concept nodes from frames\n    for (const frame of frames) {\n      await this.createConceptNode(frame);\n    }\n\n    // Establish edges based on relationships\n    await this.establishTemporalEdges(traces);\n    await this.establishCausalEdges(traces);\n    await this.establishSemanticEdges(traces);\n    await this.establishTopicEdges(traces);\n\n    // Load graph into memory for fast traversal\n    await this.loadGraphIntoMemory();\n\n    logger.info('Graph built successfully', {\n      nodes: this.nodeIndex.size,\n      edges: this.adjacencyList.size,\n    });\n  }\n\n  /**\n   * Create document node from trace\n   */\n  private async createDocumentNode(trace: Trace): Promise<GraphNode> {\n    const node: GraphNode = {\n      id: `doc_${trace.id}`,\n      type: 'document',\n      label: trace.summary.substring(0, 100),\n      content: JSON.stringify(trace),\n      importance: trace.score,\n      metadata: {\n        created: trace.metadata.startTime,\n        modified: trace.metadata.endTime,\n        accessed: Date.now(),\n        accessCount: 0,\n        traceIds: [trace.id],\n        tags: [trace.type, ...trace.metadata.filesModified.slice(0, 3)],\n      },\n    };\n\n    await this.insertNode(node);\n    return node;\n  }\n\n  /**\n   * Create concept node from frame\n   */\n  private async createConceptNode(frame: Frame): Promise<GraphNode> {\n    const node: GraphNode = {\n      id: `concept_${frame.id}`,\n      type: 'concept',\n      label: frame.name,\n      importance: frame.score,\n      metadata: {\n        created: frame.created_at,\n        modified: frame.updated_at || frame.created_at,\n        accessed: Date.now(),\n        accessCount: 0,\n        frameIds: [frame.id],\n        tags: [frame.type],\n      },\n    };\n\n    await this.insertNode(node);\n    return node;\n  }\n\n  /**\n   * Establish temporal edges between traces\n   */\n  private async establishTemporalEdges(traces: Trace[]): Promise<void> {\n    // Sort by time\n    const sorted = [...traces].sort(\n      (a, b) => a.metadata.startTime - b.metadata.startTime\n    );\n\n    for (let i = 0; i < sorted.length - 1; i++) {\n      const current = sorted[i];\n      const next = sorted[i + 1];\n\n      // Only link if within reasonable time window (1 hour)\n      const timeDiff = next.metadata.startTime - current.metadata.endTime;\n      if (timeDiff < 60 * 60 * 1000) {\n        const weight = 1 / (1 + timeDiff / (1000 * 60)); // Decay by minutes\n\n        await this.createEdge({\n          id: this.generateId('edge'),\n          source: `doc_${current.id}`,\n          target: `doc_${next.id}`,\n          type: 'temporal',\n          weight,\n          metadata: {\n            created: Date.now(),\n            evidence: [`${timeDiff}ms gap`],\n          },\n        });\n      }\n    }\n  }\n\n  /**\n   * Establish causal edges based on trace relationships\n   */\n  private async establishCausalEdges(traces: Trace[]): Promise<void> {\n    for (const trace of traces) {\n      if (trace.metadata.causalChain && trace.metadata.causalChain.length > 0) {\n        for (const parentId of trace.metadata.causalChain) {\n          const parentExists = traces.find((t) => t.id === parentId);\n          if (parentExists) {\n            await this.createEdge({\n              id: this.generateId('edge'),\n              source: `doc_${parentId}`,\n              target: `doc_${trace.id}`,\n              type: 'causal',\n              weight: 0.9, // Strong causal relationship\n              metadata: {\n                created: Date.now(),\n                evidence: ['explicit causal chain'],\n              },\n            });\n          }\n        }\n      }\n    }\n  }\n\n  /**\n   * Establish semantic edges based on similarity\n   */\n  private async establishSemanticEdges(traces: Trace[]): Promise<void> {\n    // Compare each pair (expensive but thorough)\n    for (let i = 0; i < traces.length - 1; i++) {\n      for (let j = i + 1; j < traces.length; j++) {\n        const similarity = this.calculateSimilarity(traces[i], traces[j]);\n\n        if (similarity > this.config.minEdgeWeight) {\n          await this.createEdge({\n            id: this.generateId('edge'),\n            source: `doc_${traces[i].id}`,\n            target: `doc_${traces[j].id}`,\n            type: 'semantic',\n            weight: similarity,\n            metadata: {\n              created: Date.now(),\n              evidence: [`similarity: ${similarity.toFixed(2)}`],\n              bidirectional: true,\n            },\n          });\n        }\n      }\n    }\n  }\n\n  /**\n   * Establish topic overlap edges\n   */\n  private async establishTopicEdges(traces: Trace[]): Promise<void> {\n    // Group by topic\n    const topicGroups: Map<string, Trace[]> = new Map();\n\n    for (const trace of traces) {\n      const topic = trace.type;\n      if (!topicGroups.has(topic)) {\n        topicGroups.set(topic, []);\n      }\n      topicGroups.get(topic)!.push(trace);\n    }\n\n    // Connect traces within same topic\n    for (const [topic, group] of topicGroups) {\n      if (group.length < 2) continue;\n\n      // Create topic hub node\n      const topicNode: GraphNode = {\n        id: `topic_${topic}`,\n        type: 'topic',\n        label: topic,\n        importance: 0.7,\n        metadata: {\n          created: Date.now(),\n          modified: Date.now(),\n          accessed: Date.now(),\n          accessCount: 0,\n          tags: [topic],\n        },\n      };\n\n      await this.insertNode(topicNode);\n\n      // Connect all traces to topic hub\n      for (const trace of group) {\n        await this.createEdge({\n          id: this.generateId('edge'),\n          source: `doc_${trace.id}`,\n          target: topicNode.id,\n          type: 'topic_overlap',\n          weight: 0.6,\n          metadata: {\n            created: Date.now(),\n            bidirectional: true,\n          },\n        });\n      }\n    }\n  }\n\n  /**\n   * Traverse graph to find relevant paths\n   */\n  async traverse(query: string, config?: GraphQuery): Promise<TraversalPath[]> {\n    const startTime = Date.now();\n    const queryConfig = config || {};\n    const maxHops = queryConfig.maxHops || 3;\n    const paths: TraversalPath[] = [];\n\n    // Find starting nodes based on query\n    const startNodes = await this.findStartNodes(query, queryConfig);\n\n    if (startNodes.length === 0) {\n      logger.warn('No starting nodes found for query', { query });\n      return [];\n    }\n\n    // Perform BFS/DFS traversal from each start node\n    for (const startNode of startNodes) {\n      const nodePaths = await this.traverseFromNode(\n        startNode,\n        query,\n        maxHops,\n        queryConfig\n      );\n      paths.push(...nodePaths);\n    }\n\n    // Sort by score and limit results\n    paths.sort((a, b) => b.score - a.score);\n    const topPaths = paths.slice(0, 10);\n\n    logger.info('Graph traversal complete', {\n      query: query.substring(0, 50),\n      startNodes: startNodes.length,\n      pathsFound: paths.length,\n      timeMs: Date.now() - startTime,\n    });\n\n    return topPaths;\n  }\n\n  /**\n   * Find starting nodes for traversal\n   */\n  private async findStartNodes(\n    query: string,\n    config: GraphQuery\n  ): Promise<GraphNode[]> {\n    if (config.startNodes) {\n      return config.startNodes\n        .map((id) => this.nodeIndex.get(id))\n        .filter((n) => n !== undefined) as GraphNode[];\n    }\n\n    // Find nodes matching query\n    const queryWords = query.toLowerCase().split(/\\s+/);\n    const candidates: Array<{ node: GraphNode; score: number }> = [];\n\n    for (const node of this.nodeIndex.values()) {\n      if (config.nodeTypes && !config.nodeTypes.includes(node.type)) {\n        continue;\n      }\n\n      const label = node.label.toLowerCase();\n      const tags = (node.metadata.tags || []).join(' ').toLowerCase();\n\n      let score = 0;\n      for (const word of queryWords) {\n        if (label.includes(word)) score += 2;\n        if (tags.includes(word)) score += 1;\n      }\n\n      if (score > 0) {\n        score *= node.importance; // Weight by importance\n        candidates.push({ node, score });\n      }\n    }\n\n    // Sort and return top candidates\n    candidates.sort((a, b) => b.score - a.score);\n    return candidates.slice(0, 5).map((c) => c.node);\n  }\n\n  /**\n   * Traverse from a specific node\n   */\n  private async traverseFromNode(\n    startNode: GraphNode,\n    query: string,\n    maxHops: number,\n    config: GraphQuery\n  ): Promise<TraversalPath[]> {\n    const paths: TraversalPath[] = [];\n    const visited = new Set<string>();\n\n    // BFS queue: [node, path, depth]\n    const queue: Array<{\n      node: GraphNode;\n      path: TraversalPath;\n      depth: number;\n    }> = [\n      {\n        node: startNode,\n        path: {\n          nodes: [startNode],\n          edges: [],\n          score: startNode.importance,\n          reasoning: `Starting from ${startNode.type}: ${startNode.label}`,\n        },\n        depth: 0,\n      },\n    ];\n\n    while (queue.length > 0) {\n      const current = queue.shift()!;\n\n      if (current.depth >= maxHops) {\n        paths.push(current.path);\n        continue;\n      }\n\n      if (visited.has(current.node.id)) {\n        continue;\n      }\n      visited.add(current.node.id);\n\n      // Get outgoing edges\n      const edges = this.adjacencyList.get(current.node.id) || [];\n\n      for (const edge of edges) {\n        // Filter by edge type if specified\n        if (config.edgeTypes && !config.edgeTypes.includes(edge.type)) {\n          continue;\n        }\n\n        // Filter by minimum weight\n        if (config.minWeight && edge.weight < config.minWeight) {\n          continue;\n        }\n\n        const targetNode = this.nodeIndex.get(edge.target);\n        if (!targetNode) continue;\n\n        // Calculate path score\n        const pathScore = this.calculatePathScore(\n          current.path,\n          edge,\n          targetNode,\n          query\n        );\n\n        // Create new path\n        const newPath: TraversalPath = {\n          nodes: [...current.path.nodes, targetNode],\n          edges: [...current.path.edges, edge],\n          score: pathScore,\n          reasoning: `${current.path.reasoning} \u2192 ${edge.type} \u2192 ${targetNode.label}`,\n        };\n\n        queue.push({\n          node: targetNode,\n          path: newPath,\n          depth: current.depth + 1,\n        });\n      }\n    }\n\n    return paths;\n  }\n\n  /**\n   * Calculate path score\n   */\n  private calculatePathScore(\n    currentPath: TraversalPath,\n    edge: GraphEdge,\n    targetNode: GraphNode,\n    query: string\n  ): number {\n    // Base score from current path\n    let score = currentPath.score;\n\n    // Edge weight contribution\n    score *= edge.weight;\n\n    // Target node importance\n    score *= targetNode.importance;\n\n    // Query relevance\n    const queryWords = query.toLowerCase().split(/\\s+/);\n    const targetLabel = targetNode.label.toLowerCase();\n    let relevance = 0;\n    for (const word of queryWords) {\n      if (targetLabel.includes(word)) relevance += 1;\n    }\n    score *= 1 + relevance * 0.2;\n\n    // Path length penalty (prefer shorter paths)\n    score *= Math.pow(0.9, currentPath.nodes.length);\n\n    return score;\n  }\n\n  /**\n   * Calculate similarity between traces\n   */\n  private calculateSimilarity(a: Trace, b: Trace): number {\n    // Type similarity\n    const typeSim = a.type === b.type ? 0.3 : 0;\n\n    // File overlap\n    const filesA = new Set(a.metadata.filesModified);\n    const filesB = new Set(b.metadata.filesModified);\n    const intersection = new Set([...filesA].filter((x) => filesB.has(x)));\n    const union = new Set([...filesA, ...filesB]);\n    const fileSim = union.size > 0 ? (intersection.size / union.size) * 0.3 : 0;\n\n    // Tool overlap\n    const toolsA = new Set(a.tools.map((t) => t.tool));\n    const toolsB = new Set(b.tools.map((t) => t.tool));\n    const toolIntersection = new Set([...toolsA].filter((x) => toolsB.has(x)));\n    const toolUnion = new Set([...toolsA, ...toolsB]);\n    const toolSim =\n      toolUnion.size > 0 ? (toolIntersection.size / toolUnion.size) * 0.2 : 0;\n\n    // Summary text similarity (simple word overlap)\n    const wordsA = new Set(a.summary.toLowerCase().split(/\\s+/));\n    const wordsB = new Set(b.summary.toLowerCase().split(/\\s+/));\n    const wordIntersection = new Set([...wordsA].filter((x) => wordsB.has(x)));\n    const wordUnion = new Set([...wordsA, ...wordsB]);\n    const textSim =\n      wordUnion.size > 0 ? (wordIntersection.size / wordUnion.size) * 0.2 : 0;\n\n    return typeSim + fileSim + toolSim + textSim;\n  }\n\n  /**\n   * Insert node into database\n   */\n  private async insertNode(node: GraphNode): Promise<void> {\n    this.db\n      .prepare(\n        `\n      INSERT OR REPLACE INTO graph_nodes (\n        id, type, label, content, importance,\n        created, modified, accessed, access_count,\n        trace_ids, frame_ids, tags, embeddings\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `\n      )\n      .run(\n        node.id,\n        node.type,\n        node.label,\n        node.content || null,\n        node.importance,\n        node.metadata.created,\n        node.metadata.modified,\n        node.metadata.accessed,\n        node.metadata.accessCount,\n        JSON.stringify(node.metadata.traceIds || []),\n        JSON.stringify(node.metadata.frameIds || []),\n        JSON.stringify(node.metadata.tags || []),\n        node.metadata.embeddings ? Buffer.from(node.metadata.embeddings) : null\n      );\n  }\n\n  /**\n   * Create edge in database\n   */\n  private async createEdge(edge: GraphEdge): Promise<void> {\n    try {\n      this.db\n        .prepare(\n          `\n        INSERT OR IGNORE INTO graph_edges (\n          id, source, target, type, weight,\n          created, evidence, bidirectional\n        ) VALUES (?, ?, ?, ?, ?, ?, ?, ?)\n      `\n        )\n        .run(\n          edge.id,\n          edge.source,\n          edge.target,\n          edge.type,\n          edge.weight,\n          edge.metadata.created,\n          JSON.stringify(edge.metadata.evidence || []),\n          edge.metadata.bidirectional ? 1 : 0\n        );\n    } catch (error: unknown) {\n      // Ignore duplicate edges\n    }\n  }\n\n  /**\n   * Load graph into memory for fast traversal\n   */\n  private async loadGraphIntoMemory(): Promise<void> {\n    // Load nodes\n    const nodes = this.db.prepare('SELECT * FROM graph_nodes').all() as any[];\n\n    for (const row of nodes) {\n      const node: GraphNode = {\n        id: row.id,\n        type: row.type as NodeType,\n        label: row.label,\n        content: row.content,\n        importance: row.importance,\n        metadata: {\n          created: row.created,\n          modified: row.modified,\n          accessed: row.accessed,\n          accessCount: row.access_count,\n          traceIds: JSON.parse(row.trace_ids || '[]'),\n          frameIds: JSON.parse(row.frame_ids || '[]'),\n          tags: JSON.parse(row.tags || '[]'),\n        },\n      };\n      this.nodeIndex.set(node.id, node);\n    }\n\n    // Load edges\n    const edges = this.db.prepare('SELECT * FROM graph_edges').all() as any[];\n\n    for (const row of edges) {\n      const edge: GraphEdge = {\n        id: row.id,\n        source: row.source,\n        target: row.target,\n        type: row.type as EdgeType,\n        weight: row.weight,\n        metadata: {\n          created: row.created,\n          evidence: JSON.parse(row.evidence || '[]'),\n          bidirectional: row.bidirectional === 1,\n        },\n      };\n\n      // Add to adjacency list\n      if (!this.adjacencyList.has(edge.source)) {\n        this.adjacencyList.set(edge.source, []);\n      }\n      this.adjacencyList.get(edge.source)!.push(edge);\n\n      // Add to reverse adjacency list\n      if (!this.reverseAdjacencyList.has(edge.target)) {\n        this.reverseAdjacencyList.set(edge.target, []);\n      }\n      this.reverseAdjacencyList.get(edge.target)!.push(edge);\n\n      // If bidirectional, add reverse edge\n      if (edge.metadata.bidirectional) {\n        const reverseEdge = {\n          ...edge,\n          source: edge.target,\n          target: edge.source,\n        };\n        if (!this.adjacencyList.has(reverseEdge.source)) {\n          this.adjacencyList.set(reverseEdge.source, []);\n        }\n        this.adjacencyList.get(reverseEdge.source)!.push(reverseEdge);\n      }\n    }\n  }\n\n  /**\n   * Generate unique ID\n   */\n  private generateId(prefix: string): string {\n    return `${prefix}_${crypto.randomBytes(8).toString('hex')}`;\n  }\n\n  /**\n   * Get graph statistics\n   */\n  getStatistics(): any {\n    const nodeStats = this.db\n      .prepare(\n        `\n      SELECT \n        type,\n        COUNT(*) as count,\n        AVG(importance) as avg_importance,\n        MAX(importance) as max_importance\n      FROM graph_nodes\n      GROUP BY type\n    `\n      )\n      .all();\n\n    const edgeStats = this.db\n      .prepare(\n        `\n      SELECT \n        type,\n        COUNT(*) as count,\n        AVG(weight) as avg_weight,\n        MAX(weight) as max_weight\n      FROM graph_edges\n      GROUP BY type\n    `\n      )\n      .all();\n\n    return {\n      nodes: {\n        total: this.nodeIndex.size,\n        byType: nodeStats,\n        inMemory: this.nodeIndex.size,\n      },\n      edges: {\n        total: edgeStats.reduce((sum: number, e: any) => sum + e.count, 0),\n        byType: edgeStats,\n        adjacencyListSize: this.adjacencyList.size,\n      },\n      connectivity: {\n        avgDegree: this.calculateAverageDegree(),\n        maxDegree: this.calculateMaxDegree(),\n      },\n    };\n  }\n\n  /**\n   * Calculate average node degree\n   */\n  private calculateAverageDegree(): number {\n    if (this.nodeIndex.size === 0) return 0;\n\n    let totalDegree = 0;\n    for (const nodeId of this.nodeIndex.keys()) {\n      const outgoing = this.adjacencyList.get(nodeId)?.length || 0;\n      const incoming = this.reverseAdjacencyList.get(nodeId)?.length || 0;\n      totalDegree += outgoing + incoming;\n    }\n\n    return totalDegree / this.nodeIndex.size;\n  }\n\n  /**\n   * Calculate maximum node degree\n   */\n  private calculateMaxDegree(): number {\n    let maxDegree = 0;\n\n    for (const nodeId of this.nodeIndex.keys()) {\n      const outgoing = this.adjacencyList.get(nodeId)?.length || 0;\n      const incoming = this.reverseAdjacencyList.get(nodeId)?.length || 0;\n      maxDegree = Math.max(maxDegree, outgoing + incoming);\n    }\n\n    return maxDegree;\n  }\n\n  /**\n   * Export graph for visualization\n   */\n  exportForVisualization(): any {\n    const nodes = Array.from(this.nodeIndex.values()).map((node) => ({\n      id: node.id,\n      label: node.label,\n      type: node.type,\n      size: node.importance * 10,\n      color: this.getNodeColor(node.type),\n    }));\n\n    const edges = [];\n    for (const edgeList of this.adjacencyList.values()) {\n      for (const edge of edgeList) {\n        edges.push({\n          source: edge.source,\n          target: edge.target,\n          type: edge.type,\n          weight: edge.weight,\n          color: this.getEdgeColor(edge.type),\n        });\n      }\n    }\n\n    return { nodes, edges };\n  }\n\n  /**\n   * Get node color for visualization\n   */\n  private getNodeColor(type: NodeType): string {\n    const colors: Record<NodeType, string> = {\n      document: '#4A90E2',\n      concept: '#7ED321',\n      entity: '#F5A623',\n      event: '#D0021B',\n      decision: '#9013FE',\n      constraint: '#50E3C2',\n      topic: '#B8E986',\n    };\n    return colors[type] || '#CCCCCC';\n  }\n\n  /**\n   * Get edge color for visualization\n   */\n  private getEdgeColor(type: EdgeType): string {\n    const colors: Record<EdgeType, string> = {\n      citation: '#4A90E2',\n      topic_overlap: '#7ED321',\n      temporal: '#F5A623',\n      causal: '#D0021B',\n      semantic: '#9013FE',\n      structural: '#50E3C2',\n      dependency: '#B8E986',\n      evolution: '#417505',\n      contradiction: '#FF0000',\n      implementation: '#0099FF',\n    };\n    return colors[type] || '#999999';\n  }\n}\n"],
+  "mappings": "AASA,SAAS,cAAc;AAGvB,OAAO,YAAY;AA+EZ,MAAM,uBAAoC;AAAA,EAC/C,UAAU;AAAA,EACV,UAAU;AAAA,EACV,eAAe;AAAA,EACf,qBAAqB;AAAA,EACrB,kBAAkB;AAAA,EAClB,qBAAqB;AACvB;AAKO,MAAM,eAAe;AAAA,EAClB;AAAA,EACA;AAAA,EACA,YAAoC,oBAAI,IAAI;AAAA,EAC5C,gBAA0C,oBAAI,IAAI;AAAA,EAClD,uBAAiD,oBAAI,IAAI;AAAA,EAEjE,YAAY,IAAuB,SAA+B,CAAC,GAAG;AACpE,SAAK,KAAK;AACV,SAAK,SAAS,EAAE,GAAG,sBAAsB,GAAG,OAAO;AACnD,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEQ,mBAAyB;AAE/B,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAgBZ;AAGD,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAcZ;AAGD,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAOZ;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,WAAW,QAAiB,QAAgC;AAChE,WAAO,KAAK,2BAA2B;AAAA,MACrC,YAAY,OAAO;AAAA,MACnB,YAAY,OAAO;AAAA,IACrB,CAAC;AAGD,eAAW,SAAS,QAAQ;AAC1B,YAAM,KAAK,mBAAmB,KAAK;AAAA,IACrC;AAGA,eAAW,SAAS,QAAQ;AAC1B,YAAM,KAAK,kBAAkB,KAAK;AAAA,IACpC;AAGA,UAAM,KAAK,uBAAuB,MAAM;AACxC,UAAM,KAAK,qBAAqB,MAAM;AACtC,UAAM,KAAK,uBAAuB,MAAM;AACxC,UAAM,KAAK,oBAAoB,MAAM;AAGrC,UAAM,KAAK,oBAAoB;AAE/B,WAAO,KAAK,4BAA4B;AAAA,MACtC,OAAO,KAAK,UAAU;AAAA,MACtB,OAAO,KAAK,cAAc;AAAA,IAC5B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,mBAAmB,OAAkC;AACjE,UAAM,OAAkB;AAAA,MACtB,IAAI,OAAO,MAAM,EAAE;AAAA,MACnB,MAAM;AAAA,MACN,OAAO,MAAM,QAAQ,UAAU,GAAG,GAAG;AAAA,MACrC,SAAS,KAAK,UAAU,KAAK;AAAA,MAC7B,YAAY,MAAM;AAAA,MAClB,UAAU;AAAA,QACR,SAAS,MAAM,SAAS;AAAA,QACxB,UAAU,MAAM,SAAS;AAAA,QACzB,UAAU,KAAK,IAAI;AAAA,QACnB,aAAa;AAAA,QACb,UAAU,CAAC,MAAM,EAAE;AAAA,QACnB,MAAM,CAAC,MAAM,MAAM,GAAG,MAAM,SAAS,cAAc,MAAM,GAAG,CAAC,CAAC;AAAA,MAChE;AAAA,IACF;AAEA,UAAM,KAAK,WAAW,IAAI;AAC1B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,kBAAkB,OAAkC;AAChE,UAAM,OAAkB;AAAA,MACtB,IAAI,WAAW,MAAM,EAAE;AAAA,MACvB,MAAM;AAAA,MACN,OAAO,MAAM;AAAA,MACb,YAAY,MAAM;AAAA,MAClB,UAAU;AAAA,QACR,SAAS,MAAM;AAAA,QACf,UAAU,MAAM,cAAc,MAAM;AAAA,QACpC,UAAU,KAAK,IAAI;AAAA,QACnB,aAAa;AAAA,QACb,UAAU,CAAC,MAAM,EAAE;AAAA,QACnB,MAAM,CAAC,MAAM,IAAI;AAAA,MACnB;AAAA,IACF;AAEA,UAAM,KAAK,WAAW,IAAI;AAC1B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,uBAAuB,QAAgC;AAEnE,UAAM,SAAS,CAAC,GAAG,MAAM,EAAE;AAAA,MACzB,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS;AAAA,IAC9C;AAEA,aAAS,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;AAC1C,YAAM,UAAU,OAAO,CAAC;AACxB,YAAM,OAAO,OAAO,IAAI,CAAC;AAGzB,YAAM,WAAW,KAAK,SAAS,YAAY,QAAQ,SAAS;AAC5D,UAAI,WAAW,KAAK,KAAK,KAAM;AAC7B,cAAM,SAAS,KAAK,IAAI,YAAY,MAAO;AAE3C,cAAM,KAAK,WAAW;AAAA,UACpB,IAAI,KAAK,WAAW,MAAM;AAAA,UAC1B,QAAQ,OAAO,QAAQ,EAAE;AAAA,UACzB,QAAQ,OAAO,KAAK,EAAE;AAAA,UACtB,MAAM;AAAA,UACN;AAAA,UACA,UAAU;AAAA,YACR,SAAS,KAAK,IAAI;AAAA,YAClB,UAAU,CAAC,GAAG,QAAQ,QAAQ;AAAA,UAChC;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,qBAAqB,QAAgC;AACjE,eAAW,SAAS,QAAQ;AAC1B,UAAI,MAAM,SAAS,eAAe,MAAM,SAAS,YAAY,SAAS,GAAG;AACvE,mBAAW,YAAY,MAAM,SAAS,aAAa;AACjD,gBAAM,eAAe,OAAO,KAAK,CAAC,MAAM,EAAE,OAAO,QAAQ;AACzD,cAAI,cAAc;AAChB,kBAAM,KAAK,WAAW;AAAA,cACpB,IAAI,KAAK,WAAW,MAAM;AAAA,cAC1B,QAAQ,OAAO,QAAQ;AAAA,cACvB,QAAQ,OAAO,MAAM,EAAE;AAAA,cACvB,MAAM;AAAA,cACN,QAAQ;AAAA;AAAA,cACR,UAAU;AAAA,gBACR,SAAS,KAAK,IAAI;AAAA,gBAClB,UAAU,CAAC,uBAAuB;AAAA,cACpC;AAAA,YACF,CAAC;AAAA,UACH;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,uBAAuB,QAAgC;AAEnE,aAAS,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;AAC1C,eAAS,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AAC1C,cAAM,aAAa,KAAK,oBAAoB,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AAEhE,YAAI,aAAa,KAAK,OAAO,eAAe;AAC1C,gBAAM,KAAK,WAAW;AAAA,YACpB,IAAI,KAAK,WAAW,MAAM;AAAA,YAC1B,QAAQ,OAAO,OAAO,CAAC,EAAE,EAAE;AAAA,YAC3B,QAAQ,OAAO,OAAO,CAAC,EAAE,EAAE;AAAA,YAC3B,MAAM;AAAA,YACN,QAAQ;AAAA,YACR,UAAU;AAAA,cACR,SAAS,KAAK,IAAI;AAAA,cAClB,UAAU,CAAC,eAAe,WAAW,QAAQ,CAAC,CAAC,EAAE;AAAA,cACjD,eAAe;AAAA,YACjB;AAAA,UACF,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,oBAAoB,QAAgC;AAEhE,UAAM,cAAoC,oBAAI,IAAI;AAElD,eAAW,SAAS,QAAQ;AAC1B,YAAM,QAAQ,MAAM;AACpB,UAAI,CAAC,YAAY,IAAI,KAAK,GAAG;AAC3B,oBAAY,IAAI,OAAO,CAAC,CAAC;AAAA,MAC3B;AACA,kBAAY,IAAI,KAAK,EAAG,KAAK,KAAK;AAAA,IACpC;AAGA,eAAW,CAAC,OAAO,KAAK,KAAK,aAAa;AACxC,UAAI,MAAM,SAAS,EAAG;AAGtB,YAAM,YAAuB;AAAA,QAC3B,IAAI,SAAS,KAAK;AAAA,QAClB,MAAM;AAAA,QACN,OAAO;AAAA,QACP,YAAY;AAAA,QACZ,UAAU;AAAA,UACR,SAAS,KAAK,IAAI;AAAA,UAClB,UAAU,KAAK,IAAI;AAAA,UACnB,UAAU,KAAK,IAAI;AAAA,UACnB,aAAa;AAAA,UACb,MAAM,CAAC,KAAK;AAAA,QACd;AAAA,MACF;AAEA,YAAM,KAAK,WAAW,SAAS;AAG/B,iBAAW,SAAS,OAAO;AACzB,cAAM,KAAK,WAAW;AAAA,UACpB,IAAI,KAAK,WAAW,MAAM;AAAA,UAC1B,QAAQ,OAAO,MAAM,EAAE;AAAA,UACvB,QAAQ,UAAU;AAAA,UAClB,MAAM;AAAA,UACN,QAAQ;AAAA,UACR,UAAU;AAAA,YACR,SAAS,KAAK,IAAI;AAAA,YAClB,eAAe;AAAA,UACjB;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,SAAS,OAAe,QAA+C;AAC3E,UAAM,YAAY,KAAK,IAAI;AAC3B,UAAM,cAAc,UAAU,CAAC;AAC/B,UAAM,UAAU,YAAY,WAAW;AACvC,UAAM,QAAyB,CAAC;AAGhC,UAAM,aAAa,MAAM,KAAK,eAAe,OAAO,WAAW;AAE/D,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO,KAAK,qCAAqC,EAAE,MAAM,CAAC;AAC1D,aAAO,CAAC;AAAA,IACV;AAGA,eAAW,aAAa,YAAY;AAClC,YAAM,YAAY,MAAM,KAAK;AAAA,QAC3B;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AACA,YAAM,KAAK,GAAG,SAAS;AAAA,IACzB;AAGA,UAAM,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACtC,UAAM,WAAW,MAAM,MAAM,GAAG,EAAE;AAElC,WAAO,KAAK,4BAA4B;AAAA,MACtC,OAAO,MAAM,UAAU,GAAG,EAAE;AAAA,MAC5B,YAAY,WAAW;AAAA,MACvB,YAAY,MAAM;AAAA,MAClB,QAAQ,KAAK,IAAI,IAAI;AAAA,IACvB,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,eACZ,OACA,QACsB;AACtB,QAAI,OAAO,YAAY;AACrB,aAAO,OAAO,WACX,IAAI,CAAC,OAAO,KAAK,UAAU,IAAI,EAAE,CAAC,EAClC,OAAO,CAAC,MAAM,MAAM,MAAS;AAAA,IAClC;AAGA,UAAM,aAAa,MAAM,YAAY,EAAE,MAAM,KAAK;AAClD,UAAM,aAAwD,CAAC;AAE/D,eAAW,QAAQ,KAAK,UAAU,OAAO,GAAG;AAC1C,UAAI,OAAO,aAAa,CAAC,OAAO,UAAU,SAAS,KAAK,IAAI,GAAG;AAC7D;AAAA,MACF;AAEA,YAAM,QAAQ,KAAK,MAAM,YAAY;AACrC,YAAM,QAAQ,KAAK,SAAS,QAAQ,CAAC,GAAG,KAAK,GAAG,EAAE,YAAY;AAE9D,UAAI,QAAQ;AACZ,iBAAW,QAAQ,YAAY;AAC7B,YAAI,MAAM,SAAS,IAAI,EAAG,UAAS;AACnC,YAAI,KAAK,SAAS,IAAI,EAAG,UAAS;AAAA,MACpC;AAEA,UAAI,QAAQ,GAAG;AACb,iBAAS,KAAK;AACd,mBAAW,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA,MACjC;AAAA,IACF;AAGA,eAAW,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC3C,WAAO,WAAW,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,iBACZ,WACA,OACA,SACA,QAC0B;AAC1B,UAAM,QAAyB,CAAC;AAChC,UAAM,UAAU,oBAAI,IAAY;AAGhC,UAAM,QAID;AAAA,MACH;AAAA,QACE,MAAM;AAAA,QACN,MAAM;AAAA,UACJ,OAAO,CAAC,SAAS;AAAA,UACjB,OAAO,CAAC;AAAA,UACR,OAAO,UAAU;AAAA,UACjB,WAAW,iBAAiB,UAAU,IAAI,KAAK,UAAU,KAAK;AAAA,QAChE;AAAA,QACA,OAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,MAAM,SAAS,GAAG;AACvB,YAAM,UAAU,MAAM,MAAM;AAE5B,UAAI,QAAQ,SAAS,SAAS;AAC5B,cAAM,KAAK,QAAQ,IAAI;AACvB;AAAA,MACF;AAEA,UAAI,QAAQ,IAAI,QAAQ,KAAK,EAAE,GAAG;AAChC;AAAA,MACF;AACA,cAAQ,IAAI,QAAQ,KAAK,EAAE;AAG3B,YAAM,QAAQ,KAAK,cAAc,IAAI,QAAQ,KAAK,EAAE,KAAK,CAAC;AAE1D,iBAAW,QAAQ,OAAO;AAExB,YAAI,OAAO,aAAa,CAAC,OAAO,UAAU,SAAS,KAAK,IAAI,GAAG;AAC7D;AAAA,QACF;AAGA,YAAI,OAAO,aAAa,KAAK,SAAS,OAAO,WAAW;AACtD;AAAA,QACF;AAEA,cAAM,aAAa,KAAK,UAAU,IAAI,KAAK,MAAM;AACjD,YAAI,CAAC,WAAY;AAGjB,cAAM,YAAY,KAAK;AAAA,UACrB,QAAQ;AAAA,UACR;AAAA,UACA;AAAA,UACA;AAAA,QACF;AAGA,cAAM,UAAyB;AAAA,UAC7B,OAAO,CAAC,GAAG,QAAQ,KAAK,OAAO,UAAU;AAAA,UACzC,OAAO,CAAC,GAAG,QAAQ,KAAK,OAAO,IAAI;AAAA,UACnC,OAAO;AAAA,UACP,WAAW,GAAG,QAAQ,KAAK,SAAS,WAAM,KAAK,IAAI,WAAM,WAAW,KAAK;AAAA,QAC3E;AAEA,cAAM,KAAK;AAAA,UACT,MAAM;AAAA,UACN,MAAM;AAAA,UACN,OAAO,QAAQ,QAAQ;AAAA,QACzB,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,mBACN,aACA,MACA,YACA,OACQ;AAER,QAAI,QAAQ,YAAY;AAGxB,aAAS,KAAK;AAGd,aAAS,WAAW;AAGpB,UAAM,aAAa,MAAM,YAAY,EAAE,MAAM,KAAK;AAClD,UAAM,cAAc,WAAW,MAAM,YAAY;AACjD,QAAI,YAAY;AAChB,eAAW,QAAQ,YAAY;AAC7B,UAAI,YAAY,SAAS,IAAI,EAAG,cAAa;AAAA,IAC/C;AACA,aAAS,IAAI,YAAY;AAGzB,aAAS,KAAK,IAAI,KAAK,YAAY,MAAM,MAAM;AAE/C,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,GAAU,GAAkB;AAEtD,UAAM,UAAU,EAAE,SAAS,EAAE,OAAO,MAAM;AAG1C,UAAM,SAAS,IAAI,IAAI,EAAE,SAAS,aAAa;AAC/C,UAAM,SAAS,IAAI,IAAI,EAAE,SAAS,aAAa;AAC/C,UAAM,eAAe,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AACrE,UAAM,QAAQ,oBAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;AAC5C,UAAM,UAAU,MAAM,OAAO,IAAK,aAAa,OAAO,MAAM,OAAQ,MAAM;AAG1E,UAAM,SAAS,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACjD,UAAM,SAAS,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACjD,UAAM,mBAAmB,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AACzE,UAAM,YAAY,oBAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;AAChD,UAAM,UACJ,UAAU,OAAO,IAAK,iBAAiB,OAAO,UAAU,OAAQ,MAAM;AAGxE,UAAM,SAAS,IAAI,IAAI,EAAE,QAAQ,YAAY,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAM,SAAS,IAAI,IAAI,EAAE,QAAQ,YAAY,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAM,mBAAmB,IAAI,IAAI,CAAC,GAAG,MAAM,EAAE,OAAO,CAAC,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;AACzE,UAAM,YAAY,oBAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;AAChD,UAAM,UACJ,UAAU,OAAO,IAAK,iBAAiB,OAAO,UAAU,OAAQ,MAAM;AAExE,WAAO,UAAU,UAAU,UAAU;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WAAW,MAAgC;AACvD,SAAK,GACF;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOF,EACC;AAAA,MACC,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK,WAAW;AAAA,MAChB,KAAK;AAAA,MACL,KAAK,SAAS;AAAA,MACd,KAAK,SAAS;AAAA,MACd,KAAK,SAAS;AAAA,MACd,KAAK,SAAS;AAAA,MACd,KAAK,UAAU,KAAK,SAAS,YAAY,CAAC,CAAC;AAAA,MAC3C,KAAK,UAAU,KAAK,SAAS,YAAY,CAAC,CAAC;AAAA,MAC3C,KAAK,UAAU,KAAK,SAAS,QAAQ,CAAC,CAAC;AAAA,MACvC,KAAK,SAAS,aAAa,OAAO,KAAK,KAAK,SAAS,UAAU,IAAI;AAAA,IACrE;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WAAW,MAAgC;AACvD,QAAI;AACF,WAAK,GACF;AAAA,QACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAMF,EACC;AAAA,QACC,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK,SAAS;AAAA,QACd,KAAK,UAAU,KAAK,SAAS,YAAY,CAAC,CAAC;AAAA,QAC3C,KAAK,SAAS,gBAAgB,IAAI;AAAA,MACpC;AAAA,IACJ,SAAS,OAAgB;AAAA,IAEzB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,sBAAqC;AAEjD,UAAM,QAAQ,KAAK,GAAG,QAAQ,2BAA2B,EAAE,IAAI;AAE/D,eAAW,OAAO,OAAO;AACvB,YAAM,OAAkB;AAAA,QACtB,IAAI,IAAI;AAAA,QACR,MAAM,IAAI;AAAA,QACV,OAAO,IAAI;AAAA,QACX,SAAS,IAAI;AAAA,QACb,YAAY,IAAI;AAAA,QAChB,UAAU;AAAA,UACR,SAAS,IAAI;AAAA,UACb,UAAU,IAAI;AAAA,UACd,UAAU,IAAI;AAAA,UACd,aAAa,IAAI;AAAA,UACjB,UAAU,KAAK,MAAM,IAAI,aAAa,IAAI;AAAA,UAC1C,UAAU,KAAK,MAAM,IAAI,aAAa,IAAI;AAAA,UAC1C,MAAM,KAAK,MAAM,IAAI,QAAQ,IAAI;AAAA,QACnC;AAAA,MACF;AACA,WAAK,UAAU,IAAI,KAAK,IAAI,IAAI;AAAA,IAClC;AAGA,UAAM,QAAQ,KAAK,GAAG,QAAQ,2BAA2B,EAAE,IAAI;AAE/D,eAAW,OAAO,OAAO;AACvB,YAAM,OAAkB;AAAA,QACtB,IAAI,IAAI;AAAA,QACR,QAAQ,IAAI;AAAA,QACZ,QAAQ,IAAI;AAAA,QACZ,MAAM,IAAI;AAAA,QACV,QAAQ,IAAI;AAAA,QACZ,UAAU;AAAA,UACR,SAAS,IAAI;AAAA,UACb,UAAU,KAAK,MAAM,IAAI,YAAY,IAAI;AAAA,UACzC,eAAe,IAAI,kBAAkB;AAAA,QACvC;AAAA,MACF;AAGA,UAAI,CAAC,KAAK,cAAc,IAAI,KAAK,MAAM,GAAG;AACxC,aAAK,cAAc,IAAI,KAAK,QAAQ,CAAC,CAAC;AAAA,MACxC;AACA,WAAK,cAAc,IAAI,KAAK,MAAM,EAAG,KAAK,IAAI;AAG9C,UAAI,CAAC,KAAK,qBAAqB,IAAI,KAAK,MAAM,GAAG;AAC/C,aAAK,qBAAqB,IAAI,KAAK,QAAQ,CAAC,CAAC;AAAA,MAC/C;AACA,WAAK,qBAAqB,IAAI,KAAK,MAAM,EAAG,KAAK,IAAI;AAGrD,UAAI,KAAK,SAAS,eAAe;AAC/B,cAAM,cAAc;AAAA,UAClB,GAAG;AAAA,UACH,QAAQ,KAAK;AAAA,UACb,QAAQ,KAAK;AAAA,QACf;AACA,YAAI,CAAC,KAAK,cAAc,IAAI,YAAY,MAAM,GAAG;AAC/C,eAAK,cAAc,IAAI,YAAY,QAAQ,CAAC,CAAC;AAAA,QAC/C;AACA,aAAK,cAAc,IAAI,YAAY,MAAM,EAAG,KAAK,WAAW;AAAA,MAC9D;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAW,QAAwB;AACzC,WAAO,GAAG,MAAM,IAAI,OAAO,YAAY,CAAC,EAAE,SAAS,KAAK,CAAC;AAAA,EAC3D;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAqB;AACnB,UAAM,YAAY,KAAK,GACpB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASF,EACC,IAAI;AAEP,UAAM,YAAY,KAAK,GACpB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASF,EACC,IAAI;AAEP,WAAO;AAAA,MACL,OAAO;AAAA,QACL,OAAO,KAAK,UAAU;AAAA,QACtB,QAAQ;AAAA,QACR,UAAU,KAAK,UAAU;AAAA,MAC3B;AAAA,MACA,OAAO;AAAA,QACL,OAAO,UAAU,OAAO,CAAC,KAAa,MAAW,MAAM,EAAE,OAAO,CAAC;AAAA,QACjE,QAAQ;AAAA,QACR,mBAAmB,KAAK,cAAc;AAAA,MACxC;AAAA,MACA,cAAc;AAAA,QACZ,WAAW,KAAK,uBAAuB;AAAA,QACvC,WAAW,KAAK,mBAAmB;AAAA,MACrC;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,yBAAiC;AACvC,QAAI,KAAK,UAAU,SAAS,EAAG,QAAO;AAEtC,QAAI,cAAc;AAClB,eAAW,UAAU,KAAK,UAAU,KAAK,GAAG;AAC1C,YAAM,WAAW,KAAK,cAAc,IAAI,MAAM,GAAG,UAAU;AAC3D,YAAM,WAAW,KAAK,qBAAqB,IAAI,MAAM,GAAG,UAAU;AAClE,qBAAe,WAAW;AAAA,IAC5B;AAEA,WAAO,cAAc,KAAK,UAAU;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKQ,qBAA6B;AACnC,QAAI,YAAY;AAEhB,eAAW,UAAU,KAAK,UAAU,KAAK,GAAG;AAC1C,YAAM,WAAW,KAAK,cAAc,IAAI,MAAM,GAAG,UAAU;AAC3D,YAAM,WAAW,KAAK,qBAAqB,IAAI,MAAM,GAAG,UAAU;AAClE,kBAAY,KAAK,IAAI,WAAW,WAAW,QAAQ;AAAA,IACrD;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,yBAA8B;AAC5B,UAAM,QAAQ,MAAM,KAAK,KAAK,UAAU,OAAO,CAAC,EAAE,IAAI,CAAC,UAAU;AAAA,MAC/D,IAAI,KAAK;AAAA,MACT,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,MAAM,KAAK,aAAa;AAAA,MACxB,OAAO,KAAK,aAAa,KAAK,IAAI;AAAA,IACpC,EAAE;AAEF,UAAM,QAAQ,CAAC;AACf,eAAW,YAAY,KAAK,cAAc,OAAO,GAAG;AAClD,iBAAW,QAAQ,UAAU;AAC3B,cAAM,KAAK;AAAA,UACT,QAAQ,KAAK;AAAA,UACb,QAAQ,KAAK;AAAA,UACb,MAAM,KAAK;AAAA,UACX,QAAQ,KAAK;AAAA,UACb,OAAO,KAAK,aAAa,KAAK,IAAI;AAAA,QACpC,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO,EAAE,OAAO,MAAM;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,MAAwB;AAC3C,UAAM,SAAmC;AAAA,MACvC,UAAU;AAAA,MACV,SAAS;AAAA,MACT,QAAQ;AAAA,MACR,OAAO;AAAA,MACP,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,OAAO;AAAA,IACT;AACA,WAAO,OAAO,IAAI,KAAK;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,MAAwB;AAC3C,UAAM,SAAmC;AAAA,MACvC,UAAU;AAAA,MACV,eAAe;AAAA,MACf,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,UAAU;AAAA,MACV,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,eAAe;AAAA,MACf,gBAAgB;AAAA,IAClB;AACA,WAAO,OAAO,IAAI,KAAK;AAAA,EACzB;AACF;",
   "names": []
 }

package/dist/core/retrieval/llm-context-retrieval.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/core/retrieval/llm-context-retrieval.ts"],
-  "sourcesContent": ["/**\n * LLM-Driven Context Retrieval System\n * Uses LLM analysis to intelligently select relevant context\n */\n\nimport Database from 'better-sqlite3';\nimport {\n  FrameManager,\n  Frame,\n  Anchor,\n  Event,\n} from '../context/frame-manager.js';\nimport { QueryParser, StackMemoryQuery } from '../query/query-parser.js';\nimport { CompressedSummaryGenerator } from './summary-generator.js';\nimport {\n  CompressedSummary,\n  LLMAnalysisRequest,\n  LLMAnalysisResponse,\n  RetrievedContext,\n  FrameRetrievalPlan,\n  ContextRecommendation,\n  RetrievalConfig,\n  DEFAULT_RETRIEVAL_CONFIG,\n  RetrievalHints,\n  RetrievalMetadata,\n} from './types.js';\nimport { logger } from '../monitoring/logger.js';\nimport { LazyContextLoader } from '../performance/lazy-context-loader.js';\nimport { ContextCache } from '../performance/context-cache.js';\n\n/**\n * LLM provider interface for context analysis\n */\nexport interface LLMProvider {\n  analyze(prompt: string, maxTokens: number): Promise<string>;\n}\n\n/**\n * Simple heuristic-based fallback when LLM is unavailable\n */\nclass HeuristicAnalyzer {\n  analyze(\n    query: string,\n    summary: CompressedSummary,\n    parsedQuery?: StackMemoryQuery\n  ): LLMAnalysisResponse {\n    const framesToRetrieve: FrameRetrievalPlan[] = [];\n    const recommendations: ContextRecommendation[] = [];\n    const matchedPatterns: string[] = [];\n\n    // Score frames based on query relevance\n    const queryLower = query.toLowerCase();\n    const queryWords = queryLower.split(/\\W+/).filter((w) => w.length > 2);\n\n    for (const frame of summary.recentSession.frames) {\n      let priority = 5; // Base priority\n      const reasons: string[] = [];\n\n      // Recency boost\n      const ageHours = (Date.now() - frame.createdAt) / (1000 * 60 * 60);\n      if (ageHours < 1) {\n        priority += 3;\n        reasons.push('very recent');\n      } else if (ageHours < 6) {\n        priority += 2;\n        reasons.push('recent');\n      }\n\n      // Score boost\n      priority += Math.floor(frame.score * 3);\n\n      // Name matching\n      const nameLower = frame.name.toLowerCase();\n      const nameMatches = queryWords.filter((w) => nameLower.includes(w));\n      if (nameMatches.length > 0) {\n        priority += nameMatches.length * 2;\n        reasons.push(`matches: ${nameMatches.join(', ')}`);\n        matchedPatterns.push(`name_match:${nameMatches.join(',')}`);\n      }\n\n      // Type matching from parsed query\n      if (parsedQuery?.frame?.type) {\n        const frameType = frame.type.toLowerCase();\n        if (parsedQuery.frame.type.some((t) => t.toLowerCase() === frameType)) {\n          priority += 2;\n          reasons.push('type match');\n        }\n      }\n\n      // Topic matching\n      if (parsedQuery?.content?.topic) {\n        const topics = parsedQuery.content.topic;\n        const topicMatches = topics.filter(\n          (t) =>\n            nameLower.includes(t.toLowerCase()) ||\n            (frame.digestPreview &&\n              frame.digestPreview.toLowerCase().includes(t.toLowerCase()))\n        );\n        if (topicMatches.length > 0) {\n          priority += topicMatches.length;\n          reasons.push(`topic: ${topicMatches.join(', ')}`);\n        }\n      }\n\n      // Cap priority at 10\n      priority = Math.min(priority, 10);\n\n      if (priority >= 5) {\n        framesToRetrieve.push({\n          frameId: frame.frameId,\n          priority,\n          reason: reasons.length > 0 ? reasons.join('; ') : 'relevant context',\n          includeEvents: priority >= 7,\n          includeAnchors: true,\n          includeDigest: true,\n          estimatedTokens: this.estimateFrameTokens(frame),\n        });\n      }\n    }\n\n    // Sort by priority\n    framesToRetrieve.sort((a, b) => b.priority - a.priority);\n\n    // Generate recommendations based on errors\n    if (summary.recentSession.errorsEncountered.length > 0) {\n      recommendations.push({\n        type: 'include',\n        target: 'error_context',\n        reason: `${summary.recentSession.errorsEncountered.length} errors encountered recently`,\n        impact: 'medium',\n      });\n    }\n\n    // Recommend including decisions if query seems decision-related\n    if (\n      queryLower.includes('decision') ||\n      queryLower.includes('why') ||\n      queryLower.includes('chose')\n    ) {\n      recommendations.push({\n        type: 'include',\n        target: 'decisions',\n        reason: 'Query appears to be about past decisions',\n        impact: 'high',\n      });\n    }\n\n    // Calculate confidence based on match quality\n    const avgPriority =\n      framesToRetrieve.length > 0\n        ? framesToRetrieve.reduce((sum, f) => sum + f.priority, 0) /\n          framesToRetrieve.length\n        : 0;\n    const confidenceScore = Math.min(avgPriority / 10, 0.95);\n\n    // Generate reasoning\n    const reasoning = this.generateReasoning(\n      query,\n      framesToRetrieve,\n      summary,\n      matchedPatterns\n    );\n\n    return {\n      reasoning,\n      framesToRetrieve: framesToRetrieve.slice(0, 10), // Limit to top 10\n      confidenceScore,\n      recommendations,\n      metadata: {\n        analysisTimeMs: 0, // Will be set by caller\n        summaryTokens: this.estimateSummaryTokens(summary),\n        queryComplexity: this.assessQueryComplexity(query, parsedQuery),\n        matchedPatterns,\n        fallbackUsed: true,\n      },\n    };\n  }\n\n  private estimateFrameTokens(frame: {\n    eventCount: number;\n    anchorCount: number;\n    digestPreview?: string;\n  }): number {\n    let tokens = 50; // Base frame header\n    tokens += frame.eventCount * 30; // Estimate per event\n    tokens += frame.anchorCount * 40; // Estimate per anchor\n    if (frame.digestPreview) tokens += frame.digestPreview.length / 4;\n    return Math.floor(tokens);\n  }\n\n  private estimateSummaryTokens(summary: CompressedSummary): number {\n    return Math.floor(JSON.stringify(summary).length / 4);\n  }\n\n  private assessQueryComplexity(\n    query: string,\n    parsedQuery?: StackMemoryQuery\n  ): 'simple' | 'moderate' | 'complex' {\n    const wordCount = query.split(/\\s+/).length;\n    const hasTimeFilter = !!parsedQuery?.time;\n    const hasContentFilter = !!parsedQuery?.content;\n    const hasPeopleFilter = !!parsedQuery?.people;\n    const hasFrameFilter = !!parsedQuery?.frame;\n\n    const filterCount = [\n      hasTimeFilter,\n      hasContentFilter,\n      hasPeopleFilter,\n      hasFrameFilter,\n    ].filter(Boolean).length;\n\n    if (wordCount <= 5 && filterCount <= 1) return 'simple';\n    if (wordCount <= 15 && filterCount <= 2) return 'moderate';\n    return 'complex';\n  }\n\n  private generateReasoning(\n    query: string,\n    frames: FrameRetrievalPlan[],\n    summary: CompressedSummary,\n    matchedPatterns: string[]\n  ): string {\n    const parts: string[] = [];\n\n    parts.push(`Query: \"${query}\"`);\n    parts.push(\n      `Analyzed ${summary.recentSession.frames.length} recent frames.`\n    );\n\n    if (matchedPatterns.length > 0) {\n      parts.push(`Matched patterns: ${matchedPatterns.join(', ')}`);\n    }\n\n    if (frames.length > 0) {\n      parts.push(`Selected ${frames.length} frames for retrieval.`);\n      const topFrames = frames.slice(0, 3);\n      parts.push(\n        `Top frames: ${topFrames.map((f) => `${f.frameId} (priority: ${f.priority})`).join(', ')}`\n      );\n    } else {\n      parts.push('No highly relevant frames found. Using general context.');\n    }\n\n    return parts.join(' ');\n  }\n}\n\n/**\n * Main LLM Context Retrieval class\n */\nexport class LLMContextRetrieval {\n  private db: Database.Database;\n  private frameManager: FrameManager;\n  private summaryGenerator: CompressedSummaryGenerator;\n  private queryParser: QueryParser;\n  private heuristicAnalyzer: HeuristicAnalyzer;\n  private llmProvider?: LLMProvider;\n  private config: RetrievalConfig;\n  private projectId: string;\n  private lazyLoader: LazyContextLoader;\n  private contextCache: ContextCache<RetrievedContext>;\n\n  constructor(\n    db: Database.Database,\n    frameManager: FrameManager,\n    projectId: string,\n    config: Partial<RetrievalConfig> = {},\n    llmProvider?: LLMProvider\n  ) {\n    this.db = db;\n    this.frameManager = frameManager;\n    this.projectId = projectId;\n    this.config = { ...DEFAULT_RETRIEVAL_CONFIG, ...config };\n    this.llmProvider = llmProvider;\n    this.summaryGenerator = new CompressedSummaryGenerator(\n      db,\n      frameManager,\n      projectId,\n      config\n    );\n    this.queryParser = new QueryParser();\n    this.heuristicAnalyzer = new HeuristicAnalyzer();\n    \n    // Initialize performance optimizations\n    this.lazyLoader = new LazyContextLoader(db, projectId);\n    this.contextCache = new ContextCache<RetrievedContext>({\n      maxSize: 50 * 1024 * 1024, // 50MB for context cache\n      maxItems: 100,\n      defaultTTL: 600000, // 10 minutes\n    });\n    \n    // Start cache cleanup\n    this.contextCache.startCleanup(60000);\n  }\n\n  /**\n   * Retrieve context based on query using LLM analysis (with caching)\n   */\n  public async retrieveContext(\n    query: string,\n    options: {\n      tokenBudget?: number;\n      hints?: RetrievalHints;\n      forceRefresh?: boolean;\n    } = {}\n  ): Promise<RetrievedContext> {\n    const startTime = Date.now();\n    const tokenBudget = options.tokenBudget || this.config.defaultTokenBudget;\n    \n    // Check cache first unless force refresh\n    if (!options.forceRefresh) {\n      const cacheKey = `${query}:${tokenBudget}:${JSON.stringify(options.hints || {})}`;\n      const cached = this.contextCache.get(cacheKey);\n      if (cached) {\n        logger.debug('Context cache hit', {\n          query: query.substring(0, 50),\n          cacheStats: this.contextCache.getStats(),\n        });\n        return cached;\n      }\n    }\n\n    logger.info('Starting context retrieval', {\n      projectId: this.projectId,\n      query: query.substring(0, 100),\n      tokenBudget,\n    });\n\n    // 1. Parse the query\n    const parsedQuery = this.queryParser.parseNaturalLanguage(query);\n\n    // 2. Generate compressed summary\n    const summary = this.summaryGenerator.generateSummary({\n      forceRefresh: options.forceRefresh,\n    });\n\n    // 3. Perform LLM analysis\n    const analysis = await this.analyzeWithLLM({\n      currentQuery: query,\n      parsedQuery,\n      compressedSummary: summary,\n      tokenBudget,\n      hints: options.hints,\n    });\n\n    // 4. Retrieve frames based on analysis\n    const { frames, anchors, events, tokensUsed } = await this.retrieveFrames(\n      analysis,\n      tokenBudget\n    );\n\n    // 5. Assemble context string\n    const context = this.assembleContext(frames, anchors, events, analysis);\n\n    const metadata: RetrievalMetadata = {\n      retrievalTimeMs: Date.now() - startTime,\n      cacheHit: false, // Would need cache tracking\n      framesScanned: summary.recentSession.frames.length,\n      framesIncluded: frames.length,\n      compressionRatio: tokensUsed > 0 ? tokenBudget / tokensUsed : 1,\n    };\n\n    logger.info('Context retrieval complete', {\n      projectId: this.projectId,\n      framesIncluded: frames.length,\n      tokensUsed,\n      retrievalTimeMs: metadata.retrievalTimeMs,\n      confidence: analysis.confidenceScore,\n    });\n\n    const result: RetrievedContext = {\n      context,\n      frames,\n      anchors,\n      events,\n      analysis,\n      tokenUsage: {\n        budget: tokenBudget,\n        used: tokensUsed,\n        remaining: tokenBudget - tokensUsed,\n      },\n      metadata,\n    };\n    \n    // Cache the result\n    if (!options.forceRefresh) {\n      const cacheKey = `${query}:${tokenBudget}:${JSON.stringify(options.hints || {})}`;\n      this.contextCache.set(cacheKey, result, {\n        ttl: 600000, // 10 minutes\n      });\n    }\n\n    return result;\n  }\n\n  /**\n   * Perform LLM analysis or fall back to heuristics\n   */\n  private async analyzeWithLLM(\n    request: LLMAnalysisRequest\n  ): Promise<LLMAnalysisResponse> {\n    const startTime = Date.now();\n\n    // Try LLM analysis if provider is available\n    if (this.llmProvider) {\n      try {\n        const prompt = this.buildAnalysisPrompt(request);\n        const response = await this.llmProvider.analyze(\n          prompt,\n          this.config.llmConfig.maxTokens\n        );\n        const analysis = this.parseAnalysisResponse(response, request);\n        analysis.metadata.analysisTimeMs = Date.now() - startTime;\n        analysis.metadata.fallbackUsed = false;\n\n        // Validate confidence threshold\n        if (analysis.confidenceScore >= this.config.minConfidenceThreshold) {\n          return analysis;\n        }\n\n        logger.warn('LLM confidence below threshold, using fallback', {\n          confidence: analysis.confidenceScore,\n          threshold: this.config.minConfidenceThreshold,\n        });\n      } catch (error: any) {\n        logger.error(\n          'LLM analysis failed, using fallback',\n          error instanceof Error ? error : new Error(String(error))\n        );\n      }\n    }\n\n    // Fall back to heuristic analysis\n    if (this.config.enableFallback) {\n      const analysis = this.heuristicAnalyzer.analyze(\n        request.currentQuery,\n        request.compressedSummary,\n        request.parsedQuery\n      );\n      analysis.metadata.analysisTimeMs = Date.now() - startTime;\n      return analysis;\n    }\n\n    // Return empty analysis if no fallback\n    return {\n      reasoning:\n        'Unable to perform analysis - LLM unavailable and fallback disabled',\n      framesToRetrieve: [],\n      confidenceScore: 0,\n      recommendations: [],\n      metadata: {\n        analysisTimeMs: Date.now() - startTime,\n        summaryTokens: 0,\n        queryComplexity: 'simple',\n        matchedPatterns: [],\n        fallbackUsed: false,\n      },\n    };\n  }\n\n  /**\n   * Build the prompt for LLM analysis\n   */\n  private buildAnalysisPrompt(request: LLMAnalysisRequest): string {\n    const summary = request.compressedSummary;\n\n    return `You are analyzing a code project's memory to retrieve relevant context.\n\n## Current Query\n\"${request.currentQuery}\"\n\n## Token Budget\n${request.tokenBudget} tokens available\n\n## Recent Session Summary\n- Frames: ${summary.recentSession.frames.length}\n- Time range: ${new Date(summary.recentSession.timeRange.start).toISOString()} to ${new Date(summary.recentSession.timeRange.end).toISOString()}\n- Dominant operations: ${summary.recentSession.dominantOperations.map((o) => `${o.operation}(${o.count})`).join(', ')}\n- Files touched: ${summary.recentSession.filesTouched\n      .slice(0, 5)\n      .map((f) => f.path)\n      .join(', ')}\n- Errors: ${summary.recentSession.errorsEncountered.length}\n\n## Available Frames\n${summary.recentSession.frames\n  .slice(0, 15)\n  .map(\n    (f) =>\n      `- ${f.frameId}: \"${f.name}\" (${f.type}, score: ${f.score.toFixed(2)}, events: ${f.eventCount})`\n  )\n  .join('\\n')}\n\n## Key Decisions\n${summary.historicalPatterns.keyDecisions\n  .slice(0, 5)\n  .map((d) => `- ${d.text.substring(0, 80)}...`)\n  .join('\\n')}\n\n## Task\nAnalyze the query and select the most relevant frames to retrieve.\nReturn a JSON object with:\n{\n  \"reasoning\": \"Your analysis of why these frames are relevant\",\n  \"framesToRetrieve\": [\n    {\"frameId\": \"...\", \"priority\": 1-10, \"reason\": \"...\", \"includeEvents\": true/false, \"includeAnchors\": true/false}\n  ],\n  \"confidenceScore\": 0.0-1.0,\n  \"recommendations\": [{\"type\": \"include/exclude/summarize\", \"target\": \"...\", \"reason\": \"...\", \"impact\": \"low/medium/high\"}]\n}\n\n${request.hints ? `\\n## Hints\\n${JSON.stringify(request.hints)}` : ''}\n\nRespond with only the JSON object, no other text.`;\n  }\n\n  /**\n   * Parse LLM response into structured analysis\n   */\n  private parseAnalysisResponse(\n    response: string,\n    request: LLMAnalysisRequest\n  ): LLMAnalysisResponse {\n    try {\n      // Extract JSON from response (handle markdown code blocks)\n      let jsonStr = response;\n      const jsonMatch = response.match(/```(?:json)?\\s*([\\s\\S]*?)```/);\n      if (jsonMatch) {\n        jsonStr = jsonMatch[1];\n      }\n\n      const parsed = JSON.parse(jsonStr.trim());\n\n      // Validate and normalize the response\n      return {\n        reasoning: parsed.reasoning || 'No reasoning provided',\n        framesToRetrieve: (parsed.framesToRetrieve || []).map((f: any) => ({\n          frameId: f.frameId,\n          priority: Math.min(10, Math.max(1, f.priority || 5)),\n          reason: f.reason || 'Selected by LLM',\n          includeEvents: f.includeEvents ?? true,\n          includeAnchors: f.includeAnchors ?? true,\n          includeDigest: f.includeDigest ?? true,\n          estimatedTokens: f.estimatedTokens || 100,\n        })),\n        confidenceScore: Math.min(\n          1,\n          Math.max(0, parsed.confidenceScore || 0.5)\n        ),\n        recommendations: (parsed.recommendations || []).map((r: any) => ({\n          type: r.type || 'include',\n          target: r.target || '',\n          reason: r.reason || '',\n          impact: r.impact || 'medium',\n        })),\n        metadata: {\n          analysisTimeMs: 0,\n          summaryTokens: Math.floor(\n            JSON.stringify(request.compressedSummary).length / 4\n          ),\n          queryComplexity: this.assessQueryComplexity(request.currentQuery),\n          matchedPatterns: [],\n          fallbackUsed: false,\n        },\n      };\n    } catch (error) {\n      logger.warn('Failed to parse LLM response, using fallback', {\n        error,\n        response,\n      });\n      return this.heuristicAnalyzer.analyze(\n        request.currentQuery,\n        request.compressedSummary,\n        request.parsedQuery\n      );\n    }\n  }\n\n  private assessQueryComplexity(\n    query: string\n  ): 'simple' | 'moderate' | 'complex' {\n    const wordCount = query.split(/\\s+/).length;\n    if (wordCount <= 5) return 'simple';\n    if (wordCount <= 15) return 'moderate';\n    return 'complex';\n  }\n\n  /**\n   * Retrieve frames based on analysis (with lazy loading)\n   */\n  private async retrieveFrames(\n    analysis: LLMAnalysisResponse,\n    tokenBudget: number\n  ): Promise<{\n    frames: Frame[];\n    anchors: Anchor[];\n    events: Event[];\n    tokensUsed: number;\n  }> {\n    const frames: Frame[] = [];\n    const anchors: Anchor[] = [];\n    const events: Event[] = [];\n    let tokensUsed = 0;\n\n    // Preload frames for better performance\n    const frameIds = analysis.framesToRetrieve.map(p => p.frameId);\n    await this.lazyLoader.preloadContext(frameIds, {\n      parallel: true,\n      depth: 2, // Load frames, anchors, and events\n    });\n\n    // Retrieve frames in priority order within budget\n    for (const plan of analysis.framesToRetrieve) {\n      if (tokensUsed + plan.estimatedTokens > tokenBudget) {\n        logger.debug('Token budget exceeded, stopping retrieval', {\n          tokensUsed,\n          budget: tokenBudget,\n        });\n        break;\n      }\n\n      // Use lazy loader for efficient retrieval\n      try {\n        const frame = await this.lazyLoader.lazyFrame(plan.frameId).get();\n        frames.push(frame);\n        tokensUsed += 50; // Base frame tokens\n\n        // Include anchors if requested\n        if (plan.includeAnchors) {\n          const frameAnchors = await this.lazyLoader.lazyAnchors(plan.frameId).get();\n          anchors.push(...frameAnchors);\n          tokensUsed += frameAnchors.length * 40;\n        }\n\n        // Include events if requested\n        if (plan.includeEvents) {\n          const frameEvents = await this.lazyLoader.lazyEvents(plan.frameId, 10).get();\n          events.push(...frameEvents);\n          tokensUsed += frameEvents.length * 30;\n        }\n      } catch (error) {\n        logger.warn('Failed to retrieve frame', {\n          frameId: plan.frameId,\n          error,\n        });\n      }\n    }\n\n    return { frames, anchors, events, tokensUsed };\n  }\n\n  private getFrameAnchors(frameId: string): Anchor[] {\n    try {\n      const rows = this.db\n        .prepare(\n          `\n        SELECT * FROM anchors WHERE frame_id = ?\n        ORDER BY priority DESC, created_at DESC\n      `\n        )\n        .all(frameId) as any[];\n\n      return rows.map((row) => ({\n        ...row,\n        metadata: JSON.parse(row.metadata || '{}'),\n      }));\n    } catch {\n      return [];\n    }\n  }\n\n  /**\n   * Assemble final context string\n   */\n  private assembleContext(\n    frames: Frame[],\n    anchors: Anchor[],\n    events: Event[],\n    analysis: LLMAnalysisResponse\n  ): string {\n    const sections: string[] = [];\n\n    // Add retrieval reasoning (auditable)\n    sections.push('## Context Retrieval Analysis');\n    sections.push(\n      `*Confidence: ${(analysis.confidenceScore * 100).toFixed(0)}%*`\n    );\n    sections.push(analysis.reasoning);\n    sections.push('');\n\n    // Add frames\n    if (frames.length > 0) {\n      sections.push('## Relevant Frames');\n      for (const frame of frames) {\n        sections.push(`### ${frame.name} (${frame.type})`);\n        if (frame.digest_text) {\n          sections.push(frame.digest_text);\n        }\n        sections.push('');\n      }\n    }\n\n    // Add key anchors\n    const decisions = anchors.filter((a) => a.type === 'DECISION');\n    const constraints = anchors.filter((a) => a.type === 'CONSTRAINT');\n    const facts = anchors.filter((a) => a.type === 'FACT');\n\n    if (decisions.length > 0) {\n      sections.push('## Key Decisions');\n      for (const d of decisions.slice(0, 5)) {\n        sections.push(`- ${d.text}`);\n      }\n      sections.push('');\n    }\n\n    if (constraints.length > 0) {\n      sections.push('## Active Constraints');\n      for (const c of constraints.slice(0, 5)) {\n        sections.push(`- ${c.text}`);\n      }\n      sections.push('');\n    }\n\n    if (facts.length > 0) {\n      sections.push('## Important Facts');\n      for (const f of facts.slice(0, 5)) {\n        sections.push(`- ${f.text}`);\n      }\n      sections.push('');\n    }\n\n    // Add recent events summary\n    if (events.length > 0) {\n      sections.push('## Recent Activity');\n      const eventSummary = this.summarizeEvents(events);\n      sections.push(eventSummary);\n      sections.push('');\n    }\n\n    // Add recommendations\n    if (analysis.recommendations.length > 0) {\n      sections.push('## Recommendations');\n      for (const rec of analysis.recommendations) {\n        const icon =\n          rec.type === 'include' ? '+' : rec.type === 'exclude' ? '-' : '~';\n        sections.push(`${icon} [${rec.impact.toUpperCase()}] ${rec.reason}`);\n      }\n    }\n\n    return sections.join('\\n');\n  }\n\n  private summarizeEvents(events: Event[]): string {\n    const byType: Record<string, number> = {};\n    for (const event of events) {\n      byType[event.event_type] = (byType[event.event_type] || 0) + 1;\n    }\n\n    return Object.entries(byType)\n      .map(([type, count]) => `- ${type}: ${count} occurrences`)\n      .join('\\n');\n  }\n\n  /**\n   * Get just the compressed summary (useful for external analysis)\n   */\n  public getSummary(forceRefresh = false): CompressedSummary {\n    return this.summaryGenerator.generateSummary({ forceRefresh });\n  }\n\n  /**\n   * Set LLM provider\n   */\n  public setLLMProvider(provider: LLMProvider): void {\n    this.llmProvider = provider;\n  }\n\n  /**\n   * Clear all caches\n   */\n  public clearCache(): void {\n    this.summaryGenerator.clearCache();\n    this.lazyLoader.clearCache();\n    this.contextCache.clear();\n    logger.info('Cleared all caches', {\n      projectId: this.projectId,\n      cacheStats: this.contextCache.getStats(),\n    });\n  }\n}\n"],
-  "mappings": "AAYA,SAAS,mBAAqC;AAC9C,SAAS,kCAAkC;AAC3C;AAAA,EAQE;AAAA,OAGK;AACP,SAAS,cAAc;AACvB,SAAS,yBAAyB;AAClC,SAAS,oBAAoB;AAY7B,MAAM,kBAAkB;AAAA,EACtB,QACE,OACA,SACA,aACqB;AACrB,UAAM,mBAAyC,CAAC;AAChD,UAAM,kBAA2C,CAAC;AAClD,UAAM,kBAA4B,CAAC;AAGnC,UAAM,aAAa,MAAM,YAAY;AACrC,UAAM,aAAa,WAAW,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAErE,eAAW,SAAS,QAAQ,cAAc,QAAQ;AAChD,UAAI,WAAW;AACf,YAAM,UAAoB,CAAC;AAG3B,YAAM,YAAY,KAAK,IAAI,IAAI,MAAM,cAAc,MAAO,KAAK;AAC/D,UAAI,WAAW,GAAG;AAChB,oBAAY;AACZ,gBAAQ,KAAK,aAAa;AAAA,MAC5B,WAAW,WAAW,GAAG;AACvB,oBAAY;AACZ,gBAAQ,KAAK,QAAQ;AAAA,MACvB;AAGA,kBAAY,KAAK,MAAM,MAAM,QAAQ,CAAC;AAGtC,YAAM,YAAY,MAAM,KAAK,YAAY;AACzC,YAAM,cAAc,WAAW,OAAO,CAAC,MAAM,UAAU,SAAS,CAAC,CAAC;AAClE,UAAI,YAAY,SAAS,GAAG;AAC1B,oBAAY,YAAY,SAAS;AACjC,gBAAQ,KAAK,YAAY,YAAY,KAAK,IAAI,CAAC,EAAE;AACjD,wBAAgB,KAAK,cAAc,YAAY,KAAK,GAAG,CAAC,EAAE;AAAA,MAC5D;AAGA,UAAI,aAAa,OAAO,MAAM;AAC5B,cAAM,YAAY,MAAM,KAAK,YAAY;AACzC,YAAI,YAAY,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,YAAY,MAAM,SAAS,GAAG;AACrE,sBAAY;AACZ,kBAAQ,KAAK,YAAY;AAAA,QAC3B;AAAA,MACF;AAGA,UAAI,aAAa,SAAS,OAAO;AAC/B,cAAM,SAAS,YAAY,QAAQ;AACnC,cAAM,eAAe,OAAO;AAAA,UAC1B,CAAC,MACC,UAAU,SAAS,EAAE,YAAY,CAAC,KACjC,MAAM,iBACL,MAAM,cAAc,YAAY,EAAE,SAAS,EAAE,YAAY,CAAC;AAAA,QAChE;AACA,YAAI,aAAa,SAAS,GAAG;AAC3B,sBAAY,aAAa;AACzB,kBAAQ,KAAK,UAAU,aAAa,KAAK,IAAI,CAAC,EAAE;AAAA,QAClD;AAAA,MACF;AAGA,iBAAW,KAAK,IAAI,UAAU,EAAE;AAEhC,UAAI,YAAY,GAAG;AACjB,yBAAiB,KAAK;AAAA,UACpB,SAAS,MAAM;AAAA,UACf;AAAA,UACA,QAAQ,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI,IAAI;AAAA,UAClD,eAAe,YAAY;AAAA,UAC3B,gBAAgB;AAAA,UAChB,eAAe;AAAA,UACf,iBAAiB,KAAK,oBAAoB,KAAK;AAAA,QACjD,CAAC;AAAA,MACH;AAAA,IACF;AAGA,qBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAGvD,QAAI,QAAQ,cAAc,kBAAkB,SAAS,GAAG;AACtD,sBAAgB,KAAK;AAAA,QACnB,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,QAAQ,GAAG,QAAQ,cAAc,kBAAkB,MAAM;AAAA,QACzD,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAGA,QACE,WAAW,SAAS,UAAU,KAC9B,WAAW,SAAS,KAAK,KACzB,WAAW,SAAS,OAAO,GAC3B;AACA,sBAAgB,KAAK;AAAA,QACnB,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAGA,UAAM,cACJ,iBAAiB,SAAS,IACtB,iBAAiB,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,UAAU,CAAC,IACvD,iBAAiB,SACjB;AACN,UAAM,kBAAkB,KAAK,IAAI,cAAc,IAAI,IAAI;AAGvD,UAAM,YAAY,KAAK;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,kBAAkB,iBAAiB,MAAM,GAAG,EAAE;AAAA;AAAA,MAC9C;AAAA,MACA;AAAA,MACA,UAAU;AAAA,QACR,gBAAgB;AAAA;AAAA,QAChB,eAAe,KAAK,sBAAsB,OAAO;AAAA,QACjD,iBAAiB,KAAK,sBAAsB,OAAO,WAAW;AAAA,QAC9D;AAAA,QACA,cAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,oBAAoB,OAIjB;AACT,QAAI,SAAS;AACb,cAAU,MAAM,aAAa;AAC7B,cAAU,MAAM,cAAc;AAC9B,QAAI,MAAM,cAAe,WAAU,MAAM,cAAc,SAAS;AAChE,WAAO,KAAK,MAAM,MAAM;AAAA,EAC1B;AAAA,EAEQ,sBAAsB,SAAoC;AAChE,WAAO,KAAK,MAAM,KAAK,UAAU,OAAO,EAAE,SAAS,CAAC;AAAA,EACtD;AAAA,EAEQ,sBACN,OACA,aACmC;AACnC,UAAM,YAAY,MAAM,MAAM,KAAK,EAAE;AACrC,UAAM,gBAAgB,CAAC,CAAC,aAAa;AACrC,UAAM,mBAAmB,CAAC,CAAC,aAAa;AACxC,UAAM,kBAAkB,CAAC,CAAC,aAAa;AACvC,UAAM,iBAAiB,CAAC,CAAC,aAAa;AAEtC,UAAM,cAAc;AAAA,MAClB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,OAAO,OAAO,EAAE;AAElB,QAAI,aAAa,KAAK,eAAe,EAAG,QAAO;AAC/C,QAAI,aAAa,MAAM,eAAe,EAAG,QAAO;AAChD,WAAO;AAAA,EACT;AAAA,EAEQ,kBACN,OACA,QACA,SACA,iBACQ;AACR,UAAM,QAAkB,CAAC;AAEzB,UAAM,KAAK,WAAW,KAAK,GAAG;AAC9B,UAAM;AAAA,MACJ,YAAY,QAAQ,cAAc,OAAO,MAAM;AAAA,IACjD;AAEA,QAAI,gBAAgB,SAAS,GAAG;AAC9B,YAAM,KAAK,qBAAqB,gBAAgB,KAAK,IAAI,CAAC,EAAE;AAAA,IAC9D;AAEA,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,KAAK,YAAY,OAAO,MAAM,wBAAwB;AAC5D,YAAM,YAAY,OAAO,MAAM,GAAG,CAAC;AACnC,YAAM;AAAA,QACJ,eAAe,UAAU,IAAI,CAAC,MAAM,GAAG,EAAE,OAAO,eAAe,EAAE,QAAQ,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,MAC1F;AAAA,IACF,OAAO;AACL,YAAM,KAAK,yDAAyD;AAAA,IACtE;AAEA,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AACF;AAKO,MAAM,oBAAoB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAER,YACE,IACA,cACA,WACA,SAAmC,CAAC,GACpC,aACA;AACA,SAAK,KAAK;AACV,SAAK,eAAe;AACpB,SAAK,YAAY;AACjB,SAAK,SAAS,EAAE,GAAG,0BAA0B,GAAG,OAAO;AACvD,SAAK,cAAc;AACnB,SAAK,mBAAmB,IAAI;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,SAAK,cAAc,IAAI,YAAY;AACnC,SAAK,oBAAoB,IAAI,kBAAkB;AAG/C,SAAK,aAAa,IAAI,kBAAkB,IAAI,SAAS;AACrD,SAAK,eAAe,IAAI,aAA+B;AAAA,MACrD,SAAS,KAAK,OAAO;AAAA;AAAA,MACrB,UAAU;AAAA,MACV,YAAY;AAAA;AAAA,IACd,CAAC;AAGD,SAAK,aAAa,aAAa,GAAK;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAa,gBACX,OACA,UAII,CAAC,GACsB;AAC3B,UAAM,YAAY,KAAK,IAAI;AAC3B,UAAM,cAAc,QAAQ,eAAe,KAAK,OAAO;AAGvD,QAAI,CAAC,QAAQ,cAAc;AACzB,YAAM,WAAW,GAAG,KAAK,IAAI,WAAW,IAAI,KAAK,UAAU,QAAQ,SAAS,CAAC,CAAC,CAAC;AAC/E,YAAM,SAAS,KAAK,aAAa,IAAI,QAAQ;AAC7C,UAAI,QAAQ;AACV,eAAO,MAAM,qBAAqB;AAAA,UAChC,OAAO,MAAM,UAAU,GAAG,EAAE;AAAA,UAC5B,YAAY,KAAK,aAAa,SAAS;AAAA,QACzC,CAAC;AACD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,KAAK,8BAA8B;AAAA,MACxC,WAAW,KAAK;AAAA,MAChB,OAAO,MAAM,UAAU,GAAG,GAAG;AAAA,MAC7B;AAAA,IACF,CAAC;AAGD,UAAM,cAAc,KAAK,YAAY,qBAAqB,KAAK;AAG/D,UAAM,UAAU,KAAK,iBAAiB,gBAAgB;AAAA,MACpD,cAAc,QAAQ;AAAA,IACxB,CAAC;AAGD,UAAM,WAAW,MAAM,KAAK,eAAe;AAAA,MACzC,cAAc;AAAA,MACd;AAAA,MACA,mBAAmB;AAAA,MACnB;AAAA,MACA,OAAO,QAAQ;AAAA,IACjB,CAAC;AAGD,UAAM,EAAE,QAAQ,SAAS,QAAQ,WAAW,IAAI,MAAM,KAAK;AAAA,MACzD;AAAA,MACA;AAAA,IACF;AAGA,UAAM,UAAU,KAAK,gBAAgB,QAAQ,SAAS,QAAQ,QAAQ;AAEtE,UAAM,WAA8B;AAAA,MAClC,iBAAiB,KAAK,IAAI,IAAI;AAAA,MAC9B,UAAU;AAAA;AAAA,MACV,eAAe,QAAQ,cAAc,OAAO;AAAA,MAC5C,gBAAgB,OAAO;AAAA,MACvB,kBAAkB,aAAa,IAAI,cAAc,aAAa;AAAA,IAChE;AAEA,WAAO,KAAK,8BAA8B;AAAA,MACxC,WAAW,KAAK;AAAA,MAChB,gBAAgB,OAAO;AAAA,MACvB;AAAA,MACA,iBAAiB,SAAS;AAAA,MAC1B,YAAY,SAAS;AAAA,IACvB,CAAC;AAED,UAAM,SAA2B;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,QACV,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,WAAW,cAAc;AAAA,MAC3B;AAAA,MACA;AAAA,IACF;AAGA,QAAI,CAAC,QAAQ,cAAc;AACzB,YAAM,WAAW,GAAG,KAAK,IAAI,WAAW,IAAI,KAAK,UAAU,QAAQ,SAAS,CAAC,CAAC,CAAC;AAC/E,WAAK,aAAa,IAAI,UAAU,QAAQ;AAAA,QACtC,KAAK;AAAA;AAAA,MACP,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,eACZ,SAC8B;AAC9B,UAAM,YAAY,KAAK,IAAI;AAG3B,QAAI,KAAK,aAAa;AACpB,UAAI;AACF,cAAM,SAAS,KAAK,oBAAoB,OAAO;AAC/C,cAAM,WAAW,MAAM,KAAK,YAAY;AAAA,UACtC;AAAA,UACA,KAAK,OAAO,UAAU;AAAA,QACxB;AACA,cAAM,WAAW,KAAK,sBAAsB,UAAU,OAAO;AAC7D,iBAAS,SAAS,iBAAiB,KAAK,IAAI,IAAI;AAChD,iBAAS,SAAS,eAAe;AAGjC,YAAI,SAAS,mBAAmB,KAAK,OAAO,wBAAwB;AAClE,iBAAO;AAAA,QACT;AAEA,eAAO,KAAK,kDAAkD;AAAA,UAC5D,YAAY,SAAS;AAAA,UACrB,WAAW,KAAK,OAAO;AAAA,QACzB,CAAC;AAAA,MACH,SAAS,OAAY;AACnB,eAAO;AAAA,UACL;AAAA,UACA,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;AAAA,QAC1D;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,OAAO,gBAAgB;AAC9B,YAAM,WAAW,KAAK,kBAAkB;AAAA,QACtC,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AACA,eAAS,SAAS,iBAAiB,KAAK,IAAI,IAAI;AAChD,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,MACL,WACE;AAAA,MACF,kBAAkB,CAAC;AAAA,MACnB,iBAAiB;AAAA,MACjB,iBAAiB,CAAC;AAAA,MAClB,UAAU;AAAA,QACR,gBAAgB,KAAK,IAAI,IAAI;AAAA,QAC7B,eAAe;AAAA,QACf,iBAAiB;AAAA,QACjB,iBAAiB,CAAC;AAAA,QAClB,cAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,SAAqC;AAC/D,UAAM,UAAU,QAAQ;AAExB,WAAO;AAAA;AAAA;AAAA,GAGR,QAAQ,YAAY;AAAA;AAAA;AAAA,EAGrB,QAAQ,WAAW;AAAA;AAAA;AAAA,YAGT,QAAQ,cAAc,OAAO,MAAM;AAAA,gBAC/B,IAAI,KAAK,QAAQ,cAAc,UAAU,KAAK,EAAE,YAAY,CAAC,OAAO,IAAI,KAAK,QAAQ,cAAc,UAAU,GAAG,EAAE,YAAY,CAAC;AAAA,yBACtH,QAAQ,cAAc,mBAAmB,IAAI,CAAC,MAAM,GAAG,EAAE,SAAS,IAAI,EAAE,KAAK,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,mBAClG,QAAQ,cAAc,aAClC,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,EAAE,IAAI,EACjB,KAAK,IAAI,CAAC;AAAA,YACL,QAAQ,cAAc,kBAAkB,MAAM;AAAA;AAAA;AAAA,EAGxD,QAAQ,cAAc,OACrB,MAAM,GAAG,EAAE,EACX;AAAA,MACC,CAAC,MACC,KAAK,EAAE,OAAO,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,YAAY,EAAE,MAAM,QAAQ,CAAC,CAAC,aAAa,EAAE,UAAU;AAAA,IACjG,EACC,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,EAGX,QAAQ,mBAAmB,aAC1B,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,KAAK,EAAE,KAAK,UAAU,GAAG,EAAE,CAAC,KAAK,EAC5C,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcX,QAAQ,QAAQ;AAAA;AAAA,EAAe,KAAK,UAAU,QAAQ,KAAK,CAAC,KAAK,EAAE;AAAA;AAAA;AAAA,EAGnE;AAAA;AAAA;AAAA;AAAA,EAKQ,sBACN,UACA,SACqB;AACrB,QAAI;AAEF,UAAI,UAAU;AACd,YAAM,YAAY,SAAS,MAAM,8BAA8B;AAC/D,UAAI,WAAW;AACb,kBAAU,UAAU,CAAC;AAAA,MACvB;AAEA,YAAM,SAAS,KAAK,MAAM,QAAQ,KAAK,CAAC;AAGxC,aAAO;AAAA,QACL,WAAW,OAAO,aAAa;AAAA,QAC/B,mBAAmB,OAAO,oBAAoB,CAAC,GAAG,IAAI,CAAC,OAAY;AAAA,UACjE,SAAS,EAAE;AAAA,UACX,UAAU,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,YAAY,CAAC,CAAC;AAAA,UACnD,QAAQ,EAAE,UAAU;AAAA,UACpB,eAAe,EAAE,iBAAiB;AAAA,UAClC,gBAAgB,EAAE,kBAAkB;AAAA,UACpC,eAAe,EAAE,iBAAiB;AAAA,UAClC,iBAAiB,EAAE,mBAAmB;AAAA,QACxC,EAAE;AAAA,QACF,iBAAiB,KAAK;AAAA,UACpB;AAAA,UACA,KAAK,IAAI,GAAG,OAAO,mBAAmB,GAAG;AAAA,QAC3C;AAAA,QACA,kBAAkB,OAAO,mBAAmB,CAAC,GAAG,IAAI,CAAC,OAAY;AAAA,UAC/D,MAAM,EAAE,QAAQ;AAAA,UAChB,QAAQ,EAAE,UAAU;AAAA,UACpB,QAAQ,EAAE,UAAU;AAAA,UACpB,QAAQ,EAAE,UAAU;AAAA,QACtB,EAAE;AAAA,QACF,UAAU;AAAA,UACR,gBAAgB;AAAA,UAChB,eAAe,KAAK;AAAA,YAClB,KAAK,UAAU,QAAQ,iBAAiB,EAAE,SAAS;AAAA,UACrD;AAAA,UACA,iBAAiB,KAAK,sBAAsB,QAAQ,YAAY;AAAA,UAChE,iBAAiB,CAAC;AAAA,UAClB,cAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO,KAAK,gDAAgD;AAAA,QAC1D;AAAA,QACA;AAAA,MACF,CAAC;AACD,aAAO,KAAK,kBAAkB;AAAA,QAC5B,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,sBACN,OACmC;AACnC,UAAM,YAAY,MAAM,MAAM,KAAK,EAAE;AACrC,QAAI,aAAa,EAAG,QAAO;AAC3B,QAAI,aAAa,GAAI,QAAO;AAC5B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,eACZ,UACA,aAMC;AACD,UAAM,SAAkB,CAAC;AACzB,UAAM,UAAoB,CAAC;AAC3B,UAAM,SAAkB,CAAC;AACzB,QAAI,aAAa;AAGjB,UAAM,WAAW,SAAS,iBAAiB,IAAI,OAAK,EAAE,OAAO;AAC7D,UAAM,KAAK,WAAW,eAAe,UAAU;AAAA,MAC7C,UAAU;AAAA,MACV,OAAO;AAAA;AAAA,IACT,CAAC;AAGD,eAAW,QAAQ,SAAS,kBAAkB;AAC5C,UAAI,aAAa,KAAK,kBAAkB,aAAa;AACnD,eAAO,MAAM,6CAA6C;AAAA,UACxD;AAAA,UACA,QAAQ;AAAA,QACV,CAAC;AACD;AAAA,MACF;AAGA,UAAI;AACF,cAAM,QAAQ,MAAM,KAAK,WAAW,UAAU,KAAK,OAAO,EAAE,IAAI;AAChE,eAAO,KAAK,KAAK;AACjB,sBAAc;AAGd,YAAI,KAAK,gBAAgB;AACvB,gBAAM,eAAe,MAAM,KAAK,WAAW,YAAY,KAAK,OAAO,EAAE,IAAI;AACzE,kBAAQ,KAAK,GAAG,YAAY;AAC5B,wBAAc,aAAa,SAAS;AAAA,QACtC;AAGA,YAAI,KAAK,eAAe;AACtB,gBAAM,cAAc,MAAM,KAAK,WAAW,WAAW,KAAK,SAAS,EAAE,EAAE,IAAI;AAC3E,iBAAO,KAAK,GAAG,WAAW;AAC1B,wBAAc,YAAY,SAAS;AAAA,QACrC;AAAA,MACF,SAAS,OAAO;AACd,eAAO,KAAK,4BAA4B;AAAA,UACtC,SAAS,KAAK;AAAA,UACd;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO,EAAE,QAAQ,SAAS,QAAQ,WAAW;AAAA,EAC/C;AAAA,EAEQ,gBAAgB,SAA2B;AACjD,QAAI;AACF,YAAM,OAAO,KAAK,GACf;AAAA,QACC;AAAA;AAAA;AAAA;AAAA,MAIF,EACC,IAAI,OAAO;AAEd,aAAO,KAAK,IAAI,CAAC,SAAS;AAAA,QACxB,GAAG;AAAA,QACH,UAAU,KAAK,MAAM,IAAI,YAAY,IAAI;AAAA,MAC3C,EAAE;AAAA,IACJ,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,QACA,SACA,QACA,UACQ;AACR,UAAM,WAAqB,CAAC;AAG5B,aAAS,KAAK,+BAA+B;AAC7C,aAAS;AAAA,MACP,iBAAiB,SAAS,kBAAkB,KAAK,QAAQ,CAAC,CAAC;AAAA,IAC7D;AACA,aAAS,KAAK,SAAS,SAAS;AAChC,aAAS,KAAK,EAAE;AAGhB,QAAI,OAAO,SAAS,GAAG;AACrB,eAAS,KAAK,oBAAoB;AAClC,iBAAW,SAAS,QAAQ;AAC1B,iBAAS,KAAK,OAAO,MAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AACjD,YAAI,MAAM,aAAa;AACrB,mBAAS,KAAK,MAAM,WAAW;AAAA,QACjC;AACA,iBAAS,KAAK,EAAE;AAAA,MAClB;AAAA,IACF;AAGA,UAAM,YAAY,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU;AAC7D,UAAM,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACjE,UAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM;AAErD,QAAI,UAAU,SAAS,GAAG;AACxB,eAAS,KAAK,kBAAkB;AAChC,iBAAW,KAAK,UAAU,MAAM,GAAG,CAAC,GAAG;AACrC,iBAAS,KAAK,KAAK,EAAE,IAAI,EAAE;AAAA,MAC7B;AACA,eAAS,KAAK,EAAE;AAAA,IAClB;AAEA,QAAI,YAAY,SAAS,GAAG;AAC1B,eAAS,KAAK,uBAAuB;AACrC,iBAAW,KAAK,YAAY,MAAM,GAAG,CAAC,GAAG;AACvC,iBAAS,KAAK,KAAK,EAAE,IAAI,EAAE;AAAA,MAC7B;AACA,eAAS,KAAK,EAAE;AAAA,IAClB;AAEA,QAAI,MAAM,SAAS,GAAG;AACpB,eAAS,KAAK,oBAAoB;AAClC,iBAAW,KAAK,MAAM,MAAM,GAAG,CAAC,GAAG;AACjC,iBAAS,KAAK,KAAK,EAAE,IAAI,EAAE;AAAA,MAC7B;AACA,eAAS,KAAK,EAAE;AAAA,IAClB;AAGA,QAAI,OAAO,SAAS,GAAG;AACrB,eAAS,KAAK,oBAAoB;AAClC,YAAM,eAAe,KAAK,gBAAgB,MAAM;AAChD,eAAS,KAAK,YAAY;AAC1B,eAAS,KAAK,EAAE;AAAA,IAClB;AAGA,QAAI,SAAS,gBAAgB,SAAS,GAAG;AACvC,eAAS,KAAK,oBAAoB;AAClC,iBAAW,OAAO,SAAS,iBAAiB;AAC1C,cAAM,OACJ,IAAI,SAAS,YAAY,MAAM,IAAI,SAAS,YAAY,MAAM;AAChE,iBAAS,KAAK,GAAG,IAAI,KAAK,IAAI,OAAO,YAAY,CAAC,KAAK,IAAI,MAAM,EAAE;AAAA,MACrE;AAAA,IACF;AAEA,WAAO,SAAS,KAAK,IAAI;AAAA,EAC3B;AAAA,EAEQ,gBAAgB,QAAyB;AAC/C,UAAM,SAAiC,CAAC;AACxC,eAAW,SAAS,QAAQ;AAC1B,aAAO,MAAM,UAAU,KAAK,OAAO,MAAM,UAAU,KAAK,KAAK;AAAA,IAC/D;AAEA,WAAO,OAAO,QAAQ,MAAM,EACzB,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,cAAc,EACxD,KAAK,IAAI;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,WAAW,eAAe,OAA0B;AACzD,WAAO,KAAK,iBAAiB,gBAAgB,EAAE,aAAa,CAAC;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA,EAKO,eAAe,UAA6B;AACjD,SAAK,cAAc;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKO,aAAmB;AACxB,SAAK,iBAAiB,WAAW;AACjC,SAAK,WAAW,WAAW;AAC3B,SAAK,aAAa,MAAM;AACxB,WAAO,KAAK,sBAAsB;AAAA,MAChC,WAAW,KAAK;AAAA,MAChB,YAAY,KAAK,aAAa,SAAS;AAAA,IACzC,CAAC;AAAA,EACH;AACF;",
+  "sourcesContent": ["/**\n * LLM-Driven Context Retrieval System\n * Uses LLM analysis to intelligently select relevant context\n */\n\nimport Database from 'better-sqlite3';\nimport {\n  FrameManager,\n  Frame,\n  Anchor,\n  Event,\n} from '../context/frame-manager.js';\nimport { QueryParser, StackMemoryQuery } from '../query/query-parser.js';\nimport { CompressedSummaryGenerator } from './summary-generator.js';\nimport {\n  CompressedSummary,\n  LLMAnalysisRequest,\n  LLMAnalysisResponse,\n  RetrievedContext,\n  FrameRetrievalPlan,\n  ContextRecommendation,\n  RetrievalConfig,\n  DEFAULT_RETRIEVAL_CONFIG,\n  RetrievalHints,\n  RetrievalMetadata,\n} from './types.js';\nimport { logger } from '../monitoring/logger.js';\nimport { LazyContextLoader } from '../performance/lazy-context-loader.js';\nimport { ContextCache } from '../performance/context-cache.js';\n\n/**\n * LLM provider interface for context analysis\n */\nexport interface LLMProvider {\n  analyze(prompt: string, maxTokens: number): Promise<string>;\n}\n\n/**\n * Simple heuristic-based fallback when LLM is unavailable\n */\nclass HeuristicAnalyzer {\n  analyze(\n    query: string,\n    summary: CompressedSummary,\n    parsedQuery?: StackMemoryQuery\n  ): LLMAnalysisResponse {\n    const framesToRetrieve: FrameRetrievalPlan[] = [];\n    const recommendations: ContextRecommendation[] = [];\n    const matchedPatterns: string[] = [];\n\n    // Score frames based on query relevance\n    const queryLower = query.toLowerCase();\n    const queryWords = queryLower.split(/\\W+/).filter((w) => w.length > 2);\n\n    for (const frame of summary.recentSession.frames) {\n      let priority = 5; // Base priority\n      const reasons: string[] = [];\n\n      // Recency boost\n      const ageHours = (Date.now() - frame.createdAt) / (1000 * 60 * 60);\n      if (ageHours < 1) {\n        priority += 3;\n        reasons.push('very recent');\n      } else if (ageHours < 6) {\n        priority += 2;\n        reasons.push('recent');\n      }\n\n      // Score boost\n      priority += Math.floor(frame.score * 3);\n\n      // Name matching\n      const nameLower = frame.name.toLowerCase();\n      const nameMatches = queryWords.filter((w) => nameLower.includes(w));\n      if (nameMatches.length > 0) {\n        priority += nameMatches.length * 2;\n        reasons.push(`matches: ${nameMatches.join(', ')}`);\n        matchedPatterns.push(`name_match:${nameMatches.join(',')}`);\n      }\n\n      // Type matching from parsed query\n      if (parsedQuery?.frame?.type) {\n        const frameType = frame.type.toLowerCase();\n        if (parsedQuery.frame.type.some((t) => t.toLowerCase() === frameType)) {\n          priority += 2;\n          reasons.push('type match');\n        }\n      }\n\n      // Topic matching\n      if (parsedQuery?.content?.topic) {\n        const topics = parsedQuery.content.topic;\n        const topicMatches = topics.filter(\n          (t) =>\n            nameLower.includes(t.toLowerCase()) ||\n            (frame.digestPreview &&\n              frame.digestPreview.toLowerCase().includes(t.toLowerCase()))\n        );\n        if (topicMatches.length > 0) {\n          priority += topicMatches.length;\n          reasons.push(`topic: ${topicMatches.join(', ')}`);\n        }\n      }\n\n      // Cap priority at 10\n      priority = Math.min(priority, 10);\n\n      if (priority >= 5) {\n        framesToRetrieve.push({\n          frameId: frame.frameId,\n          priority,\n          reason: reasons.length > 0 ? reasons.join('; ') : 'relevant context',\n          includeEvents: priority >= 7,\n          includeAnchors: true,\n          includeDigest: true,\n          estimatedTokens: this.estimateFrameTokens(frame),\n        });\n      }\n    }\n\n    // Sort by priority\n    framesToRetrieve.sort((a, b) => b.priority - a.priority);\n\n    // Generate recommendations based on errors\n    if (summary.recentSession.errorsEncountered.length > 0) {\n      recommendations.push({\n        type: 'include',\n        target: 'error_context',\n        reason: `${summary.recentSession.errorsEncountered.length} errors encountered recently`,\n        impact: 'medium',\n      });\n    }\n\n    // Recommend including decisions if query seems decision-related\n    if (\n      queryLower.includes('decision') ||\n      queryLower.includes('why') ||\n      queryLower.includes('chose')\n    ) {\n      recommendations.push({\n        type: 'include',\n        target: 'decisions',\n        reason: 'Query appears to be about past decisions',\n        impact: 'high',\n      });\n    }\n\n    // Calculate confidence based on match quality\n    const avgPriority =\n      framesToRetrieve.length > 0\n        ? framesToRetrieve.reduce((sum, f) => sum + f.priority, 0) /\n          framesToRetrieve.length\n        : 0;\n    const confidenceScore = Math.min(avgPriority / 10, 0.95);\n\n    // Generate reasoning\n    const reasoning = this.generateReasoning(\n      query,\n      framesToRetrieve,\n      summary,\n      matchedPatterns\n    );\n\n    return {\n      reasoning,\n      framesToRetrieve: framesToRetrieve.slice(0, 10), // Limit to top 10\n      confidenceScore,\n      recommendations,\n      metadata: {\n        analysisTimeMs: 0, // Will be set by caller\n        summaryTokens: this.estimateSummaryTokens(summary),\n        queryComplexity: this.assessQueryComplexity(query, parsedQuery),\n        matchedPatterns,\n        fallbackUsed: true,\n      },\n    };\n  }\n\n  private estimateFrameTokens(frame: {\n    eventCount: number;\n    anchorCount: number;\n    digestPreview?: string;\n  }): number {\n    let tokens = 50; // Base frame header\n    tokens += frame.eventCount * 30; // Estimate per event\n    tokens += frame.anchorCount * 40; // Estimate per anchor\n    if (frame.digestPreview) tokens += frame.digestPreview.length / 4;\n    return Math.floor(tokens);\n  }\n\n  private estimateSummaryTokens(summary: CompressedSummary): number {\n    return Math.floor(JSON.stringify(summary).length / 4);\n  }\n\n  private assessQueryComplexity(\n    query: string,\n    parsedQuery?: StackMemoryQuery\n  ): 'simple' | 'moderate' | 'complex' {\n    const wordCount = query.split(/\\s+/).length;\n    const hasTimeFilter = !!parsedQuery?.time;\n    const hasContentFilter = !!parsedQuery?.content;\n    const hasPeopleFilter = !!parsedQuery?.people;\n    const hasFrameFilter = !!parsedQuery?.frame;\n\n    const filterCount = [\n      hasTimeFilter,\n      hasContentFilter,\n      hasPeopleFilter,\n      hasFrameFilter,\n    ].filter(Boolean).length;\n\n    if (wordCount <= 5 && filterCount <= 1) return 'simple';\n    if (wordCount <= 15 && filterCount <= 2) return 'moderate';\n    return 'complex';\n  }\n\n  private generateReasoning(\n    query: string,\n    frames: FrameRetrievalPlan[],\n    summary: CompressedSummary,\n    matchedPatterns: string[]\n  ): string {\n    const parts: string[] = [];\n\n    parts.push(`Query: \"${query}\"`);\n    parts.push(\n      `Analyzed ${summary.recentSession.frames.length} recent frames.`\n    );\n\n    if (matchedPatterns.length > 0) {\n      parts.push(`Matched patterns: ${matchedPatterns.join(', ')}`);\n    }\n\n    if (frames.length > 0) {\n      parts.push(`Selected ${frames.length} frames for retrieval.`);\n      const topFrames = frames.slice(0, 3);\n      parts.push(\n        `Top frames: ${topFrames.map((f) => `${f.frameId} (priority: ${f.priority})`).join(', ')}`\n      );\n    } else {\n      parts.push('No highly relevant frames found. Using general context.');\n    }\n\n    return parts.join(' ');\n  }\n}\n\n/**\n * Main LLM Context Retrieval class\n */\nexport class LLMContextRetrieval {\n  private db: Database.Database;\n  private frameManager: FrameManager;\n  private summaryGenerator: CompressedSummaryGenerator;\n  private queryParser: QueryParser;\n  private heuristicAnalyzer: HeuristicAnalyzer;\n  private llmProvider?: LLMProvider;\n  private config: RetrievalConfig;\n  private projectId: string;\n  private lazyLoader: LazyContextLoader;\n  private contextCache: ContextCache<RetrievedContext>;\n\n  constructor(\n    db: Database.Database,\n    frameManager: FrameManager,\n    projectId: string,\n    config: Partial<RetrievalConfig> = {},\n    llmProvider?: LLMProvider\n  ) {\n    this.db = db;\n    this.frameManager = frameManager;\n    this.projectId = projectId;\n    this.config = { ...DEFAULT_RETRIEVAL_CONFIG, ...config };\n    this.llmProvider = llmProvider;\n    this.summaryGenerator = new CompressedSummaryGenerator(\n      db,\n      frameManager,\n      projectId,\n      config\n    );\n    this.queryParser = new QueryParser();\n    this.heuristicAnalyzer = new HeuristicAnalyzer();\n    \n    // Initialize performance optimizations\n    this.lazyLoader = new LazyContextLoader(db, projectId);\n    this.contextCache = new ContextCache<RetrievedContext>({\n      maxSize: 50 * 1024 * 1024, // 50MB for context cache\n      maxItems: 100,\n      defaultTTL: 600000, // 10 minutes\n    });\n    \n    // Start cache cleanup\n    this.contextCache.startCleanup(60000);\n  }\n\n  /**\n   * Retrieve context based on query using LLM analysis (with caching)\n   */\n  public async retrieveContext(\n    query: string,\n    options: {\n      tokenBudget?: number;\n      hints?: RetrievalHints;\n      forceRefresh?: boolean;\n    } = {}\n  ): Promise<RetrievedContext> {\n    const startTime = Date.now();\n    const tokenBudget = options.tokenBudget || this.config.defaultTokenBudget;\n    \n    // Check cache first unless force refresh\n    if (!options.forceRefresh) {\n      const cacheKey = `${query}:${tokenBudget}:${JSON.stringify(options.hints || {})}`;\n      const cached = this.contextCache.get(cacheKey);\n      if (cached) {\n        logger.debug('Context cache hit', {\n          query: query.substring(0, 50),\n          cacheStats: this.contextCache.getStats(),\n        });\n        return cached;\n      }\n    }\n\n    logger.info('Starting context retrieval', {\n      projectId: this.projectId,\n      query: query.substring(0, 100),\n      tokenBudget,\n    });\n\n    // 1. Parse the query\n    const parsedQuery = this.queryParser.parseNaturalLanguage(query);\n\n    // 2. Generate compressed summary\n    const summary = this.summaryGenerator.generateSummary({\n      forceRefresh: options.forceRefresh,\n    });\n\n    // 3. Perform LLM analysis\n    const analysis = await this.analyzeWithLLM({\n      currentQuery: query,\n      parsedQuery,\n      compressedSummary: summary,\n      tokenBudget,\n      hints: options.hints,\n    });\n\n    // 4. Retrieve frames based on analysis\n    const { frames, anchors, events, tokensUsed } = await this.retrieveFrames(\n      analysis,\n      tokenBudget\n    );\n\n    // 5. Assemble context string\n    const context = this.assembleContext(frames, anchors, events, analysis);\n\n    const metadata: RetrievalMetadata = {\n      retrievalTimeMs: Date.now() - startTime,\n      cacheHit: false, // Would need cache tracking\n      framesScanned: summary.recentSession.frames.length,\n      framesIncluded: frames.length,\n      compressionRatio: tokensUsed > 0 ? tokenBudget / tokensUsed : 1,\n    };\n\n    logger.info('Context retrieval complete', {\n      projectId: this.projectId,\n      framesIncluded: frames.length,\n      tokensUsed,\n      retrievalTimeMs: metadata.retrievalTimeMs,\n      confidence: analysis.confidenceScore,\n    });\n\n    const result: RetrievedContext = {\n      context,\n      frames,\n      anchors,\n      events,\n      analysis,\n      tokenUsage: {\n        budget: tokenBudget,\n        used: tokensUsed,\n        remaining: tokenBudget - tokensUsed,\n      },\n      metadata,\n    };\n    \n    // Cache the result\n    if (!options.forceRefresh) {\n      const cacheKey = `${query}:${tokenBudget}:${JSON.stringify(options.hints || {})}`;\n      this.contextCache.set(cacheKey, result, {\n        ttl: 600000, // 10 minutes\n      });\n    }\n\n    return result;\n  }\n\n  /**\n   * Perform LLM analysis or fall back to heuristics\n   */\n  private async analyzeWithLLM(\n    request: LLMAnalysisRequest\n  ): Promise<LLMAnalysisResponse> {\n    const startTime = Date.now();\n\n    // Try LLM analysis if provider is available\n    if (this.llmProvider) {\n      try {\n        const prompt = this.buildAnalysisPrompt(request);\n        const response = await this.llmProvider.analyze(\n          prompt,\n          this.config.llmConfig.maxTokens\n        );\n        const analysis = this.parseAnalysisResponse(response, request);\n        analysis.metadata.analysisTimeMs = Date.now() - startTime;\n        analysis.metadata.fallbackUsed = false;\n\n        // Validate confidence threshold\n        if (analysis.confidenceScore >= this.config.minConfidenceThreshold) {\n          return analysis;\n        }\n\n        logger.warn('LLM confidence below threshold, using fallback', {\n          confidence: analysis.confidenceScore,\n          threshold: this.config.minConfidenceThreshold,\n        });\n      } catch (error: any) {\n        logger.error(\n          'LLM analysis failed, using fallback',\n          error instanceof Error ? error : new Error(String(error))\n        );\n      }\n    }\n\n    // Fall back to heuristic analysis\n    if (this.config.enableFallback) {\n      const analysis = this.heuristicAnalyzer.analyze(\n        request.currentQuery,\n        request.compressedSummary,\n        request.parsedQuery\n      );\n      analysis.metadata.analysisTimeMs = Date.now() - startTime;\n      return analysis;\n    }\n\n    // Return empty analysis if no fallback\n    return {\n      reasoning:\n        'Unable to perform analysis - LLM unavailable and fallback disabled',\n      framesToRetrieve: [],\n      confidenceScore: 0,\n      recommendations: [],\n      metadata: {\n        analysisTimeMs: Date.now() - startTime,\n        summaryTokens: 0,\n        queryComplexity: 'simple',\n        matchedPatterns: [],\n        fallbackUsed: false,\n      },\n    };\n  }\n\n  /**\n   * Build the prompt for LLM analysis\n   */\n  private buildAnalysisPrompt(request: LLMAnalysisRequest): string {\n    const summary = request.compressedSummary;\n\n    return `You are analyzing a code project's memory to retrieve relevant context.\n\n## Current Query\n\"${request.currentQuery}\"\n\n## Token Budget\n${request.tokenBudget} tokens available\n\n## Recent Session Summary\n- Frames: ${summary.recentSession.frames.length}\n- Time range: ${new Date(summary.recentSession.timeRange.start).toISOString()} to ${new Date(summary.recentSession.timeRange.end).toISOString()}\n- Dominant operations: ${summary.recentSession.dominantOperations.map((o) => `${o.operation}(${o.count})`).join(', ')}\n- Files touched: ${summary.recentSession.filesTouched\n      .slice(0, 5)\n      .map((f) => f.path)\n      .join(', ')}\n- Errors: ${summary.recentSession.errorsEncountered.length}\n\n## Available Frames\n${summary.recentSession.frames\n  .slice(0, 15)\n  .map(\n    (f) =>\n      `- ${f.frameId}: \"${f.name}\" (${f.type}, score: ${f.score.toFixed(2)}, events: ${f.eventCount})`\n  )\n  .join('\\n')}\n\n## Key Decisions\n${summary.historicalPatterns.keyDecisions\n  .slice(0, 5)\n  .map((d) => `- ${d.text.substring(0, 80)}...`)\n  .join('\\n')}\n\n## Task\nAnalyze the query and select the most relevant frames to retrieve.\nReturn a JSON object with:\n{\n  \"reasoning\": \"Your analysis of why these frames are relevant\",\n  \"framesToRetrieve\": [\n    {\"frameId\": \"...\", \"priority\": 1-10, \"reason\": \"...\", \"includeEvents\": true/false, \"includeAnchors\": true/false}\n  ],\n  \"confidenceScore\": 0.0-1.0,\n  \"recommendations\": [{\"type\": \"include/exclude/summarize\", \"target\": \"...\", \"reason\": \"...\", \"impact\": \"low/medium/high\"}]\n}\n\n${request.hints ? `\\n## Hints\\n${JSON.stringify(request.hints)}` : ''}\n\nRespond with only the JSON object, no other text.`;\n  }\n\n  /**\n   * Parse LLM response into structured analysis\n   */\n  private parseAnalysisResponse(\n    response: string,\n    request: LLMAnalysisRequest\n  ): LLMAnalysisResponse {\n    try {\n      // Extract JSON from response (handle markdown code blocks)\n      let jsonStr = response;\n      const jsonMatch = response.match(/```(?:json)?\\s*([\\s\\S]*?)```/);\n      if (jsonMatch) {\n        jsonStr = jsonMatch[1];\n      }\n\n      const parsed = JSON.parse(jsonStr.trim());\n\n      // Validate and normalize the response\n      return {\n        reasoning: parsed.reasoning || 'No reasoning provided',\n        framesToRetrieve: (parsed.framesToRetrieve || []).map((f: any) => ({\n          frameId: f.frameId,\n          priority: Math.min(10, Math.max(1, f.priority || 5)),\n          reason: f.reason || 'Selected by LLM',\n          includeEvents: f.includeEvents ?? true,\n          includeAnchors: f.includeAnchors ?? true,\n          includeDigest: f.includeDigest ?? true,\n          estimatedTokens: f.estimatedTokens || 100,\n        })),\n        confidenceScore: Math.min(\n          1,\n          Math.max(0, parsed.confidenceScore || 0.5)\n        ),\n        recommendations: (parsed.recommendations || []).map((r: any) => ({\n          type: r.type || 'include',\n          target: r.target || '',\n          reason: r.reason || '',\n          impact: r.impact || 'medium',\n        })),\n        metadata: {\n          analysisTimeMs: 0,\n          summaryTokens: Math.floor(\n            JSON.stringify(request.compressedSummary).length / 4\n          ),\n          queryComplexity: this.assessQueryComplexity(request.currentQuery),\n          matchedPatterns: [],\n          fallbackUsed: false,\n        },\n      };\n    } catch (error: unknown) {\n      logger.warn('Failed to parse LLM response, using fallback', {\n        error,\n        response,\n      });\n      return this.heuristicAnalyzer.analyze(\n        request.currentQuery,\n        request.compressedSummary,\n        request.parsedQuery\n      );\n    }\n  }\n\n  private assessQueryComplexity(\n    query: string\n  ): 'simple' | 'moderate' | 'complex' {\n    const wordCount = query.split(/\\s+/).length;\n    if (wordCount <= 5) return 'simple';\n    if (wordCount <= 15) return 'moderate';\n    return 'complex';\n  }\n\n  /**\n   * Retrieve frames based on analysis (with lazy loading)\n   */\n  private async retrieveFrames(\n    analysis: LLMAnalysisResponse,\n    tokenBudget: number\n  ): Promise<{\n    frames: Frame[];\n    anchors: Anchor[];\n    events: Event[];\n    tokensUsed: number;\n  }> {\n    const frames: Frame[] = [];\n    const anchors: Anchor[] = [];\n    const events: Event[] = [];\n    let tokensUsed = 0;\n\n    // Preload frames for better performance\n    const frameIds = analysis.framesToRetrieve.map((p: any) => p.frameId);\n    await this.lazyLoader.preloadContext(frameIds, {\n      parallel: true,\n      depth: 2, // Load frames, anchors, and events\n    });\n\n    // Retrieve frames in priority order within budget\n    for (const plan of analysis.framesToRetrieve) {\n      if (tokensUsed + plan.estimatedTokens > tokenBudget) {\n        logger.debug('Token budget exceeded, stopping retrieval', {\n          tokensUsed,\n          budget: tokenBudget,\n        });\n        break;\n      }\n\n      // Use lazy loader for efficient retrieval\n      try {\n        const frame = await this.lazyLoader.lazyFrame(plan.frameId).get();\n        frames.push(frame);\n        tokensUsed += 50; // Base frame tokens\n\n        // Include anchors if requested\n        if (plan.includeAnchors) {\n          const frameAnchors = await this.lazyLoader.lazyAnchors(plan.frameId).get();\n          anchors.push(...frameAnchors);\n          tokensUsed += frameAnchors.length * 40;\n        }\n\n        // Include events if requested\n        if (plan.includeEvents) {\n          const frameEvents = await this.lazyLoader.lazyEvents(plan.frameId, 10).get();\n          events.push(...frameEvents);\n          tokensUsed += frameEvents.length * 30;\n        }\n      } catch (error: unknown) {\n        logger.warn('Failed to retrieve frame', {\n          frameId: plan.frameId,\n          error,\n        });\n      }\n    }\n\n    return { frames, anchors, events, tokensUsed };\n  }\n\n  private getFrameAnchors(frameId: string): Anchor[] {\n    try {\n      const rows = this.db\n        .prepare(\n          `\n        SELECT * FROM anchors WHERE frame_id = ?\n        ORDER BY priority DESC, created_at DESC\n      `\n        )\n        .all(frameId) as any[];\n\n      return rows.map((row) => ({\n        ...row,\n        metadata: JSON.parse(row.metadata || '{}'),\n      }));\n    } catch {\n      return [];\n    }\n  }\n\n  /**\n   * Assemble final context string\n   */\n  private assembleContext(\n    frames: Frame[],\n    anchors: Anchor[],\n    events: Event[],\n    analysis: LLMAnalysisResponse\n  ): string {\n    const sections: string[] = [];\n\n    // Add retrieval reasoning (auditable)\n    sections.push('## Context Retrieval Analysis');\n    sections.push(\n      `*Confidence: ${(analysis.confidenceScore * 100).toFixed(0)}%*`\n    );\n    sections.push(analysis.reasoning);\n    sections.push('');\n\n    // Add frames\n    if (frames.length > 0) {\n      sections.push('## Relevant Frames');\n      for (const frame of frames) {\n        sections.push(`### ${frame.name} (${frame.type})`);\n        if (frame.digest_text) {\n          sections.push(frame.digest_text);\n        }\n        sections.push('');\n      }\n    }\n\n    // Add key anchors\n    const decisions = anchors.filter((a) => a.type === 'DECISION');\n    const constraints = anchors.filter((a) => a.type === 'CONSTRAINT');\n    const facts = anchors.filter((a) => a.type === 'FACT');\n\n    if (decisions.length > 0) {\n      sections.push('## Key Decisions');\n      for (const d of decisions.slice(0, 5)) {\n        sections.push(`- ${d.text}`);\n      }\n      sections.push('');\n    }\n\n    if (constraints.length > 0) {\n      sections.push('## Active Constraints');\n      for (const c of constraints.slice(0, 5)) {\n        sections.push(`- ${c.text}`);\n      }\n      sections.push('');\n    }\n\n    if (facts.length > 0) {\n      sections.push('## Important Facts');\n      for (const f of facts.slice(0, 5)) {\n        sections.push(`- ${f.text}`);\n      }\n      sections.push('');\n    }\n\n    // Add recent events summary\n    if (events.length > 0) {\n      sections.push('## Recent Activity');\n      const eventSummary = this.summarizeEvents(events);\n      sections.push(eventSummary);\n      sections.push('');\n    }\n\n    // Add recommendations\n    if (analysis.recommendations.length > 0) {\n      sections.push('## Recommendations');\n      for (const rec of analysis.recommendations) {\n        const icon =\n          rec.type === 'include' ? '+' : rec.type === 'exclude' ? '-' : '~';\n        sections.push(`${icon} [${rec.impact.toUpperCase()}] ${rec.reason}`);\n      }\n    }\n\n    return sections.join('\\n');\n  }\n\n  private summarizeEvents(events: Event[]): string {\n    const byType: Record<string, number> = {};\n    for (const event of events) {\n      byType[event.event_type] = (byType[event.event_type] || 0) + 1;\n    }\n\n    return Object.entries(byType)\n      .map(([type, count]) => `- ${type}: ${count} occurrences`)\n      .join('\\n');\n  }\n\n  /**\n   * Get just the compressed summary (useful for external analysis)\n   */\n  public getSummary(forceRefresh = false): CompressedSummary {\n    return this.summaryGenerator.generateSummary({ forceRefresh });\n  }\n\n  /**\n   * Set LLM provider\n   */\n  public setLLMProvider(provider: LLMProvider): void {\n    this.llmProvider = provider;\n  }\n\n  /**\n   * Clear all caches\n   */\n  public clearCache(): void {\n    this.summaryGenerator.clearCache();\n    this.lazyLoader.clearCache();\n    this.contextCache.clear();\n    logger.info('Cleared all caches', {\n      projectId: this.projectId,\n      cacheStats: this.contextCache.getStats(),\n    });\n  }\n}\n"],
+  "mappings": "AAYA,SAAS,mBAAqC;AAC9C,SAAS,kCAAkC;AAC3C;AAAA,EAQE;AAAA,OAGK;AACP,SAAS,cAAc;AACvB,SAAS,yBAAyB;AAClC,SAAS,oBAAoB;AAY7B,MAAM,kBAAkB;AAAA,EACtB,QACE,OACA,SACA,aACqB;AACrB,UAAM,mBAAyC,CAAC;AAChD,UAAM,kBAA2C,CAAC;AAClD,UAAM,kBAA4B,CAAC;AAGnC,UAAM,aAAa,MAAM,YAAY;AACrC,UAAM,aAAa,WAAW,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAErE,eAAW,SAAS,QAAQ,cAAc,QAAQ;AAChD,UAAI,WAAW;AACf,YAAM,UAAoB,CAAC;AAG3B,YAAM,YAAY,KAAK,IAAI,IAAI,MAAM,cAAc,MAAO,KAAK;AAC/D,UAAI,WAAW,GAAG;AAChB,oBAAY;AACZ,gBAAQ,KAAK,aAAa;AAAA,MAC5B,WAAW,WAAW,GAAG;AACvB,oBAAY;AACZ,gBAAQ,KAAK,QAAQ;AAAA,MACvB;AAGA,kBAAY,KAAK,MAAM,MAAM,QAAQ,CAAC;AAGtC,YAAM,YAAY,MAAM,KAAK,YAAY;AACzC,YAAM,cAAc,WAAW,OAAO,CAAC,MAAM,UAAU,SAAS,CAAC,CAAC;AAClE,UAAI,YAAY,SAAS,GAAG;AAC1B,oBAAY,YAAY,SAAS;AACjC,gBAAQ,KAAK,YAAY,YAAY,KAAK,IAAI,CAAC,EAAE;AACjD,wBAAgB,KAAK,cAAc,YAAY,KAAK,GAAG,CAAC,EAAE;AAAA,MAC5D;AAGA,UAAI,aAAa,OAAO,MAAM;AAC5B,cAAM,YAAY,MAAM,KAAK,YAAY;AACzC,YAAI,YAAY,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,YAAY,MAAM,SAAS,GAAG;AACrE,sBAAY;AACZ,kBAAQ,KAAK,YAAY;AAAA,QAC3B;AAAA,MACF;AAGA,UAAI,aAAa,SAAS,OAAO;AAC/B,cAAM,SAAS,YAAY,QAAQ;AACnC,cAAM,eAAe,OAAO;AAAA,UAC1B,CAAC,MACC,UAAU,SAAS,EAAE,YAAY,CAAC,KACjC,MAAM,iBACL,MAAM,cAAc,YAAY,EAAE,SAAS,EAAE,YAAY,CAAC;AAAA,QAChE;AACA,YAAI,aAAa,SAAS,GAAG;AAC3B,sBAAY,aAAa;AACzB,kBAAQ,KAAK,UAAU,aAAa,KAAK,IAAI,CAAC,EAAE;AAAA,QAClD;AAAA,MACF;AAGA,iBAAW,KAAK,IAAI,UAAU,EAAE;AAEhC,UAAI,YAAY,GAAG;AACjB,yBAAiB,KAAK;AAAA,UACpB,SAAS,MAAM;AAAA,UACf;AAAA,UACA,QAAQ,QAAQ,SAAS,IAAI,QAAQ,KAAK,IAAI,IAAI;AAAA,UAClD,eAAe,YAAY;AAAA,UAC3B,gBAAgB;AAAA,UAChB,eAAe;AAAA,UACf,iBAAiB,KAAK,oBAAoB,KAAK;AAAA,QACjD,CAAC;AAAA,MACH;AAAA,IACF;AAGA,qBAAiB,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAGvD,QAAI,QAAQ,cAAc,kBAAkB,SAAS,GAAG;AACtD,sBAAgB,KAAK;AAAA,QACnB,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,QAAQ,GAAG,QAAQ,cAAc,kBAAkB,MAAM;AAAA,QACzD,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAGA,QACE,WAAW,SAAS,UAAU,KAC9B,WAAW,SAAS,KAAK,KACzB,WAAW,SAAS,OAAO,GAC3B;AACA,sBAAgB,KAAK;AAAA,QACnB,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV,CAAC;AAAA,IACH;AAGA,UAAM,cACJ,iBAAiB,SAAS,IACtB,iBAAiB,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,UAAU,CAAC,IACvD,iBAAiB,SACjB;AACN,UAAM,kBAAkB,KAAK,IAAI,cAAc,IAAI,IAAI;AAGvD,UAAM,YAAY,KAAK;AAAA,MACrB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAEA,WAAO;AAAA,MACL;AAAA,MACA,kBAAkB,iBAAiB,MAAM,GAAG,EAAE;AAAA;AAAA,MAC9C;AAAA,MACA;AAAA,MACA,UAAU;AAAA,QACR,gBAAgB;AAAA;AAAA,QAChB,eAAe,KAAK,sBAAsB,OAAO;AAAA,QACjD,iBAAiB,KAAK,sBAAsB,OAAO,WAAW;AAAA,QAC9D;AAAA,QACA,cAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,oBAAoB,OAIjB;AACT,QAAI,SAAS;AACb,cAAU,MAAM,aAAa;AAC7B,cAAU,MAAM,cAAc;AAC9B,QAAI,MAAM,cAAe,WAAU,MAAM,cAAc,SAAS;AAChE,WAAO,KAAK,MAAM,MAAM;AAAA,EAC1B;AAAA,EAEQ,sBAAsB,SAAoC;AAChE,WAAO,KAAK,MAAM,KAAK,UAAU,OAAO,EAAE,SAAS,CAAC;AAAA,EACtD;AAAA,EAEQ,sBACN,OACA,aACmC;AACnC,UAAM,YAAY,MAAM,MAAM,KAAK,EAAE;AACrC,UAAM,gBAAgB,CAAC,CAAC,aAAa;AACrC,UAAM,mBAAmB,CAAC,CAAC,aAAa;AACxC,UAAM,kBAAkB,CAAC,CAAC,aAAa;AACvC,UAAM,iBAAiB,CAAC,CAAC,aAAa;AAEtC,UAAM,cAAc;AAAA,MAClB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,EAAE,OAAO,OAAO,EAAE;AAElB,QAAI,aAAa,KAAK,eAAe,EAAG,QAAO;AAC/C,QAAI,aAAa,MAAM,eAAe,EAAG,QAAO;AAChD,WAAO;AAAA,EACT;AAAA,EAEQ,kBACN,OACA,QACA,SACA,iBACQ;AACR,UAAM,QAAkB,CAAC;AAEzB,UAAM,KAAK,WAAW,KAAK,GAAG;AAC9B,UAAM;AAAA,MACJ,YAAY,QAAQ,cAAc,OAAO,MAAM;AAAA,IACjD;AAEA,QAAI,gBAAgB,SAAS,GAAG;AAC9B,YAAM,KAAK,qBAAqB,gBAAgB,KAAK,IAAI,CAAC,EAAE;AAAA,IAC9D;AAEA,QAAI,OAAO,SAAS,GAAG;AACrB,YAAM,KAAK,YAAY,OAAO,MAAM,wBAAwB;AAC5D,YAAM,YAAY,OAAO,MAAM,GAAG,CAAC;AACnC,YAAM;AAAA,QACJ,eAAe,UAAU,IAAI,CAAC,MAAM,GAAG,EAAE,OAAO,eAAe,EAAE,QAAQ,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,MAC1F;AAAA,IACF,OAAO;AACL,YAAM,KAAK,yDAAyD;AAAA,IACtE;AAEA,WAAO,MAAM,KAAK,GAAG;AAAA,EACvB;AACF;AAKO,MAAM,oBAAoB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAER,YACE,IACA,cACA,WACA,SAAmC,CAAC,GACpC,aACA;AACA,SAAK,KAAK;AACV,SAAK,eAAe;AACpB,SAAK,YAAY;AACjB,SAAK,SAAS,EAAE,GAAG,0BAA0B,GAAG,OAAO;AACvD,SAAK,cAAc;AACnB,SAAK,mBAAmB,IAAI;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,SAAK,cAAc,IAAI,YAAY;AACnC,SAAK,oBAAoB,IAAI,kBAAkB;AAG/C,SAAK,aAAa,IAAI,kBAAkB,IAAI,SAAS;AACrD,SAAK,eAAe,IAAI,aAA+B;AAAA,MACrD,SAAS,KAAK,OAAO;AAAA;AAAA,MACrB,UAAU;AAAA,MACV,YAAY;AAAA;AAAA,IACd,CAAC;AAGD,SAAK,aAAa,aAAa,GAAK;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,MAAa,gBACX,OACA,UAII,CAAC,GACsB;AAC3B,UAAM,YAAY,KAAK,IAAI;AAC3B,UAAM,cAAc,QAAQ,eAAe,KAAK,OAAO;AAGvD,QAAI,CAAC,QAAQ,cAAc;AACzB,YAAM,WAAW,GAAG,KAAK,IAAI,WAAW,IAAI,KAAK,UAAU,QAAQ,SAAS,CAAC,CAAC,CAAC;AAC/E,YAAM,SAAS,KAAK,aAAa,IAAI,QAAQ;AAC7C,UAAI,QAAQ;AACV,eAAO,MAAM,qBAAqB;AAAA,UAChC,OAAO,MAAM,UAAU,GAAG,EAAE;AAAA,UAC5B,YAAY,KAAK,aAAa,SAAS;AAAA,QACzC,CAAC;AACD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,WAAO,KAAK,8BAA8B;AAAA,MACxC,WAAW,KAAK;AAAA,MAChB,OAAO,MAAM,UAAU,GAAG,GAAG;AAAA,MAC7B;AAAA,IACF,CAAC;AAGD,UAAM,cAAc,KAAK,YAAY,qBAAqB,KAAK;AAG/D,UAAM,UAAU,KAAK,iBAAiB,gBAAgB;AAAA,MACpD,cAAc,QAAQ;AAAA,IACxB,CAAC;AAGD,UAAM,WAAW,MAAM,KAAK,eAAe;AAAA,MACzC,cAAc;AAAA,MACd;AAAA,MACA,mBAAmB;AAAA,MACnB;AAAA,MACA,OAAO,QAAQ;AAAA,IACjB,CAAC;AAGD,UAAM,EAAE,QAAQ,SAAS,QAAQ,WAAW,IAAI,MAAM,KAAK;AAAA,MACzD;AAAA,MACA;AAAA,IACF;AAGA,UAAM,UAAU,KAAK,gBAAgB,QAAQ,SAAS,QAAQ,QAAQ;AAEtE,UAAM,WAA8B;AAAA,MAClC,iBAAiB,KAAK,IAAI,IAAI;AAAA,MAC9B,UAAU;AAAA;AAAA,MACV,eAAe,QAAQ,cAAc,OAAO;AAAA,MAC5C,gBAAgB,OAAO;AAAA,MACvB,kBAAkB,aAAa,IAAI,cAAc,aAAa;AAAA,IAChE;AAEA,WAAO,KAAK,8BAA8B;AAAA,MACxC,WAAW,KAAK;AAAA,MAChB,gBAAgB,OAAO;AAAA,MACvB;AAAA,MACA,iBAAiB,SAAS;AAAA,MAC1B,YAAY,SAAS;AAAA,IACvB,CAAC;AAED,UAAM,SAA2B;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,YAAY;AAAA,QACV,QAAQ;AAAA,QACR,MAAM;AAAA,QACN,WAAW,cAAc;AAAA,MAC3B;AAAA,MACA;AAAA,IACF;AAGA,QAAI,CAAC,QAAQ,cAAc;AACzB,YAAM,WAAW,GAAG,KAAK,IAAI,WAAW,IAAI,KAAK,UAAU,QAAQ,SAAS,CAAC,CAAC,CAAC;AAC/E,WAAK,aAAa,IAAI,UAAU,QAAQ;AAAA,QACtC,KAAK;AAAA;AAAA,MACP,CAAC;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,eACZ,SAC8B;AAC9B,UAAM,YAAY,KAAK,IAAI;AAG3B,QAAI,KAAK,aAAa;AACpB,UAAI;AACF,cAAM,SAAS,KAAK,oBAAoB,OAAO;AAC/C,cAAM,WAAW,MAAM,KAAK,YAAY;AAAA,UACtC;AAAA,UACA,KAAK,OAAO,UAAU;AAAA,QACxB;AACA,cAAM,WAAW,KAAK,sBAAsB,UAAU,OAAO;AAC7D,iBAAS,SAAS,iBAAiB,KAAK,IAAI,IAAI;AAChD,iBAAS,SAAS,eAAe;AAGjC,YAAI,SAAS,mBAAmB,KAAK,OAAO,wBAAwB;AAClE,iBAAO;AAAA,QACT;AAEA,eAAO,KAAK,kDAAkD;AAAA,UAC5D,YAAY,SAAS;AAAA,UACrB,WAAW,KAAK,OAAO;AAAA,QACzB,CAAC;AAAA,MACH,SAAS,OAAY;AACnB,eAAO;AAAA,UACL;AAAA,UACA,iBAAiB,QAAQ,QAAQ,IAAI,MAAM,OAAO,KAAK,CAAC;AAAA,QAC1D;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK,OAAO,gBAAgB;AAC9B,YAAM,WAAW,KAAK,kBAAkB;AAAA,QACtC,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AACA,eAAS,SAAS,iBAAiB,KAAK,IAAI,IAAI;AAChD,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,MACL,WACE;AAAA,MACF,kBAAkB,CAAC;AAAA,MACnB,iBAAiB;AAAA,MACjB,iBAAiB,CAAC;AAAA,MAClB,UAAU;AAAA,QACR,gBAAgB,KAAK,IAAI,IAAI;AAAA,QAC7B,eAAe;AAAA,QACf,iBAAiB;AAAA,QACjB,iBAAiB,CAAC;AAAA,QAClB,cAAc;AAAA,MAChB;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,oBAAoB,SAAqC;AAC/D,UAAM,UAAU,QAAQ;AAExB,WAAO;AAAA;AAAA;AAAA,GAGR,QAAQ,YAAY;AAAA;AAAA;AAAA,EAGrB,QAAQ,WAAW;AAAA;AAAA;AAAA,YAGT,QAAQ,cAAc,OAAO,MAAM;AAAA,gBAC/B,IAAI,KAAK,QAAQ,cAAc,UAAU,KAAK,EAAE,YAAY,CAAC,OAAO,IAAI,KAAK,QAAQ,cAAc,UAAU,GAAG,EAAE,YAAY,CAAC;AAAA,yBACtH,QAAQ,cAAc,mBAAmB,IAAI,CAAC,MAAM,GAAG,EAAE,SAAS,IAAI,EAAE,KAAK,GAAG,EAAE,KAAK,IAAI,CAAC;AAAA,mBAClG,QAAQ,cAAc,aAClC,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,EAAE,IAAI,EACjB,KAAK,IAAI,CAAC;AAAA,YACL,QAAQ,cAAc,kBAAkB,MAAM;AAAA;AAAA;AAAA,EAGxD,QAAQ,cAAc,OACrB,MAAM,GAAG,EAAE,EACX;AAAA,MACC,CAAC,MACC,KAAK,EAAE,OAAO,MAAM,EAAE,IAAI,MAAM,EAAE,IAAI,YAAY,EAAE,MAAM,QAAQ,CAAC,CAAC,aAAa,EAAE,UAAU;AAAA,IACjG,EACC,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA,EAGX,QAAQ,mBAAmB,aAC1B,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,KAAK,EAAE,KAAK,UAAU,GAAG,EAAE,CAAC,KAAK,EAC5C,KAAK,IAAI,CAAC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcX,QAAQ,QAAQ;AAAA;AAAA,EAAe,KAAK,UAAU,QAAQ,KAAK,CAAC,KAAK,EAAE;AAAA;AAAA;AAAA,EAGnE;AAAA;AAAA;AAAA;AAAA,EAKQ,sBACN,UACA,SACqB;AACrB,QAAI;AAEF,UAAI,UAAU;AACd,YAAM,YAAY,SAAS,MAAM,8BAA8B;AAC/D,UAAI,WAAW;AACb,kBAAU,UAAU,CAAC;AAAA,MACvB;AAEA,YAAM,SAAS,KAAK,MAAM,QAAQ,KAAK,CAAC;AAGxC,aAAO;AAAA,QACL,WAAW,OAAO,aAAa;AAAA,QAC/B,mBAAmB,OAAO,oBAAoB,CAAC,GAAG,IAAI,CAAC,OAAY;AAAA,UACjE,SAAS,EAAE;AAAA,UACX,UAAU,KAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAE,YAAY,CAAC,CAAC;AAAA,UACnD,QAAQ,EAAE,UAAU;AAAA,UACpB,eAAe,EAAE,iBAAiB;AAAA,UAClC,gBAAgB,EAAE,kBAAkB;AAAA,UACpC,eAAe,EAAE,iBAAiB;AAAA,UAClC,iBAAiB,EAAE,mBAAmB;AAAA,QACxC,EAAE;AAAA,QACF,iBAAiB,KAAK;AAAA,UACpB;AAAA,UACA,KAAK,IAAI,GAAG,OAAO,mBAAmB,GAAG;AAAA,QAC3C;AAAA,QACA,kBAAkB,OAAO,mBAAmB,CAAC,GAAG,IAAI,CAAC,OAAY;AAAA,UAC/D,MAAM,EAAE,QAAQ;AAAA,UAChB,QAAQ,EAAE,UAAU;AAAA,UACpB,QAAQ,EAAE,UAAU;AAAA,UACpB,QAAQ,EAAE,UAAU;AAAA,QACtB,EAAE;AAAA,QACF,UAAU;AAAA,UACR,gBAAgB;AAAA,UAChB,eAAe,KAAK;AAAA,YAClB,KAAK,UAAU,QAAQ,iBAAiB,EAAE,SAAS;AAAA,UACrD;AAAA,UACA,iBAAiB,KAAK,sBAAsB,QAAQ,YAAY;AAAA,UAChE,iBAAiB,CAAC;AAAA,UAClB,cAAc;AAAA,QAChB;AAAA,MACF;AAAA,IACF,SAAS,OAAgB;AACvB,aAAO,KAAK,gDAAgD;AAAA,QAC1D;AAAA,QACA;AAAA,MACF,CAAC;AACD,aAAO,KAAK,kBAAkB;AAAA,QAC5B,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,QAAQ;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,sBACN,OACmC;AACnC,UAAM,YAAY,MAAM,MAAM,KAAK,EAAE;AACrC,QAAI,aAAa,EAAG,QAAO;AAC3B,QAAI,aAAa,GAAI,QAAO;AAC5B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,eACZ,UACA,aAMC;AACD,UAAM,SAAkB,CAAC;AACzB,UAAM,UAAoB,CAAC;AAC3B,UAAM,SAAkB,CAAC;AACzB,QAAI,aAAa;AAGjB,UAAM,WAAW,SAAS,iBAAiB,IAAI,CAAC,MAAW,EAAE,OAAO;AACpE,UAAM,KAAK,WAAW,eAAe,UAAU;AAAA,MAC7C,UAAU;AAAA,MACV,OAAO;AAAA;AAAA,IACT,CAAC;AAGD,eAAW,QAAQ,SAAS,kBAAkB;AAC5C,UAAI,aAAa,KAAK,kBAAkB,aAAa;AACnD,eAAO,MAAM,6CAA6C;AAAA,UACxD;AAAA,UACA,QAAQ;AAAA,QACV,CAAC;AACD;AAAA,MACF;AAGA,UAAI;AACF,cAAM,QAAQ,MAAM,KAAK,WAAW,UAAU,KAAK,OAAO,EAAE,IAAI;AAChE,eAAO,KAAK,KAAK;AACjB,sBAAc;AAGd,YAAI,KAAK,gBAAgB;AACvB,gBAAM,eAAe,MAAM,KAAK,WAAW,YAAY,KAAK,OAAO,EAAE,IAAI;AACzE,kBAAQ,KAAK,GAAG,YAAY;AAC5B,wBAAc,aAAa,SAAS;AAAA,QACtC;AAGA,YAAI,KAAK,eAAe;AACtB,gBAAM,cAAc,MAAM,KAAK,WAAW,WAAW,KAAK,SAAS,EAAE,EAAE,IAAI;AAC3E,iBAAO,KAAK,GAAG,WAAW;AAC1B,wBAAc,YAAY,SAAS;AAAA,QACrC;AAAA,MACF,SAAS,OAAgB;AACvB,eAAO,KAAK,4BAA4B;AAAA,UACtC,SAAS,KAAK;AAAA,UACd;AAAA,QACF,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO,EAAE,QAAQ,SAAS,QAAQ,WAAW;AAAA,EAC/C;AAAA,EAEQ,gBAAgB,SAA2B;AACjD,QAAI;AACF,YAAM,OAAO,KAAK,GACf;AAAA,QACC;AAAA;AAAA;AAAA;AAAA,MAIF,EACC,IAAI,OAAO;AAEd,aAAO,KAAK,IAAI,CAAC,SAAS;AAAA,QACxB,GAAG;AAAA,QACH,UAAU,KAAK,MAAM,IAAI,YAAY,IAAI;AAAA,MAC3C,EAAE;AAAA,IACJ,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,QACA,SACA,QACA,UACQ;AACR,UAAM,WAAqB,CAAC;AAG5B,aAAS,KAAK,+BAA+B;AAC7C,aAAS;AAAA,MACP,iBAAiB,SAAS,kBAAkB,KAAK,QAAQ,CAAC,CAAC;AAAA,IAC7D;AACA,aAAS,KAAK,SAAS,SAAS;AAChC,aAAS,KAAK,EAAE;AAGhB,QAAI,OAAO,SAAS,GAAG;AACrB,eAAS,KAAK,oBAAoB;AAClC,iBAAW,SAAS,QAAQ;AAC1B,iBAAS,KAAK,OAAO,MAAM,IAAI,KAAK,MAAM,IAAI,GAAG;AACjD,YAAI,MAAM,aAAa;AACrB,mBAAS,KAAK,MAAM,WAAW;AAAA,QACjC;AACA,iBAAS,KAAK,EAAE;AAAA,MAClB;AAAA,IACF;AAGA,UAAM,YAAY,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,UAAU;AAC7D,UAAM,cAAc,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,YAAY;AACjE,UAAM,QAAQ,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM;AAErD,QAAI,UAAU,SAAS,GAAG;AACxB,eAAS,KAAK,kBAAkB;AAChC,iBAAW,KAAK,UAAU,MAAM,GAAG,CAAC,GAAG;AACrC,iBAAS,KAAK,KAAK,EAAE,IAAI,EAAE;AAAA,MAC7B;AACA,eAAS,KAAK,EAAE;AAAA,IAClB;AAEA,QAAI,YAAY,SAAS,GAAG;AAC1B,eAAS,KAAK,uBAAuB;AACrC,iBAAW,KAAK,YAAY,MAAM,GAAG,CAAC,GAAG;AACvC,iBAAS,KAAK,KAAK,EAAE,IAAI,EAAE;AAAA,MAC7B;AACA,eAAS,KAAK,EAAE;AAAA,IAClB;AAEA,QAAI,MAAM,SAAS,GAAG;AACpB,eAAS,KAAK,oBAAoB;AAClC,iBAAW,KAAK,MAAM,MAAM,GAAG,CAAC,GAAG;AACjC,iBAAS,KAAK,KAAK,EAAE,IAAI,EAAE;AAAA,MAC7B;AACA,eAAS,KAAK,EAAE;AAAA,IAClB;AAGA,QAAI,OAAO,SAAS,GAAG;AACrB,eAAS,KAAK,oBAAoB;AAClC,YAAM,eAAe,KAAK,gBAAgB,MAAM;AAChD,eAAS,KAAK,YAAY;AAC1B,eAAS,KAAK,EAAE;AAAA,IAClB;AAGA,QAAI,SAAS,gBAAgB,SAAS,GAAG;AACvC,eAAS,KAAK,oBAAoB;AAClC,iBAAW,OAAO,SAAS,iBAAiB;AAC1C,cAAM,OACJ,IAAI,SAAS,YAAY,MAAM,IAAI,SAAS,YAAY,MAAM;AAChE,iBAAS,KAAK,GAAG,IAAI,KAAK,IAAI,OAAO,YAAY,CAAC,KAAK,IAAI,MAAM,EAAE;AAAA,MACrE;AAAA,IACF;AAEA,WAAO,SAAS,KAAK,IAAI;AAAA,EAC3B;AAAA,EAEQ,gBAAgB,QAAyB;AAC/C,UAAM,SAAiC,CAAC;AACxC,eAAW,SAAS,QAAQ;AAC1B,aAAO,MAAM,UAAU,KAAK,OAAO,MAAM,UAAU,KAAK,KAAK;AAAA,IAC/D;AAEA,WAAO,OAAO,QAAQ,MAAM,EACzB,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,cAAc,EACxD,KAAK,IAAI;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKO,WAAW,eAAe,OAA0B;AACzD,WAAO,KAAK,iBAAiB,gBAAgB,EAAE,aAAa,CAAC;AAAA,EAC/D;AAAA;AAAA;AAAA;AAAA,EAKO,eAAe,UAA6B;AACjD,SAAK,cAAc;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAKO,aAAmB;AACxB,SAAK,iBAAiB,WAAW;AACjC,SAAK,WAAW,WAAW;AAC3B,SAAK,aAAa,MAAM;AACxB,WAAO,KAAK,sBAAsB;AAAA,MAChC,WAAW,KAAK;AAAA,MAChB,YAAY,KAAK,aAAa,SAAS;AAAA,IACzC,CAAC;AAAA,EACH;AACF;",
   "names": []
 }

package/dist/core/retrieval/retrieval-benchmarks.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../src/core/retrieval/retrieval-benchmarks.ts"],
-  "sourcesContent": ["/**\n * Retrieval Quality Benchmarks at Scale\n * Tests different retrieval strategies to monitor for semantic collapse\n *\n * Key metrics:\n * - Precision: How relevant are retrieved results?\n * - Recall: Are we missing important context?\n * - Semantic Drift: Do embeddings collapse over time?\n * - Query Latency: Performance at scale\n */\n\nimport Database from 'better-sqlite3';\nimport { logger } from '../monitoring/logger.js';\nimport { Trace } from '../trace/types.js';\nimport { LLMContextRetrieval } from './llm-context-retrieval.js';\nimport { HierarchicalRetrieval } from './hierarchical-retrieval.js';\nimport { GraphRetrieval } from './graph-retrieval.js';\nimport { FrameManager } from '../context/frame-manager.js';\n\nexport interface BenchmarkQuery {\n  query: string;\n  expectedTraceIds: string[];\n  expectedTopics: string[];\n  difficulty: 'easy' | 'medium' | 'hard';\n  category: string;\n}\n\nexport interface BenchmarkResult {\n  strategy: 'flat' | 'hierarchical' | 'graph';\n  query: BenchmarkQuery;\n  retrievedTraceIds: string[];\n  precision: number;\n  recall: number;\n  f1Score: number;\n  queryTimeMs: number;\n  tokensUsed: number;\n  semanticDrift?: number;\n  explanation: string;\n}\n\nexport interface BenchmarkReport {\n  timestamp: number;\n  traceCount: number;\n  strategies: {\n    flat: StrategyMetrics;\n    hierarchical: StrategyMetrics;\n    graph: StrategyMetrics;\n  };\n  warnings: string[];\n  recommendations: string[];\n}\n\nexport interface StrategyMetrics {\n  avgPrecision: number;\n  avgRecall: number;\n  avgF1Score: number;\n  avgQueryTime: number;\n  avgTokensUsed: number;\n  semanticCollapse: boolean;\n  collapseIndicators: string[];\n}\n\n/**\n * Benchmark suite for retrieval quality at scale\n */\nexport class RetrievalBenchmarks {\n  private db: Database.Database;\n  private flatRetrieval: LLMContextRetrieval;\n  private hierarchicalRetrieval: HierarchicalRetrieval;\n  private graphRetrieval: GraphRetrieval;\n  private frameManager: FrameManager;\n\n  constructor(\n    db: Database.Database,\n    frameManager: FrameManager,\n    projectId: string\n  ) {\n    this.db = db;\n    this.frameManager = frameManager;\n\n    // Initialize retrieval strategies\n    this.flatRetrieval = new LLMContextRetrieval(db, frameManager, projectId);\n    this.hierarchicalRetrieval = new HierarchicalRetrieval(db);\n    this.graphRetrieval = new GraphRetrieval(db);\n\n    this.initializeSchema();\n  }\n\n  private initializeSchema(): void {\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS benchmark_results (\n        id INTEGER PRIMARY KEY AUTOINCREMENT,\n        timestamp INTEGER DEFAULT (unixepoch() * 1000),\n        strategy TEXT NOT NULL,\n        query TEXT NOT NULL,\n        difficulty TEXT,\n        category TEXT,\n        precision REAL,\n        recall REAL,\n        f1_score REAL,\n        query_time_ms INTEGER,\n        tokens_used INTEGER,\n        semantic_drift REAL,\n        trace_count INTEGER,\n        retrieved_ids TEXT,\n        expected_ids TEXT\n      )\n    `);\n\n    this.db.exec(`\n      CREATE INDEX IF NOT EXISTS idx_benchmark_strategy ON benchmark_results(strategy);\n      CREATE INDEX IF NOT EXISTS idx_benchmark_timestamp ON benchmark_results(timestamp);\n      CREATE INDEX IF NOT EXISTS idx_benchmark_difficulty ON benchmark_results(difficulty);\n    `);\n  }\n\n  /**\n   * Generate benchmark queries based on current data\n   */\n  async generateBenchmarkQueries(traces: Trace[]): Promise<BenchmarkQuery[]> {\n    const queries: BenchmarkQuery[] = [];\n\n    // Easy: Recent specific traces\n    const recentTraces = traces\n      .sort((a, b) => b.metadata.startTime - a.metadata.startTime)\n      .slice(0, 10);\n\n    for (const trace of recentTraces.slice(0, 3)) {\n      queries.push({\n        query: `Show me the ${trace.type} operation from ${new Date(trace.metadata.startTime).toLocaleString()}`,\n        expectedTraceIds: [trace.id],\n        expectedTopics: [trace.type],\n        difficulty: 'easy',\n        category: 'specific_lookup',\n      });\n    }\n\n    // Medium: Topic-based queries\n    const topicGroups = this.groupByTopic(traces);\n\n    for (const [topic, topicTraces] of topicGroups.entries()) {\n      if (topicTraces.length >= 5) {\n        queries.push({\n          query: `What ${topic} operations have been performed recently?`,\n          expectedTraceIds: topicTraces.slice(0, 10).map((t) => t.id),\n          expectedTopics: [topic],\n          difficulty: 'medium',\n          category: 'topic_search',\n        });\n      }\n    }\n\n    // Hard: Cross-topic and temporal queries\n    if (traces.length > 50) {\n      // Find traces with errors\n      const errorTraces = traces.filter(\n        (t) => t.metadata.errorsEncountered.length > 0\n      );\n\n      if (errorTraces.length > 0) {\n        queries.push({\n          query: 'What errors occurred and how were they resolved?',\n          expectedTraceIds: errorTraces.map((t) => t.id),\n          expectedTopics: ['error', 'fix', 'debug'],\n          difficulty: 'hard',\n          category: 'error_analysis',\n        });\n      }\n\n      // Find decision chains\n      const decisionTraces = traces.filter(\n        (t) => t.metadata.decisionsRecorded.length > 0\n      );\n\n      if (decisionTraces.length > 0) {\n        queries.push({\n          query: 'What architectural decisions were made and why?',\n          expectedTraceIds: decisionTraces.map((t) => t.id),\n          expectedTopics: ['decision', 'architecture', 'design'],\n          difficulty: 'hard',\n          category: 'decision_tracking',\n        });\n      }\n    }\n\n    // Adversarial: Test for semantic collapse\n    queries.push({\n      query: 'something about code',\n      expectedTraceIds: [],\n      expectedTopics: [],\n      difficulty: 'hard',\n      category: 'vague_query',\n    });\n\n    queries.push({\n      query: 'the thing we did yesterday with the files',\n      expectedTraceIds: [],\n      expectedTopics: [],\n      difficulty: 'hard',\n      category: 'ambiguous_query',\n    });\n\n    return queries;\n  }\n\n  /**\n   * Run benchmarks on all strategies\n   */\n  async runBenchmarks(\n    traces: Trace[],\n    sampleSize: number = 10\n  ): Promise<BenchmarkReport> {\n    logger.info('Starting retrieval benchmarks', {\n      traceCount: traces.length,\n      sampleSize,\n    });\n\n    const queries = await this.generateBenchmarkQueries(traces);\n    const sampledQueries = this.sampleQueries(queries, sampleSize);\n\n    const results: BenchmarkResult[] = [];\n\n    // Build hierarchical and graph structures\n    await this.hierarchicalRetrieval.buildHierarchy(traces);\n    const frames = await this.frameManager.getAllFrames();\n    await this.graphRetrieval.buildGraph(traces, frames);\n\n    // Test flat retrieval\n    for (const query of sampledQueries) {\n      const result = await this.benchmarkFlatRetrieval(query, traces);\n      results.push(result);\n      await this.saveResult(result, traces.length);\n    }\n\n    // Test hierarchical retrieval\n    for (const query of sampledQueries) {\n      const result = await this.benchmarkHierarchicalRetrieval(query, traces);\n      results.push(result);\n      await this.saveResult(result, traces.length);\n    }\n\n    // Test graph retrieval\n    for (const query of sampledQueries) {\n      const result = await this.benchmarkGraphRetrieval(query, traces);\n      results.push(result);\n      await this.saveResult(result, traces.length);\n    }\n\n    // Generate report\n    const report = this.generateReport(results, traces.length);\n\n    logger.info('Benchmarks complete', {\n      strategies: 3,\n      queries: sampledQueries.length,\n      avgF1: {\n        flat: report.strategies.flat.avgF1Score,\n        hierarchical: report.strategies.hierarchical.avgF1Score,\n        graph: report.strategies.graph.avgF1Score,\n      },\n    });\n\n    return report;\n  }\n\n  /**\n   * Benchmark flat embedding retrieval\n   */\n  private async benchmarkFlatRetrieval(\n    query: BenchmarkQuery,\n    traces: Trace[]\n  ): Promise<BenchmarkResult> {\n    const startTime = Date.now();\n\n    try {\n      const result = await this.flatRetrieval.retrieveContext(query.query, {\n        tokenBudget: 4000,\n      });\n\n      const retrievedIds = result.frames.map((f) => f.id);\n      const queryTime = Date.now() - startTime;\n\n      return this.evaluateResult(\n        'flat',\n        query,\n        retrievedIds,\n        queryTime,\n        result.tokenUsage.used,\n        'Standard flat embedding retrieval'\n      );\n    } catch (error) {\n      logger.error('Flat retrieval failed', error);\n      return this.createErrorResult('flat', query, error as Error);\n    }\n  }\n\n  /**\n   * Benchmark hierarchical retrieval\n   */\n  private async benchmarkHierarchicalRetrieval(\n    query: BenchmarkQuery,\n    traces: Trace[]\n  ): Promise<BenchmarkResult> {\n    const startTime = Date.now();\n\n    try {\n      const context = await this.hierarchicalRetrieval.retrieve(\n        query.query,\n        4,\n        4000\n      );\n\n      const queryTime = Date.now() - startTime;\n\n      // Extract trace IDs from context (simplified)\n      const retrievedIds = this.extractTraceIds(context);\n\n      return this.evaluateResult(\n        'hierarchical',\n        query,\n        retrievedIds,\n        queryTime,\n        context.length / 4, // Estimate tokens\n        'Hierarchical retrieval with progressive summarization'\n      );\n    } catch (error) {\n      logger.error('Hierarchical retrieval failed', error);\n      return this.createErrorResult('hierarchical', query, error as Error);\n    }\n  }\n\n  /**\n   * Benchmark graph retrieval\n   */\n  private async benchmarkGraphRetrieval(\n    query: BenchmarkQuery,\n    traces: Trace[]\n  ): Promise<BenchmarkResult> {\n    const startTime = Date.now();\n\n    try {\n      const paths = await this.graphRetrieval.traverse(query.query, {\n        maxHops: 3,\n        minWeight: 0.3,\n      });\n\n      const queryTime = Date.now() - startTime;\n\n      // Extract trace IDs from paths\n      const retrievedIds = new Set<string>();\n      for (const path of paths) {\n        for (const node of path.nodes) {\n          if (node.metadata.traceIds) {\n            node.metadata.traceIds.forEach((id) => retrievedIds.add(id));\n          }\n        }\n      }\n\n      return this.evaluateResult(\n        'graph',\n        query,\n        Array.from(retrievedIds),\n        queryTime,\n        paths.length * 100, // Estimate tokens\n        'Graph-based retrieval with explicit relationships'\n      );\n    } catch (error) {\n      logger.error('Graph retrieval failed', error);\n      return this.createErrorResult('graph', query, error as Error);\n    }\n  }\n\n  /**\n   * Evaluate retrieval results\n   */\n  private evaluateResult(\n    strategy: 'flat' | 'hierarchical' | 'graph',\n    query: BenchmarkQuery,\n    retrievedIds: string[],\n    queryTimeMs: number,\n    tokensUsed: number,\n    explanation: string\n  ): BenchmarkResult {\n    const expectedSet = new Set(query.expectedTraceIds);\n    const retrievedSet = new Set(retrievedIds);\n\n    // Calculate metrics\n    const truePositives = [...retrievedSet].filter((id) =>\n      expectedSet.has(id)\n    ).length;\n    const falsePositives = retrievedSet.size - truePositives;\n    const falseNegatives = expectedSet.size - truePositives;\n\n    const precision =\n      retrievedSet.size > 0 ? truePositives / retrievedSet.size : 0;\n    const recall = expectedSet.size > 0 ? truePositives / expectedSet.size : 1;\n    const f1Score =\n      precision + recall > 0\n        ? (2 * (precision * recall)) / (precision + recall)\n        : 0;\n\n    // Check for semantic drift (simplified)\n    const semanticDrift = this.calculateSemanticDrift(query, retrievedIds);\n\n    return {\n      strategy,\n      query,\n      retrievedTraceIds: retrievedIds,\n      precision,\n      recall,\n      f1Score,\n      queryTimeMs,\n      tokensUsed,\n      semanticDrift,\n      explanation,\n    };\n  }\n\n  /**\n   * Calculate semantic drift indicator\n   */\n  private calculateSemanticDrift(\n    query: BenchmarkQuery,\n    retrievedIds: string[]\n  ): number {\n    // If vague query returns too many results, indicates collapse\n    if (query.category === 'vague_query' && retrievedIds.length > 10) {\n      return 0.8; // High drift\n    }\n\n    // If specific query returns nothing, indicates problem\n    if (query.category === 'specific_lookup' && retrievedIds.length === 0) {\n      return 0.7;\n    }\n\n    return 0.1; // Normal\n  }\n\n  /**\n   * Create error result\n   */\n  private createErrorResult(\n    strategy: 'flat' | 'hierarchical' | 'graph',\n    query: BenchmarkQuery,\n    error: Error\n  ): BenchmarkResult {\n    return {\n      strategy,\n      query,\n      retrievedTraceIds: [],\n      precision: 0,\n      recall: 0,\n      f1Score: 0,\n      queryTimeMs: 0,\n      tokensUsed: 0,\n      semanticDrift: 1.0,\n      explanation: `Error: ${error.message}`,\n    };\n  }\n\n  /**\n   * Generate benchmark report\n   */\n  private generateReport(\n    results: BenchmarkResult[],\n    traceCount: number\n  ): BenchmarkReport {\n    const byStrategy = this.groupByStrategy(results);\n\n    const report: BenchmarkReport = {\n      timestamp: Date.now(),\n      traceCount,\n      strategies: {\n        flat: this.calculateStrategyMetrics(byStrategy.flat || []),\n        hierarchical: this.calculateStrategyMetrics(\n          byStrategy.hierarchical || []\n        ),\n        graph: this.calculateStrategyMetrics(byStrategy.graph || []),\n      },\n      warnings: [],\n      recommendations: [],\n    };\n\n    // Generate warnings\n    if (report.strategies.flat.semanticCollapse) {\n      report.warnings.push('Flat embedding shows signs of semantic collapse');\n    }\n\n    if (report.strategies.flat.avgQueryTime > 1000) {\n      report.warnings.push('Flat retrieval query time exceeds 1 second');\n    }\n\n    // Generate recommendations\n    const bestStrategy = this.getBestStrategy(report.strategies);\n    report.recommendations.push(`Best overall strategy: ${bestStrategy}`);\n\n    if (traceCount > 10000) {\n      report.recommendations.push('Consider hierarchical retrieval for scale');\n    }\n\n    if (\n      report.strategies.graph.avgF1Score >\n      report.strategies.flat.avgF1Score * 1.2\n    ) {\n      report.recommendations.push(\n        'Graph retrieval significantly outperforms flat - consider switching'\n      );\n    }\n\n    return report;\n  }\n\n  /**\n   * Calculate strategy metrics\n   */\n  private calculateStrategyMetrics(\n    results: BenchmarkResult[]\n  ): StrategyMetrics {\n    if (results.length === 0) {\n      return {\n        avgPrecision: 0,\n        avgRecall: 0,\n        avgF1Score: 0,\n        avgQueryTime: 0,\n        avgTokensUsed: 0,\n        semanticCollapse: false,\n        collapseIndicators: [],\n      };\n    }\n\n    const avgPrecision =\n      results.reduce((sum, r) => sum + r.precision, 0) / results.length;\n    const avgRecall =\n      results.reduce((sum, r) => sum + r.recall, 0) / results.length;\n    const avgF1Score =\n      results.reduce((sum, r) => sum + r.f1Score, 0) / results.length;\n    const avgQueryTime =\n      results.reduce((sum, r) => sum + r.queryTimeMs, 0) / results.length;\n    const avgTokensUsed =\n      results.reduce((sum, r) => sum + r.tokensUsed, 0) / results.length;\n\n    // Check for semantic collapse\n    const collapseIndicators: string[] = [];\n    const avgDrift =\n      results.reduce((sum, r) => sum + (r.semanticDrift || 0), 0) /\n      results.length;\n\n    if (avgDrift > 0.5) {\n      collapseIndicators.push('High semantic drift detected');\n    }\n\n    // Check for uniform results (everything returns same thing)\n    const uniqueResults = new Set(\n      results.map((r) => r.retrievedTraceIds.sort().join(','))\n    );\n    if (uniqueResults.size < results.length * 0.3) {\n      collapseIndicators.push(\n        'Low result diversity - possible embedding collapse'\n      );\n    }\n\n    // Check for poor precision on specific queries\n    const specificQueries = results.filter(\n      (r) => r.query.difficulty === 'easy'\n    );\n    const specificPrecision =\n      specificQueries.reduce((sum, r) => sum + r.precision, 0) /\n      (specificQueries.length || 1);\n    if (specificPrecision < 0.5) {\n      collapseIndicators.push('Poor precision on specific queries');\n    }\n\n    return {\n      avgPrecision,\n      avgRecall,\n      avgF1Score,\n      avgQueryTime,\n      avgTokensUsed,\n      semanticCollapse: collapseIndicators.length > 0,\n      collapseIndicators,\n    };\n  }\n\n  /**\n   * Determine best strategy\n   */\n  private getBestStrategy(strategies: BenchmarkReport['strategies']): string {\n    const scores = {\n      flat:\n        strategies.flat.avgF1Score * (1 - strategies.flat.avgQueryTime / 5000),\n      hierarchical:\n        strategies.hierarchical.avgF1Score *\n        (1 - strategies.hierarchical.avgQueryTime / 5000),\n      graph:\n        strategies.graph.avgF1Score *\n        (1 - strategies.graph.avgQueryTime / 5000),\n    };\n\n    return Object.entries(scores).sort((a, b) => b[1] - a[1])[0][0];\n  }\n\n  /**\n   * Group traces by topic\n   */\n  private groupByTopic(traces: Trace[]): Map<string, Trace[]> {\n    const groups = new Map<string, Trace[]>();\n\n    for (const trace of traces) {\n      if (!groups.has(trace.type)) {\n        groups.set(trace.type, []);\n      }\n      groups.get(trace.type)!.push(trace);\n    }\n\n    return groups;\n  }\n\n  /**\n   * Group results by strategy\n   */\n  private groupByStrategy(\n    results: BenchmarkResult[]\n  ): Record<string, BenchmarkResult[]> {\n    const grouped: Record<string, BenchmarkResult[]> = {};\n\n    for (const result of results) {\n      if (!grouped[result.strategy]) {\n        grouped[result.strategy] = [];\n      }\n      grouped[result.strategy].push(result);\n    }\n\n    return grouped;\n  }\n\n  /**\n   * Sample queries for benchmarking\n   */\n  private sampleQueries(\n    queries: BenchmarkQuery[],\n    sampleSize: number\n  ): BenchmarkQuery[] {\n    // Ensure we get a mix of difficulties\n    const byDifficulty = this.groupByDifficulty(queries);\n    const sampled: BenchmarkQuery[] = [];\n\n    const perDifficulty = Math.ceil(sampleSize / 3);\n\n    for (const difficulty of ['easy', 'medium', 'hard'] as const) {\n      const difficultyQueries = byDifficulty[difficulty] || [];\n      const sample = this.randomSample(difficultyQueries, perDifficulty);\n      sampled.push(...sample);\n    }\n\n    return sampled.slice(0, sampleSize);\n  }\n\n  /**\n   * Group queries by difficulty\n   */\n  private groupByDifficulty(\n    queries: BenchmarkQuery[]\n  ): Record<string, BenchmarkQuery[]> {\n    const grouped: Record<string, BenchmarkQuery[]> = {};\n\n    for (const query of queries) {\n      if (!grouped[query.difficulty]) {\n        grouped[query.difficulty] = [];\n      }\n      grouped[query.difficulty].push(query);\n    }\n\n    return grouped;\n  }\n\n  /**\n   * Random sample from array\n   */\n  private randomSample<T>(array: T[], size: number): T[] {\n    const shuffled = [...array].sort(() => Math.random() - 0.5);\n    return shuffled.slice(0, size);\n  }\n\n  /**\n   * Extract trace IDs from context string\n   */\n  private extractTraceIds(context: string): string[] {\n    // Simple pattern matching for trace IDs\n    const matches = context.match(/trace_[a-f0-9]{16}/g) || [];\n    return [...new Set(matches)];\n  }\n\n  /**\n   * Save benchmark result to database\n   */\n  private async saveResult(\n    result: BenchmarkResult,\n    traceCount: number\n  ): Promise<void> {\n    this.db\n      .prepare(\n        `\n      INSERT INTO benchmark_results (\n        strategy, query, difficulty, category,\n        precision, recall, f1_score,\n        query_time_ms, tokens_used, semantic_drift,\n        trace_count, retrieved_ids, expected_ids\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `\n      )\n      .run(\n        result.strategy,\n        result.query.query,\n        result.query.difficulty,\n        result.query.category,\n        result.precision,\n        result.recall,\n        result.f1Score,\n        result.queryTimeMs,\n        result.tokensUsed,\n        result.semanticDrift || 0,\n        traceCount,\n        JSON.stringify(result.retrievedTraceIds),\n        JSON.stringify(result.query.expectedTraceIds)\n      );\n  }\n\n  /**\n   * Get historical benchmark trends\n   */\n  getHistoricalTrends(days: number = 7): any {\n    const cutoff = Date.now() - days * 24 * 60 * 60 * 1000;\n\n    const trends = this.db\n      .prepare(\n        `\n      SELECT \n        strategy,\n        DATE(timestamp / 1000, 'unixepoch') as date,\n        AVG(precision) as avg_precision,\n        AVG(recall) as avg_recall,\n        AVG(f1_score) as avg_f1,\n        AVG(query_time_ms) as avg_query_time,\n        AVG(semantic_drift) as avg_drift,\n        COUNT(*) as query_count\n      FROM benchmark_results\n      WHERE timestamp > ?\n      GROUP BY strategy, date\n      ORDER BY date, strategy\n    `\n      )\n      .all(cutoff);\n\n    return trends;\n  }\n}\n"],
-  "mappings": "AAYA,SAAS,cAAc;AAEvB,SAAS,2BAA2B;AACpC,SAAS,6BAA6B;AACtC,SAAS,sBAAsB;AAiDxB,MAAM,oBAAoB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAER,YACE,IACA,cACA,WACA;AACA,SAAK,KAAK;AACV,SAAK,eAAe;AAGpB,SAAK,gBAAgB,IAAI,oBAAoB,IAAI,cAAc,SAAS;AACxE,SAAK,wBAAwB,IAAI,sBAAsB,EAAE;AACzD,SAAK,iBAAiB,IAAI,eAAe,EAAE;AAE3C,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEQ,mBAAyB;AAC/B,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAkBZ;AAED,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA,KAIZ;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,yBAAyB,QAA4C;AACzE,UAAM,UAA4B,CAAC;AAGnC,UAAM,eAAe,OAClB,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS,EAC1D,MAAM,GAAG,EAAE;AAEd,eAAW,SAAS,aAAa,MAAM,GAAG,CAAC,GAAG;AAC5C,cAAQ,KAAK;AAAA,QACX,OAAO,eAAe,MAAM,IAAI,mBAAmB,IAAI,KAAK,MAAM,SAAS,SAAS,EAAE,eAAe,CAAC;AAAA,QACtG,kBAAkB,CAAC,MAAM,EAAE;AAAA,QAC3B,gBAAgB,CAAC,MAAM,IAAI;AAAA,QAC3B,YAAY;AAAA,QACZ,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAGA,UAAM,cAAc,KAAK,aAAa,MAAM;AAE5C,eAAW,CAAC,OAAO,WAAW,KAAK,YAAY,QAAQ,GAAG;AACxD,UAAI,YAAY,UAAU,GAAG;AAC3B,gBAAQ,KAAK;AAAA,UACX,OAAO,QAAQ,KAAK;AAAA,UACpB,kBAAkB,YAAY,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,UAC1D,gBAAgB,CAAC,KAAK;AAAA,UACtB,YAAY;AAAA,UACZ,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAGA,QAAI,OAAO,SAAS,IAAI;AAEtB,YAAM,cAAc,OAAO;AAAA,QACzB,CAAC,MAAM,EAAE,SAAS,kBAAkB,SAAS;AAAA,MAC/C;AAEA,UAAI,YAAY,SAAS,GAAG;AAC1B,gBAAQ,KAAK;AAAA,UACX,OAAO;AAAA,UACP,kBAAkB,YAAY,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,UAC7C,gBAAgB,CAAC,SAAS,OAAO,OAAO;AAAA,UACxC,YAAY;AAAA,UACZ,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAGA,YAAM,iBAAiB,OAAO;AAAA,QAC5B,CAAC,MAAM,EAAE,SAAS,kBAAkB,SAAS;AAAA,MAC/C;AAEA,UAAI,eAAe,SAAS,GAAG;AAC7B,gBAAQ,KAAK;AAAA,UACX,OAAO;AAAA,UACP,kBAAkB,eAAe,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,UAChD,gBAAgB,CAAC,YAAY,gBAAgB,QAAQ;AAAA,UACrD,YAAY;AAAA,UACZ,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAGA,YAAQ,KAAK;AAAA,MACX,OAAO;AAAA,MACP,kBAAkB,CAAC;AAAA,MACnB,gBAAgB,CAAC;AAAA,MACjB,YAAY;AAAA,MACZ,UAAU;AAAA,IACZ,CAAC;AAED,YAAQ,KAAK;AAAA,MACX,OAAO;AAAA,MACP,kBAAkB,CAAC;AAAA,MACnB,gBAAgB,CAAC;AAAA,MACjB,YAAY;AAAA,MACZ,UAAU;AAAA,IACZ,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cACJ,QACA,aAAqB,IACK;AAC1B,WAAO,KAAK,iCAAiC;AAAA,MAC3C,YAAY,OAAO;AAAA,MACnB;AAAA,IACF,CAAC;AAED,UAAM,UAAU,MAAM,KAAK,yBAAyB,MAAM;AAC1D,UAAM,iBAAiB,KAAK,cAAc,SAAS,UAAU;AAE7D,UAAM,UAA6B,CAAC;AAGpC,UAAM,KAAK,sBAAsB,eAAe,MAAM;AACtD,UAAM,SAAS,MAAM,KAAK,aAAa,aAAa;AACpD,UAAM,KAAK,eAAe,WAAW,QAAQ,MAAM;AAGnD,eAAW,SAAS,gBAAgB;AAClC,YAAM,SAAS,MAAM,KAAK,uBAAuB,OAAO,MAAM;AAC9D,cAAQ,KAAK,MAAM;AACnB,YAAM,KAAK,WAAW,QAAQ,OAAO,MAAM;AAAA,IAC7C;AAGA,eAAW,SAAS,gBAAgB;AAClC,YAAM,SAAS,MAAM,KAAK,+BAA+B,OAAO,MAAM;AACtE,cAAQ,KAAK,MAAM;AACnB,YAAM,KAAK,WAAW,QAAQ,OAAO,MAAM;AAAA,IAC7C;AAGA,eAAW,SAAS,gBAAgB;AAClC,YAAM,SAAS,MAAM,KAAK,wBAAwB,OAAO,MAAM;AAC/D,cAAQ,KAAK,MAAM;AACnB,YAAM,KAAK,WAAW,QAAQ,OAAO,MAAM;AAAA,IAC7C;AAGA,UAAM,SAAS,KAAK,eAAe,SAAS,OAAO,MAAM;AAEzD,WAAO,KAAK,uBAAuB;AAAA,MACjC,YAAY;AAAA,MACZ,SAAS,eAAe;AAAA,MACxB,OAAO;AAAA,QACL,MAAM,OAAO,WAAW,KAAK;AAAA,QAC7B,cAAc,OAAO,WAAW,aAAa;AAAA,QAC7C,OAAO,OAAO,WAAW,MAAM;AAAA,MACjC;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,uBACZ,OACA,QAC0B;AAC1B,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI;AACF,YAAM,SAAS,MAAM,KAAK,cAAc,gBAAgB,MAAM,OAAO;AAAA,QACnE,aAAa;AAAA,MACf,CAAC;AAED,YAAM,eAAe,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE;AAClD,YAAM,YAAY,KAAK,IAAI,IAAI;AAE/B,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO,WAAW;AAAA,QAClB;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO,MAAM,yBAAyB,KAAK;AAC3C,aAAO,KAAK,kBAAkB,QAAQ,OAAO,KAAc;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,+BACZ,OACA,QAC0B;AAC1B,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,sBAAsB;AAAA,QAC/C,MAAM;AAAA,QACN;AAAA,QACA;AAAA,MACF;AAEA,YAAM,YAAY,KAAK,IAAI,IAAI;AAG/B,YAAM,eAAe,KAAK,gBAAgB,OAAO;AAEjD,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ,SAAS;AAAA;AAAA,QACjB;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO,MAAM,iCAAiC,KAAK;AACnD,aAAO,KAAK,kBAAkB,gBAAgB,OAAO,KAAc;AAAA,IACrE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,wBACZ,OACA,QAC0B;AAC1B,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI;AACF,YAAM,QAAQ,MAAM,KAAK,eAAe,SAAS,MAAM,OAAO;AAAA,QAC5D,SAAS;AAAA,QACT,WAAW;AAAA,MACb,CAAC;AAED,YAAM,YAAY,KAAK,IAAI,IAAI;AAG/B,YAAM,eAAe,oBAAI,IAAY;AACrC,iBAAW,QAAQ,OAAO;AACxB,mBAAW,QAAQ,KAAK,OAAO;AAC7B,cAAI,KAAK,SAAS,UAAU;AAC1B,iBAAK,SAAS,SAAS,QAAQ,CAAC,OAAO,aAAa,IAAI,EAAE,CAAC;AAAA,UAC7D;AAAA,QACF;AAAA,MACF;AAEA,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA,MAAM,KAAK,YAAY;AAAA,QACvB;AAAA,QACA,MAAM,SAAS;AAAA;AAAA,QACf;AAAA,MACF;AAAA,IACF,SAAS,OAAO;AACd,aAAO,MAAM,0BAA0B,KAAK;AAC5C,aAAO,KAAK,kBAAkB,SAAS,OAAO,KAAc;AAAA,IAC9D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,eACN,UACA,OACA,cACA,aACA,YACA,aACiB;AACjB,UAAM,cAAc,IAAI,IAAI,MAAM,gBAAgB;AAClD,UAAM,eAAe,IAAI,IAAI,YAAY;AAGzC,UAAM,gBAAgB,CAAC,GAAG,YAAY,EAAE;AAAA,MAAO,CAAC,OAC9C,YAAY,IAAI,EAAE;AAAA,IACpB,EAAE;AACF,UAAM,iBAAiB,aAAa,OAAO;AAC3C,UAAM,iBAAiB,YAAY,OAAO;AAE1C,UAAM,YACJ,aAAa,OAAO,IAAI,gBAAgB,aAAa,OAAO;AAC9D,UAAM,SAAS,YAAY,OAAO,IAAI,gBAAgB,YAAY,OAAO;AACzE,UAAM,UACJ,YAAY,SAAS,IAChB,KAAK,YAAY,WAAY,YAAY,UAC1C;AAGN,UAAM,gBAAgB,KAAK,uBAAuB,OAAO,YAAY;AAErE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,mBAAmB;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,uBACN,OACA,cACQ;AAER,QAAI,MAAM,aAAa,iBAAiB,aAAa,SAAS,IAAI;AAChE,aAAO;AAAA,IACT;AAGA,QAAI,MAAM,aAAa,qBAAqB,aAAa,WAAW,GAAG;AACrE,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,kBACN,UACA,OACA,OACiB;AACjB,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,mBAAmB,CAAC;AAAA,MACpB,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,eAAe;AAAA,MACf,aAAa,UAAU,MAAM,OAAO;AAAA,IACtC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,eACN,SACA,YACiB;AACjB,UAAM,aAAa,KAAK,gBAAgB,OAAO;AAE/C,UAAM,SAA0B;AAAA,MAC9B,WAAW,KAAK,IAAI;AAAA,MACpB;AAAA,MACA,YAAY;AAAA,QACV,MAAM,KAAK,yBAAyB,WAAW,QAAQ,CAAC,CAAC;AAAA,QACzD,cAAc,KAAK;AAAA,UACjB,WAAW,gBAAgB,CAAC;AAAA,QAC9B;AAAA,QACA,OAAO,KAAK,yBAAyB,WAAW,SAAS,CAAC,CAAC;AAAA,MAC7D;AAAA,MACA,UAAU,CAAC;AAAA,MACX,iBAAiB,CAAC;AAAA,IACpB;AAGA,QAAI,OAAO,WAAW,KAAK,kBAAkB;AAC3C,aAAO,SAAS,KAAK,iDAAiD;AAAA,IACxE;AAEA,QAAI,OAAO,WAAW,KAAK,eAAe,KAAM;AAC9C,aAAO,SAAS,KAAK,4CAA4C;AAAA,IACnE;AAGA,UAAM,eAAe,KAAK,gBAAgB,OAAO,UAAU;AAC3D,WAAO,gBAAgB,KAAK,0BAA0B,YAAY,EAAE;AAEpE,QAAI,aAAa,KAAO;AACtB,aAAO,gBAAgB,KAAK,2CAA2C;AAAA,IACzE;AAEA,QACE,OAAO,WAAW,MAAM,aACxB,OAAO,WAAW,KAAK,aAAa,KACpC;AACA,aAAO,gBAAgB;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,yBACN,SACiB;AACjB,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,cAAc;AAAA,QACd,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,cAAc;AAAA,QACd,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,oBAAoB,CAAC;AAAA,MACvB;AAAA,IACF;AAEA,UAAM,eACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC,IAAI,QAAQ;AAC7D,UAAM,YACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC,IAAI,QAAQ;AAC1D,UAAM,aACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,SAAS,CAAC,IAAI,QAAQ;AAC3D,UAAM,eACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,aAAa,CAAC,IAAI,QAAQ;AAC/D,UAAM,gBACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,YAAY,CAAC,IAAI,QAAQ;AAG9D,UAAM,qBAA+B,CAAC;AACtC,UAAM,WACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,iBAAiB,IAAI,CAAC,IAC1D,QAAQ;AAEV,QAAI,WAAW,KAAK;AAClB,yBAAmB,KAAK,8BAA8B;AAAA,IACxD;AAGA,UAAM,gBAAgB,IAAI;AAAA,MACxB,QAAQ,IAAI,CAAC,MAAM,EAAE,kBAAkB,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,IACzD;AACA,QAAI,cAAc,OAAO,QAAQ,SAAS,KAAK;AAC7C,yBAAmB;AAAA,QACjB;AAAA,MACF;AAAA,IACF;AAGA,UAAM,kBAAkB,QAAQ;AAAA,MAC9B,CAAC,MAAM,EAAE,MAAM,eAAe;AAAA,IAChC;AACA,UAAM,oBACJ,gBAAgB,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC,KACtD,gBAAgB,UAAU;AAC7B,QAAI,oBAAoB,KAAK;AAC3B,yBAAmB,KAAK,oCAAoC;AAAA,IAC9D;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,kBAAkB,mBAAmB,SAAS;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,YAAmD;AACzE,UAAM,SAAS;AAAA,MACb,MACE,WAAW,KAAK,cAAc,IAAI,WAAW,KAAK,eAAe;AAAA,MACnE,cACE,WAAW,aAAa,cACvB,IAAI,WAAW,aAAa,eAAe;AAAA,MAC9C,OACE,WAAW,MAAM,cAChB,IAAI,WAAW,MAAM,eAAe;AAAA,IACzC;AAEA,WAAO,OAAO,QAAQ,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,QAAuC;AAC1D,UAAM,SAAS,oBAAI,IAAqB;AAExC,eAAW,SAAS,QAAQ;AAC1B,UAAI,CAAC,OAAO,IAAI,MAAM,IAAI,GAAG;AAC3B,eAAO,IAAI,MAAM,MAAM,CAAC,CAAC;AAAA,MAC3B;AACA,aAAO,IAAI,MAAM,IAAI,EAAG,KAAK,KAAK;AAAA,IACpC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,SACmC;AACnC,UAAM,UAA6C,CAAC;AAEpD,eAAW,UAAU,SAAS;AAC5B,UAAI,CAAC,QAAQ,OAAO,QAAQ,GAAG;AAC7B,gBAAQ,OAAO,QAAQ,IAAI,CAAC;AAAA,MAC9B;AACA,cAAQ,OAAO,QAAQ,EAAE,KAAK,MAAM;AAAA,IACtC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,SACA,YACkB;AAElB,UAAM,eAAe,KAAK,kBAAkB,OAAO;AACnD,UAAM,UAA4B,CAAC;AAEnC,UAAM,gBAAgB,KAAK,KAAK,aAAa,CAAC;AAE9C,eAAW,cAAc,CAAC,QAAQ,UAAU,MAAM,GAAY;AAC5D,YAAM,oBAAoB,aAAa,UAAU,KAAK,CAAC;AACvD,YAAM,SAAS,KAAK,aAAa,mBAAmB,aAAa;AACjE,cAAQ,KAAK,GAAG,MAAM;AAAA,IACxB;AAEA,WAAO,QAAQ,MAAM,GAAG,UAAU;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA,EAKQ,kBACN,SACkC;AAClC,UAAM,UAA4C,CAAC;AAEnD,eAAW,SAAS,SAAS;AAC3B,UAAI,CAAC,QAAQ,MAAM,UAAU,GAAG;AAC9B,gBAAQ,MAAM,UAAU,IAAI,CAAC;AAAA,MAC/B;AACA,cAAQ,MAAM,UAAU,EAAE,KAAK,KAAK;AAAA,IACtC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAgB,OAAY,MAAmB;AACrD,UAAM,WAAW,CAAC,GAAG,KAAK,EAAE,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AAC1D,WAAO,SAAS,MAAM,GAAG,IAAI;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,SAA2B;AAEjD,UAAM,UAAU,QAAQ,MAAM,qBAAqB,KAAK,CAAC;AACzD,WAAO,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WACZ,QACA,YACe;AACf,SAAK,GACF;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQF,EACC;AAAA,MACC,OAAO;AAAA,MACP,OAAO,MAAM;AAAA,MACb,OAAO,MAAM;AAAA,MACb,OAAO,MAAM;AAAA,MACb,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO,iBAAiB;AAAA,MACxB;AAAA,MACA,KAAK,UAAU,OAAO,iBAAiB;AAAA,MACvC,KAAK,UAAU,OAAO,MAAM,gBAAgB;AAAA,IAC9C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB,OAAe,GAAQ;AACzC,UAAM,SAAS,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,KAAK;AAElD,UAAM,SAAS,KAAK,GACjB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeF,EACC,IAAI,MAAM;AAEb,WAAO;AAAA,EACT;AACF;",
+  "sourcesContent": ["/**\n * Retrieval Quality Benchmarks at Scale\n * Tests different retrieval strategies to monitor for semantic collapse\n *\n * Key metrics:\n * - Precision: How relevant are retrieved results?\n * - Recall: Are we missing important context?\n * - Semantic Drift: Do embeddings collapse over time?\n * - Query Latency: Performance at scale\n */\n\nimport Database from 'better-sqlite3';\nimport { logger } from '../monitoring/logger.js';\nimport { Trace } from '../trace/types.js';\nimport { LLMContextRetrieval } from './llm-context-retrieval.js';\nimport { HierarchicalRetrieval } from './hierarchical-retrieval.js';\nimport { GraphRetrieval } from './graph-retrieval.js';\nimport { FrameManager } from '../context/frame-manager.js';\n\nexport interface BenchmarkQuery {\n  query: string;\n  expectedTraceIds: string[];\n  expectedTopics: string[];\n  difficulty: 'easy' | 'medium' | 'hard';\n  category: string;\n}\n\nexport interface BenchmarkResult {\n  strategy: 'flat' | 'hierarchical' | 'graph';\n  query: BenchmarkQuery;\n  retrievedTraceIds: string[];\n  precision: number;\n  recall: number;\n  f1Score: number;\n  queryTimeMs: number;\n  tokensUsed: number;\n  semanticDrift?: number;\n  explanation: string;\n}\n\nexport interface BenchmarkReport {\n  timestamp: number;\n  traceCount: number;\n  strategies: {\n    flat: StrategyMetrics;\n    hierarchical: StrategyMetrics;\n    graph: StrategyMetrics;\n  };\n  warnings: string[];\n  recommendations: string[];\n}\n\nexport interface StrategyMetrics {\n  avgPrecision: number;\n  avgRecall: number;\n  avgF1Score: number;\n  avgQueryTime: number;\n  avgTokensUsed: number;\n  semanticCollapse: boolean;\n  collapseIndicators: string[];\n}\n\n/**\n * Benchmark suite for retrieval quality at scale\n */\nexport class RetrievalBenchmarks {\n  private db: Database.Database;\n  private flatRetrieval: LLMContextRetrieval;\n  private hierarchicalRetrieval: HierarchicalRetrieval;\n  private graphRetrieval: GraphRetrieval;\n  private frameManager: FrameManager;\n\n  constructor(\n    db: Database.Database,\n    frameManager: FrameManager,\n    projectId: string\n  ) {\n    this.db = db;\n    this.frameManager = frameManager;\n\n    // Initialize retrieval strategies\n    this.flatRetrieval = new LLMContextRetrieval(db, frameManager, projectId);\n    this.hierarchicalRetrieval = new HierarchicalRetrieval(db);\n    this.graphRetrieval = new GraphRetrieval(db);\n\n    this.initializeSchema();\n  }\n\n  private initializeSchema(): void {\n    this.db.exec(`\n      CREATE TABLE IF NOT EXISTS benchmark_results (\n        id INTEGER PRIMARY KEY AUTOINCREMENT,\n        timestamp INTEGER DEFAULT (unixepoch() * 1000),\n        strategy TEXT NOT NULL,\n        query TEXT NOT NULL,\n        difficulty TEXT,\n        category TEXT,\n        precision REAL,\n        recall REAL,\n        f1_score REAL,\n        query_time_ms INTEGER,\n        tokens_used INTEGER,\n        semantic_drift REAL,\n        trace_count INTEGER,\n        retrieved_ids TEXT,\n        expected_ids TEXT\n      )\n    `);\n\n    this.db.exec(`\n      CREATE INDEX IF NOT EXISTS idx_benchmark_strategy ON benchmark_results(strategy);\n      CREATE INDEX IF NOT EXISTS idx_benchmark_timestamp ON benchmark_results(timestamp);\n      CREATE INDEX IF NOT EXISTS idx_benchmark_difficulty ON benchmark_results(difficulty);\n    `);\n  }\n\n  /**\n   * Generate benchmark queries based on current data\n   */\n  async generateBenchmarkQueries(traces: Trace[]): Promise<BenchmarkQuery[]> {\n    const queries: BenchmarkQuery[] = [];\n\n    // Easy: Recent specific traces\n    const recentTraces = traces\n      .sort((a, b) => b.metadata.startTime - a.metadata.startTime)\n      .slice(0, 10);\n\n    for (const trace of recentTraces.slice(0, 3)) {\n      queries.push({\n        query: `Show me the ${trace.type} operation from ${new Date(trace.metadata.startTime).toLocaleString()}`,\n        expectedTraceIds: [trace.id],\n        expectedTopics: [trace.type],\n        difficulty: 'easy',\n        category: 'specific_lookup',\n      });\n    }\n\n    // Medium: Topic-based queries\n    const topicGroups = this.groupByTopic(traces);\n\n    for (const [topic, topicTraces] of topicGroups.entries()) {\n      if (topicTraces.length >= 5) {\n        queries.push({\n          query: `What ${topic} operations have been performed recently?`,\n          expectedTraceIds: topicTraces.slice(0, 10).map((t) => t.id),\n          expectedTopics: [topic],\n          difficulty: 'medium',\n          category: 'topic_search',\n        });\n      }\n    }\n\n    // Hard: Cross-topic and temporal queries\n    if (traces.length > 50) {\n      // Find traces with errors\n      const errorTraces = traces.filter(\n        (t) => t.metadata.errorsEncountered.length > 0\n      );\n\n      if (errorTraces.length > 0) {\n        queries.push({\n          query: 'What errors occurred and how were they resolved?',\n          expectedTraceIds: errorTraces.map((t) => t.id),\n          expectedTopics: ['error', 'fix', 'debug'],\n          difficulty: 'hard',\n          category: 'error_analysis',\n        });\n      }\n\n      // Find decision chains\n      const decisionTraces = traces.filter(\n        (t) => t.metadata.decisionsRecorded.length > 0\n      );\n\n      if (decisionTraces.length > 0) {\n        queries.push({\n          query: 'What architectural decisions were made and why?',\n          expectedTraceIds: decisionTraces.map((t) => t.id),\n          expectedTopics: ['decision', 'architecture', 'design'],\n          difficulty: 'hard',\n          category: 'decision_tracking',\n        });\n      }\n    }\n\n    // Adversarial: Test for semantic collapse\n    queries.push({\n      query: 'something about code',\n      expectedTraceIds: [],\n      expectedTopics: [],\n      difficulty: 'hard',\n      category: 'vague_query',\n    });\n\n    queries.push({\n      query: 'the thing we did yesterday with the files',\n      expectedTraceIds: [],\n      expectedTopics: [],\n      difficulty: 'hard',\n      category: 'ambiguous_query',\n    });\n\n    return queries;\n  }\n\n  /**\n   * Run benchmarks on all strategies\n   */\n  async runBenchmarks(\n    traces: Trace[],\n    sampleSize: number = 10\n  ): Promise<BenchmarkReport> {\n    logger.info('Starting retrieval benchmarks', {\n      traceCount: traces.length,\n      sampleSize,\n    });\n\n    const queries = await this.generateBenchmarkQueries(traces);\n    const sampledQueries = this.sampleQueries(queries, sampleSize);\n\n    const results: BenchmarkResult[] = [];\n\n    // Build hierarchical and graph structures\n    await this.hierarchicalRetrieval.buildHierarchy(traces);\n    const frames = await this.frameManager.getAllFrames();\n    await this.graphRetrieval.buildGraph(traces, frames);\n\n    // Test flat retrieval\n    for (const query of sampledQueries) {\n      const result = await this.benchmarkFlatRetrieval(query, traces);\n      results.push(result);\n      await this.saveResult(result, traces.length);\n    }\n\n    // Test hierarchical retrieval\n    for (const query of sampledQueries) {\n      const result = await this.benchmarkHierarchicalRetrieval(query, traces);\n      results.push(result);\n      await this.saveResult(result, traces.length);\n    }\n\n    // Test graph retrieval\n    for (const query of sampledQueries) {\n      const result = await this.benchmarkGraphRetrieval(query, traces);\n      results.push(result);\n      await this.saveResult(result, traces.length);\n    }\n\n    // Generate report\n    const report = this.generateReport(results, traces.length);\n\n    logger.info('Benchmarks complete', {\n      strategies: 3,\n      queries: sampledQueries.length,\n      avgF1: {\n        flat: report.strategies.flat.avgF1Score,\n        hierarchical: report.strategies.hierarchical.avgF1Score,\n        graph: report.strategies.graph.avgF1Score,\n      },\n    });\n\n    return report;\n  }\n\n  /**\n   * Benchmark flat embedding retrieval\n   */\n  private async benchmarkFlatRetrieval(\n    query: BenchmarkQuery,\n    traces: Trace[]\n  ): Promise<BenchmarkResult> {\n    const startTime = Date.now();\n\n    try {\n      const result = await this.flatRetrieval.retrieveContext(query.query, {\n        tokenBudget: 4000,\n      });\n\n      const retrievedIds = result.frames.map((f) => f.id);\n      const queryTime = Date.now() - startTime;\n\n      return this.evaluateResult(\n        'flat',\n        query,\n        retrievedIds,\n        queryTime,\n        result.tokenUsage.used,\n        'Standard flat embedding retrieval'\n      );\n    } catch (error: unknown) {\n      logger.error('Flat retrieval failed', error);\n      return this.createErrorResult('flat', query, error as Error);\n    }\n  }\n\n  /**\n   * Benchmark hierarchical retrieval\n   */\n  private async benchmarkHierarchicalRetrieval(\n    query: BenchmarkQuery,\n    traces: Trace[]\n  ): Promise<BenchmarkResult> {\n    const startTime = Date.now();\n\n    try {\n      const context = await this.hierarchicalRetrieval.retrieve(\n        query.query,\n        4,\n        4000\n      );\n\n      const queryTime = Date.now() - startTime;\n\n      // Extract trace IDs from context (simplified)\n      const retrievedIds = this.extractTraceIds(context);\n\n      return this.evaluateResult(\n        'hierarchical',\n        query,\n        retrievedIds,\n        queryTime,\n        context.length / 4, // Estimate tokens\n        'Hierarchical retrieval with progressive summarization'\n      );\n    } catch (error: unknown) {\n      logger.error('Hierarchical retrieval failed', error);\n      return this.createErrorResult('hierarchical', query, error as Error);\n    }\n  }\n\n  /**\n   * Benchmark graph retrieval\n   */\n  private async benchmarkGraphRetrieval(\n    query: BenchmarkQuery,\n    traces: Trace[]\n  ): Promise<BenchmarkResult> {\n    const startTime = Date.now();\n\n    try {\n      const paths = await this.graphRetrieval.traverse(query.query, {\n        maxHops: 3,\n        minWeight: 0.3,\n      });\n\n      const queryTime = Date.now() - startTime;\n\n      // Extract trace IDs from paths\n      const retrievedIds = new Set<string>();\n      for (const path of paths) {\n        for (const node of path.nodes) {\n          if (node.metadata.traceIds) {\n            node.metadata.traceIds.forEach((id) => retrievedIds.add(id));\n          }\n        }\n      }\n\n      return this.evaluateResult(\n        'graph',\n        query,\n        Array.from(retrievedIds),\n        queryTime,\n        paths.length * 100, // Estimate tokens\n        'Graph-based retrieval with explicit relationships'\n      );\n    } catch (error: unknown) {\n      logger.error('Graph retrieval failed', error);\n      return this.createErrorResult('graph', query, error as Error);\n    }\n  }\n\n  /**\n   * Evaluate retrieval results\n   */\n  private evaluateResult(\n    strategy: 'flat' | 'hierarchical' | 'graph',\n    query: BenchmarkQuery,\n    retrievedIds: string[],\n    queryTimeMs: number,\n    tokensUsed: number,\n    explanation: string\n  ): BenchmarkResult {\n    const expectedSet = new Set(query.expectedTraceIds);\n    const retrievedSet = new Set(retrievedIds);\n\n    // Calculate metrics\n    const truePositives = [...retrievedSet].filter((id) =>\n      expectedSet.has(id)\n    ).length;\n    const falsePositives = retrievedSet.size - truePositives;\n    const falseNegatives = expectedSet.size - truePositives;\n\n    const precision =\n      retrievedSet.size > 0 ? truePositives / retrievedSet.size : 0;\n    const recall = expectedSet.size > 0 ? truePositives / expectedSet.size : 1;\n    const f1Score =\n      precision + recall > 0\n        ? (2 * (precision * recall)) / (precision + recall)\n        : 0;\n\n    // Check for semantic drift (simplified)\n    const semanticDrift = this.calculateSemanticDrift(query, retrievedIds);\n\n    return {\n      strategy,\n      query,\n      retrievedTraceIds: retrievedIds,\n      precision,\n      recall,\n      f1Score,\n      queryTimeMs,\n      tokensUsed,\n      semanticDrift,\n      explanation,\n    };\n  }\n\n  /**\n   * Calculate semantic drift indicator\n   */\n  private calculateSemanticDrift(\n    query: BenchmarkQuery,\n    retrievedIds: string[]\n  ): number {\n    // If vague query returns too many results, indicates collapse\n    if (query.category === 'vague_query' && retrievedIds.length > 10) {\n      return 0.8; // High drift\n    }\n\n    // If specific query returns nothing, indicates problem\n    if (query.category === 'specific_lookup' && retrievedIds.length === 0) {\n      return 0.7;\n    }\n\n    return 0.1; // Normal\n  }\n\n  /**\n   * Create error result\n   */\n  private createErrorResult(\n    strategy: 'flat' | 'hierarchical' | 'graph',\n    query: BenchmarkQuery,\n    error: Error\n  ): BenchmarkResult {\n    return {\n      strategy,\n      query,\n      retrievedTraceIds: [],\n      precision: 0,\n      recall: 0,\n      f1Score: 0,\n      queryTimeMs: 0,\n      tokensUsed: 0,\n      semanticDrift: 1.0,\n      explanation: `Error: ${error.message}`,\n    };\n  }\n\n  /**\n   * Generate benchmark report\n   */\n  private generateReport(\n    results: BenchmarkResult[],\n    traceCount: number\n  ): BenchmarkReport {\n    const byStrategy = this.groupByStrategy(results);\n\n    const report: BenchmarkReport = {\n      timestamp: Date.now(),\n      traceCount,\n      strategies: {\n        flat: this.calculateStrategyMetrics(byStrategy.flat || []),\n        hierarchical: this.calculateStrategyMetrics(\n          byStrategy.hierarchical || []\n        ),\n        graph: this.calculateStrategyMetrics(byStrategy.graph || []),\n      },\n      warnings: [],\n      recommendations: [],\n    };\n\n    // Generate warnings\n    if (report.strategies.flat.semanticCollapse) {\n      report.warnings.push('Flat embedding shows signs of semantic collapse');\n    }\n\n    if (report.strategies.flat.avgQueryTime > 1000) {\n      report.warnings.push('Flat retrieval query time exceeds 1 second');\n    }\n\n    // Generate recommendations\n    const bestStrategy = this.getBestStrategy(report.strategies);\n    report.recommendations.push(`Best overall strategy: ${bestStrategy}`);\n\n    if (traceCount > 10000) {\n      report.recommendations.push('Consider hierarchical retrieval for scale');\n    }\n\n    if (\n      report.strategies.graph.avgF1Score >\n      report.strategies.flat.avgF1Score * 1.2\n    ) {\n      report.recommendations.push(\n        'Graph retrieval significantly outperforms flat - consider switching'\n      );\n    }\n\n    return report;\n  }\n\n  /**\n   * Calculate strategy metrics\n   */\n  private calculateStrategyMetrics(\n    results: BenchmarkResult[]\n  ): StrategyMetrics {\n    if (results.length === 0) {\n      return {\n        avgPrecision: 0,\n        avgRecall: 0,\n        avgF1Score: 0,\n        avgQueryTime: 0,\n        avgTokensUsed: 0,\n        semanticCollapse: false,\n        collapseIndicators: [],\n      };\n    }\n\n    const avgPrecision =\n      results.reduce((sum, r) => sum + r.precision, 0) / results.length;\n    const avgRecall =\n      results.reduce((sum, r) => sum + r.recall, 0) / results.length;\n    const avgF1Score =\n      results.reduce((sum, r) => sum + r.f1Score, 0) / results.length;\n    const avgQueryTime =\n      results.reduce((sum, r) => sum + r.queryTimeMs, 0) / results.length;\n    const avgTokensUsed =\n      results.reduce((sum, r) => sum + r.tokensUsed, 0) / results.length;\n\n    // Check for semantic collapse\n    const collapseIndicators: string[] = [];\n    const avgDrift =\n      results.reduce((sum, r) => sum + (r.semanticDrift || 0), 0) /\n      results.length;\n\n    if (avgDrift > 0.5) {\n      collapseIndicators.push('High semantic drift detected');\n    }\n\n    // Check for uniform results (everything returns same thing)\n    const uniqueResults = new Set(\n      results.map((r) => r.retrievedTraceIds.sort().join(','))\n    );\n    if (uniqueResults.size < results.length * 0.3) {\n      collapseIndicators.push(\n        'Low result diversity - possible embedding collapse'\n      );\n    }\n\n    // Check for poor precision on specific queries\n    const specificQueries = results.filter(\n      (r) => r.query.difficulty === 'easy'\n    );\n    const specificPrecision =\n      specificQueries.reduce((sum, r) => sum + r.precision, 0) /\n      (specificQueries.length || 1);\n    if (specificPrecision < 0.5) {\n      collapseIndicators.push('Poor precision on specific queries');\n    }\n\n    return {\n      avgPrecision,\n      avgRecall,\n      avgF1Score,\n      avgQueryTime,\n      avgTokensUsed,\n      semanticCollapse: collapseIndicators.length > 0,\n      collapseIndicators,\n    };\n  }\n\n  /**\n   * Determine best strategy\n   */\n  private getBestStrategy(strategies: BenchmarkReport['strategies']): string {\n    const scores = {\n      flat:\n        strategies.flat.avgF1Score * (1 - strategies.flat.avgQueryTime / 5000),\n      hierarchical:\n        strategies.hierarchical.avgF1Score *\n        (1 - strategies.hierarchical.avgQueryTime / 5000),\n      graph:\n        strategies.graph.avgF1Score *\n        (1 - strategies.graph.avgQueryTime / 5000),\n    };\n\n    return Object.entries(scores).sort((a, b) => b[1] - a[1])[0][0];\n  }\n\n  /**\n   * Group traces by topic\n   */\n  private groupByTopic(traces: Trace[]): Map<string, Trace[]> {\n    const groups = new Map<string, Trace[]>();\n\n    for (const trace of traces) {\n      if (!groups.has(trace.type)) {\n        groups.set(trace.type, []);\n      }\n      groups.get(trace.type)!.push(trace);\n    }\n\n    return groups;\n  }\n\n  /**\n   * Group results by strategy\n   */\n  private groupByStrategy(\n    results: BenchmarkResult[]\n  ): Record<string, BenchmarkResult[]> {\n    const grouped: Record<string, BenchmarkResult[]> = {};\n\n    for (const result of results) {\n      if (!grouped[result.strategy]) {\n        grouped[result.strategy] = [];\n      }\n      grouped[result.strategy].push(result);\n    }\n\n    return grouped;\n  }\n\n  /**\n   * Sample queries for benchmarking\n   */\n  private sampleQueries(\n    queries: BenchmarkQuery[],\n    sampleSize: number\n  ): BenchmarkQuery[] {\n    // Ensure we get a mix of difficulties\n    const byDifficulty = this.groupByDifficulty(queries);\n    const sampled: BenchmarkQuery[] = [];\n\n    const perDifficulty = Math.ceil(sampleSize / 3);\n\n    for (const difficulty of ['easy', 'medium', 'hard'] as const) {\n      const difficultyQueries = byDifficulty[difficulty] || [];\n      const sample = this.randomSample(difficultyQueries, perDifficulty);\n      sampled.push(...sample);\n    }\n\n    return sampled.slice(0, sampleSize);\n  }\n\n  /**\n   * Group queries by difficulty\n   */\n  private groupByDifficulty(\n    queries: BenchmarkQuery[]\n  ): Record<string, BenchmarkQuery[]> {\n    const grouped: Record<string, BenchmarkQuery[]> = {};\n\n    for (const query of queries) {\n      if (!grouped[query.difficulty]) {\n        grouped[query.difficulty] = [];\n      }\n      grouped[query.difficulty].push(query);\n    }\n\n    return grouped;\n  }\n\n  /**\n   * Random sample from array\n   */\n  private randomSample<T>(array: T[], size: number): T[] {\n    const shuffled = [...array].sort(() => Math.random() - 0.5);\n    return shuffled.slice(0, size);\n  }\n\n  /**\n   * Extract trace IDs from context string\n   */\n  private extractTraceIds(context: string): string[] {\n    // Simple pattern matching for trace IDs\n    const matches = context.match(/trace_[a-f0-9]{16}/g) || [];\n    return [...new Set(matches)];\n  }\n\n  /**\n   * Save benchmark result to database\n   */\n  private async saveResult(\n    result: BenchmarkResult,\n    traceCount: number\n  ): Promise<void> {\n    this.db\n      .prepare(\n        `\n      INSERT INTO benchmark_results (\n        strategy, query, difficulty, category,\n        precision, recall, f1_score,\n        query_time_ms, tokens_used, semantic_drift,\n        trace_count, retrieved_ids, expected_ids\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `\n      )\n      .run(\n        result.strategy,\n        result.query.query,\n        result.query.difficulty,\n        result.query.category,\n        result.precision,\n        result.recall,\n        result.f1Score,\n        result.queryTimeMs,\n        result.tokensUsed,\n        result.semanticDrift || 0,\n        traceCount,\n        JSON.stringify(result.retrievedTraceIds),\n        JSON.stringify(result.query.expectedTraceIds)\n      );\n  }\n\n  /**\n   * Get historical benchmark trends\n   */\n  getHistoricalTrends(days: number = 7): any {\n    const cutoff = Date.now() - days * 24 * 60 * 60 * 1000;\n\n    const trends = this.db\n      .prepare(\n        `\n      SELECT \n        strategy,\n        DATE(timestamp / 1000, 'unixepoch') as date,\n        AVG(precision) as avg_precision,\n        AVG(recall) as avg_recall,\n        AVG(f1_score) as avg_f1,\n        AVG(query_time_ms) as avg_query_time,\n        AVG(semantic_drift) as avg_drift,\n        COUNT(*) as query_count\n      FROM benchmark_results\n      WHERE timestamp > ?\n      GROUP BY strategy, date\n      ORDER BY date, strategy\n    `\n      )\n      .all(cutoff);\n\n    return trends;\n  }\n}\n"],
+  "mappings": "AAYA,SAAS,cAAc;AAEvB,SAAS,2BAA2B;AACpC,SAAS,6BAA6B;AACtC,SAAS,sBAAsB;AAiDxB,MAAM,oBAAoB;AAAA,EACvB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAER,YACE,IACA,cACA,WACA;AACA,SAAK,KAAK;AACV,SAAK,eAAe;AAGpB,SAAK,gBAAgB,IAAI,oBAAoB,IAAI,cAAc,SAAS;AACxE,SAAK,wBAAwB,IAAI,sBAAsB,EAAE;AACzD,SAAK,iBAAiB,IAAI,eAAe,EAAE;AAE3C,SAAK,iBAAiB;AAAA,EACxB;AAAA,EAEQ,mBAAyB;AAC/B,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAkBZ;AAED,SAAK,GAAG,KAAK;AAAA;AAAA;AAAA;AAAA,KAIZ;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,yBAAyB,QAA4C;AACzE,UAAM,UAA4B,CAAC;AAGnC,UAAM,eAAe,OAClB,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,YAAY,EAAE,SAAS,SAAS,EAC1D,MAAM,GAAG,EAAE;AAEd,eAAW,SAAS,aAAa,MAAM,GAAG,CAAC,GAAG;AAC5C,cAAQ,KAAK;AAAA,QACX,OAAO,eAAe,MAAM,IAAI,mBAAmB,IAAI,KAAK,MAAM,SAAS,SAAS,EAAE,eAAe,CAAC;AAAA,QACtG,kBAAkB,CAAC,MAAM,EAAE;AAAA,QAC3B,gBAAgB,CAAC,MAAM,IAAI;AAAA,QAC3B,YAAY;AAAA,QACZ,UAAU;AAAA,MACZ,CAAC;AAAA,IACH;AAGA,UAAM,cAAc,KAAK,aAAa,MAAM;AAE5C,eAAW,CAAC,OAAO,WAAW,KAAK,YAAY,QAAQ,GAAG;AACxD,UAAI,YAAY,UAAU,GAAG;AAC3B,gBAAQ,KAAK;AAAA,UACX,OAAO,QAAQ,KAAK;AAAA,UACpB,kBAAkB,YAAY,MAAM,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,UAC1D,gBAAgB,CAAC,KAAK;AAAA,UACtB,YAAY;AAAA,UACZ,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAGA,QAAI,OAAO,SAAS,IAAI;AAEtB,YAAM,cAAc,OAAO;AAAA,QACzB,CAAC,MAAM,EAAE,SAAS,kBAAkB,SAAS;AAAA,MAC/C;AAEA,UAAI,YAAY,SAAS,GAAG;AAC1B,gBAAQ,KAAK;AAAA,UACX,OAAO;AAAA,UACP,kBAAkB,YAAY,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,UAC7C,gBAAgB,CAAC,SAAS,OAAO,OAAO;AAAA,UACxC,YAAY;AAAA,UACZ,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAGA,YAAM,iBAAiB,OAAO;AAAA,QAC5B,CAAC,MAAM,EAAE,SAAS,kBAAkB,SAAS;AAAA,MAC/C;AAEA,UAAI,eAAe,SAAS,GAAG;AAC7B,gBAAQ,KAAK;AAAA,UACX,OAAO;AAAA,UACP,kBAAkB,eAAe,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,UAChD,gBAAgB,CAAC,YAAY,gBAAgB,QAAQ;AAAA,UACrD,YAAY;AAAA,UACZ,UAAU;AAAA,QACZ,CAAC;AAAA,MACH;AAAA,IACF;AAGA,YAAQ,KAAK;AAAA,MACX,OAAO;AAAA,MACP,kBAAkB,CAAC;AAAA,MACnB,gBAAgB,CAAC;AAAA,MACjB,YAAY;AAAA,MACZ,UAAU;AAAA,IACZ,CAAC;AAED,YAAQ,KAAK;AAAA,MACX,OAAO;AAAA,MACP,kBAAkB,CAAC;AAAA,MACnB,gBAAgB,CAAC;AAAA,MACjB,YAAY;AAAA,MACZ,UAAU;AAAA,IACZ,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,cACJ,QACA,aAAqB,IACK;AAC1B,WAAO,KAAK,iCAAiC;AAAA,MAC3C,YAAY,OAAO;AAAA,MACnB;AAAA,IACF,CAAC;AAED,UAAM,UAAU,MAAM,KAAK,yBAAyB,MAAM;AAC1D,UAAM,iBAAiB,KAAK,cAAc,SAAS,UAAU;AAE7D,UAAM,UAA6B,CAAC;AAGpC,UAAM,KAAK,sBAAsB,eAAe,MAAM;AACtD,UAAM,SAAS,MAAM,KAAK,aAAa,aAAa;AACpD,UAAM,KAAK,eAAe,WAAW,QAAQ,MAAM;AAGnD,eAAW,SAAS,gBAAgB;AAClC,YAAM,SAAS,MAAM,KAAK,uBAAuB,OAAO,MAAM;AAC9D,cAAQ,KAAK,MAAM;AACnB,YAAM,KAAK,WAAW,QAAQ,OAAO,MAAM;AAAA,IAC7C;AAGA,eAAW,SAAS,gBAAgB;AAClC,YAAM,SAAS,MAAM,KAAK,+BAA+B,OAAO,MAAM;AACtE,cAAQ,KAAK,MAAM;AACnB,YAAM,KAAK,WAAW,QAAQ,OAAO,MAAM;AAAA,IAC7C;AAGA,eAAW,SAAS,gBAAgB;AAClC,YAAM,SAAS,MAAM,KAAK,wBAAwB,OAAO,MAAM;AAC/D,cAAQ,KAAK,MAAM;AACnB,YAAM,KAAK,WAAW,QAAQ,OAAO,MAAM;AAAA,IAC7C;AAGA,UAAM,SAAS,KAAK,eAAe,SAAS,OAAO,MAAM;AAEzD,WAAO,KAAK,uBAAuB;AAAA,MACjC,YAAY;AAAA,MACZ,SAAS,eAAe;AAAA,MACxB,OAAO;AAAA,QACL,MAAM,OAAO,WAAW,KAAK;AAAA,QAC7B,cAAc,OAAO,WAAW,aAAa;AAAA,QAC7C,OAAO,OAAO,WAAW,MAAM;AAAA,MACjC;AAAA,IACF,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,uBACZ,OACA,QAC0B;AAC1B,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI;AACF,YAAM,SAAS,MAAM,KAAK,cAAc,gBAAgB,MAAM,OAAO;AAAA,QACnE,aAAa;AAAA,MACf,CAAC;AAED,YAAM,eAAe,OAAO,OAAO,IAAI,CAAC,MAAM,EAAE,EAAE;AAClD,YAAM,YAAY,KAAK,IAAI,IAAI;AAE/B,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,OAAO,WAAW;AAAA,QAClB;AAAA,MACF;AAAA,IACF,SAAS,OAAgB;AACvB,aAAO,MAAM,yBAAyB,KAAK;AAC3C,aAAO,KAAK,kBAAkB,QAAQ,OAAO,KAAc;AAAA,IAC7D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,+BACZ,OACA,QAC0B;AAC1B,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI;AACF,YAAM,UAAU,MAAM,KAAK,sBAAsB;AAAA,QAC/C,MAAM;AAAA,QACN;AAAA,QACA;AAAA,MACF;AAEA,YAAM,YAAY,KAAK,IAAI,IAAI;AAG/B,YAAM,eAAe,KAAK,gBAAgB,OAAO;AAEjD,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ,SAAS;AAAA;AAAA,QACjB;AAAA,MACF;AAAA,IACF,SAAS,OAAgB;AACvB,aAAO,MAAM,iCAAiC,KAAK;AACnD,aAAO,KAAK,kBAAkB,gBAAgB,OAAO,KAAc;AAAA,IACrE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,wBACZ,OACA,QAC0B;AAC1B,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI;AACF,YAAM,QAAQ,MAAM,KAAK,eAAe,SAAS,MAAM,OAAO;AAAA,QAC5D,SAAS;AAAA,QACT,WAAW;AAAA,MACb,CAAC;AAED,YAAM,YAAY,KAAK,IAAI,IAAI;AAG/B,YAAM,eAAe,oBAAI,IAAY;AACrC,iBAAW,QAAQ,OAAO;AACxB,mBAAW,QAAQ,KAAK,OAAO;AAC7B,cAAI,KAAK,SAAS,UAAU;AAC1B,iBAAK,SAAS,SAAS,QAAQ,CAAC,OAAO,aAAa,IAAI,EAAE,CAAC;AAAA,UAC7D;AAAA,QACF;AAAA,MACF;AAEA,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA,MAAM,KAAK,YAAY;AAAA,QACvB;AAAA,QACA,MAAM,SAAS;AAAA;AAAA,QACf;AAAA,MACF;AAAA,IACF,SAAS,OAAgB;AACvB,aAAO,MAAM,0BAA0B,KAAK;AAC5C,aAAO,KAAK,kBAAkB,SAAS,OAAO,KAAc;AAAA,IAC9D;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,eACN,UACA,OACA,cACA,aACA,YACA,aACiB;AACjB,UAAM,cAAc,IAAI,IAAI,MAAM,gBAAgB;AAClD,UAAM,eAAe,IAAI,IAAI,YAAY;AAGzC,UAAM,gBAAgB,CAAC,GAAG,YAAY,EAAE;AAAA,MAAO,CAAC,OAC9C,YAAY,IAAI,EAAE;AAAA,IACpB,EAAE;AACF,UAAM,iBAAiB,aAAa,OAAO;AAC3C,UAAM,iBAAiB,YAAY,OAAO;AAE1C,UAAM,YACJ,aAAa,OAAO,IAAI,gBAAgB,aAAa,OAAO;AAC9D,UAAM,SAAS,YAAY,OAAO,IAAI,gBAAgB,YAAY,OAAO;AACzE,UAAM,UACJ,YAAY,SAAS,IAChB,KAAK,YAAY,WAAY,YAAY,UAC1C;AAGN,UAAM,gBAAgB,KAAK,uBAAuB,OAAO,YAAY;AAErE,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,mBAAmB;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,uBACN,OACA,cACQ;AAER,QAAI,MAAM,aAAa,iBAAiB,aAAa,SAAS,IAAI;AAChE,aAAO;AAAA,IACT;AAGA,QAAI,MAAM,aAAa,qBAAqB,aAAa,WAAW,GAAG;AACrE,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,kBACN,UACA,OACA,OACiB;AACjB,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,mBAAmB,CAAC;AAAA,MACpB,WAAW;AAAA,MACX,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,eAAe;AAAA,MACf,aAAa,UAAU,MAAM,OAAO;AAAA,IACtC;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,eACN,SACA,YACiB;AACjB,UAAM,aAAa,KAAK,gBAAgB,OAAO;AAE/C,UAAM,SAA0B;AAAA,MAC9B,WAAW,KAAK,IAAI;AAAA,MACpB;AAAA,MACA,YAAY;AAAA,QACV,MAAM,KAAK,yBAAyB,WAAW,QAAQ,CAAC,CAAC;AAAA,QACzD,cAAc,KAAK;AAAA,UACjB,WAAW,gBAAgB,CAAC;AAAA,QAC9B;AAAA,QACA,OAAO,KAAK,yBAAyB,WAAW,SAAS,CAAC,CAAC;AAAA,MAC7D;AAAA,MACA,UAAU,CAAC;AAAA,MACX,iBAAiB,CAAC;AAAA,IACpB;AAGA,QAAI,OAAO,WAAW,KAAK,kBAAkB;AAC3C,aAAO,SAAS,KAAK,iDAAiD;AAAA,IACxE;AAEA,QAAI,OAAO,WAAW,KAAK,eAAe,KAAM;AAC9C,aAAO,SAAS,KAAK,4CAA4C;AAAA,IACnE;AAGA,UAAM,eAAe,KAAK,gBAAgB,OAAO,UAAU;AAC3D,WAAO,gBAAgB,KAAK,0BAA0B,YAAY,EAAE;AAEpE,QAAI,aAAa,KAAO;AACtB,aAAO,gBAAgB,KAAK,2CAA2C;AAAA,IACzE;AAEA,QACE,OAAO,WAAW,MAAM,aACxB,OAAO,WAAW,KAAK,aAAa,KACpC;AACA,aAAO,gBAAgB;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,yBACN,SACiB;AACjB,QAAI,QAAQ,WAAW,GAAG;AACxB,aAAO;AAAA,QACL,cAAc;AAAA,QACd,WAAW;AAAA,QACX,YAAY;AAAA,QACZ,cAAc;AAAA,QACd,eAAe;AAAA,QACf,kBAAkB;AAAA,QAClB,oBAAoB,CAAC;AAAA,MACvB;AAAA,IACF;AAEA,UAAM,eACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC,IAAI,QAAQ;AAC7D,UAAM,YACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,QAAQ,CAAC,IAAI,QAAQ;AAC1D,UAAM,aACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,SAAS,CAAC,IAAI,QAAQ;AAC3D,UAAM,eACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,aAAa,CAAC,IAAI,QAAQ;AAC/D,UAAM,gBACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,YAAY,CAAC,IAAI,QAAQ;AAG9D,UAAM,qBAA+B,CAAC;AACtC,UAAM,WACJ,QAAQ,OAAO,CAAC,KAAK,MAAM,OAAO,EAAE,iBAAiB,IAAI,CAAC,IAC1D,QAAQ;AAEV,QAAI,WAAW,KAAK;AAClB,yBAAmB,KAAK,8BAA8B;AAAA,IACxD;AAGA,UAAM,gBAAgB,IAAI;AAAA,MACxB,QAAQ,IAAI,CAAC,MAAM,EAAE,kBAAkB,KAAK,EAAE,KAAK,GAAG,CAAC;AAAA,IACzD;AACA,QAAI,cAAc,OAAO,QAAQ,SAAS,KAAK;AAC7C,yBAAmB;AAAA,QACjB;AAAA,MACF;AAAA,IACF;AAGA,UAAM,kBAAkB,QAAQ;AAAA,MAC9B,CAAC,MAAM,EAAE,MAAM,eAAe;AAAA,IAChC;AACA,UAAM,oBACJ,gBAAgB,OAAO,CAAC,KAAK,MAAM,MAAM,EAAE,WAAW,CAAC,KACtD,gBAAgB,UAAU;AAC7B,QAAI,oBAAoB,KAAK;AAC3B,yBAAmB,KAAK,oCAAoC;AAAA,IAC9D;AAEA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,kBAAkB,mBAAmB,SAAS;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,YAAmD;AACzE,UAAM,SAAS;AAAA,MACb,MACE,WAAW,KAAK,cAAc,IAAI,WAAW,KAAK,eAAe;AAAA,MACnE,cACE,WAAW,aAAa,cACvB,IAAI,WAAW,aAAa,eAAe;AAAA,MAC9C,OACE,WAAW,MAAM,cAChB,IAAI,WAAW,MAAM,eAAe;AAAA,IACzC;AAEA,WAAO,OAAO,QAAQ,MAAM,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAa,QAAuC;AAC1D,UAAM,SAAS,oBAAI,IAAqB;AAExC,eAAW,SAAS,QAAQ;AAC1B,UAAI,CAAC,OAAO,IAAI,MAAM,IAAI,GAAG;AAC3B,eAAO,IAAI,MAAM,MAAM,CAAC,CAAC;AAAA,MAC3B;AACA,aAAO,IAAI,MAAM,IAAI,EAAG,KAAK,KAAK;AAAA,IACpC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,gBACN,SACmC;AACnC,UAAM,UAA6C,CAAC;AAEpD,eAAW,UAAU,SAAS;AAC5B,UAAI,CAAC,QAAQ,OAAO,QAAQ,GAAG;AAC7B,gBAAQ,OAAO,QAAQ,IAAI,CAAC;AAAA,MAC9B;AACA,cAAQ,OAAO,QAAQ,EAAE,KAAK,MAAM;AAAA,IACtC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,cACN,SACA,YACkB;AAElB,UAAM,eAAe,KAAK,kBAAkB,OAAO;AACnD,UAAM,UAA4B,CAAC;AAEnC,UAAM,gBAAgB,KAAK,KAAK,aAAa,CAAC;AAE9C,eAAW,cAAc,CAAC,QAAQ,UAAU,MAAM,GAAY;AAC5D,YAAM,oBAAoB,aAAa,UAAU,KAAK,CAAC;AACvD,YAAM,SAAS,KAAK,aAAa,mBAAmB,aAAa;AACjE,cAAQ,KAAK,GAAG,MAAM;AAAA,IACxB;AAEA,WAAO,QAAQ,MAAM,GAAG,UAAU;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA,EAKQ,kBACN,SACkC;AAClC,UAAM,UAA4C,CAAC;AAEnD,eAAW,SAAS,SAAS;AAC3B,UAAI,CAAC,QAAQ,MAAM,UAAU,GAAG;AAC9B,gBAAQ,MAAM,UAAU,IAAI,CAAC;AAAA,MAC/B;AACA,cAAQ,MAAM,UAAU,EAAE,KAAK,KAAK;AAAA,IACtC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKQ,aAAgB,OAAY,MAAmB;AACrD,UAAM,WAAW,CAAC,GAAG,KAAK,EAAE,KAAK,MAAM,KAAK,OAAO,IAAI,GAAG;AAC1D,WAAO,SAAS,MAAM,GAAG,IAAI;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA,EAKQ,gBAAgB,SAA2B;AAEjD,UAAM,UAAU,QAAQ,MAAM,qBAAqB,KAAK,CAAC;AACzD,WAAO,CAAC,GAAG,IAAI,IAAI,OAAO,CAAC;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAc,WACZ,QACA,YACe;AACf,SAAK,GACF;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAQF,EACC;AAAA,MACC,OAAO;AAAA,MACP,OAAO,MAAM;AAAA,MACb,OAAO,MAAM;AAAA,MACb,OAAO,MAAM;AAAA,MACb,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO,iBAAiB;AAAA,MACxB;AAAA,MACA,KAAK,UAAU,OAAO,iBAAiB;AAAA,MACvC,KAAK,UAAU,OAAO,MAAM,gBAAgB;AAAA,IAC9C;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB,OAAe,GAAQ;AACzC,UAAM,SAAS,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,KAAK;AAElD,UAAM,SAAS,KAAK,GACjB;AAAA,MACC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAeF,EACC,IAAI,MAAM;AAEb,WAAO;AAAA,EACT;AACF;",
   "names": []
 }