@remnic/core 10.0.91 → 10.0.93

package/dist/chunk-E6M225BJ.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/summarizer.ts"],"sourcesContent":["import { mkdir, readFile, writeFile, readdir } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { z } from \"zod\";\nimport { log } from \"./logger.js\";\nimport { LocalLlmClient } from \"./local-llm.js\";\nimport { FallbackLlmClient, fallbackLlmRuntimeContextFromConfig, gatewayTaskChainOptions } from \"./fallback-llm.js\";\nimport { ModelRegistry } from \"./model-registry.js\";\nimport { extractJsonCandidates } from \"./json-extract.js\";\nimport {\n  completeBackgroundGeneration,\n  parseBackgroundGenerationJson,\n} from \"./background-generation.js\";\nimport type { HourlySummary, TranscriptEntry, PluginConfig, GatewayConfig } from \"./types.js\";\nimport type { TranscriptManager } from \"./transcript.js\";\nimport { readSummarySnapshot, upsertSummarySnapshot, writeSummarySnapshot } from \"./summary-snapshot.js\";\nimport { encodeStoragePathSegment, resolveSafeStoragePath } from \"./storage-paths.js\";\nimport { sessionStoragePaths } from \"./session-identity.js\";\nimport { resolveLocalLlmCapabilities } from \"./capabilities.js\";\nimport { resolvePipelineProcessingCapabilities } from \"./capabilities.js\";\n\n// Schema for LLM summary output\nconst HourlySummarySchema = z.object({\n  bullets: z.array(z.string().trim().min(1)).min(1).describe(\"3-5 bullet points summarizing the hour's activity\"),\n});\n\ntype HourlySummaryResult = z.infer<typeof HourlySummarySchema>;\n\nconst HourlySummaryExtendedSchema = z.object({\n  topics: z.array(z.string()).default([]),\n  decisions: z.array(z.string()).default([]),\n  actionItems: z.array(z.string()).default([]),\n  rejected: z.array(z.string()).default([]),\n});\n\ntype HourlySummaryExtendedResult = z.infer<typeof HourlySummaryExtendedSchema>;\n\ntype HourlySummaryExtendedMeta = {\n  userTurns: number;\n  assistantTurns: number;\n  toolCalls: number;\n  toolCounts: Record<string, number>;\n};\n\nfunction escapeRegExp(value: string): string {\n  return value.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n}\n\n/**\n * Outcome stats of one `runHourly` pass (issue #2783). The summarizer must\n * not report success on empty work: an empty or stale transcript store is\n * the delegate-mode starvation signature, and callers surface these counts\n * and the staleness flag as a distinct warning instead of a bare ok.\n */\nexport interface HourlySummarizerRunStats {\n  sessionsConsidered: number;\n  sessionsWithEntries: number;\n  summariesWritten: number;\n  /** True when the newest transcript entry across the store is older than STALE_STORE_MS. */\n  staleStore: boolean;\n  /** ISO timestamp of the newest transcript entry seen by the scan, when any exist. */\n  newestEntryTimestamp: string | null;\n  /** True when the transcript scan itself FAILED (unreadable store) — distinct from an empty store. */\n  scanFailed: boolean;\n}\n\n/** A store whose newest entry is older than this is considered stale (starvation signal, issue #2783). */\nconst STALE_STORE_MS = 2 * 60 * 60 * 1000;\n\n/**\n * Interpret one {@link HourlySummarizerRunStats} into the operator-facing\n * message/warning (issue #2783). Every degraded shape — failed scan, empty\n * store, backend-down, stale store — is DISTINCT from success; monitoring\n * alerts on `warning`, never on `ok` (ok only means \"the run completed\").\n */\nexport function summarizeHourlyStatus(stats: HourlySummarizerRunStats): {\n  message: string;\n  warning?: string;\n} {\n  if (stats.scanFailed) {\n    return {\n      message:\n        \"Hourly summarization completed, but the transcript store scan FAILED (unreadable directory or I/O error). Investigate the daemon's memoryDir.\",\n      warning: \"transcript store scan failed\",\n    };\n  }\n  if (stats.sessionsConsidered === 0) {\n    return {\n      message:\n        \"Hourly summarization completed, but the transcript store is empty — no sessions found. If turns are ingested via observe, transcript persistence may be disabled or failing.\",\n      warning: \"transcript store is empty\",\n    };\n  }\n  if (stats.sessionsWithEntries > 0 && stats.summariesWritten === 0) {\n    return {\n      message: `Hourly summarization found ${stats.sessionsWithEntries} session(s) with transcript entries but wrote no summaries — the summarizer backend may be down.`,\n      warning: \"sessions with entries produced no summaries\",\n    };\n  }\n  if (stats.sessionsWithEntries === 0 && stats.staleStore) {\n    return {\n      message: `Hourly summarization completed with no transcript entries for the target hour, and the store looks stale (newest entry ${stats.newestEntryTimestamp ?? \"unknown\"}).`,\n      warning: \"no transcript entries for the target hour and no new entries recently\",\n    };\n  }\n  return {\n    message: `Hourly summarization completed: ${stats.summariesWritten} summar${stats.summariesWritten === 1 ? \"y\" : \"ies\"} written across ${stats.sessionsWithEntries} session${stats.sessionsWithEntries === 1 ? \"\" : \"s\"} with transcript entries.`,\n  };\n}\n\nexport class HourlySummarizer {\n  private summariesDir: string;\n  private config: PluginConfig;\n  private localLlm: LocalLlmClient;\n  private fallbackLlm: FallbackLlmClient;\n  private modelRegistry: ModelRegistry;\n  private transcript?: TranscriptManager;\n\n  constructor(\n    config: PluginConfig,\n    gatewayConfig?: GatewayConfig,\n    modelRegistry?: ModelRegistry,\n    transcript?: TranscriptManager\n  ) {\n    this.config = config;\n    this.summariesDir = path.join(config.memoryDir, \"summaries\", \"hourly\");\n    this.modelRegistry = modelRegistry ?? new ModelRegistry(config.memoryDir);\n    this.transcript = transcript;\n\n    // Initialize local LLM client with shared model registry\n    this.localLlm = new LocalLlmClient(config, this.modelRegistry);\n\n    // Initialize fallback client with gateway config\n    this.fallbackLlm = new FallbackLlmClient(gatewayConfig, fallbackLlmRuntimeContextFromConfig(config));\n\n    if (\n      !gatewayConfig?.agents?.defaults?.model?.primary &&\n      !resolveLocalLlmCapabilities(config).localLlm &&\n      config.modelSource !== \"gateway\"\n    ) {\n      log.warn(\"no gateway default AI and local LLM disabled — hourly summarization disabled\");\n    }\n  }\n\n  private get useGatewayModelSource(): boolean {\n    return this.config.modelSource === \"gateway\";\n  }\n\n  private get shouldUseLocalLlm(): boolean {\n    return resolveLocalLlmCapabilities(this.config).localLlm && !this.useGatewayModelSource;\n  }\n\n  private withGatewayAgent(\n    options: import(\"./fallback-llm.js\").FallbackLlmOptions\n  ): import(\"./fallback-llm.js\").FallbackLlmOptions {\n    if (!this.useGatewayModelSource) return options;\n    // Shared resolution (taskModelChain > gatewayAgentId) — gotcha #22. Issue #1365.\n    return { ...options, ...gatewayTaskChainOptions(this.config) };\n  }\n\n  async initialize(): Promise<void> {\n    await mkdir(this.summariesDir, { recursive: true });\n    log.info(\"hourly summarizer initialized\");\n  }\n\n  private async summarySessionDir(sessionKey: string): Promise<string> {\n    return resolveSafeStoragePath(this.summariesDir, encodeStoragePathSegment(sessionKey, \"session\"));\n  }\n\n  private async legacySummarySessionDir(sessionKey: string): Promise<string | null> {\n    if (sessionKey.includes(\"\\0\")) return null;\n    try {\n      return await resolveSafeStoragePath(this.summariesDir, sessionKey);\n    } catch {\n      return null;\n    }\n  }\n\n  private summaryDateString(hour: string): string {\n    const dateStr = hour.slice(0, 10);\n    if (!/^\\d{4}-\\d{2}-\\d{2}$/.test(dateStr)) {\n      throw new Error(`invalid hourly summary timestamp: ${hour}`);\n    }\n    return dateStr;\n  }\n\n  // Generate summary for a specific hour and session\n  async generateSummary(\n    sessionKey: string,\n    hourStart: Date,\n    entries: TranscriptEntry[]\n  ): Promise<HourlySummary | null> {\n    if (entries.length === 0) return null;\n\n    // Format entries for the LLM\n    const conversation = entries.map((e) => `[${e.role}] ${e.content}`).join(\"\\n\\n\");\n\n    if (resolvePipelineProcessingCapabilities(this.config).hourlySummariesExtended) {\n      const extended = await this.generateExtended(sessionKey, hourStart, conversation, entries);\n      if (!extended) return null;\n      const meta: HourlySummaryExtendedMeta = {\n        userTurns: entries.filter((e) => e.role === \"user\").length,\n        assistantTurns: entries.filter((e) => e.role === \"assistant\").length,\n        toolCalls: extended._meta.toolCalls,\n        toolCounts: extended._meta.toolCounts,\n      };\n      // Keep HourlySummary surface stable; encode \"topics\" as bullets for recall injection.\n      const base: HourlySummary = {\n        hour: hourStart.toISOString(),\n        sessionKey,\n        bullets: extended.topics.length > 0 ? extended.topics.slice(0, 5) : [\"(summary generated)\"],\n        turnCount: entries.length,\n        generatedAt: new Date().toISOString(),\n      };\n      const withExtras = base as any;\n      withExtras._extended = extended;\n      withExtras._extendedMeta = meta;\n      return base;\n    }\n\n    const hourIso = hourStart.toISOString();\n    const startTime = Date.now();\n\n    if (this.config.backgroundGeneration) {\n      try {\n        const text = await completeBackgroundGeneration(this.config, [\n          {\n            role: \"system\",\n            content:\n              \"You are a conversation summarization system. Summarize the following conversation transcript into 3-5 concise bullet points.\\n\\nGuidelines:\\n- Focus on what was accomplished, decided, or discussed\\n- Include specific topics, projects, or entities mentioned\\n- Note any significant user requests or agent actions\\n- Keep bullets brief but informative (1-2 sentences each)\\n- Skip trivial greetings or meta-conversation\\n- Use present tense for ongoing work, past for completed items\\n\\nRespond with valid JSON only, matching this schema:\\n{\\\"bullets\\\": [\\\"bullet 1\\\", \\\"bullet 2\\\", \\\"bullet 3\\\"]}\",\n          },\n          { role: \"user\", content: `Summarize this conversation:\\n\\n${conversation}` },\n        ]);\n        const parsed = parseBackgroundGenerationJson(text, (value) => HourlySummarySchema.parse(value));\n        if (parsed) {\n          return {\n            hour: hourIso,\n            sessionKey,\n            bullets: parsed.bullets,\n            turnCount: entries.length,\n            generatedAt: new Date().toISOString(),\n          };\n        }\n      } catch {\n        log.info(\"summary generation: background generation unavailable, continuing\");\n      }\n    }\n\n    // Try local LLM first if enabled\n    if (this.shouldUseLocalLlm) {\n      try {\n        const localResult = await this.generateWithLocalLlm(conversation);\n        if (localResult) {\n          const durationMs = Date.now() - startTime;\n          log.debug(`generated hourly summary for ${sessionKey} at ${hourIso} in ${durationMs}ms using local LLM`);\n          return {\n            hour: hourIso,\n            sessionKey,\n            bullets: localResult.bullets,\n            turnCount: entries.length,\n            generatedAt: new Date().toISOString(),\n          };\n        }\n        // Local failed, fall back if allowed\n        if (!this.config.localLlmFallback) {\n          log.warn(\"summary generation: local LLM failed and fallback disabled\");\n          return null;\n        }\n        log.info(\"summary generation: local LLM unavailable, falling back to gateway default AI\");\n      } catch (err) {\n        if (!this.config.localLlmFallback) {\n          log.warn(\"summary generation: local LLM error and fallback disabled:\", err);\n          return null;\n        }\n        log.info(\"summary generation: local LLM error, falling back to gateway default AI:\", err);\n      }\n    }\n\n    // Fall back to gateway's default AI\n    log.info(\"summary generation: falling back to gateway default AI\");\n\n    try {\n      const messages = [\n        {\n          role: \"system\" as const,\n          content: `You are a conversation summarization system. Summarize the following conversation transcript into 3-5 concise bullet points.\n\nGuidelines:\n- Focus on what was accomplished, decided, or discussed\n- Include specific topics, projects, or entities mentioned\n- Note any significant user requests or agent actions\n- Keep bullets brief but informative (1-2 sentences each)\n- Skip trivial greetings or meta-conversation\n- Use present tense for ongoing work, past for completed items\n\nRespond with valid JSON matching this schema:\n{\n  \"bullets\": [\"bullet 1\", \"bullet 2\", \"bullet 3\"]\n}`,\n        },\n        { role: \"user\" as const, content: `Summarize this conversation:\\n\\n${conversation}` },\n      ];\n\n      const result = await this.fallbackLlm.parseWithSchema(\n        messages,\n        HourlySummarySchema,\n        this.withGatewayAgent({ temperature: 0.3, maxTokens: 8192 })\n      );\n\n      const durationMs = Date.now() - startTime;\n\n      if (result) {\n        log.debug(`generated hourly summary for ${sessionKey} at ${hourIso} in ${durationMs}ms via fallback`);\n        return {\n          hour: hourIso,\n          sessionKey,\n          bullets: result.bullets,\n          turnCount: entries.length,\n          generatedAt: new Date().toISOString(),\n        };\n      }\n\n      log.warn(\"summary generation fallback returned no parsed output\");\n      return null;\n    } catch (err) {\n      log.error(\"summary generation fallback failed\", err);\n      return null;\n    }\n  }\n\n  private async generateExtended(\n    sessionKey: string,\n    hourStart: Date,\n    conversation: string,\n    entries: TranscriptEntry[]\n  ): Promise<(HourlySummaryExtendedResult & { _meta: HourlySummaryExtendedMeta }) | null> {\n    const hourIso = hourStart.toISOString();\n    const startTime = Date.now();\n\n    const hourEnd = new Date(hourStart.getTime() + 60 * 60 * 1000);\n    let toolCounts: Record<string, number> = {};\n    if (this.config.hourlySummariesIncludeToolStats && this.transcript) {\n      const uses = await this.transcript.readToolUse(sessionKey, hourStart, hourEnd);\n      for (const u of uses) toolCounts[u.tool] = (toolCounts[u.tool] ?? 0) + 1;\n    }\n\n    const sys = `You are a conversation summarization system.\\n\\nSummarize the hour into structured sections.\\n\\nReturn valid JSON matching:\\n{\\n  \\\"topics\\\": [\\\"...\\\"],\\n  \\\"decisions\\\": [\\\"...\\\"],\\n  \\\"actionItems\\\": [\\\"...\\\"],\\n  \\\"rejected\\\": [\\\"...\\\"]\\n}\\n\\nGuidelines:\\n- Prefer concrete topics and decisions.\\n- Action items should be imperative.\\n- Rejected ideas are things that were explicitly discarded or reversed.\\n- If there are none for a section, return an empty array.\\n`;\n\n    const toolStatsLine =\n      Object.keys(toolCounts).length > 0\n        ? `Tools used (counts): ${Object.entries(toolCounts)\n            .sort((a, b) => b[1] - a[1])\n            .slice(0, 10)\n            .map(([k, v]) => `${k}=${v}`)\n            .join(\", \")}\\n\\n`\n        : \"\";\n    const userTurns = entries.filter((e) => e.role === \"user\").length;\n    const assistantTurns = entries.filter((e) => e.role === \"assistant\").length;\n    const toolCalls = Object.values(toolCounts).reduce((a, b) => a + b, 0);\n    const statsLine = `Stats: userTurns=${userTurns}, assistantTurns=${assistantTurns}, toolCalls=${toolCalls}\\n\\n`;\n\n    const user = `Hour: ${hourIso}\\nSession: ${sessionKey}\\n\\n${statsLine}${toolStatsLine}Conversation:\\n${conversation}\\n`;\n\n    if (this.config.backgroundGeneration) {\n      try {\n        const text = await completeBackgroundGeneration(this.config, [\n          { role: \"system\", content: sys },\n          { role: \"user\", content: user },\n        ]);\n        const parsed = parseBackgroundGenerationJson(text, (value) => HourlySummaryExtendedSchema.parse(value));\n        if (parsed) {\n          log.debug(\n            `generated extended hourly summary for ${sessionKey} at ${hourIso} in ${Date.now() - startTime}ms (background)`\n          );\n          return { ...parsed, _meta: { userTurns, assistantTurns, toolCalls, toolCounts } };\n        }\n      } catch {\n        log.info(\"extended summary: background generation unavailable, continuing\");\n      }\n    }\n\n    // Try local LLM first if enabled\n    if (this.shouldUseLocalLlm) {\n      try {\n        const contextSizes = this.modelRegistry.calculateContextSizes(\n          this.config.localLlmModel,\n          this.config.localLlmMaxContext\n        );\n        const truncated =\n          user.length > contextSizes.maxInputChars\n            ? user.slice(0, contextSizes.maxInputChars) + \"\\n\\n[truncated]\"\n            : user;\n        const response = await this.localLlm.chatCompletion(\n          [\n            { role: \"system\", content: \"Output valid JSON only.\" },\n            { role: \"user\", content: sys + \"\\n\\n\" + truncated },\n          ],\n          {\n            temperature: 0.2,\n            maxTokens: contextSizes.maxOutputTokens,\n            operation: \"hourly_summary_extended\",\n            priority: \"background\",\n          }\n        );\n        if (response?.content) {\n          const content = response.content.trim();\n          for (const candidate of extractJsonCandidates(content)) {\n            try {\n              const parsed = JSON.parse(candidate);\n              const result = HourlySummaryExtendedSchema.parse(parsed);\n              log.debug(\n                `generated extended hourly summary for ${sessionKey} at ${hourIso} in ${Date.now() - startTime}ms (local)`\n              );\n              return { ...result, _meta: { userTurns, assistantTurns, toolCalls, toolCounts } };\n            } catch {\n              // keep trying candidates\n            }\n          }\n        }\n      } catch (err) {\n        if (!this.config.localLlmFallback) return null;\n        log.info(\"extended summary: local failed, falling back:\", err);\n      }\n    }\n\n    try {\n      const result = await this.fallbackLlm.parseWithSchema(\n        [\n          { role: \"system\" as const, content: sys },\n          { role: \"user\" as const, content: user },\n        ],\n        HourlySummaryExtendedSchema,\n        this.withGatewayAgent({ temperature: 0.2, maxTokens: 2048 })\n      );\n      if (result) {\n        log.debug(\n          `generated extended hourly summary for ${sessionKey} at ${hourIso} in ${Date.now() - startTime}ms (fallback)`\n        );\n        return { ...result, _meta: { userTurns, assistantTurns, toolCalls, toolCounts } };\n      }\n      return null;\n    } catch (err) {\n      log.error(\"extended summary generation failed\", err);\n      return null;\n    }\n  }\n\n  /**\n   * Generate summary using local LLM with JSON mode.\n   * Uses dynamic context sizing based on model capabilities.\n   */\n  private async generateWithLocalLlm(conversation: string): Promise<HourlySummaryResult | null> {\n    // Get dynamic context sizes based on model capabilities\n    const contextSizes = this.modelRegistry.calculateContextSizes(\n      this.config.localLlmModel,\n      this.config.localLlmMaxContext\n    );\n    log.debug(`Summarizer model context: ${contextSizes.description}`);\n\n    const maxConversationChars = contextSizes.maxInputChars;\n    const truncatedConversation =\n      conversation.length > maxConversationChars\n        ? conversation.slice(0, maxConversationChars) + \"\\n\\n[truncated]\"\n        : conversation;\n\n    const instructions = `You are a conversation summarization system. Summarize the following conversation transcript into 3-5 concise bullet points.\n\nGuidelines:\n- Focus on what was accomplished, decided, or discussed\n- Include specific topics, projects, or entities mentioned\n- Note any significant user requests or agent actions\n- Keep bullets brief but informative (1-2 sentences each)\n- Skip trivial greetings or meta-conversation\n- Use present tense for ongoing work, past for completed items\n\nRespond with valid JSON matching this schema:\n{\n  \"bullets\": [\"bullet 1\", \"bullet 2\", \"bullet 3\"]\n}`;\n\n    const fullPrompt = `${instructions}\\n\\nConversation to summarize:\\n${truncatedConversation}`;\n\n    const response = await this.localLlm.chatCompletion(\n      [\n        { role: \"system\", content: \"You are a conversation summarization system. Output valid JSON only.\" },\n        { role: \"user\", content: fullPrompt },\n      ],\n      {\n        temperature: 0.3,\n        maxTokens: contextSizes.maxOutputTokens,\n        operation: \"hourly_summary\",\n        priority: \"background\",\n      }\n    );\n\n    if (!response?.content) {\n      return null;\n    }\n\n    try {\n      // Parse JSON response\n      const content = response.content.trim();\n      for (const candidate of extractJsonCandidates(content)) {\n        try {\n          const parsed = JSON.parse(candidate);\n          return HourlySummarySchema.parse(parsed);\n        } catch {\n          // keep trying candidates\n        }\n      }\n      return null;\n    } catch (err) {\n      log.warn(\"local LLM summary: failed to parse JSON response:\", err);\n      return null;\n    }\n  }\n\n  // Save summary to file\n  async saveSummary(summary: HourlySummary): Promise<void> {\n    const sessionDir = await this.summarySessionDir(summary.sessionKey);\n    await mkdir(sessionDir, { recursive: true });\n\n    // Format date as YYYY-MM-DD for the filename\n    const dateStr = this.summaryDateString(summary.hour);\n    const filePath = await resolveSafeStoragePath(sessionDir, `${dateStr}.md`);\n\n    // Format hour as HH:00 for display\n    const hourStr = summary.hour.slice(11, 13);\n\n    // Build markdown content\n    const lines: string[] = [];\n\n    // Check if file exists to append or create\n    let existingContent = \"\";\n    try {\n      existingContent = await readFile(filePath, \"utf-8\");\n    } catch {\n      // File doesn't exist yet, will create new\n    }\n\n    // Check if this hour already exists (idempotent)\n    const hourHeader = `## ${hourStr}:00`;\n    if (existingContent.includes(hourHeader)) {\n      // Replace existing hour section\n      const headerMatch = new RegExp(`(^|\\\\n)${escapeRegExp(hourHeader)}\\\\n`).exec(existingContent);\n      const sectionStart = headerMatch\n        ? headerMatch.index + headerMatch[1].length\n        : existingContent.indexOf(hourHeader);\n      const nextHeaderPattern = /\\n## \\d{2}:00\\n/g;\n      nextHeaderPattern.lastIndex = sectionStart + hourHeader.length;\n      const nextHeader = nextHeaderPattern.exec(existingContent);\n      const beforeHour = existingContent.slice(0, sectionStart);\n      const afterHour = nextHeader ? existingContent.slice(nextHeader.index + 1) : \"\";\n      const newSection = this.formatHourSection(summary, hourHeader);\n      existingContent = beforeHour + newSection.trimEnd() + (afterHour ? \"\\n\\n\" + afterHour : \"\\n\");\n\n      await writeFile(filePath, existingContent, \"utf-8\");\n      log.debug(`updated hourly summary for ${summary.sessionKey} at ${hourStr}:00`);\n    } else {\n      // Append new hour section\n      const newSection = this.formatHourSection(summary, hourHeader);\n\n      if (existingContent) {\n        // Add to existing file\n        await writeFile(filePath, existingContent.trimEnd() + \"\\n\\n\" + newSection, \"utf-8\");\n      } else {\n        // Create new file with header\n        const header = `# Hourly Summaries — ${dateStr}\\n\\n*Session: ${summary.sessionKey}*\\n`;\n        await writeFile(filePath, header + \"\\n\" + newSection, \"utf-8\");\n      }\n      log.debug(`saved hourly summary for ${summary.sessionKey} at ${hourStr}:00`);\n    }\n    try {\n      await upsertSummarySnapshot(this.config.memoryDir, summary);\n    } catch (error) {\n      log.warn(\n        `hourly summarizer: failed to update summary snapshot for ${summary.sessionKey} (fail-open): ${String(error)}`\n      );\n    }\n  }\n\n  private formatHourSection(summary: HourlySummary, hourHeader: string): string {\n    const ext = (summary as any)._extended as\n      | (HourlySummaryExtendedResult & { _meta?: HourlySummaryExtendedMeta })\n      | undefined;\n    const meta = (summary as any)._extendedMeta as HourlySummaryExtendedMeta | undefined;\n    const lines: string[] = [hourHeader, \"\"];\n\n    if (resolvePipelineProcessingCapabilities(this.config).hourlySummariesExtended && ext) {\n      lines.push(\"### Topics Discussed\");\n      for (const t of ext.topics) lines.push(`- ${t}`);\n      lines.push(\"\");\n      lines.push(\"### Decisions Made\");\n      for (const d of ext.decisions) lines.push(`- ${d}`);\n      lines.push(\"\");\n      lines.push(\"### Action Items\");\n      for (const a of ext.actionItems) lines.push(`- ${a}`);\n      lines.push(\"\");\n      lines.push(\"### Rejected Ideas / Reversals\");\n      for (const r of ext.rejected) lines.push(`- ${r}`);\n      lines.push(\"\");\n      if (meta && Object.keys(meta.toolCounts).length > 0) {\n        lines.push(\"### Tools Used\");\n        const top = Object.entries(meta.toolCounts)\n          .sort((a, b) => b[1] - a[1])\n          .slice(0, 12);\n        for (const [name, count] of top) lines.push(`- ${name}: ${count}`);\n        lines.push(\"\");\n      }\n      lines.push(\"### Stats\");\n      lines.push(`- Turns: ${summary.turnCount}`);\n      if (meta) {\n        lines.push(`- User turns: ${meta.userTurns}`);\n        lines.push(`- Assistant turns: ${meta.assistantTurns}`);\n        lines.push(`- Tool calls: ${meta.toolCalls}`);\n      }\n      lines.push(\"\");\n      return lines.join(\"\\n\");\n    }\n\n    for (const bullet of summary.bullets) lines.push(`- ${bullet}`);\n    lines.push(`  *(${summary.turnCount} turns)*`);\n    lines.push(\"\");\n    return lines.join(\"\\n\");\n  }\n\n  // Read recent summaries for recall injection\n  async readRecent(sessionKey: string, hours: number): Promise<HourlySummary[]> {\n    try {\n      const cutoffTime = Date.now() - hours * 60 * 60 * 1000;\n\n      const snapshot = await readSummarySnapshot(this.config.memoryDir, sessionKey);\n      if (snapshot) {\n        return snapshot\n          .filter((s) => new Date(s.hour).getTime() >= cutoffTime)\n          .sort((a, b) => new Date(b.hour).getTime() - new Date(a.hour).getTime());\n      }\n\n      const summaries: HourlySummary[] = [];\n      const encodedDir = await this.summarySessionDir(sessionKey);\n      const legacyDir = await this.legacySummarySessionDir(sessionKey);\n      const seenDirs = new Set<string>();\n\n      for (const sessionDir of [encodedDir, legacyDir]) {\n        if (!sessionDir || seenDirs.has(sessionDir)) continue;\n        seenDirs.add(sessionDir);\n        const parsed = await this.readSummaryDir(sessionDir, sessionKey);\n        summaries.push(...parsed);\n      }\n\n      const byHour = new Map<string, HourlySummary>();\n      for (const summary of summaries) {\n        if (!byHour.has(summary.hour)) byHour.set(summary.hour, summary);\n      }\n\n      const sortedSummaries = Array.from(byHour.values()).sort(\n        (a, b) => new Date(b.hour).getTime() - new Date(a.hour).getTime()\n      );\n\n      // Filter to recent hours while materializing the full parsed history.\n      const recent = sortedSummaries.filter((s) => new Date(s.hour).getTime() >= cutoffTime);\n\n      if (sortedSummaries.length > 0) {\n        try {\n          await writeSummarySnapshot(this.config.memoryDir, sessionKey, sortedSummaries);\n        } catch (error) {\n          log.warn(\n            `hourly summarizer: failed to materialize summary snapshot for ${sessionKey} (fail-open): ${String(error)}`\n          );\n        }\n      }\n\n      return recent;\n    } catch {\n      // Directory doesn't exist or error reading\n      return [];\n    }\n  }\n\n  private async readSummaryDir(sessionDir: string, sessionKey: string): Promise<HourlySummary[]> {\n    let files: string[];\n    try {\n      files = await readdir(sessionDir);\n    } catch {\n      return [];\n    }\n\n    const summaries: HourlySummary[] = [];\n    const mdFiles = files.filter((f) => f.endsWith(\".md\"));\n    for (const file of mdFiles) {\n      const filePath = await resolveSafeStoragePath(sessionDir, file).catch(() => null);\n      if (filePath === null) continue;\n\n      try {\n        const content = await readFile(filePath, \"utf-8\");\n        summaries.push(...this.parseSummaryFile(content, sessionKey, file));\n      } catch {\n        // Skip unreadable summary files.\n      }\n    }\n\n    return summaries;\n  }\n\n  private parseSummaryFile(content: string, sessionKey: string, filename: string): HourlySummary[] {\n    const summaries: HourlySummary[] = [];\n\n    // Extract date from filename (YYYY-MM-DD.md)\n    const dateMatch = filename.match(/^(\\d{4}-\\d{2}-\\d{2})\\.md$/);\n    if (!dateMatch) return summaries;\n    const dateStr = dateMatch[1];\n\n    // Split by hour sections\n    const hourSections = content.split(/\\n## (\\d{2}):00\\n/);\n\n    // First element is the header, skip it\n    for (let i = 1; i < hourSections.length; i += 2) {\n      const hourStr = hourSections[i];\n      const sectionContent = hourSections[i + 1] || \"\";\n\n      // Parse bullets\n      const bullets: string[] = [];\n      const lines = sectionContent.split(\"\\n\");\n      let turnCount = 0;\n\n      let inTopics = false;\n      let sawExtendedTopicsHeader = false;\n      for (const line of lines) {\n        if (line.startsWith(\"### Topics\")) {\n          inTopics = true;\n          sawExtendedTopicsHeader = true;\n          continue;\n        }\n        if (line.startsWith(\"### \") && !line.startsWith(\"### Topics\")) {\n          inTopics = false;\n        }\n        const bulletMatch = line.match(/^- (.+)$/);\n        if (bulletMatch) {\n          // For extended format, only treat topic bullets as recall bullets.\n          if (!sawExtendedTopicsHeader || inTopics) bullets.push(bulletMatch[1]);\n        }\n        const turnMatch = line.match(/\\((\\d+) turns?\\)/);\n        if (turnMatch) turnCount = parseInt(turnMatch[1], 10);\n      }\n\n      if (bullets.length > 0) {\n        summaries.push({\n          hour: `${dateStr}T${hourStr}:00:00.000Z`,\n          sessionKey,\n          bullets,\n          turnCount,\n          generatedAt: \"\", // Not stored in file, not needed for recall\n        });\n      }\n    }\n\n    return summaries;\n  }\n\n  // Format summaries for recall injection\n  formatForRecall(summaries: HourlySummary[], maxCount: number): string {\n    if (summaries.length === 0) return \"\";\n\n    const limited = summaries.slice(0, maxCount);\n    const lines: string[] = [`## Recent Activity (last ${limited.length} hours)`];\n\n    for (const summary of limited) {\n      const hourStr = summary.hour.slice(11, 16); // HH:MM\n      for (const bullet of summary.bullets) {\n        lines.push(`- ${hourStr}: ${bullet}`);\n      }\n    }\n\n    return lines.join(\"\\n\");\n  }\n\n  // Main entry point for cron job\n  async runHourly(): Promise<HourlySummarizerRunStats> {\n    log.debug(\"running hourly summary generation\");\n\n    // Get active sessions from transcript. The scan outcome is kept LOCAL to\n    // this invocation (review round 2): shared instance state would let two\n    // concurrent runHourly calls cross-report each other's timestamps.\n    const scan = await this.getActiveSessions();\n    const sessions = scan.sessionKeys;\n    let sessionsWithEntries = 0;\n    let summariesWritten = 0;\n\n    for (const sessionKey of sessions) {\n      // Calculate the hour we want to summarize (previous hour)\n      const now = new Date();\n      const hourStart = new Date(now.getTime() - 60 * 60 * 1000);\n      hourStart.setMinutes(0, 0, 0);\n      const hourEnd = new Date(hourStart.getTime() + 60 * 60 * 1000);\n\n      // Get entries for this session in the target hour\n      const entries = await this.getTranscriptEntries(sessionKey, hourStart, hourEnd);\n\n      if (entries.length === 0) {\n        log.debug(`no transcript entries for ${sessionKey} at ${hourStart.toISOString()}`);\n        continue;\n      }\n      sessionsWithEntries += 1;\n\n      // Generate and save summary\n      const summary = await this.generateSummary(sessionKey, hourStart, entries);\n      if (summary) {\n        await this.saveSummary(summary);\n        summariesWritten += 1;\n        log.info(`generated hourly summary for ${sessionKey} (${entries.length} turns)`);\n      }\n    }\n\n    return {\n      sessionsConsidered: sessions.length,\n      sessionsWithEntries,\n      summariesWritten,\n      // Staleness signal (issue #2783): newest entry across the whole\n      // store, from the same scan getActiveSessions already performs.\n      staleStore:\n        scan.newestEntryTimestamp !== null &&\n        Date.now() - new Date(scan.newestEntryTimestamp).getTime() > STALE_STORE_MS,\n      newestEntryTimestamp: scan.newestEntryTimestamp,\n      scanFailed: scan.scanFailed,\n    };\n  }\n\n  // Get list of active sessions from the transcript directory, plus the\n  // scan bookkeeping runHourly reports: newest entry timestamp (staleness\n  // signal) and whether the scan itself FAILED. A failed scan must not be\n  // reported as an empty store — those are different incidents (review\n  // round 2).\n  private async getActiveSessions(): Promise<{\n    sessionKeys: string[];\n    newestEntryTimestamp: string | null;\n    scanFailed: boolean;\n  }> {\n    const transcriptDir = await resolveSafeStoragePath(this.config.memoryDir, \"transcripts\").catch(() => null);\n    if (transcriptDir === null) {\n      return { sessionKeys: [], newestEntryTimestamp: null, scanFailed: false };\n    }\n\n    const sessionKeys = new Set<string>();\n    let newestEntryTimestamp: string | null = null;\n    let newestEntryTimeMs = Number.NaN;\n    let fileReadFailed = false;\n    const collect = async (transcriptPath: string): Promise<void> => {\n      try {\n        const raw = await readFile(transcriptPath, \"utf-8\");\n        for (const line of raw.split(\"\\n\")) {\n          if (!line.trim()) continue;\n          try {\n            const entry = JSON.parse(line) as TranscriptEntry;\n            if (typeof entry.sessionKey === \"string\" && entry.sessionKey.length > 0) {\n              sessionKeys.add(entry.sessionKey);\n            }\n            // Compare parsed epoch values, never strings: a malformed\n            // timestamp in a hand-edited file must not poison the staleness\n            // signal with a lexically-maximal garbage value (review).\n            if (typeof entry.timestamp === \"string\") {\n              const timeMs = new Date(entry.timestamp).getTime();\n              if (Number.isFinite(timeMs) && (Number.isNaN(newestEntryTimeMs) || timeMs > newestEntryTimeMs)) {\n                newestEntryTimeMs = timeMs;\n                newestEntryTimestamp = entry.timestamp;\n              }\n            }\n          } catch {\n            // ignore malformed transcript lines\n          }\n        }\n      } catch (err) {\n        // ENOENT is a concurrently-deleted file — ignore. Any other read\n        // failure (permissions, I/O) means the store is partially UNREADABLE:\n        // mark the scan failed so the caller warns instead of reporting an\n        // empty store (review round 3).\n        if ((err as NodeJS.ErrnoException)?.code !== \"ENOENT\") {\n          fileReadFailed = true;\n        }\n      }\n    };\n\n    try {\n      const typeEntries = await readdir(transcriptDir, { withFileTypes: true });\n      for (const typeEnt of typeEntries) {\n        if (!typeEnt.isDirectory()) continue;\n        const typeDir = await resolveSafeStoragePath(transcriptDir, typeEnt.name).catch(() => null);\n        if (typeDir === null) continue;\n        const idEntries = await readdir(typeDir, { withFileTypes: true });\n        for (const idEnt of idEntries) {\n          if (!idEnt.isDirectory()) continue;\n          const chanDir = await resolveSafeStoragePath(typeDir, idEnt.name).catch(() => null);\n          if (chanDir === null) continue;\n          const files = (await readdir(chanDir)).filter((f) => f.endsWith(\".jsonl\")).sort();\n          for (const file of files) {\n            const transcriptPath = await resolveSafeStoragePath(chanDir, file).catch(() => null);\n            if (transcriptPath === null) continue;\n            await collect(transcriptPath);\n          }\n        }\n      }\n      return {\n        sessionKeys: Array.from(sessionKeys),\n        newestEntryTimestamp,\n        scanFailed: fileReadFailed,\n      };\n    } catch (err) {\n      // ENOENT on the root is a never-written store — an EMPTY store, not a\n      // scan failure (those are different incidents).\n      const code = (err as NodeJS.ErrnoException)?.code;\n      if (code === \"ENOENT\") {\n        return { sessionKeys: [], newestEntryTimestamp: null, scanFailed: false };\n      }\n      log.warn(`transcript scan failed: ${err}`);\n      return { sessionKeys: [], newestEntryTimestamp: null, scanFailed: true };\n    }\n  }\n\n  // Get transcript entries for a session within a time range\n  private async getTranscriptEntries(sessionKey: string, startTime: Date, endTime: Date): Promise<TranscriptEntry[]> {\n    // Shared session-identity layer (issue #1496, rule #22). Arbitrary keys\n    // route to `session/<hash>`; legacy `agent:<id>:...` keep their paths. The\n    // shared helper also supplies the read-back-only candidate dirs (mirrors\n    // TranscriptManager) so legacy `other/default` AND old `parts.length >= 3`\n    // data stays discoverable here too.\n    const paths = sessionStoragePaths(sessionKey);\n\n    try {\n      const transcriptRoot = path.join(this.config.memoryDir, \"transcripts\");\n      const candidateDirs = new Set(\n        [paths.dir, paths.alternateDir, paths.legacyDir, ...paths.readbackDirs].filter(\n          (dir): dir is string => typeof dir === \"string\" && dir.length > 0\n        )\n      );\n      const entries: TranscriptEntry[] = [];\n      // Dedup identical raw rows that a partially-applied migration may have\n      // left in both the primary dir and a read-back dir (issue #1496, cursor\n      // review). Exact raw JSONL line is the stable identity.\n      const seenRawLines = new Set<string>();\n\n      // Read all daily transcript files in the directory\n      for (const candidateDir of candidateDirs) {\n        const transcriptDir = await resolveSafeStoragePath(transcriptRoot, candidateDir).catch(() => null);\n        if (transcriptDir === null) continue;\n\n        const files = await readdir(transcriptDir).catch(() => []);\n        for (const file of files) {\n          if (!file.endsWith(\".jsonl\")) continue;\n\n          const transcriptPath = await resolveSafeStoragePath(transcriptDir, file).catch(() => null);\n          if (transcriptPath === null) continue;\n\n          try {\n            const content = await readFile(transcriptPath, \"utf-8\");\n            const lines = content.trim().split(\"\\n\");\n\n            for (const line of lines) {\n              if (!line.trim()) continue;\n              try {\n                const entry = JSON.parse(line) as TranscriptEntry;\n                const entryTime = new Date(entry.timestamp).getTime();\n\n                if (\n                  entry.sessionKey === sessionKey &&\n                  entryTime >= startTime.getTime() &&\n                  entryTime < endTime.getTime() &&\n                  !seenRawLines.has(line)\n                ) {\n                  seenRawLines.add(line);\n                  entries.push(entry);\n                }\n              } catch {\n                // Skip malformed lines\n              }\n            }\n          } catch {\n            // Skip unreadable files\n          }\n        }\n      }\n\n      return entries;\n    } catch {\n      return [];\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAS,OAAO,UAAU,WAAW,eAAe;AACpD,OAAO,UAAU;AACjB,SAAS,SAAS;AAmBlB,IAAM,sBAAsB,EAAE,OAAO;AAAA,EACnC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,SAAS,mDAAmD;AAChH,CAAC;AAID,IAAM,8BAA8B,EAAE,OAAO;AAAA,EAC3C,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,EACtC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,EACzC,aAAa,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,EAC3C,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;AAC1C,CAAC;AAWD,SAAS,aAAa,OAAuB;AAC3C,SAAO,MAAM,QAAQ,uBAAuB,MAAM;AACpD;AAqBA,IAAM,iBAAiB,IAAI,KAAK,KAAK;AAQ9B,SAAS,sBAAsB,OAGpC;AACA,MAAI,MAAM,YAAY;AACpB,WAAO;AAAA,MACL,SACE;AAAA,MACF,SAAS;AAAA,IACX;AAAA,EACF;AACA,MAAI,MAAM,uBAAuB,GAAG;AAClC,WAAO;AAAA,MACL,SACE;AAAA,MACF,SAAS;AAAA,IACX;AAAA,EACF;AACA,MAAI,MAAM,sBAAsB,KAAK,MAAM,qBAAqB,GAAG;AACjE,WAAO;AAAA,MACL,SAAS,8BAA8B,MAAM,mBAAmB;AAAA,MAChE,SAAS;AAAA,IACX;AAAA,EACF;AACA,MAAI,MAAM,wBAAwB,KAAK,MAAM,YAAY;AACvD,WAAO;AAAA,MACL,SAAS,0HAA0H,MAAM,wBAAwB,SAAS;AAAA,MAC1K,SAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AAAA,IACL,SAAS,mCAAmC,MAAM,gBAAgB,UAAU,MAAM,qBAAqB,IAAI,MAAM,KAAK,mBAAmB,MAAM,mBAAmB,WAAW,MAAM,wBAAwB,IAAI,KAAK,GAAG;AAAA,EACzN;AACF;AAEO,IAAM,mBAAN,MAAuB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAER,YACE,QACA,eACA,eACA,YACA;AACA,SAAK,SAAS;AACd,SAAK,eAAe,KAAK,KAAK,OAAO,WAAW,aAAa,QAAQ;AACrE,SAAK,gBAAgB,iBAAiB,IAAI,cAAc,OAAO,SAAS;AACxE,SAAK,aAAa;AAGlB,SAAK,WAAW,IAAI,eAAe,QAAQ,KAAK,aAAa;AAG7D,SAAK,cAAc,IAAI,kBAAkB,eAAe,oCAAoC,MAAM,CAAC;AAEnG,QACE,CAAC,eAAe,QAAQ,UAAU,OAAO,WACzC,CAAC,4BAA4B,MAAM,EAAE,YACrC,OAAO,gBAAgB,WACvB;AACA,UAAI,KAAK,mFAA8E;AAAA,IACzF;AAAA,EACF;AAAA,EAEA,IAAY,wBAAiC;AAC3C,WAAO,KAAK,OAAO,gBAAgB;AAAA,EACrC;AAAA,EAEA,IAAY,oBAA6B;AACvC,WAAO,4BAA4B,KAAK,MAAM,EAAE,YAAY,CAAC,KAAK;AAAA,EACpE;AAAA,EAEQ,iBACN,SACgD;AAChD,QAAI,CAAC,KAAK,sBAAuB,QAAO;AAExC,WAAO,EAAE,GAAG,SAAS,GAAG,wBAAwB,KAAK,MAAM,EAAE;AAAA,EAC/D;AAAA,EAEA,MAAM,aAA4B;AAChC,UAAM,MAAM,KAAK,cAAc,EAAE,WAAW,KAAK,CAAC;AAClD,QAAI,KAAK,+BAA+B;AAAA,EAC1C;AAAA,EAEA,MAAc,kBAAkB,YAAqC;AACnE,WAAO,uBAAuB,KAAK,cAAc,yBAAyB,YAAY,SAAS,CAAC;AAAA,EAClG;AAAA,EAEA,MAAc,wBAAwB,YAA4C;AAChF,QAAI,WAAW,SAAS,IAAI,EAAG,QAAO;AACtC,QAAI;AACF,aAAO,MAAM,uBAAuB,KAAK,cAAc,UAAU;AAAA,IACnE,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEQ,kBAAkB,MAAsB;AAC9C,UAAM,UAAU,KAAK,MAAM,GAAG,EAAE;AAChC,QAAI,CAAC,sBAAsB,KAAK,OAAO,GAAG;AACxC,YAAM,IAAI,MAAM,qCAAqC,IAAI,EAAE;AAAA,IAC7D;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,gBACJ,YACA,WACA,SAC+B;AAC/B,QAAI,QAAQ,WAAW,EAAG,QAAO;AAGjC,UAAM,eAAe,QAAQ,IAAI,CAAC,MAAM,IAAI,EAAE,IAAI,KAAK,EAAE,OAAO,EAAE,EAAE,KAAK,MAAM;AAE/E,QAAI,sCAAsC,KAAK,MAAM,EAAE,yBAAyB;AAC9E,YAAM,WAAW,MAAM,KAAK,iBAAiB,YAAY,WAAW,cAAc,OAAO;AACzF,UAAI,CAAC,SAAU,QAAO;AACtB,YAAM,OAAkC;AAAA,QACtC,WAAW,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE;AAAA,QACpD,gBAAgB,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE;AAAA,QAC9D,WAAW,SAAS,MAAM;AAAA,QAC1B,YAAY,SAAS,MAAM;AAAA,MAC7B;AAEA,YAAM,OAAsB;AAAA,QAC1B,MAAM,UAAU,YAAY;AAAA,QAC5B;AAAA,QACA,SAAS,SAAS,OAAO,SAAS,IAAI,SAAS,OAAO,MAAM,GAAG,CAAC,IAAI,CAAC,qBAAqB;AAAA,QAC1F,WAAW,QAAQ;AAAA,QACnB,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,MACtC;AACA,YAAM,aAAa;AACnB,iBAAW,YAAY;AACvB,iBAAW,gBAAgB;AAC3B,aAAO;AAAA,IACT;AAEA,UAAM,UAAU,UAAU,YAAY;AACtC,UAAM,YAAY,KAAK,IAAI;AAE3B,QAAI,KAAK,OAAO,sBAAsB;AACpC,UAAI;AACF,cAAM,OAAO,MAAM,6BAA6B,KAAK,QAAQ;AAAA,UAC3D;AAAA,YACE,MAAM;AAAA,YACN,SACE;AAAA,UACJ;AAAA,UACA,EAAE,MAAM,QAAQ,SAAS;AAAA;AAAA,EAAmC,YAAY,GAAG;AAAA,QAC7E,CAAC;AACD,cAAM,SAAS,8BAA8B,MAAM,CAAC,UAAU,oBAAoB,MAAM,KAAK,CAAC;AAC9F,YAAI,QAAQ;AACV,iBAAO;AAAA,YACL,MAAM;AAAA,YACN;AAAA,YACA,SAAS,OAAO;AAAA,YAChB,WAAW,QAAQ;AAAA,YACnB,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,UACtC;AAAA,QACF;AAAA,MACF,QAAQ;AACN,YAAI,KAAK,mEAAmE;AAAA,MAC9E;AAAA,IACF;AAGA,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,cAAc,MAAM,KAAK,qBAAqB,YAAY;AAChE,YAAI,aAAa;AACf,gBAAM,aAAa,KAAK,IAAI,IAAI;AAChC,cAAI,MAAM,gCAAgC,UAAU,OAAO,OAAO,OAAO,UAAU,oBAAoB;AACvG,iBAAO;AAAA,YACL,MAAM;AAAA,YACN;AAAA,YACA,SAAS,YAAY;AAAA,YACrB,WAAW,QAAQ;AAAA,YACnB,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,UACtC;AAAA,QACF;AAEA,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,4DAA4D;AACrE,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,+EAA+E;AAAA,MAC1F,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,kBAAkB;AACjC,cAAI,KAAK,8DAA8D,GAAG;AAC1E,iBAAO;AAAA,QACT;AACA,YAAI,KAAK,4EAA4E,GAAG;AAAA,MAC1F;AAAA,IACF;AAGA,QAAI,KAAK,wDAAwD;AAEjE,QAAI;AACF,YAAM,WAAW;AAAA,QACf;AAAA,UACE,MAAM;AAAA,UACN,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,QAcX;AAAA,QACA,EAAE,MAAM,QAAiB,SAAS;AAAA;AAAA,EAAmC,YAAY,GAAG;AAAA,MACtF;AAEA,YAAM,SAAS,MAAM,KAAK,YAAY;AAAA,QACpC;AAAA,QACA;AAAA,QACA,KAAK,iBAAiB,EAAE,aAAa,KAAK,WAAW,KAAK,CAAC;AAAA,MAC7D;AAEA,YAAM,aAAa,KAAK,IAAI,IAAI;AAEhC,UAAI,QAAQ;AACV,YAAI,MAAM,gCAAgC,UAAU,OAAO,OAAO,OAAO,UAAU,iBAAiB;AACpG,eAAO;AAAA,UACL,MAAM;AAAA,UACN;AAAA,UACA,SAAS,OAAO;AAAA,UAChB,WAAW,QAAQ;AAAA,UACnB,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,QACtC;AAAA,MACF;AAEA,UAAI,KAAK,uDAAuD;AAChE,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,MAAM,sCAAsC,GAAG;AACnD,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAc,iBACZ,YACA,WACA,cACA,SACsF;AACtF,UAAM,UAAU,UAAU,YAAY;AACtC,UAAM,YAAY,KAAK,IAAI;AAE3B,UAAM,UAAU,IAAI,KAAK,UAAU,QAAQ,IAAI,KAAK,KAAK,GAAI;AAC7D,QAAI,aAAqC,CAAC;AAC1C,QAAI,KAAK,OAAO,mCAAmC,KAAK,YAAY;AAClE,YAAM,OAAO,MAAM,KAAK,WAAW,YAAY,YAAY,WAAW,OAAO;AAC7E,iBAAW,KAAK,KAAM,YAAW,EAAE,IAAI,KAAK,WAAW,EAAE,IAAI,KAAK,KAAK;AAAA,IACzE;AAEA,UAAM,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAEZ,UAAM,gBACJ,OAAO,KAAK,UAAU,EAAE,SAAS,IAC7B,wBAAwB,OAAO,QAAQ,UAAU,EAC9C,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,EAAE,EACX,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,EAC3B,KAAK,IAAI,CAAC;AAAA;AAAA,IACb;AACN,UAAM,YAAY,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE;AAC3D,UAAM,iBAAiB,QAAQ,OAAO,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE;AACrE,UAAM,YAAY,OAAO,OAAO,UAAU,EAAE,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AACrE,UAAM,YAAY,oBAAoB,SAAS,oBAAoB,cAAc,eAAe,SAAS;AAAA;AAAA;AAEzG,UAAM,OAAO,SAAS,OAAO;AAAA,WAAc,UAAU;AAAA;AAAA,EAAO,SAAS,GAAG,aAAa;AAAA,EAAkB,YAAY;AAAA;AAEnH,QAAI,KAAK,OAAO,sBAAsB;AACpC,UAAI;AACF,cAAM,OAAO,MAAM,6BAA6B,KAAK,QAAQ;AAAA,UAC3D,EAAE,MAAM,UAAU,SAAS,IAAI;AAAA,UAC/B,EAAE,MAAM,QAAQ,SAAS,KAAK;AAAA,QAChC,CAAC;AACD,cAAM,SAAS,8BAA8B,MAAM,CAAC,UAAU,4BAA4B,MAAM,KAAK,CAAC;AACtG,YAAI,QAAQ;AACV,cAAI;AAAA,YACF,yCAAyC,UAAU,OAAO,OAAO,OAAO,KAAK,IAAI,IAAI,SAAS;AAAA,UAChG;AACA,iBAAO,EAAE,GAAG,QAAQ,OAAO,EAAE,WAAW,gBAAgB,WAAW,WAAW,EAAE;AAAA,QAClF;AAAA,MACF,QAAQ;AACN,YAAI,KAAK,iEAAiE;AAAA,MAC5E;AAAA,IACF;AAGA,QAAI,KAAK,mBAAmB;AAC1B,UAAI;AACF,cAAM,eAAe,KAAK,cAAc;AAAA,UACtC,KAAK,OAAO;AAAA,UACZ,KAAK,OAAO;AAAA,QACd;AACA,cAAM,YACJ,KAAK,SAAS,aAAa,gBACvB,KAAK,MAAM,GAAG,aAAa,aAAa,IAAI,oBAC5C;AACN,cAAM,WAAW,MAAM,KAAK,SAAS;AAAA,UACnC;AAAA,YACE,EAAE,MAAM,UAAU,SAAS,0BAA0B;AAAA,YACrD,EAAE,MAAM,QAAQ,SAAS,MAAM,SAAS,UAAU;AAAA,UACpD;AAAA,UACA;AAAA,YACE,aAAa;AAAA,YACb,WAAW,aAAa;AAAA,YACxB,WAAW;AAAA,YACX,UAAU;AAAA,UACZ;AAAA,QACF;AACA,YAAI,UAAU,SAAS;AACrB,gBAAM,UAAU,SAAS,QAAQ,KAAK;AACtC,qBAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,gBAAI;AACF,oBAAM,SAAS,KAAK,MAAM,SAAS;AACnC,oBAAM,SAAS,4BAA4B,MAAM,MAAM;AACvD,kBAAI;AAAA,gBACF,yCAAyC,UAAU,OAAO,OAAO,OAAO,KAAK,IAAI,IAAI,SAAS;AAAA,cAChG;AACA,qBAAO,EAAE,GAAG,QAAQ,OAAO,EAAE,WAAW,gBAAgB,WAAW,WAAW,EAAE;AAAA,YAClF,QAAQ;AAAA,YAER;AAAA,UACF;AAAA,QACF;AAAA,MACF,SAAS,KAAK;AACZ,YAAI,CAAC,KAAK,OAAO,iBAAkB,QAAO;AAC1C,YAAI,KAAK,iDAAiD,GAAG;AAAA,MAC/D;AAAA,IACF;AAEA,QAAI;AACF,YAAM,SAAS,MAAM,KAAK,YAAY;AAAA,QACpC;AAAA,UACE,EAAE,MAAM,UAAmB,SAAS,IAAI;AAAA,UACxC,EAAE,MAAM,QAAiB,SAAS,KAAK;AAAA,QACzC;AAAA,QACA;AAAA,QACA,KAAK,iBAAiB,EAAE,aAAa,KAAK,WAAW,KAAK,CAAC;AAAA,MAC7D;AACA,UAAI,QAAQ;AACV,YAAI;AAAA,UACF,yCAAyC,UAAU,OAAO,OAAO,OAAO,KAAK,IAAI,IAAI,SAAS;AAAA,QAChG;AACA,eAAO,EAAE,GAAG,QAAQ,OAAO,EAAE,WAAW,gBAAgB,WAAW,WAAW,EAAE;AAAA,MAClF;AACA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,MAAM,sCAAsC,GAAG;AACnD,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAc,qBAAqB,cAA2D;AAE5F,UAAM,eAAe,KAAK,cAAc;AAAA,MACtC,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACd;AACA,QAAI,MAAM,6BAA6B,aAAa,WAAW,EAAE;AAEjE,UAAM,uBAAuB,aAAa;AAC1C,UAAM,wBACJ,aAAa,SAAS,uBAClB,aAAa,MAAM,GAAG,oBAAoB,IAAI,oBAC9C;AAEN,UAAM,eAAe;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAerB,UAAM,aAAa,GAAG,YAAY;AAAA;AAAA;AAAA,EAAmC,qBAAqB;AAE1F,UAAM,WAAW,MAAM,KAAK,SAAS;AAAA,MACnC;AAAA,QACE,EAAE,MAAM,UAAU,SAAS,uEAAuE;AAAA,QAClG,EAAE,MAAM,QAAQ,SAAS,WAAW;AAAA,MACtC;AAAA,MACA;AAAA,QACE,aAAa;AAAA,QACb,WAAW,aAAa;AAAA,QACxB,WAAW;AAAA,QACX,UAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,UAAU,SAAS;AACtB,aAAO;AAAA,IACT;AAEA,QAAI;AAEF,YAAM,UAAU,SAAS,QAAQ,KAAK;AACtC,iBAAW,aAAa,sBAAsB,OAAO,GAAG;AACtD,YAAI;AACF,gBAAM,SAAS,KAAK,MAAM,SAAS;AACnC,iBAAO,oBAAoB,MAAM,MAAM;AAAA,QACzC,QAAQ;AAAA,QAER;AAAA,MACF;AACA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,KAAK,qDAAqD,GAAG;AACjE,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,MAAM,YAAY,SAAuC;AACvD,UAAM,aAAa,MAAM,KAAK,kBAAkB,QAAQ,UAAU;AAClE,UAAM,MAAM,YAAY,EAAE,WAAW,KAAK,CAAC;AAG3C,UAAM,UAAU,KAAK,kBAAkB,QAAQ,IAAI;AACnD,UAAM,WAAW,MAAM,uBAAuB,YAAY,GAAG,OAAO,KAAK;AAGzE,UAAM,UAAU,QAAQ,KAAK,MAAM,IAAI,EAAE;AAGzC,UAAM,QAAkB,CAAC;AAGzB,QAAI,kBAAkB;AACtB,QAAI;AACF,wBAAkB,MAAM,SAAS,UAAU,OAAO;AAAA,IACpD,QAAQ;AAAA,IAER;AAGA,UAAM,aAAa,MAAM,OAAO;AAChC,QAAI,gBAAgB,SAAS,UAAU,GAAG;AAExC,YAAM,cAAc,IAAI,OAAO,UAAU,aAAa,UAAU,CAAC,KAAK,EAAE,KAAK,eAAe;AAC5F,YAAM,eAAe,cACjB,YAAY,QAAQ,YAAY,CAAC,EAAE,SACnC,gBAAgB,QAAQ,UAAU;AACtC,YAAM,oBAAoB;AAC1B,wBAAkB,YAAY,eAAe,WAAW;AACxD,YAAM,aAAa,kBAAkB,KAAK,eAAe;AACzD,YAAM,aAAa,gBAAgB,MAAM,GAAG,YAAY;AACxD,YAAM,YAAY,aAAa,gBAAgB,MAAM,WAAW,QAAQ,CAAC,IAAI;AAC7E,YAAM,aAAa,KAAK,kBAAkB,SAAS,UAAU;AAC7D,wBAAkB,aAAa,WAAW,QAAQ,KAAK,YAAY,SAAS,YAAY;AAExF,YAAM,UAAU,UAAU,iBAAiB,OAAO;AAClD,UAAI,MAAM,8BAA8B,QAAQ,UAAU,OAAO,OAAO,KAAK;AAAA,IAC/E,OAAO;AAEL,YAAM,aAAa,KAAK,kBAAkB,SAAS,UAAU;AAE7D,UAAI,iBAAiB;AAEnB,cAAM,UAAU,UAAU,gBAAgB,QAAQ,IAAI,SAAS,YAAY,OAAO;AAAA,MACpF,OAAO;AAEL,cAAM,SAAS,6BAAwB,OAAO;AAAA;AAAA,YAAiB,QAAQ,UAAU;AAAA;AACjF,cAAM,UAAU,UAAU,SAAS,OAAO,YAAY,OAAO;AAAA,MAC/D;AACA,UAAI,MAAM,4BAA4B,QAAQ,UAAU,OAAO,OAAO,KAAK;AAAA,IAC7E;AACA,QAAI;AACF,YAAM,sBAAsB,KAAK,OAAO,WAAW,OAAO;AAAA,IAC5D,SAAS,OAAO;AACd,UAAI;AAAA,QACF,4DAA4D,QAAQ,UAAU,iBAAiB,OAAO,KAAK,CAAC;AAAA,MAC9G;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,kBAAkB,SAAwB,YAA4B;AAC5E,UAAM,MAAO,QAAgB;AAG7B,UAAM,OAAQ,QAAgB;AAC9B,UAAM,QAAkB,CAAC,YAAY,EAAE;AAEvC,QAAI,sCAAsC,KAAK,MAAM,EAAE,2BAA2B,KAAK;AACrF,YAAM,KAAK,sBAAsB;AACjC,iBAAW,KAAK,IAAI,OAAQ,OAAM,KAAK,KAAK,CAAC,EAAE;AAC/C,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,oBAAoB;AAC/B,iBAAW,KAAK,IAAI,UAAW,OAAM,KAAK,KAAK,CAAC,EAAE;AAClD,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,kBAAkB;AAC7B,iBAAW,KAAK,IAAI,YAAa,OAAM,KAAK,KAAK,CAAC,EAAE;AACpD,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,gCAAgC;AAC3C,iBAAW,KAAK,IAAI,SAAU,OAAM,KAAK,KAAK,CAAC,EAAE;AACjD,YAAM,KAAK,EAAE;AACb,UAAI,QAAQ,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,GAAG;AACnD,cAAM,KAAK,gBAAgB;AAC3B,cAAM,MAAM,OAAO,QAAQ,KAAK,UAAU,EACvC,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAC1B,MAAM,GAAG,EAAE;AACd,mBAAW,CAAC,MAAM,KAAK,KAAK,IAAK,OAAM,KAAK,KAAK,IAAI,KAAK,KAAK,EAAE;AACjE,cAAM,KAAK,EAAE;AAAA,MACf;AACA,YAAM,KAAK,WAAW;AACtB,YAAM,KAAK,YAAY,QAAQ,SAAS,EAAE;AAC1C,UAAI,MAAM;AACR,cAAM,KAAK,iBAAiB,KAAK,SAAS,EAAE;AAC5C,cAAM,KAAK,sBAAsB,KAAK,cAAc,EAAE;AACtD,cAAM,KAAK,iBAAiB,KAAK,SAAS,EAAE;AAAA,MAC9C;AACA,YAAM,KAAK,EAAE;AACb,aAAO,MAAM,KAAK,IAAI;AAAA,IACxB;AAEA,eAAW,UAAU,QAAQ,QAAS,OAAM,KAAK,KAAK,MAAM,EAAE;AAC9D,UAAM,KAAK,OAAO,QAAQ,SAAS,UAAU;AAC7C,UAAM,KAAK,EAAE;AACb,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,WAAW,YAAoB,OAAyC;AAC5E,QAAI;AACF,YAAM,aAAa,KAAK,IAAI,IAAI,QAAQ,KAAK,KAAK;AAElD,YAAM,WAAW,MAAM,oBAAoB,KAAK,OAAO,WAAW,UAAU;AAC5E,UAAI,UAAU;AACZ,eAAO,SACJ,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,KAAK,UAAU,EACtD,KAAK,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC;AAAA,MAC3E;AAEA,YAAM,YAA6B,CAAC;AACpC,YAAM,aAAa,MAAM,KAAK,kBAAkB,UAAU;AAC1D,YAAM,YAAY,MAAM,KAAK,wBAAwB,UAAU;AAC/D,YAAM,WAAW,oBAAI,IAAY;AAEjC,iBAAW,cAAc,CAAC,YAAY,SAAS,GAAG;AAChD,YAAI,CAAC,cAAc,SAAS,IAAI,UAAU,EAAG;AAC7C,iBAAS,IAAI,UAAU;AACvB,cAAM,SAAS,MAAM,KAAK,eAAe,YAAY,UAAU;AAC/D,kBAAU,KAAK,GAAG,MAAM;AAAA,MAC1B;AAEA,YAAM,SAAS,oBAAI,IAA2B;AAC9C,iBAAW,WAAW,WAAW;AAC/B,YAAI,CAAC,OAAO,IAAI,QAAQ,IAAI,EAAG,QAAO,IAAI,QAAQ,MAAM,OAAO;AAAA,MACjE;AAEA,YAAM,kBAAkB,MAAM,KAAK,OAAO,OAAO,CAAC,EAAE;AAAA,QAClD,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,IAAI,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ;AAAA,MAClE;AAGA,YAAM,SAAS,gBAAgB,OAAO,CAAC,MAAM,IAAI,KAAK,EAAE,IAAI,EAAE,QAAQ,KAAK,UAAU;AAErF,UAAI,gBAAgB,SAAS,GAAG;AAC9B,YAAI;AACF,gBAAM,qBAAqB,KAAK,OAAO,WAAW,YAAY,eAAe;AAAA,QAC/E,SAAS,OAAO;AACd,cAAI;AAAA,YACF,iEAAiE,UAAU,iBAAiB,OAAO,KAAK,CAAC;AAAA,UAC3G;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT,QAAQ;AAEN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA,EAEA,MAAc,eAAe,YAAoB,YAA8C;AAC7F,QAAI;AACJ,QAAI;AACF,cAAQ,MAAM,QAAQ,UAAU;AAAA,IAClC,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,YAA6B,CAAC;AACpC,UAAM,UAAU,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC;AACrD,eAAW,QAAQ,SAAS;AAC1B,YAAM,WAAW,MAAM,uBAAuB,YAAY,IAAI,EAAE,MAAM,MAAM,IAAI;AAChF,UAAI,aAAa,KAAM;AAEvB,UAAI;AACF,cAAM,UAAU,MAAM,SAAS,UAAU,OAAO;AAChD,kBAAU,KAAK,GAAG,KAAK,iBAAiB,SAAS,YAAY,IAAI,CAAC;AAAA,MACpE,QAAQ;AAAA,MAER;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,iBAAiB,SAAiB,YAAoB,UAAmC;AAC/F,UAAM,YAA6B,CAAC;AAGpC,UAAM,YAAY,SAAS,MAAM,2BAA2B;AAC5D,QAAI,CAAC,UAAW,QAAO;AACvB,UAAM,UAAU,UAAU,CAAC;AAG3B,UAAM,eAAe,QAAQ,MAAM,mBAAmB;AAGtD,aAAS,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK,GAAG;AAC/C,YAAM,UAAU,aAAa,CAAC;AAC9B,YAAM,iBAAiB,aAAa,IAAI,CAAC,KAAK;AAG9C,YAAM,UAAoB,CAAC;AAC3B,YAAM,QAAQ,eAAe,MAAM,IAAI;AACvC,UAAI,YAAY;AAEhB,UAAI,WAAW;AACf,UAAI,0BAA0B;AAC9B,iBAAW,QAAQ,OAAO;AACxB,YAAI,KAAK,WAAW,YAAY,GAAG;AACjC,qBAAW;AACX,oCAA0B;AAC1B;AAAA,QACF;AACA,YAAI,KAAK,WAAW,MAAM,KAAK,CAAC,KAAK,WAAW,YAAY,GAAG;AAC7D,qBAAW;AAAA,QACb;AACA,cAAM,cAAc,KAAK,MAAM,UAAU;AACzC,YAAI,aAAa;AAEf,cAAI,CAAC,2BAA2B,SAAU,SAAQ,KAAK,YAAY,CAAC,CAAC;AAAA,QACvE;AACA,cAAM,YAAY,KAAK,MAAM,kBAAkB;AAC/C,YAAI,UAAW,aAAY,SAAS,UAAU,CAAC,GAAG,EAAE;AAAA,MACtD;AAEA,UAAI,QAAQ,SAAS,GAAG;AACtB,kBAAU,KAAK;AAAA,UACb,MAAM,GAAG,OAAO,IAAI,OAAO;AAAA,UAC3B;AAAA,UACA;AAAA,UACA;AAAA,UACA,aAAa;AAAA;AAAA,QACf,CAAC;AAAA,MACH;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,gBAAgB,WAA4B,UAA0B;AACpE,QAAI,UAAU,WAAW,EAAG,QAAO;AAEnC,UAAM,UAAU,UAAU,MAAM,GAAG,QAAQ;AAC3C,UAAM,QAAkB,CAAC,4BAA4B,QAAQ,MAAM,SAAS;AAE5E,eAAW,WAAW,SAAS;AAC7B,YAAM,UAAU,QAAQ,KAAK,MAAM,IAAI,EAAE;AACzC,iBAAW,UAAU,QAAQ,SAAS;AACpC,cAAM,KAAK,KAAK,OAAO,KAAK,MAAM,EAAE;AAAA,MACtC;AAAA,IACF;AAEA,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB;AAAA;AAAA,EAGA,MAAM,YAA+C;AACnD,QAAI,MAAM,mCAAmC;AAK7C,UAAM,OAAO,MAAM,KAAK,kBAAkB;AAC1C,UAAM,WAAW,KAAK;AACtB,QAAI,sBAAsB;AAC1B,QAAI,mBAAmB;AAEvB,eAAW,cAAc,UAAU;AAEjC,YAAM,MAAM,oBAAI,KAAK;AACrB,YAAM,YAAY,IAAI,KAAK,IAAI,QAAQ,IAAI,KAAK,KAAK,GAAI;AACzD,gBAAU,WAAW,GAAG,GAAG,CAAC;AAC5B,YAAM,UAAU,IAAI,KAAK,UAAU,QAAQ,IAAI,KAAK,KAAK,GAAI;AAG7D,YAAM,UAAU,MAAM,KAAK,qBAAqB,YAAY,WAAW,OAAO;AAE9E,UAAI,QAAQ,WAAW,GAAG;AACxB,YAAI,MAAM,6BAA6B,UAAU,OAAO,UAAU,YAAY,CAAC,EAAE;AACjF;AAAA,MACF;AACA,6BAAuB;AAGvB,YAAM,UAAU,MAAM,KAAK,gBAAgB,YAAY,WAAW,OAAO;AACzE,UAAI,SAAS;AACX,cAAM,KAAK,YAAY,OAAO;AAC9B,4BAAoB;AACpB,YAAI,KAAK,gCAAgC,UAAU,KAAK,QAAQ,MAAM,SAAS;AAAA,MACjF;AAAA,IACF;AAEA,WAAO;AAAA,MACL,oBAAoB,SAAS;AAAA,MAC7B;AAAA,MACA;AAAA;AAAA;AAAA,MAGA,YACE,KAAK,yBAAyB,QAC9B,KAAK,IAAI,IAAI,IAAI,KAAK,KAAK,oBAAoB,EAAE,QAAQ,IAAI;AAAA,MAC/D,sBAAsB,KAAK;AAAA,MAC3B,YAAY,KAAK;AAAA,IACnB;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAc,oBAIX;AACD,UAAM,gBAAgB,MAAM,uBAAuB,KAAK,OAAO,WAAW,aAAa,EAAE,MAAM,MAAM,IAAI;AACzG,QAAI,kBAAkB,MAAM;AAC1B,aAAO,EAAE,aAAa,CAAC,GAAG,sBAAsB,MAAM,YAAY,MAAM;AAAA,IAC1E;AAEA,UAAM,cAAc,oBAAI,IAAY;AACpC,QAAI,uBAAsC;AAC1C,QAAI,oBAAoB,OAAO;AAC/B,QAAI,iBAAiB;AACrB,UAAM,UAAU,OAAO,mBAA0C;AAC/D,UAAI;AACF,cAAM,MAAM,MAAM,SAAS,gBAAgB,OAAO;AAClD,mBAAW,QAAQ,IAAI,MAAM,IAAI,GAAG;AAClC,cAAI,CAAC,KAAK,KAAK,EAAG;AAClB,cAAI;AACF,kBAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,gBAAI,OAAO,MAAM,eAAe,YAAY,MAAM,WAAW,SAAS,GAAG;AACvE,0BAAY,IAAI,MAAM,UAAU;AAAA,YAClC;AAIA,gBAAI,OAAO,MAAM,cAAc,UAAU;AACvC,oBAAM,SAAS,IAAI,KAAK,MAAM,SAAS,EAAE,QAAQ;AACjD,kBAAI,OAAO,SAAS,MAAM,MAAM,OAAO,MAAM,iBAAiB,KAAK,SAAS,oBAAoB;AAC9F,oCAAoB;AACpB,uCAAuB,MAAM;AAAA,cAC/B;AAAA,YACF;AAAA,UACF,QAAQ;AAAA,UAER;AAAA,QACF;AAAA,MACF,SAAS,KAAK;AAKZ,YAAK,KAA+B,SAAS,UAAU;AACrD,2BAAiB;AAAA,QACnB;AAAA,MACF;AAAA,IACF;AAEA,QAAI;AACF,YAAM,cAAc,MAAM,QAAQ,eAAe,EAAE,eAAe,KAAK,CAAC;AACxE,iBAAW,WAAW,aAAa;AACjC,YAAI,CAAC,QAAQ,YAAY,EAAG;AAC5B,cAAM,UAAU,MAAM,uBAAuB,eAAe,QAAQ,IAAI,EAAE,MAAM,MAAM,IAAI;AAC1F,YAAI,YAAY,KAAM;AACtB,cAAM,YAAY,MAAM,QAAQ,SAAS,EAAE,eAAe,KAAK,CAAC;AAChE,mBAAW,SAAS,WAAW;AAC7B,cAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,gBAAM,UAAU,MAAM,uBAAuB,SAAS,MAAM,IAAI,EAAE,MAAM,MAAM,IAAI;AAClF,cAAI,YAAY,KAAM;AACtB,gBAAM,SAAS,MAAM,QAAQ,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,CAAC,EAAE,KAAK;AAChF,qBAAW,QAAQ,OAAO;AACxB,kBAAM,iBAAiB,MAAM,uBAAuB,SAAS,IAAI,EAAE,MAAM,MAAM,IAAI;AACnF,gBAAI,mBAAmB,KAAM;AAC7B,kBAAM,QAAQ,cAAc;AAAA,UAC9B;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,QACL,aAAa,MAAM,KAAK,WAAW;AAAA,QACnC;AAAA,QACA,YAAY;AAAA,MACd;AAAA,IACF,SAAS,KAAK;AAGZ,YAAM,OAAQ,KAA+B;AAC7C,UAAI,SAAS,UAAU;AACrB,eAAO,EAAE,aAAa,CAAC,GAAG,sBAAsB,MAAM,YAAY,MAAM;AAAA,MAC1E;AACA,UAAI,KAAK,2BAA2B,GAAG,EAAE;AACzC,aAAO,EAAE,aAAa,CAAC,GAAG,sBAAsB,MAAM,YAAY,KAAK;AAAA,IACzE;AAAA,EACF;AAAA;AAAA,EAGA,MAAc,qBAAqB,YAAoB,WAAiB,SAA2C;AAMjH,UAAM,QAAQ,oBAAoB,UAAU;AAE5C,QAAI;AACF,YAAM,iBAAiB,KAAK,KAAK,KAAK,OAAO,WAAW,aAAa;AACrE,YAAM,gBAAgB,IAAI;AAAA,QACxB,CAAC,MAAM,KAAK,MAAM,cAAc,MAAM,WAAW,GAAG,MAAM,YAAY,EAAE;AAAA,UACtE,CAAC,QAAuB,OAAO,QAAQ,YAAY,IAAI,SAAS;AAAA,QAClE;AAAA,MACF;AACA,YAAM,UAA6B,CAAC;AAIpC,YAAM,eAAe,oBAAI,IAAY;AAGrC,iBAAW,gBAAgB,eAAe;AACxC,cAAM,gBAAgB,MAAM,uBAAuB,gBAAgB,YAAY,EAAE,MAAM,MAAM,IAAI;AACjG,YAAI,kBAAkB,KAAM;AAE5B,cAAM,QAAQ,MAAM,QAAQ,aAAa,EAAE,MAAM,MAAM,CAAC,CAAC;AACzD,mBAAW,QAAQ,OAAO;AACxB,cAAI,CAAC,KAAK,SAAS,QAAQ,EAAG;AAE9B,gBAAM,iBAAiB,MAAM,uBAAuB,eAAe,IAAI,EAAE,MAAM,MAAM,IAAI;AACzF,cAAI,mBAAmB,KAAM;AAE7B,cAAI;AACF,kBAAM,UAAU,MAAM,SAAS,gBAAgB,OAAO;AACtD,kBAAM,QAAQ,QAAQ,KAAK,EAAE,MAAM,IAAI;AAEvC,uBAAW,QAAQ,OAAO;AACxB,kBAAI,CAAC,KAAK,KAAK,EAAG;AAClB,kBAAI;AACF,sBAAM,QAAQ,KAAK,MAAM,IAAI;AAC7B,sBAAM,YAAY,IAAI,KAAK,MAAM,SAAS,EAAE,QAAQ;AAEpD,oBACE,MAAM,eAAe,cACrB,aAAa,UAAU,QAAQ,KAC/B,YAAY,QAAQ,QAAQ,KAC5B,CAAC,aAAa,IAAI,IAAI,GACtB;AACA,+BAAa,IAAI,IAAI;AACrB,0BAAQ,KAAK,KAAK;AAAA,gBACpB;AAAA,cACF,QAAQ;AAAA,cAER;AAAA,YACF;AAAA,UACF,QAAQ;AAAA,UAER;AAAA,QACF;AAAA,MACF;AAEA,aAAO;AAAA,IACT,QAAQ;AACN,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AACF;","names":[]}

package/dist/chunk-EQ4U73UH.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/extraction-quote-grounding.ts"],"sourcesContent":["/**\n * Quote-anchored source grounding.\n *\n * An extracted fact carries the exact words that support it in `quote`. A quote\n * that is a verbatim substring of the source (whitespace-normalized) is real\n * evidence: the claim only has to be supported by the text around that span,\n * not by word overlap against the whole conversation. Items without such a\n * quote never get an anchor here and stay on the whole-source rules.\n */\n\nimport type { ExtractionResult } from \"./types.js\";\nimport {\n  GROUNDING_MIN_SHARED_TOKENS,\n  areGroundingTokensCompatible,\n  entityNameStart,\n  hasDenialReporting,\n  hasNonAssertiveReporting,\n  isGroundedEntityName,\n  normalizedEntityIdentifierTokens,\n  sourceSentences,\n  tokenize,\n} from \"./extraction-source-grounding-helpers.js\";\n\n/** Shortest normalized quote that counts as evidence; \"the\" or \"I\" prove nothing. */\nexport const QUOTE_ANCHOR_MIN_CHARS = 12;\n/** Characters of context kept on each side of the quote inside its turn. */\nexport const QUOTE_ANCHOR_CONTEXT_CHARS = 400;\n/** Share of a claim's content words that must occur in the quote's window. */\nexport const QUOTE_ANCHOR_MIN_WINDOW_COVERAGE = 0.35;\n/** Share of a claim's content words that must occur anywhere in the source; the rest is invented. */\nexport const QUOTE_ANCHOR_MIN_SOURCE_COVERAGE = 0.75;\nconst QUOTE_ANCHOR_MAX_OCCURRENCES = 8;\nconst TURN_SEPARATOR = \"\\n\\n\";\nconst NEGATOR_PATTERN = /\\b(?:not|no|never|cannot|without|neither|nor)\\b|n't\\b/iu;\nconst EXCLUSION_PATTERN =\n  /\\b(?:exclu\\w*|avoid\\w*|omit\\w*|skip\\w*|ignor\\w*|forbid\\w*|prohibit\\w*|disallow\\w*|prevent\\w*|reject\\w*|refus\\w*|insufficient|instead|rather|unless|except)\\b/iu;\n\n/** A verbatim quote and the text around it inside its turn. */\nexport interface QuoteAnchor {\n  /** Whitespace-normalized quote, exactly as it appears in the source. */\n  quote: string;\n  /** `quote` with its turn-local context; `;` inside the quote is rewritten to `,`. */\n  window: string;\n}\n\nexport type TokenPool = (token: string) => boolean;\n\ntype Entity = ExtractionResult[\"entities\"][number];\ntype Relationship = NonNullable<ExtractionResult[\"relationships\"]>[number];\n\nfunction normalizeWhitespaceWithMap(source: string): { text: string; originalIndex: number[] } {\n  const chars: string[] = [];\n  const originalIndex: number[] = [];\n  let inSpace = false;\n  for (let index = 0; index < source.length; index += 1) {\n    const char = source[index]!;\n    if (/\\s/u.test(char)) {\n      if (inSpace) continue;\n      inSpace = true;\n      chars.push(\" \");\n    } else {\n      inSpace = false;\n      chars.push(char);\n    }\n    originalIndex.push(index);\n  }\n  return { text: chars.join(\"\"), originalIndex };\n}\n\nfunction turnStartOffsets(source: string, turns: readonly string[]): readonly number[] | undefined {\n  const offsets: number[] = [];\n  let at = 0;\n  for (const turn of turns) {\n    if (!source.startsWith(turn, at)) return undefined;\n    offsets.push(at);\n    at += turn.length + TURN_SEPARATOR.length;\n  }\n  return at - TURN_SEPARATOR.length === source.length ? offsets : undefined;\n}\n\nfunction findQuoteAnchors(quote: string, source: string, bounds?: readonly number[]): QuoteAnchor[] {\n  const needle = quote.replace(/\\s+/gu, \" \").trim();\n  if (needle.length < QUOTE_ANCHOR_MIN_CHARS) return [];\n  const normalized = normalizeWhitespaceWithMap(source);\n  const anchors: QuoteAnchor[] = [];\n  let from = 0;\n  while (anchors.length < QUOTE_ANCHOR_MAX_OCCURRENCES) {\n    const at = normalized.text.indexOf(needle, from);\n    if (at < 0) break;\n    from = at + 1;\n    const start = normalized.originalIndex[at]!;\n    const end = normalized.originalIndex[at + needle.length - 1]! + 1;\n\n    let before: string;\n    let after: string;\n    if (bounds === undefined) {\n      if (source.slice(start, end).includes(TURN_SEPARATOR)) continue;\n      before = source.slice(Math.max(0, start - QUOTE_ANCHOR_CONTEXT_CHARS), start);\n      const sepBefore = before.lastIndexOf(TURN_SEPARATOR);\n      if (sepBefore >= 0) before = before.slice(sepBefore + TURN_SEPARATOR.length);\n      else if (start > QUOTE_ANCHOR_CONTEXT_CHARS) before = before.replace(/^\\S+/u, \"\");\n      after = source.slice(end, end + QUOTE_ANCHOR_CONTEXT_CHARS);\n      const sepAfter = after.indexOf(TURN_SEPARATOR);\n      if (sepAfter >= 0) after = after.slice(0, sepAfter);\n      else if (source.length - end > QUOTE_ANCHOR_CONTEXT_CHARS) after = after.replace(/\\S+$/u, \"\");\n    } else {\n      let turnStart = 0;\n      let turnEnd = source.length;\n      for (const bound of bounds) {\n        if (bound <= start) turnStart = bound;\n        else {\n          turnEnd = bound - TURN_SEPARATOR.length;\n          break;\n        }\n      }\n      if (turnEnd < end) continue;\n      before = source.slice(Math.max(turnStart, start - QUOTE_ANCHOR_CONTEXT_CHARS), start);\n      if (start - QUOTE_ANCHOR_CONTEXT_CHARS > turnStart) before = before.replace(/^\\S+/u, \"\");\n      const contextEnd = Math.min(turnEnd, end + QUOTE_ANCHOR_CONTEXT_CHARS);\n      after = source.slice(end, contextEnd);\n      if (end + QUOTE_ANCHOR_CONTEXT_CHARS < turnEnd) after = after.replace(/\\S+$/u, \"\");\n    }\n\n    anchors.push({ quote: needle, window: `${before}${needle.replace(/;/gu, \",\")}${after}` });\n  }\n  return anchors;\n}\n\n/**\n * Returns one anchor per place `quote` occurs verbatim in `source`, or [] when\n * the quote is absent, too short, or not an exact substring. A quote that\n * spans a turn separator is not one turn's words and yields no anchor; windows\n * never extend past their turn.\n *\n * The quote is one evidence unit: a `;` inside it is rewritten to `,` in the\n * window so sentence splitting cannot cut it, or a claim that merges two of\n * its clauses could never be grounded in a single sentence.\n *\n * `source` may have been rewritten before grounding (temporal anchoring,\n * pronoun resolution) while the model quoted the original words. When the raw\n * quote is not found, `transformQuote` applies the same rewrite to the quote.\n *\n * `turns` are the texts `source` was joined from; when they tile `source`\n * exactly, quotes and windows cut at real turn boundaries instead of any\n * blank line. Without them, every `TURN_SEPARATOR` run is a boundary.\n */\nexport function quoteAnchors(\n  quote: string | undefined,\n  source: string,\n  transformQuote?: (quote: string) => string,\n  turns?: readonly string[],\n): QuoteAnchor[] {\n  if (typeof quote !== \"string\") return [];\n  const bounds = turns === undefined ? undefined : turnStartOffsets(source, turns);\n  const exact = findQuoteAnchors(quote, source, bounds);\n  if (exact.length > 0 || transformQuote === undefined) return exact;\n  return findQuoteAnchors(transformQuote(quote), source, bounds);\n}\n\nexport function tokenPool(tokens: ReadonlySet<string>): TokenPool {\n  const list = [...tokens];\n  return (token) => tokens.has(token) || list.some((poolToken) => areGroundingTokensCompatible(token, poolToken));\n}\n\nfunction hasNegation(text: string): boolean {\n  return NEGATOR_PATTERN.test(text.replace(/[\\u2018\\u2019]/gu, \"'\")) || hasDenialReporting(text);\n}\n\nconst CLAUSE_PATTERN = /[^;.!?\\n]+[;.!?]*/gu;\n/** Split \"X, and Y\" claim coordination without touching list commas. */\nconst CLAIM_COORD_SPLIT = /,\\s{1,8}(?:and|but|or|nor)\\s{1,8}/iu;\n\nfunction splitClaimClauses(content: string): string[] {\n  return (content.match(CLAUSE_PATTERN) ?? [content]).flatMap((clause) => {\n    const parts = clause\n      .split(CLAIM_COORD_SPLIT)\n      .map((part) => part.trim())\n      .filter((part) => part.length > 0);\n    return parts.length > 0 ? parts : [clause];\n  });\n}\n\nfunction clauseOverlap(clauseTokens: readonly string[], target: string) {\n  const has = tokenPool(tokenize(target));\n  const shared = clauseTokens.filter(has).length;\n  return { shared, ratio: clauseTokens.length === 0 ? 0 : shared / clauseTokens.length };\n}\n\n/** What a quote clause's first negator governs: the words after it. */\nfunction negatedScope(clause: string): string {\n  const match = NEGATOR_PATTERN.exec(clause.replace(/[\\u2018\\u2019]/gu, \"'\"));\n  return match ? clause.slice(match.index + match[0].length) : clause;\n}\n\n/**\n * True when the claim asserts what a quote clause denies or does not assert:\n * \"did not approve the budget\" or \"denied approving it\" restated as \"approved\n * the budget\", \"suspects Bob stole funds\" or \"Is Alice the CEO?\" restated as a\n * plain statement. The claim must restate the quote clause, and none of its\n * clauses that share a word with what the negator governs may keep the\n * negator, exclusion word, or reporting marker (\"do not X\" reworded as \"X is\n * excluded\", or \"Alice reviewed it, but she did not approve it\"). A negator in\n * a clause about something else does not count, so a claim that keeps one\n * quote negation can still misstate another quote clause, and a claim clause\n * that shares only the subject does not satisfy the check.\n */\nfunction misstatesQuote(content: string, quote: string): boolean {\n  const claimClauses = splitClaimClauses(content);\n  return (quote.match(CLAUSE_PATTERN) ?? []).some((quoteClause) => {\n    const needsNegation = hasNegation(quoteClause);\n    const needsReporting = quoteClause.trim().endsWith(\"?\") || hasNonAssertiveReporting(quoteClause);\n    if (!needsNegation && !needsReporting) return false;\n    const clauseTokens = [...tokenize(quoteClause)];\n    const whole = clauseOverlap(clauseTokens, content);\n    if (whole.shared < GROUNDING_MIN_SHARED_TOKENS || whole.ratio < 0.5) return false;\n    const clausesSharing = (tokens: readonly string[]) =>\n      claimClauses.filter((claimClause) => clauseOverlap(tokens, claimClause).shared > 0);\n    if (needsNegation) {\n      const scopeTokens = [...tokenize(negatedScope(quoteClause))];\n      const related = clausesSharing(scopeTokens.length > 0 ? scopeTokens : clauseTokens);\n      if (!related.some((text) => hasNegation(text) || EXCLUSION_PATTERN.test(text))) return true;\n    }\n    return needsReporting\n      && !clausesSharing(clauseTokens).some((text) => hasNonAssertiveReporting(text) || text.trim().endsWith(\"?\"));\n  });\n}\n\n/**\n * A claim is supported by a verbatim quote when it shares at least\n * GROUNDING_MIN_SHARED_TOKENS content words with the quote, a good part of its\n * words sit in the text around the quote, nearly all of them occur in the\n * source at all, and it does not invert a negated clause of the quote. Reworded\n * and lightly elaborated claims pass; claims that bring words the conversation\n * never used, or that have nothing to do with the quote, do not.\n */\nexport function isQuoteAnchoredClaim(content: string, anchor: QuoteAnchor, sourceHas: TokenPool): boolean {\n  const contentTokens = [...tokenize(content)];\n  if (contentTokens.length === 0) return false;\n  const quoteHas = tokenPool(tokenize(anchor.quote));\n  if (contentTokens.filter(quoteHas).length < GROUNDING_MIN_SHARED_TOKENS) return false;\n  const windowHas = tokenPool(tokenize(anchor.window));\n  if (contentTokens.filter(windowHas).length / contentTokens.length < QUOTE_ANCHOR_MIN_WINDOW_COVERAGE) {\n    return false;\n  }\n  return contentTokens.filter(sourceHas).length / contentTokens.length >= QUOTE_ANCHOR_MIN_SOURCE_COVERAGE\n    && !misstatesQuote(content, anchor.quote);\n}\n\n/** Keeps the entity facts (flat and sectioned) `isSupported` accepts; undefined when none remain. */\nexport function filterEntityFacts(entity: Entity, isSupported: (fact: string) => boolean): Entity | undefined {\n  const facts = entity.facts.filter(isSupported);\n  const structuredSections = entity.structuredSections?.flatMap((section) => {\n    const groundedFacts = section.facts.filter(isSupported);\n    return groundedFacts.length > 0 ? [{ ...section, facts: groundedFacts }] : [];\n  });\n  if (facts.length === 0 && (structuredSections === undefined || structuredSections.length === 0)) {\n    return undefined;\n  }\n  const { structuredSections: _structuredSections, ...entityWithoutSections } = entity;\n  return {\n    ...entityWithoutSections,\n    facts,\n    ...(structuredSections && structuredSections.length > 0 ? { structuredSections } : {}),\n  };\n}\n\n/**\n * Entities carry no quote of their own; the anchors of facts that kept support\n * them. Returns a fact predicate, or undefined when no anchor window names the entity.\n */\nexport function quoteAnchoredEntitySupport(\n  entity: Entity,\n  anchors: readonly QuoteAnchor[],\n  sourceHas: TokenPool,\n): ((fact: string) => boolean) | undefined {\n  const nameAnchors = anchors.filter((anchor) => isGroundedEntityName(entity.name, anchor.window));\n  if (nameAnchors.length === 0) return undefined;\n  return (fact) => nameAnchors.some((anchor) => isQuoteAnchoredClaim(fact, anchor, sourceHas));\n}\n\n/**\n * The label words and both names must sit in one anchor-window sentence, source\n * before target, so an invented label or a reversed edge never passes.\n */\nexport function isQuoteAnchoredRelationship(\n  relationship: Relationship,\n  anchors: readonly QuoteAnchor[],\n  sourceHas: TokenPool,\n): boolean {\n  const labelTokens = [...tokenize(relationship.label)];\n  if (labelTokens.length === 0) return false;\n  const relationText = [\n    normalizedEntityIdentifierTokens(relationship.source).join(\" \"),\n    relationship.label,\n    normalizedEntityIdentifierTokens(relationship.target).join(\" \"),\n  ].join(\" \");\n  return anchors.some((anchor) => {\n    const windowHas = tokenPool(tokenize(anchor.window));\n    return labelTokens.every(windowHas)\n      && sourceSentences(anchor.window).some((sentence) => {\n        const sourceStart = entityNameStart(relationship.source, sentence);\n        return sourceStart >= 0 && entityNameStart(relationship.target, sentence) > sourceStart;\n      })\n      && isQuoteAnchoredClaim(relationText, anchor, sourceHas);\n  });\n}\n"],"mappings":";;;;;;;;;;;;;AAwBO,IAAM,yBAAyB;AAE/B,IAAM,6BAA6B;AAEnC,IAAM,mCAAmC;AAEzC,IAAM,mCAAmC;AAChD,IAAM,+BAA+B;AACrC,IAAM,iBAAiB;AACvB,IAAM,kBAAkB;AACxB,IAAM,oBACJ;AAeF,SAAS,2BAA2B,QAA2D;AAC7F,QAAM,QAAkB,CAAC;AACzB,QAAM,gBAA0B,CAAC;AACjC,MAAI,UAAU;AACd,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,UAAM,OAAO,OAAO,KAAK;AACzB,QAAI,MAAM,KAAK,IAAI,GAAG;AACpB,UAAI,QAAS;AACb,gBAAU;AACV,YAAM,KAAK,GAAG;AAAA,IAChB,OAAO;AACL,gBAAU;AACV,YAAM,KAAK,IAAI;AAAA,IACjB;AACA,kBAAc,KAAK,KAAK;AAAA,EAC1B;AACA,SAAO,EAAE,MAAM,MAAM,KAAK,EAAE,GAAG,cAAc;AAC/C;AAEA,SAAS,iBAAiB,QAAgB,OAAyD;AACjG,QAAM,UAAoB,CAAC;AAC3B,MAAI,KAAK;AACT,aAAW,QAAQ,OAAO;AACxB,QAAI,CAAC,OAAO,WAAW,MAAM,EAAE,EAAG,QAAO;AACzC,YAAQ,KAAK,EAAE;AACf,UAAM,KAAK,SAAS,eAAe;AAAA,EACrC;AACA,SAAO,KAAK,eAAe,WAAW,OAAO,SAAS,UAAU;AAClE;AAEA,SAAS,iBAAiB,OAAe,QAAgB,QAA2C;AAClG,QAAM,SAAS,MAAM,QAAQ,SAAS,GAAG,EAAE,KAAK;AAChD,MAAI,OAAO,SAAS,uBAAwB,QAAO,CAAC;AACpD,QAAM,aAAa,2BAA2B,MAAM;AACpD,QAAM,UAAyB,CAAC;AAChC,MAAI,OAAO;AACX,SAAO,QAAQ,SAAS,8BAA8B;AACpD,UAAM,KAAK,WAAW,KAAK,QAAQ,QAAQ,IAAI;AAC/C,QAAI,KAAK,EAAG;AACZ,WAAO,KAAK;AACZ,UAAM,QAAQ,WAAW,cAAc,EAAE;AACzC,UAAM,MAAM,WAAW,cAAc,KAAK,OAAO,SAAS,CAAC,IAAK;AAEhE,QAAI;AACJ,QAAI;AACJ,QAAI,WAAW,QAAW;AACxB,UAAI,OAAO,MAAM,OAAO,GAAG,EAAE,SAAS,cAAc,EAAG;AACvD,eAAS,OAAO,MAAM,KAAK,IAAI,GAAG,QAAQ,0BAA0B,GAAG,KAAK;AAC5E,YAAM,YAAY,OAAO,YAAY,cAAc;AACnD,UAAI,aAAa,EAAG,UAAS,OAAO,MAAM,YAAY,eAAe,MAAM;AAAA,eAClE,QAAQ,2BAA4B,UAAS,OAAO,QAAQ,SAAS,EAAE;AAChF,cAAQ,OAAO,MAAM,KAAK,MAAM,0BAA0B;AAC1D,YAAM,WAAW,MAAM,QAAQ,cAAc;AAC7C,UAAI,YAAY,EAAG,SAAQ,MAAM,MAAM,GAAG,QAAQ;AAAA,eACzC,OAAO,SAAS,MAAM,2BAA4B,SAAQ,MAAM,QAAQ,SAAS,EAAE;AAAA,IAC9F,OAAO;AACL,UAAI,YAAY;AAChB,UAAI,UAAU,OAAO;AACrB,iBAAW,SAAS,QAAQ;AAC1B,YAAI,SAAS,MAAO,aAAY;AAAA,aAC3B;AACH,oBAAU,QAAQ,eAAe;AACjC;AAAA,QACF;AAAA,MACF;AACA,UAAI,UAAU,IAAK;AACnB,eAAS,OAAO,MAAM,KAAK,IAAI,WAAW,QAAQ,0BAA0B,GAAG,KAAK;AACpF,UAAI,QAAQ,6BAA6B,UAAW,UAAS,OAAO,QAAQ,SAAS,EAAE;AACvF,YAAM,aAAa,KAAK,IAAI,SAAS,MAAM,0BAA0B;AACrE,cAAQ,OAAO,MAAM,KAAK,UAAU;AACpC,UAAI,MAAM,6BAA6B,QAAS,SAAQ,MAAM,QAAQ,SAAS,EAAE;AAAA,IACnF;AAEA,YAAQ,KAAK,EAAE,OAAO,QAAQ,QAAQ,GAAG,MAAM,GAAG,OAAO,QAAQ,OAAO,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC;AAAA,EAC1F;AACA,SAAO;AACT;AAoBO,SAAS,aACd,OACA,QACA,gBACA,OACe;AACf,MAAI,OAAO,UAAU,SAAU,QAAO,CAAC;AACvC,QAAM,SAAS,UAAU,SAAY,SAAY,iBAAiB,QAAQ,KAAK;AAC/E,QAAM,QAAQ,iBAAiB,OAAO,QAAQ,MAAM;AACpD,MAAI,MAAM,SAAS,KAAK,mBAAmB,OAAW,QAAO;AAC7D,SAAO,iBAAiB,eAAe,KAAK,GAAG,QAAQ,MAAM;AAC/D;AAEO,SAAS,UAAU,QAAwC;AAChE,QAAM,OAAO,CAAC,GAAG,MAAM;AACvB,SAAO,CAAC,UAAU,OAAO,IAAI,KAAK,KAAK,KAAK,KAAK,CAAC,cAAc,6BAA6B,OAAO,SAAS,CAAC;AAChH;AAEA,SAAS,YAAY,MAAuB;AAC1C,SAAO,gBAAgB,KAAK,KAAK,QAAQ,oBAAoB,GAAG,CAAC,KAAK,mBAAmB,IAAI;AAC/F;AAEA,IAAM,iBAAiB;AAEvB,IAAM,oBAAoB;AAE1B,SAAS,kBAAkB,SAA2B;AACpD,UAAQ,QAAQ,MAAM,cAAc,KAAK,CAAC,OAAO,GAAG,QAAQ,CAAC,WAAW;AACtE,UAAM,QAAQ,OACX,MAAM,iBAAiB,EACvB,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC;AACnC,WAAO,MAAM,SAAS,IAAI,QAAQ,CAAC,MAAM;AAAA,EAC3C,CAAC;AACH;AAEA,SAAS,cAAc,cAAiC,QAAgB;AACtE,QAAM,MAAM,UAAU,SAAS,MAAM,CAAC;AACtC,QAAM,SAAS,aAAa,OAAO,GAAG,EAAE;AACxC,SAAO,EAAE,QAAQ,OAAO,aAAa,WAAW,IAAI,IAAI,SAAS,aAAa,OAAO;AACvF;AAGA,SAAS,aAAa,QAAwB;AAC5C,QAAM,QAAQ,gBAAgB,KAAK,OAAO,QAAQ,oBAAoB,GAAG,CAAC;AAC1E,SAAO,QAAQ,OAAO,MAAM,MAAM,QAAQ,MAAM,CAAC,EAAE,MAAM,IAAI;AAC/D;AAcA,SAAS,eAAe,SAAiB,OAAwB;AAC/D,QAAM,eAAe,kBAAkB,OAAO;AAC9C,UAAQ,MAAM,MAAM,cAAc,KAAK,CAAC,GAAG,KAAK,CAAC,gBAAgB;AAC/D,UAAM,gBAAgB,YAAY,WAAW;AAC7C,UAAM,iBAAiB,YAAY,KAAK,EAAE,SAAS,GAAG,KAAK,yBAAyB,WAAW;AAC/F,QAAI,CAAC,iBAAiB,CAAC,eAAgB,QAAO;AAC9C,UAAM,eAAe,CAAC,GAAG,SAAS,WAAW,CAAC;AAC9C,UAAM,QAAQ,cAAc,cAAc,OAAO;AACjD,QAAI,MAAM,SAAS,+BAA+B,MAAM,QAAQ,IAAK,QAAO;AAC5E,UAAM,iBAAiB,CAAC,WACtB,aAAa,OAAO,CAAC,gBAAgB,cAAc,QAAQ,WAAW,EAAE,SAAS,CAAC;AACpF,QAAI,eAAe;AACjB,YAAM,cAAc,CAAC,GAAG,SAAS,aAAa,WAAW,CAAC,CAAC;AAC3D,YAAM,UAAU,eAAe,YAAY,SAAS,IAAI,cAAc,YAAY;AAClF,UAAI,CAAC,QAAQ,KAAK,CAAC,SAAS,YAAY,IAAI,KAAK,kBAAkB,KAAK,IAAI,CAAC,EAAG,QAAO;AAAA,IACzF;AACA,WAAO,kBACF,CAAC,eAAe,YAAY,EAAE,KAAK,CAAC,SAAS,yBAAyB,IAAI,KAAK,KAAK,KAAK,EAAE,SAAS,GAAG,CAAC;AAAA,EAC/G,CAAC;AACH;AAUO,SAAS,qBAAqB,SAAiB,QAAqB,WAA+B;AACxG,QAAM,gBAAgB,CAAC,GAAG,SAAS,OAAO,CAAC;AAC3C,MAAI,cAAc,WAAW,EAAG,QAAO;AACvC,QAAM,WAAW,UAAU,SAAS,OAAO,KAAK,CAAC;AACjD,MAAI,cAAc,OAAO,QAAQ,EAAE,SAAS,4BAA6B,QAAO;AAChF,QAAM,YAAY,UAAU,SAAS,OAAO,MAAM,CAAC;AACnD,MAAI,cAAc,OAAO,SAAS,EAAE,SAAS,cAAc,SAAS,kCAAkC;AACpG,WAAO;AAAA,EACT;AACA,SAAO,cAAc,OAAO,SAAS,EAAE,SAAS,cAAc,UAAU,oCACnE,CAAC,eAAe,SAAS,OAAO,KAAK;AAC5C;AAGO,SAAS,kBAAkB,QAAgB,aAA4D;AAC5G,QAAM,QAAQ,OAAO,MAAM,OAAO,WAAW;AAC7C,QAAM,qBAAqB,OAAO,oBAAoB,QAAQ,CAAC,YAAY;AACzE,UAAM,gBAAgB,QAAQ,MAAM,OAAO,WAAW;AACtD,WAAO,cAAc,SAAS,IAAI,CAAC,EAAE,GAAG,SAAS,OAAO,cAAc,CAAC,IAAI,CAAC;AAAA,EAC9E,CAAC;AACD,MAAI,MAAM,WAAW,MAAM,uBAAuB,UAAa,mBAAmB,WAAW,IAAI;AAC/F,WAAO;AAAA,EACT;AACA,QAAM,EAAE,oBAAoB,qBAAqB,GAAG,sBAAsB,IAAI;AAC9E,SAAO;AAAA,IACL,GAAG;AAAA,IACH;AAAA,IACA,GAAI,sBAAsB,mBAAmB,SAAS,IAAI,EAAE,mBAAmB,IAAI,CAAC;AAAA,EACtF;AACF;AAMO,SAAS,2BACd,QACA,SACA,WACyC;AACzC,QAAM,cAAc,QAAQ,OAAO,CAAC,WAAW,qBAAqB,OAAO,MAAM,OAAO,MAAM,CAAC;AAC/F,MAAI,YAAY,WAAW,EAAG,QAAO;AACrC,SAAO,CAAC,SAAS,YAAY,KAAK,CAAC,WAAW,qBAAqB,MAAM,QAAQ,SAAS,CAAC;AAC7F;AAMO,SAAS,4BACd,cACA,SACA,WACS;AACT,QAAM,cAAc,CAAC,GAAG,SAAS,aAAa,KAAK,CAAC;AACpD,MAAI,YAAY,WAAW,EAAG,QAAO;AACrC,QAAM,eAAe;AAAA,IACnB,iCAAiC,aAAa,MAAM,EAAE,KAAK,GAAG;AAAA,IAC9D,aAAa;AAAA,IACb,iCAAiC,aAAa,MAAM,EAAE,KAAK,GAAG;AAAA,EAChE,EAAE,KAAK,GAAG;AACV,SAAO,QAAQ,KAAK,CAAC,WAAW;AAC9B,UAAM,YAAY,UAAU,SAAS,OAAO,MAAM,CAAC;AACnD,WAAO,YAAY,MAAM,SAAS,KAC7B,gBAAgB,OAAO,MAAM,EAAE,KAAK,CAAC,aAAa;AACnD,YAAM,cAAc,gBAAgB,aAAa,QAAQ,QAAQ;AACjE,aAAO,eAAe,KAAK,gBAAgB,aAAa,QAAQ,QAAQ,IAAI;AAAA,IAC9E,CAAC,KACE,qBAAqB,cAAc,QAAQ,SAAS;AAAA,EAC3D,CAAC;AACH;","names":[]}

package/dist/chunk-ETSJD5IV.js

@@ -1,361 +0,0 @@
-import {
-  coerceBool,
-  coerceNumber
-} from "./chunk-PQVCH2AE.js";
-
-// src/correction/correction-contract.ts
-var MEMORY_CATEGORIES = [
-  "fact",
-  "preference",
-  "correction",
-  "entity",
-  "decision",
-  "relationship",
-  "principle",
-  "commitment",
-  "moment",
-  "skill",
-  "rule",
-  "procedure",
-  "reasoning_trace"
-];
-var CORRECTION_ACTION_KINDS = [
-  "supersede",
-  "edit",
-  "retract",
-  "rescope",
-  "redaction_rule"
-];
-var CORRECTION_TEXT_MAX = 1e4;
-var REDACTION_PATTERN_MAX = 256;
-var CORRECTION_MEMORY_ID_MAX = 512;
-function validateCorrectionRequest(request) {
-  if (!request || typeof request !== "object") {
-    throw new CorrectionContractError("CorrectionRequest must be an object.");
-  }
-  const text = typeof request.text === "string" ? request.text.trim() : "";
-  if (text.length === 0) {
-    throw new CorrectionContractError("CorrectionRequest.text is required and must be non-empty.");
-  }
-  if (text.length > CORRECTION_TEXT_MAX) {
-    throw new CorrectionContractError(
-      `CorrectionRequest.text exceeds the ${CORRECTION_TEXT_MAX}-character limit (${text.length}).`
-    );
-  }
-  const targetIds = Array.isArray(request.targetIds) ? request.targetIds.filter((id) => typeof id === "string" && id.length > 0) : void 0;
-  const normalizedTargets = targetIds !== void 0 && targetIds.length === 0 ? void 0 : targetIds;
-  const duplicateOf = readDuplicateOf(request.duplicateOf);
-  if (duplicateOf) {
-    if (!normalizedTargets || normalizedTargets.length !== 1) {
-      throw new CorrectionContractError(
-        "CorrectionRequest.duplicateOf requires exactly one targetIds entry (the duplicate memory)."
-      );
-    }
-    if (normalizedTargets[0] === duplicateOf) {
-      throw new CorrectionContractError(
-        "CorrectionRequest.duplicateOf must be a different memory from targetIds."
-      );
-    }
-  }
-  return {
-    text,
-    ...normalizedTargets ? { targetIds: normalizedTargets } : {},
-    ...duplicateOf ? { duplicateOf } : {},
-    ...request.sessionKey ? { sessionKey: request.sessionKey } : {},
-    ...request.principal ? { principal: request.principal } : {},
-    ...request.namespace ? { namespace: request.namespace } : {}
-  };
-}
-function readDuplicateOf(value) {
-  if (value === void 0 || value === null) return void 0;
-  if (typeof value !== "string") {
-    throw new CorrectionContractError("CorrectionRequest.duplicateOf must be a memory id string.");
-  }
-  const id = value.trim();
-  if (id.length === 0 || id !== value) {
-    throw new CorrectionContractError("CorrectionRequest.duplicateOf must be a non-empty memory id.");
-  }
-  if (id.length > CORRECTION_MEMORY_ID_MAX) {
-    throw new CorrectionContractError(
-      `CorrectionRequest.duplicateOf exceeds the ${CORRECTION_MEMORY_ID_MAX}-character limit (${id.length}).`
-    );
-  }
-  return id;
-}
-function validateRedactionPattern(pattern) {
-  if (typeof pattern !== "string") {
-    throw new CorrectionContractError("redaction_rule.pattern must be a string.");
-  }
-  const trimmed = pattern.trim();
-  if (trimmed.length === 0) {
-    throw new CorrectionContractError("redaction_rule.pattern is required.");
-  }
-  if (trimmed.length > REDACTION_PATTERN_MAX) {
-    throw new CorrectionContractError(
-      `redaction_rule.pattern exceeds the ${REDACTION_PATTERN_MAX}-character bound.`
-    );
-  }
-  if (isRegexLike(trimmed) && isUnsafeRedactionRegex(trimmed)) {
-    throw new CorrectionContractError(
-      "redaction_rule.pattern is unsafe \u2014 use a bounded literal or a regex without nested quantifiers / overlapping alternation."
-    );
-  }
-  if (isRegexLike(trimmed)) {
-    const regexBody = trimmed.slice(1, -1);
-    if (regexBody.length === 0) {
-      throw new CorrectionContractError("redaction_rule.pattern body is empty \u2014 use a non-empty regex.");
-    }
-    try {
-      if (new RegExp(regexBody).test("")) {
-        throw new CorrectionContractError(
-          "redaction_rule.pattern matches the empty string \u2014 it would withhold every fact."
-        );
-      }
-    } catch (e) {
-      if (e instanceof CorrectionContractError) throw e;
-    }
-  }
-  return trimmed;
-}
-function isRegexLike(pattern) {
-  return pattern.startsWith("/") && pattern.endsWith("/") && pattern.length >= 2;
-}
-function isUnsafeRedactionRegex(pattern) {
-  const body = pattern.startsWith("/") && pattern.endsWith("/") ? pattern.slice(1, -1) : pattern;
-  if (/(?:^|[^\\])\(\.\*\)|(?:^|[^\\])\.\*|(?:^|[^\\])\.\+|^\.([^*+]?)$/.test(body)) {
-    return true;
-  }
-  if (body.length > 512) return true;
-  for (let i = 0; i < body.length; i++) {
-    if (body[i] !== "(") continue;
-    let depth = 1;
-    let j = i + 1;
-    while (j < body.length && depth > 0) {
-      if (body[j] === "\\") {
-        j += 2;
-        continue;
-      }
-      if (body[j] === "(") depth++;
-      else if (body[j] === ")") depth--;
-      j++;
-    }
-    if (depth !== 0) continue;
-    const afterGroup = body[j];
-    if (afterGroup !== "+" && afterGroup !== "*" && afterGroup !== "{") continue;
-    const groupBody = body.slice(i + 1, j - 1);
-    if (/[+*?]$/.test(groupBody) || /\{\d+,?\d*\}[+*?]?$/.test(groupBody)) {
-      return true;
-    }
-    if (groupBody.includes("|")) {
-      const branches = groupBody.split("|");
-      if (branches.length >= 2) {
-        const firstChars = new Set(branches.map((b) => b[0]).filter(Boolean));
-        if (firstChars.size < branches.filter((b) => b.length > 0).length) {
-          return true;
-        }
-      }
-    }
-    i = j;
-  }
-  return false;
-}
-function validateCorrectionAction(action) {
-  if (!action || typeof action !== "object") {
-    throw new CorrectionContractError("CorrectionAction must be an object.");
-  }
-  const a = action;
-  if (typeof a.kind !== "string" || !CORRECTION_ACTION_KINDS.includes(a.kind)) {
-    throw new CorrectionContractError(
-      `CorrectionAction.kind must be one of: ${CORRECTION_ACTION_KINDS.join(", ")}.`
-    );
-  }
-  switch (a.kind) {
-    case "supersede":
-      if (typeof a.loserId !== "string" || a.loserId.length === 0) {
-        throw new CorrectionContractError("supersede.loserId is required.");
-      }
-      {
-        const hasReplacement = a.replacement !== void 0 && a.replacement !== null;
-        const hasWinner = a.winnerId !== void 0 && a.winnerId !== null;
-        if (hasWinner) {
-          if (typeof a.winnerId !== "string" || a.winnerId.trim().length === 0 || a.winnerId !== a.winnerId.trim()) {
-            throw new CorrectionContractError("supersede.winnerId must be a non-empty memory id.");
-          }
-          if (a.winnerId === a.loserId) {
-            throw new CorrectionContractError("supersede.winnerId must differ from loserId.");
-          }
-          if (hasReplacement) {
-            throw new CorrectionContractError("supersede.winnerId cannot be combined with a replacement draft.");
-          }
-        }
-        if (hasReplacement) validateMemoryDraft(a.replacement);
-      }
-      break;
-    case "edit":
-      if (typeof a.memoryId !== "string" || a.memoryId.length === 0) {
-        throw new CorrectionContractError("edit.memoryId is required.");
-      }
-      if (typeof a.patch !== "string" || a.patch.length === 0) {
-        throw new CorrectionContractError("edit.patch is required and must be non-empty.");
-      }
-      break;
-    case "retract":
-      if (typeof a.memoryId !== "string" || a.memoryId.length === 0) {
-        throw new CorrectionContractError("retract.memoryId is required.");
-      }
-      break;
-    case "rescope":
-      if (typeof a.memoryId !== "string" || a.memoryId.length === 0) {
-        throw new CorrectionContractError("rescope.memoryId is required.");
-      }
-      if (typeof a.toNamespace !== "string" || a.toNamespace.trim().length === 0) {
-        throw new CorrectionContractError("rescope.toNamespace is required.");
-      }
-      break;
-    case "redaction_rule":
-      if (typeof a.pattern !== "string") {
-        throw new CorrectionContractError("redaction_rule.pattern is required.");
-      }
-      validateRedactionPattern(a.pattern);
-      break;
-  }
-}
-function validateMemoryDraft(draft) {
-  if (!draft || typeof draft !== "object") {
-    throw new CorrectionContractError("MemoryDraft must be an object.");
-  }
-  const d = draft;
-  if (typeof d.content !== "string" || d.content.trim().length === 0) {
-    throw new CorrectionContractError("MemoryDraft.content is required and must be non-empty.");
-  }
-  if (d.category !== void 0) {
-    if (typeof d.category !== "string" || !MEMORY_CATEGORIES.includes(d.category)) {
-      throw new CorrectionContractError(
-        `MemoryDraft.category must be one of: ${MEMORY_CATEGORIES.join(", ")}.`
-      );
-    }
-  }
-  if (d.confidence !== void 0 && (typeof d.confidence !== "number" || d.confidence < 0 || d.confidence > 1)) {
-    throw new CorrectionContractError("MemoryDraft.confidence must be a number in [0, 1].");
-  }
-  if (d.tags !== void 0 && !Array.isArray(d.tags)) {
-    throw new CorrectionContractError("MemoryDraft.tags must be an array.");
-  }
-  if (d.structuredAttributes !== void 0 && (typeof d.structuredAttributes !== "object" || d.structuredAttributes === null)) {
-    throw new CorrectionContractError("MemoryDraft.structuredAttributes must be an object.");
-  }
-}
-function deterministicFallbackPlan(args) {
-  return {
-    planId: newPlanId(),
-    request: args.request,
-    namespace: args.namespace,
-    affected: args.affected,
-    classification: "outdated",
-    actions: [],
-    diff: "",
-    confidence: 0,
-    warnings: [...args.warnings, "planner LLM unavailable \u2014 manual action selection required"],
-    createdAt: args.createdAt,
-    expiresAt: args.expiresAt,
-    status: "pending"
-  };
-}
-function newPlanId() {
-  return `corr-${Date.now().toString(36)}-${Math.random().toString(36).slice(2, 10)}`;
-}
-var CorrectionContractError = class extends Error {
-  constructor(message) {
-    super(message);
-    this.name = "CorrectionContractError";
-  }
-};
-
-// src/correction/correction-config.ts
-var DEFAULT_CORRECTION_CLASSIFY_TIMEOUT_MS = 45e3;
-var MAX_CORRECTION_CLASSIFY_TIMEOUT_MS = 3e5;
-function parseCorrectionConfig(cfg) {
-  return {
-    correctionEnabled: (() => {
-      const nested = cfg.correction?.enabled;
-      const raw = nested !== void 0 ? nested : cfg.correctionEnabled;
-      if (raw === void 0 || raw === null) return true;
-      const value = coerceBool(raw);
-      if (value === void 0) {
-        throw new Error(`Invalid correction.enabled: expected a boolean, got ${JSON.stringify(raw)}`);
-      }
-      return value;
-    })(),
-    correctionApplyRequiresConfirm: (() => {
-      const nested = cfg.correction?.applyRequiresConfirm;
-      const raw = nested !== void 0 ? nested : cfg.correctionApplyRequiresConfirm;
-      if (raw === void 0 || raw === null) return true;
-      const value = coerceBool(raw);
-      if (value === void 0) {
-        throw new Error(`Invalid correction.applyRequiresConfirm: expected a boolean, got ${JSON.stringify(raw)}`);
-      }
-      return value;
-    })(),
-    correctionMaxAffected: (() => {
-      const rawNested = cfg.correction?.maxAffected;
-      const raw = rawNested !== void 0 ? rawNested : cfg.correctionMaxAffected;
-      if (raw === void 0 || raw === null) return 10;
-      const n = coerceNumber(raw);
-      if (n === void 0 || !Number.isFinite(n) || n < 1 || !Number.isInteger(n)) {
-        throw new Error(`Invalid correction.maxAffected: expected an integer >= 1, got ${JSON.stringify(raw)}`);
-      }
-      return n;
-    })(),
-    correctionPlanTtlHours: (() => {
-      const nested = cfg.correction?.planTtlHours;
-      const fromNested = nested !== void 0 ? coerceNumber(nested) : void 0;
-      if (fromNested !== void 0 && fromNested >= 1) return fromNested;
-      if (nested !== void 0 && fromNested === void 0) {
-        throw new Error(`Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(nested)}`);
-      }
-      if (fromNested !== void 0 && fromNested < 1) {
-        throw new Error(`Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(nested)}`);
-      }
-      const fromFlat = coerceNumber(cfg.correctionPlanTtlHours);
-      if (fromFlat !== void 0 && fromFlat >= 1) return fromFlat;
-      if (cfg.correctionPlanTtlHours !== void 0 && fromFlat === void 0) {
-        throw new Error(
-          `Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(cfg.correctionPlanTtlHours)}`
-        );
-      }
-      if (fromFlat !== void 0 && fromFlat < 1) {
-        throw new Error(
-          `Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(cfg.correctionPlanTtlHours)}`
-        );
-      }
-      return 24;
-    })(),
-    correctionClassifyTimeoutMs: (() => {
-      const nested = cfg.correction?.classifyTimeoutMs;
-      const raw = nested !== void 0 ? nested : cfg.correctionClassifyTimeoutMs;
-      if (raw === void 0 || raw === null) return DEFAULT_CORRECTION_CLASSIFY_TIMEOUT_MS;
-      const n = coerceNumber(raw);
-      if (n === void 0 || !Number.isInteger(n) || n < 1 || n > MAX_CORRECTION_CLASSIFY_TIMEOUT_MS) {
-        throw new Error(
-          `Invalid correction.classifyTimeoutMs: expected an integer from 1 to ${MAX_CORRECTION_CLASSIFY_TIMEOUT_MS}, got ${JSON.stringify(raw)}`
-        );
-      }
-      return n;
-    })()
-  };
-}
-
-export {
-  MEMORY_CATEGORIES,
-  CORRECTION_TEXT_MAX,
-  validateCorrectionRequest,
-  validateRedactionPattern,
-  validateCorrectionAction,
-  deterministicFallbackPlan,
-  newPlanId,
-  CorrectionContractError,
-  DEFAULT_CORRECTION_CLASSIFY_TIMEOUT_MS,
-  MAX_CORRECTION_CLASSIFY_TIMEOUT_MS,
-  parseCorrectionConfig
-};
-//# sourceMappingURL=chunk-ETSJD5IV.js.map

package/dist/chunk-ETSJD5IV.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/correction/correction-contract.ts","../src/correction/correction-config.ts"],"sourcesContent":["/**\n * correction/correction-contract.ts — Types for the Correction Contract\n * (issue #1580).\n *\n * The Correction Contract is the SINGLE plan/apply pipeline every memory\n * correction flows through: supersession, invalidation, tombstone, edit,\n * rescope, redaction. A correction arrives as a plain-language statement\n * (\"we migrated to MySQL in March\"); the planner turns it into a structured\n * {@link CorrectionPlan}; the executor applies the plan in non-destructive\n * order through the existing storage/orchestrator chokepoints.\n *\n * This module is PURE types + validation helpers — no I/O, no side effects.\n * The planner and executor live in sibling modules and inject their own\n * collaborators so the contract is testable in isolation (rule 33).\n *\n * Design rules honored (issue #1580 design section):\n *   - Plans are per-request state on disk, never module-level (rules 11/47).\n *   - Caller-supplied namespaces are NEVER trusted raw — the service\n *     resolves them through the normal namespace policy (rule 42).\n *   - Bulk operations refuse past maxAffected (no silent truncation, §39).\n *   - `never_store` redaction patterns must be bounded and safe (§34).\n */\n\nimport type { MemoryCategory, MemoryFrontmatter } from \"../types.js\";\n\n// ---------------------------------------------------------------------------\n// Request\n// ---------------------------------------------------------------------------\n\n/**\n * The user-facing input: a plain-language correction plus optional explicit\n * targets. This is what every surface (MCP / HTTP / CLI) collects before\n * handing off to the planner.\n */\nexport interface CorrectionRequest {\n  /** Natural-language correction statement. Required, non-empty. */\n  text: string;\n  /**\n   * Explicit target memory ids (or handles via #1582). When present the\n   * planner resolves these directly; an unknown id is an explicit error\n   * (rule 34), never a silent empty plan. When absent the planner searches.\n   */\n  targetIds?: string[];\n  /** Session key for namespace/principal resolution. */\n  sessionKey?: string;\n  /** Authenticated principal (resolved by the service, never trusted raw). */\n  principal?: string;\n  /**\n   * Caller-suggested namespace. ALWAYS re-resolved through the namespace\n   * policy by the service before reaching the planner (rule 42). The\n   * planner only sees the ALREADY-AUTHORIZED namespace.\n   */\n  namespace?: string;\n  /**\n   * Winner memory id. When set, `targetIds` must be exactly the duplicate\n   * (the loser). The planner skips classification and drafts one recoverable\n   * supersede — no hard delete, no replacement write.\n   */\n  duplicateOf?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Classification + actions\n// ---------------------------------------------------------------------------\n\nexport type CorrectionClassification =\n  | \"wrong\"\n  | \"outdated\"\n  | \"incomplete\"\n  | \"wrong_scope\"\n  | \"never_store\";\n\nexport const CORRECTION_CLASSIFICATIONS: readonly CorrectionClassification[] = [\n  \"wrong\",\n  \"outdated\",\n  \"incomplete\",\n  \"wrong_scope\",\n  \"never_store\",\n];\n\n/**\n * A draft for a replacement memory (supersede action). Mirrors the subset of\n * {@link MemoryFrontmatter} a correction caller may legitimately set; the\n * executor fills in id/created/updated/source.\n */\nexport interface MemoryDraft {\n  content: string;\n  category?: MemoryCategory;\n  confidence?: number;\n  tags?: string[];\n  entityRef?: string;\n  /** Optional event-time anchor for bi-temporal supersession (#1578). */\n  validAt?: string;\n  /** Optional observed-at anchor for bi-temporal supersession (#1578). */\n  observedAt?: string;\n  structuredAttributes?: Record<string, string>;\n}\n\n/**\n * The known {@link MemoryCategory} values. A replacement/rescope category must\n * be one of these — rejecting path-like or unexpected strings before they reach\n * `StorageManager.writeMemory`, which incorporates the category into the\n * generated memory id/path (review thread Of-XJ).\n */\nexport const MEMORY_CATEGORIES: readonly MemoryCategory[] = [\n  \"fact\", \"preference\", \"correction\", \"entity\", \"decision\",\n  \"relationship\", \"principle\", \"commitment\", \"moment\",\n  \"skill\", \"rule\", \"procedure\", \"reasoning_trace\",\n];\n\nexport type CorrectionAction =\n  /**\n   * Outdated: a new fact replaces the loser, or `winnerId` records an\n   * existing memory as the replacement without writing a new one.\n   */\n  | { kind: \"supersede\"; loserId: string; replacement?: MemoryDraft; winnerId?: string }\n  /** Incomplete / minor-wrong: a versioned edit to an existing memory. */\n  | { kind: \"edit\"; memoryId: string; patch: string }\n  /** Wrong: retire + tombstone. */\n  | { kind: \"retract\"; memoryId: string }\n  /** Wrong scope: move to a different namespace. */\n  | { kind: \"rescope\"; memoryId: string; toNamespace: string }\n  /** Never-store: a future-extraction redaction rule. */\n  | { kind: \"redaction_rule\"; pattern: string };\n\nexport const CORRECTION_ACTION_KINDS: readonly CorrectionAction[\"kind\"][] = [\n  \"supersede\",\n  \"edit\",\n  \"retract\",\n  \"rescope\",\n  \"redaction_rule\",\n];\n\n// ---------------------------------------------------------------------------\n// Plan + outcome\n// ---------------------------------------------------------------------------\n\n/**\n * One affected memory in a plan: where it lives, an excerpt, why it is\n * affected, and (when available) the source quote that supports the\n * correction (#1575 provenance).\n */\nexport interface CorrectionAffectedEntry {\n  memoryId: string;\n  /** File path relative to the storage dir, for diff rendering. */\n  path: string;\n  excerpt: string;\n  why: string;\n  sourceQuote?: string;\n}\n\n/**\n * A persisted, expiring correction plan. Read-only artifact produced by the\n * planner; consumed (once) by the executor.\n */\nexport interface CorrectionPlan {\n  planId: string;\n  request: CorrectionRequest;\n  /** Authorized namespace the plan is scoped to (resolved by the service). */\n  namespace: string;\n  affected: CorrectionAffectedEntry[];\n  classification: CorrectionClassification;\n  actions: CorrectionAction[];\n  /** Human-readable diff preview rendered via page-versioning. */\n  diff: string;\n  /** Planner confidence in [0, 1]. `0` means manual selection required. */\n  confidence: number;\n  warnings: string[];\n  createdAt: string;\n  /** ISO timestamp after which apply rejects the plan as expired. */\n  expiresAt: string;\n  /**\n   * Lifecycle: `pending` → `applying` → `applied`|`partial` (or `discarded`).\n   * The executor flips a plan to `applying` BEFORE running any mutation\n   * (review thread OgIqt): if the process dies mid-apply, the plan stays\n   * `applying` and is NOT silently retryable — a partially-applied plan must\n   * never be re-applied wholesale (it would duplicate succeeded actions).\n   */\n  status?: \"pending\" | \"applying\" | \"applied\" | \"discarded\" | \"partial\";\n  /**\n   * ISO timestamp recorded when the plan transitioned to `applying` (#1713\n   * Item 2). Startup recovery uses this to detect plans stuck in `applying`\n   * past the stale-applying TTL (process died mid-apply) and discard+scrub\n   * them. Absent on plans that never entered `applying`.\n   */\n  applyingAt?: string;\n}\n\n/**\n * Per-action outcome recorded by the executor. An action whose new-state\n * write failed is `failed`; the executor never destroys old state for a\n * failed action (rule 25 / checklist §14).\n */\nexport interface CorrectionActionResult {\n  action: CorrectionAction;\n  status: \"applied\" | \"failed\" | \"skipped\";\n  /** For supersede: the new memory id. For edit: the memory id. */\n  memoryId?: string;\n  /** For supersede/retract: the emitted tombstone id (if any). */\n  tombstoneId?: string;\n  error?: string;\n}\n\nexport interface CorrectionOutcome {\n  planId: string;\n  status: \"applied\" | \"partial\";\n  results: CorrectionActionResult[];\n  /** Audit-record memory id (corrections are themselves memories). */\n  auditMemoryId: string;\n  /** ISO timestamp of the apply. */\n  appliedAt: string;\n}\n\n// ---------------------------------------------------------------------------\n// Validation helpers (pure) — shared by planner, executor, and surface tests\n// ---------------------------------------------------------------------------\n\n/** Maximum supported `text` length. Surfaces bound this earlier; the planner\n *  re-validates so a direct-service caller cannot bypass. */\nexport const CORRECTION_TEXT_MAX = 10_000;\n\n/** Maximum supported redaction pattern length (§34 — bounded patterns). */\nexport const REDACTION_PATTERN_MAX = 256;\n\n/** Maximum memory-id length for `duplicateOf` / explicit targets. */\nexport const CORRECTION_MEMORY_ID_MAX = 512;\n\n/**\n * Validate a {@link CorrectionRequest}'s invariants. Returns the cleaned\n * request or throws with a field-specific message (rule 51 — list valid\n * options, never silently default).\n */\nexport function validateCorrectionRequest(request: CorrectionRequest): CorrectionRequest {\n  if (!request || typeof request !== \"object\") {\n    throw new CorrectionContractError(\"CorrectionRequest must be an object.\");\n  }\n  const text = typeof request.text === \"string\" ? request.text.trim() : \"\";\n  if (text.length === 0) {\n    throw new CorrectionContractError(\"CorrectionRequest.text is required and must be non-empty.\");\n  }\n  if (text.length > CORRECTION_TEXT_MAX) {\n    throw new CorrectionContractError(\n      `CorrectionRequest.text exceeds the ${CORRECTION_TEXT_MAX}-character limit (${text.length}).`,\n    );\n  }\n  const targetIds = Array.isArray(request.targetIds)\n    ? request.targetIds.filter((id): id is string => typeof id === \"string\" && id.length > 0)\n    : undefined;\n  const normalizedTargets = targetIds !== undefined && targetIds.length === 0 ? undefined : targetIds;\n  const duplicateOf = readDuplicateOf(request.duplicateOf);\n  if (duplicateOf) {\n    if (!normalizedTargets || normalizedTargets.length !== 1) {\n      throw new CorrectionContractError(\n        \"CorrectionRequest.duplicateOf requires exactly one targetIds entry (the duplicate memory).\",\n      );\n    }\n    if (normalizedTargets[0] === duplicateOf) {\n      throw new CorrectionContractError(\n        \"CorrectionRequest.duplicateOf must be a different memory from targetIds.\",\n      );\n    }\n  }\n  return {\n    text,\n    ...(normalizedTargets ? { targetIds: normalizedTargets } : {}),\n    ...(duplicateOf ? { duplicateOf } : {}),\n    ...(request.sessionKey ? { sessionKey: request.sessionKey } : {}),\n    ...(request.principal ? { principal: request.principal } : {}),\n    ...(request.namespace ? { namespace: request.namespace } : {}),\n  };\n}\n\nfunction readDuplicateOf(value: unknown): string | undefined {\n  if (value === undefined || value === null) return undefined;\n  if (typeof value !== \"string\") {\n    throw new CorrectionContractError(\"CorrectionRequest.duplicateOf must be a memory id string.\");\n  }\n  const id = value.trim();\n  if (id.length === 0 || id !== value) {\n    throw new CorrectionContractError(\"CorrectionRequest.duplicateOf must be a non-empty memory id.\");\n  }\n  if (id.length > CORRECTION_MEMORY_ID_MAX) {\n    throw new CorrectionContractError(\n      `CorrectionRequest.duplicateOf exceeds the ${CORRECTION_MEMORY_ID_MAX}-character limit (${id.length}).`,\n    );\n  }\n  return id;\n}\n\n/**\n * Validate a redaction pattern (§34 — bounded, literal-or-safe-regex; reject\n * catastrophic patterns). Returns the cleaned pattern or throws.\n */\nexport function validateRedactionPattern(pattern: string): string {\n  if (typeof pattern !== \"string\") {\n    throw new CorrectionContractError(\"redaction_rule.pattern must be a string.\");\n  }\n  const trimmed = pattern.trim();\n  if (trimmed.length === 0) {\n    throw new CorrectionContractError(\"redaction_rule.pattern is required.\");\n  }\n  if (trimmed.length > REDACTION_PATTERN_MAX) {\n    throw new CorrectionContractError(\n      `redaction_rule.pattern exceeds the ${REDACTION_PATTERN_MAX}-character bound.`,\n    );\n  }\n  // Reject patterns that could match an unbounded string (overly-broad) OR\n  // exhibit catastrophic backtracking (nested quantifiers like `(a+)+`). We do\n  // NOT execute the regex (that would be ReDoS itself); we only inspect shape.\n  if (isRegexLike(trimmed) && isUnsafeRedactionRegex(trimmed)) {\n    throw new CorrectionContractError(\n      \"redaction_rule.pattern is unsafe — use a bounded literal or a regex without nested quantifiers / overlapping alternation.\",\n    );\n  }\n  // #1669 P2: reject zero-width regex (empty body or matches empty string)\n  // that would withhold every fact.\n  if (isRegexLike(trimmed)) {\n    const regexBody = trimmed.slice(1, -1);\n    if (regexBody.length === 0) {\n      throw new CorrectionContractError(\"redaction_rule.pattern body is empty — use a non-empty regex.\");\n    }\n    try {\n      if (new RegExp(regexBody).test(\"\")) {\n        throw new CorrectionContractError(\n          \"redaction_rule.pattern matches the empty string — it would withhold every fact.\",\n        );\n      }\n    } catch (e) {\n      if (e instanceof CorrectionContractError) throw e;\n      // Compilation failed — the extraction-time defense handles it.\n    }\n  }\n  return trimmed;\n}\n\n/** Only `/.../`-wrapped patterns are treated as regex; everything else is a\n *  literal (review thread P1 — consistent with extraction-redaction-rules.ts). */\nfunction isRegexLike(pattern: string): boolean {\n  return pattern.startsWith(\"/\") && pattern.endsWith(\"/\") && pattern.length >= 2;\n}\n\n/**\n * Reject a regex that would either match an arbitrary-length run of any\n * character (overly-broad) OR exhibit catastrophic backtracking (ReDoS).\n * Mirrors the safe-regex heuristic in extraction-redaction-rules.ts so the\n * apply-time chokepoint and the extraction-time defense agree on what is\n * pathological — intentionally not imported to keep the two modules decoupled\n * (contract owns validation; extraction owns consultation).\n */\nfunction isUnsafeRedactionRegex(pattern: string): boolean {\n  const body = pattern.startsWith(\"/\") && pattern.endsWith(\"/\")\n    ? pattern.slice(1, -1)\n    : pattern;\n  // `.*`, `.+`, `.`, or `(.*)` etc. anywhere → overly broad.\n  if (/(?:^|[^\\\\])\\(\\.\\*\\)|(?:^|[^\\\\])\\.\\*|(?:^|[^\\\\])\\.\\+|^\\.([^*+]?)$/.test(body)) {\n    return true;\n  }\n  // Nested quantifier: a group (...) whose body ends with a quantifier and\n  // which is itself quantified → exponential blowup on near-miss inputs\n  // (classic ReDoS shapes: (a+)+, (a*)*, (a?)+). Also catches overlapping\n  // alternation under repetition: (a|a)+ where branches share a prefix.\n  if (body.length > 512) return true;\n  for (let i = 0; i < body.length; i++) {\n    if (body[i] !== \"(\") continue;\n    let depth = 1;\n    let j = i + 1;\n    while (j < body.length && depth > 0) {\n      if (body[j] === \"\\\\\") { j += 2; continue; }\n      if (body[j] === \"(\") depth++;\n      else if (body[j] === \")\") depth--;\n      j++;\n    }\n    if (depth !== 0) continue;\n    const afterGroup = body[j];\n    if (afterGroup !== \"+\" && afterGroup !== \"*\" && afterGroup !== \"{\") continue;\n    const groupBody = body.slice(i + 1, j - 1);\n    if (/[+*?]$/.test(groupBody) || /\\{\\d+,?\\d*\\}[+*?]?$/.test(groupBody)) {\n      return true;\n    }\n    if (groupBody.includes(\"|\")) {\n      const branches = groupBody.split(\"|\");\n      if (branches.length >= 2) {\n        const firstChars = new Set(branches.map((b) => b[0]).filter(Boolean));\n        if (firstChars.size < branches.filter((b) => b.length > 0).length) {\n          return true;\n        }\n      }\n    }\n    i = j;\n  }\n  return false;\n}\n\n/**\n * Validate the shape of a {@link CorrectionAction}. Used by the executor\n * before applying and by the surface layer to reject malformed client input\n * (rule 51 — list valid kinds).\n */\nexport function validateCorrectionAction(action: unknown): asserts action is CorrectionAction {\n  if (!action || typeof action !== \"object\") {\n    throw new CorrectionContractError(\"CorrectionAction must be an object.\");\n  }\n  const a = action as Record<string, unknown>;\n  if (typeof a.kind !== \"string\" || !CORRECTION_ACTION_KINDS.includes(a.kind as CorrectionAction[\"kind\"])) {\n    throw new CorrectionContractError(\n      `CorrectionAction.kind must be one of: ${CORRECTION_ACTION_KINDS.join(\", \")}.`,\n    );\n  }\n  switch (a.kind) {\n    case \"supersede\":\n      if (typeof a.loserId !== \"string\" || a.loserId.length === 0) {\n        throw new CorrectionContractError(\"supersede.loserId is required.\");\n      }\n      {\n        const hasReplacement = a.replacement !== undefined && a.replacement !== null;\n        const hasWinner = a.winnerId !== undefined && a.winnerId !== null;\n        if (hasWinner) {\n          if (typeof a.winnerId !== \"string\" || a.winnerId.trim().length === 0 || a.winnerId !== a.winnerId.trim()) {\n            throw new CorrectionContractError(\"supersede.winnerId must be a non-empty memory id.\");\n          }\n          if (a.winnerId === a.loserId) {\n            throw new CorrectionContractError(\"supersede.winnerId must differ from loserId.\");\n          }\n          if (hasReplacement) {\n            throw new CorrectionContractError(\"supersede.winnerId cannot be combined with a replacement draft.\");\n          }\n        }\n        if (hasReplacement) validateMemoryDraft(a.replacement);\n      }\n      break;\n    case \"edit\":\n      if (typeof a.memoryId !== \"string\" || a.memoryId.length === 0) {\n        throw new CorrectionContractError(\"edit.memoryId is required.\");\n      }\n      if (typeof a.patch !== \"string\" || a.patch.length === 0) {\n        throw new CorrectionContractError(\"edit.patch is required and must be non-empty.\");\n      }\n      break;\n    case \"retract\":\n      if (typeof a.memoryId !== \"string\" || a.memoryId.length === 0) {\n        throw new CorrectionContractError(\"retract.memoryId is required.\");\n      }\n      break;\n    case \"rescope\":\n      if (typeof a.memoryId !== \"string\" || a.memoryId.length === 0) {\n        throw new CorrectionContractError(\"rescope.memoryId is required.\");\n      }\n      if (typeof a.toNamespace !== \"string\" || a.toNamespace.trim().length === 0) {\n        throw new CorrectionContractError(\"rescope.toNamespace is required.\");\n      }\n      break;\n    case \"redaction_rule\":\n      if (typeof a.pattern !== \"string\") {\n        throw new CorrectionContractError(\"redaction_rule.pattern is required.\");\n      }\n      validateRedactionPattern(a.pattern);\n      break;\n  }\n}\n\n/** Validate a {@link MemoryDraft}. Throws on invalid shape. */\nexport function validateMemoryDraft(draft: unknown): asserts draft is MemoryDraft {\n  if (!draft || typeof draft !== \"object\") {\n    throw new CorrectionContractError(\"MemoryDraft must be an object.\");\n  }\n  const d = draft as Record<string, unknown>;\n  if (typeof d.content !== \"string\" || d.content.trim().length === 0) {\n    throw new CorrectionContractError(\"MemoryDraft.content is required and must be non-empty.\");\n  }\n  if (d.category !== undefined) {\n    if (typeof d.category !== \"string\" || !(MEMORY_CATEGORIES as readonly string[]).includes(d.category)) {\n      throw new CorrectionContractError(\n        `MemoryDraft.category must be one of: ${MEMORY_CATEGORIES.join(\", \")}.`,\n      );\n    }\n  }\n  if (d.confidence !== undefined && (typeof d.confidence !== \"number\" || d.confidence < 0 || d.confidence > 1)) {\n    throw new CorrectionContractError(\"MemoryDraft.confidence must be a number in [0, 1].\");\n  }\n  if (d.tags !== undefined && !Array.isArray(d.tags)) {\n    throw new CorrectionContractError(\"MemoryDraft.tags must be an array.\");\n  }\n  if (d.structuredAttributes !== undefined && (typeof d.structuredAttributes !== \"object\" || d.structuredAttributes === null)) {\n    throw new CorrectionContractError(\"MemoryDraft.structuredAttributes must be an object.\");\n  }\n}\n\n/**\n * Deterministic fallback plan (rule 13): when the planner's LLM is\n * unavailable, the plan degrades to a search result, never an error page.\n * Classification `outdated`, confidence `0`, actions empty.\n */\nexport function deterministicFallbackPlan(args: {\n  request: CorrectionRequest;\n  namespace: string;\n  affected: CorrectionAffectedEntry[];\n  warnings: string[];\n  createdAt: string;\n  expiresAt: string;\n}): CorrectionPlan {\n  return {\n    planId: newPlanId(),\n    request: args.request,\n    namespace: args.namespace,\n    affected: args.affected,\n    classification: \"outdated\",\n    actions: [],\n    diff: \"\",\n    confidence: 0,\n    warnings: [...args.warnings, \"planner LLM unavailable — manual action selection required\"],\n    createdAt: args.createdAt,\n    expiresAt: args.expiresAt,\n    status: \"pending\",\n  };\n}\n\n/** Generate a stable plan id. Exposed for tests + deterministic fallback. */\nexport function newPlanId(): string {\n  return `corr-${Date.now().toString(36)}-${Math.random().toString(36).slice(2, 10)}`;\n}\n\n/** Error class for contract violations. Surfaces map it to a 400 / input error. */\nexport class CorrectionContractError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"CorrectionContractError\";\n  }\n}\n","/**\n * Correction-contract config (issue #1580 plus classify timeout).\n *\n * Extracted from config.ts so the grandfathered parser file does not grow.\n * Nested `correction.<key>` wins over the flat `correction<Key>` legacy key.\n * Invalid values throw — they are never clamped or silently defaulted.\n *\n * Reads stay inline on `cfg` so the parsed-key extractor records the same\n * paths the plugin schema declares.\n */\nimport { coerceBool, coerceNumber } from \"../connectors/coerce.js\";\n\nexport const DEFAULT_CORRECTION_CLASSIFY_TIMEOUT_MS = 45_000;\nexport const MAX_CORRECTION_CLASSIFY_TIMEOUT_MS = 300_000;\n\nexport interface ParsedCorrectionConfig {\n  correctionEnabled: boolean;\n  correctionApplyRequiresConfirm: boolean;\n  correctionMaxAffected: number;\n  correctionPlanTtlHours: number;\n  correctionClassifyTimeoutMs: number;\n}\n\nexport function parseCorrectionConfig(cfg: Record<string, unknown>): ParsedCorrectionConfig {\n  return {\n    correctionEnabled: (() => {\n      const nested = (cfg.correction as Record<string, unknown> | undefined)?.enabled;\n      const raw = nested !== undefined ? nested : cfg.correctionEnabled;\n      if (raw === undefined || raw === null) return true;\n      const value = coerceBool(raw);\n      if (value === undefined) {\n        throw new Error(`Invalid correction.enabled: expected a boolean, got ${JSON.stringify(raw)}`);\n      }\n      return value;\n    })(),\n    correctionApplyRequiresConfirm: (() => {\n      const nested = (cfg.correction as Record<string, unknown> | undefined)?.applyRequiresConfirm;\n      const raw = nested !== undefined ? nested : cfg.correctionApplyRequiresConfirm;\n      if (raw === undefined || raw === null) return true;\n      const value = coerceBool(raw);\n      if (value === undefined) {\n        throw new Error(`Invalid correction.applyRequiresConfirm: expected a boolean, got ${JSON.stringify(raw)}`);\n      }\n      return value;\n    })(),\n    correctionMaxAffected: (() => {\n      const rawNested = (cfg.correction as Record<string, unknown> | undefined)?.maxAffected;\n      const raw = rawNested !== undefined ? rawNested : cfg.correctionMaxAffected;\n      if (raw === undefined || raw === null) return 10;\n      const n = coerceNumber(raw);\n      if (n === undefined || !Number.isFinite(n) || n < 1 || !Number.isInteger(n)) {\n        throw new Error(`Invalid correction.maxAffected: expected an integer >= 1, got ${JSON.stringify(raw)}`);\n      }\n      return n;\n    })(),\n    correctionPlanTtlHours: (() => {\n      const nested = (cfg.correction as Record<string, unknown> | undefined)?.planTtlHours;\n      const fromNested = nested !== undefined ? coerceNumber(nested) : undefined;\n      if (fromNested !== undefined && fromNested >= 1) return fromNested;\n      if (nested !== undefined && fromNested === undefined) {\n        throw new Error(`Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(nested)}`);\n      }\n      if (fromNested !== undefined && fromNested < 1) {\n        throw new Error(`Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(nested)}`);\n      }\n      const fromFlat = coerceNumber(cfg.correctionPlanTtlHours);\n      if (fromFlat !== undefined && fromFlat >= 1) return fromFlat;\n      if (cfg.correctionPlanTtlHours !== undefined && fromFlat === undefined) {\n        throw new Error(\n          `Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(cfg.correctionPlanTtlHours)}`\n        );\n      }\n      if (fromFlat !== undefined && fromFlat < 1) {\n        throw new Error(\n          `Invalid correction.planTtlHours: expected a number >= 1, got ${JSON.stringify(cfg.correctionPlanTtlHours)}`\n        );\n      }\n      return 24;\n    })(),\n    correctionClassifyTimeoutMs: (() => {\n      const nested = (cfg.correction as Record<string, unknown> | undefined)?.classifyTimeoutMs;\n      const raw = nested !== undefined ? nested : cfg.correctionClassifyTimeoutMs;\n      if (raw === undefined || raw === null) return DEFAULT_CORRECTION_CLASSIFY_TIMEOUT_MS;\n      const n = coerceNumber(raw);\n      if (n === undefined || !Number.isInteger(n) || n < 1 || n > MAX_CORRECTION_CLASSIFY_TIMEOUT_MS) {\n        throw new Error(\n          `Invalid correction.classifyTimeoutMs: expected an integer from 1 to ${MAX_CORRECTION_CLASSIFY_TIMEOUT_MS}, got ${JSON.stringify(raw)}`\n        );\n      }\n      return n;\n    })(),\n  };\n}\n"],"mappings":";;;;;;AAwGO,IAAM,oBAA+C;AAAA,EAC1D;AAAA,EAAQ;AAAA,EAAc;AAAA,EAAc;AAAA,EAAU;AAAA,EAC9C;AAAA,EAAgB;AAAA,EAAa;AAAA,EAAc;AAAA,EAC3C;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAa;AAChC;AAiBO,IAAM,0BAA+D;AAAA,EAC1E;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAwFO,IAAM,sBAAsB;AAG5B,IAAM,wBAAwB;AAG9B,IAAM,2BAA2B;AAOjC,SAAS,0BAA0B,SAA+C;AACvF,MAAI,CAAC,WAAW,OAAO,YAAY,UAAU;AAC3C,UAAM,IAAI,wBAAwB,sCAAsC;AAAA,EAC1E;AACA,QAAM,OAAO,OAAO,QAAQ,SAAS,WAAW,QAAQ,KAAK,KAAK,IAAI;AACtE,MAAI,KAAK,WAAW,GAAG;AACrB,UAAM,IAAI,wBAAwB,2DAA2D;AAAA,EAC/F;AACA,MAAI,KAAK,SAAS,qBAAqB;AACrC,UAAM,IAAI;AAAA,MACR,sCAAsC,mBAAmB,qBAAqB,KAAK,MAAM;AAAA,IAC3F;AAAA,EACF;AACA,QAAM,YAAY,MAAM,QAAQ,QAAQ,SAAS,IAC7C,QAAQ,UAAU,OAAO,CAAC,OAAqB,OAAO,OAAO,YAAY,GAAG,SAAS,CAAC,IACtF;AACJ,QAAM,oBAAoB,cAAc,UAAa,UAAU,WAAW,IAAI,SAAY;AAC1F,QAAM,cAAc,gBAAgB,QAAQ,WAAW;AACvD,MAAI,aAAa;AACf,QAAI,CAAC,qBAAqB,kBAAkB,WAAW,GAAG;AACxD,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AACA,QAAI,kBAAkB,CAAC,MAAM,aAAa;AACxC,YAAM,IAAI;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AAAA,IACL;AAAA,IACA,GAAI,oBAAoB,EAAE,WAAW,kBAAkB,IAAI,CAAC;AAAA,IAC5D,GAAI,cAAc,EAAE,YAAY,IAAI,CAAC;AAAA,IACrC,GAAI,QAAQ,aAAa,EAAE,YAAY,QAAQ,WAAW,IAAI,CAAC;AAAA,IAC/D,GAAI,QAAQ,YAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAAA,IAC5D,GAAI,QAAQ,YAAY,EAAE,WAAW,QAAQ,UAAU,IAAI,CAAC;AAAA,EAC9D;AACF;AAEA,SAAS,gBAAgB,OAAoC;AAC3D,MAAI,UAAU,UAAa,UAAU,KAAM,QAAO;AAClD,MAAI,OAAO,UAAU,UAAU;AAC7B,UAAM,IAAI,wBAAwB,2DAA2D;AAAA,EAC/F;AACA,QAAM,KAAK,MAAM,KAAK;AACtB,MAAI,GAAG,WAAW,KAAK,OAAO,OAAO;AACnC,UAAM,IAAI,wBAAwB,8DAA8D;AAAA,EAClG;AACA,MAAI,GAAG,SAAS,0BAA0B;AACxC,UAAM,IAAI;AAAA,MACR,6CAA6C,wBAAwB,qBAAqB,GAAG,MAAM;AAAA,IACrG;AAAA,EACF;AACA,SAAO;AACT;AAMO,SAAS,yBAAyB,SAAyB;AAChE,MAAI,OAAO,YAAY,UAAU;AAC/B,UAAM,IAAI,wBAAwB,0CAA0C;AAAA,EAC9E;AACA,QAAM,UAAU,QAAQ,KAAK;AAC7B,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,IAAI,wBAAwB,qCAAqC;AAAA,EACzE;AACA,MAAI,QAAQ,SAAS,uBAAuB;AAC1C,UAAM,IAAI;AAAA,MACR,sCAAsC,qBAAqB;AAAA,IAC7D;AAAA,EACF;AAIA,MAAI,YAAY,OAAO,KAAK,uBAAuB,OAAO,GAAG;AAC3D,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAGA,MAAI,YAAY,OAAO,GAAG;AACxB,UAAM,YAAY,QAAQ,MAAM,GAAG,EAAE;AACrC,QAAI,UAAU,WAAW,GAAG;AAC1B,YAAM,IAAI,wBAAwB,oEAA+D;AAAA,IACnG;AACA,QAAI;AACF,UAAI,IAAI,OAAO,SAAS,EAAE,KAAK,EAAE,GAAG;AAClC,cAAM,IAAI;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,GAAG;AACV,UAAI,aAAa,wBAAyB,OAAM;AAAA,IAElD;AAAA,EACF;AACA,SAAO;AACT;AAIA,SAAS,YAAY,SAA0B;AAC7C,SAAO,QAAQ,WAAW,GAAG,KAAK,QAAQ,SAAS,GAAG,KAAK,QAAQ,UAAU;AAC/E;AAUA,SAAS,uBAAuB,SAA0B;AACxD,QAAM,OAAO,QAAQ,WAAW,GAAG,KAAK,QAAQ,SAAS,GAAG,IACxD,QAAQ,MAAM,GAAG,EAAE,IACnB;AAEJ,MAAI,mEAAmE,KAAK,IAAI,GAAG;AACjF,WAAO;AAAA,EACT;AAKA,MAAI,KAAK,SAAS,IAAK,QAAO;AAC9B,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,QAAI,KAAK,CAAC,MAAM,IAAK;AACrB,QAAI,QAAQ;AACZ,QAAI,IAAI,IAAI;AACZ,WAAO,IAAI,KAAK,UAAU,QAAQ,GAAG;AACnC,UAAI,KAAK,CAAC,MAAM,MAAM;AAAE,aAAK;AAAG;AAAA,MAAU;AAC1C,UAAI,KAAK,CAAC,MAAM,IAAK;AAAA,eACZ,KAAK,CAAC,MAAM,IAAK;AAC1B;AAAA,IACF;AACA,QAAI,UAAU,EAAG;AACjB,UAAM,aAAa,KAAK,CAAC;AACzB,QAAI,eAAe,OAAO,eAAe,OAAO,eAAe,IAAK;AACpE,UAAM,YAAY,KAAK,MAAM,IAAI,GAAG,IAAI,CAAC;AACzC,QAAI,SAAS,KAAK,SAAS,KAAK,sBAAsB,KAAK,SAAS,GAAG;AACrE,aAAO;AAAA,IACT;AACA,QAAI,UAAU,SAAS,GAAG,GAAG;AAC3B,YAAM,WAAW,UAAU,MAAM,GAAG;AACpC,UAAI,SAAS,UAAU,GAAG;AACxB,cAAM,aAAa,IAAI,IAAI,SAAS,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,OAAO,OAAO,CAAC;AACpE,YAAI,WAAW,OAAO,SAAS,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,QAAQ;AACjE,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA,QAAI;AAAA,EACN;AACA,SAAO;AACT;AAOO,SAAS,yBAAyB,QAAqD;AAC5F,MAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,UAAM,IAAI,wBAAwB,qCAAqC;AAAA,EACzE;AACA,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,SAAS,YAAY,CAAC,wBAAwB,SAAS,EAAE,IAAgC,GAAG;AACvG,UAAM,IAAI;AAAA,MACR,yCAAyC,wBAAwB,KAAK,IAAI,CAAC;AAAA,IAC7E;AAAA,EACF;AACA,UAAQ,EAAE,MAAM;AAAA,IACd,KAAK;AACH,UAAI,OAAO,EAAE,YAAY,YAAY,EAAE,QAAQ,WAAW,GAAG;AAC3D,cAAM,IAAI,wBAAwB,gCAAgC;AAAA,MACpE;AACA;AACE,cAAM,iBAAiB,EAAE,gBAAgB,UAAa,EAAE,gBAAgB;AACxE,cAAM,YAAY,EAAE,aAAa,UAAa,EAAE,aAAa;AAC7D,YAAI,WAAW;AACb,cAAI,OAAO,EAAE,aAAa,YAAY,EAAE,SAAS,KAAK,EAAE,WAAW,KAAK,EAAE,aAAa,EAAE,SAAS,KAAK,GAAG;AACxG,kBAAM,IAAI,wBAAwB,mDAAmD;AAAA,UACvF;AACA,cAAI,EAAE,aAAa,EAAE,SAAS;AAC5B,kBAAM,IAAI,wBAAwB,8CAA8C;AAAA,UAClF;AACA,cAAI,gBAAgB;AAClB,kBAAM,IAAI,wBAAwB,iEAAiE;AAAA,UACrG;AAAA,QACF;AACA,YAAI,eAAgB,qBAAoB,EAAE,WAAW;AAAA,MACvD;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,EAAE,aAAa,YAAY,EAAE,SAAS,WAAW,GAAG;AAC7D,cAAM,IAAI,wBAAwB,4BAA4B;AAAA,MAChE;AACA,UAAI,OAAO,EAAE,UAAU,YAAY,EAAE,MAAM,WAAW,GAAG;AACvD,cAAM,IAAI,wBAAwB,+CAA+C;AAAA,MACnF;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,EAAE,aAAa,YAAY,EAAE,SAAS,WAAW,GAAG;AAC7D,cAAM,IAAI,wBAAwB,+BAA+B;AAAA,MACnE;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,EAAE,aAAa,YAAY,EAAE,SAAS,WAAW,GAAG;AAC7D,cAAM,IAAI,wBAAwB,+BAA+B;AAAA,MACnE;AACA,UAAI,OAAO,EAAE,gBAAgB,YAAY,EAAE,YAAY,KAAK,EAAE,WAAW,GAAG;AAC1E,cAAM,IAAI,wBAAwB,kCAAkC;AAAA,MACtE;AACA;AAAA,IACF,KAAK;AACH,UAAI,OAAO,EAAE,YAAY,UAAU;AACjC,cAAM,IAAI,wBAAwB,qCAAqC;AAAA,MACzE;AACA,+BAAyB,EAAE,OAAO;AAClC;AAAA,EACJ;AACF;AAGO,SAAS,oBAAoB,OAA8C;AAChF,MAAI,CAAC,SAAS,OAAO,UAAU,UAAU;AACvC,UAAM,IAAI,wBAAwB,gCAAgC;AAAA,EACpE;AACA,QAAM,IAAI;AACV,MAAI,OAAO,EAAE,YAAY,YAAY,EAAE,QAAQ,KAAK,EAAE,WAAW,GAAG;AAClE,UAAM,IAAI,wBAAwB,wDAAwD;AAAA,EAC5F;AACA,MAAI,EAAE,aAAa,QAAW;AAC5B,QAAI,OAAO,EAAE,aAAa,YAAY,CAAE,kBAAwC,SAAS,EAAE,QAAQ,GAAG;AACpG,YAAM,IAAI;AAAA,QACR,wCAAwC,kBAAkB,KAAK,IAAI,CAAC;AAAA,MACtE;AAAA,IACF;AAAA,EACF;AACA,MAAI,EAAE,eAAe,WAAc,OAAO,EAAE,eAAe,YAAY,EAAE,aAAa,KAAK,EAAE,aAAa,IAAI;AAC5G,UAAM,IAAI,wBAAwB,oDAAoD;AAAA,EACxF;AACA,MAAI,EAAE,SAAS,UAAa,CAAC,MAAM,QAAQ,EAAE,IAAI,GAAG;AAClD,UAAM,IAAI,wBAAwB,oCAAoC;AAAA,EACxE;AACA,MAAI,EAAE,yBAAyB,WAAc,OAAO,EAAE,yBAAyB,YAAY,EAAE,yBAAyB,OAAO;AAC3H,UAAM,IAAI,wBAAwB,qDAAqD;AAAA,EACzF;AACF;AAOO,SAAS,0BAA0B,MAOvB;AACjB,SAAO;AAAA,IACL,QAAQ,UAAU;AAAA,IAClB,SAAS,KAAK;AAAA,IACd,WAAW,KAAK;AAAA,IAChB,UAAU,KAAK;AAAA,IACf,gBAAgB;AAAA,IAChB,SAAS,CAAC;AAAA,IACV,MAAM;AAAA,IACN,YAAY;AAAA,IACZ,UAAU,CAAC,GAAG,KAAK,UAAU,iEAA4D;AAAA,IACzF,WAAW,KAAK;AAAA,IAChB,WAAW,KAAK;AAAA,IAChB,QAAQ;AAAA,EACV;AACF;AAGO,SAAS,YAAoB;AAClC,SAAO,QAAQ,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AACnF;AAGO,IAAM,0BAAN,cAAsC,MAAM;AAAA,EACjD,YAAY,SAAiB;AAC3B,UAAM,OAAO;AACb,SAAK,OAAO;AAAA,EACd;AACF;;;ACngBO,IAAM,yCAAyC;AAC/C,IAAM,qCAAqC;AAU3C,SAAS,sBAAsB,KAAsD;AAC1F,SAAO;AAAA,IACL,oBAAoB,MAAM;AACxB,YAAM,SAAU,IAAI,YAAoD;AACxE,YAAM,MAAM,WAAW,SAAY,SAAS,IAAI;AAChD,UAAI,QAAQ,UAAa,QAAQ,KAAM,QAAO;AAC9C,YAAM,QAAQ,WAAW,GAAG;AAC5B,UAAI,UAAU,QAAW;AACvB,cAAM,IAAI,MAAM,uDAAuD,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,MAC9F;AACA,aAAO;AAAA,IACT,GAAG;AAAA,IACH,iCAAiC,MAAM;AACrC,YAAM,SAAU,IAAI,YAAoD;AACxE,YAAM,MAAM,WAAW,SAAY,SAAS,IAAI;AAChD,UAAI,QAAQ,UAAa,QAAQ,KAAM,QAAO;AAC9C,YAAM,QAAQ,WAAW,GAAG;AAC5B,UAAI,UAAU,QAAW;AACvB,cAAM,IAAI,MAAM,oEAAoE,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,MAC3G;AACA,aAAO;AAAA,IACT,GAAG;AAAA,IACH,wBAAwB,MAAM;AAC5B,YAAM,YAAa,IAAI,YAAoD;AAC3E,YAAM,MAAM,cAAc,SAAY,YAAY,IAAI;AACtD,UAAI,QAAQ,UAAa,QAAQ,KAAM,QAAO;AAC9C,YAAM,IAAI,aAAa,GAAG;AAC1B,UAAI,MAAM,UAAa,CAAC,OAAO,SAAS,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,UAAU,CAAC,GAAG;AAC3E,cAAM,IAAI,MAAM,iEAAiE,KAAK,UAAU,GAAG,CAAC,EAAE;AAAA,MACxG;AACA,aAAO;AAAA,IACT,GAAG;AAAA,IACH,yBAAyB,MAAM;AAC7B,YAAM,SAAU,IAAI,YAAoD;AACxE,YAAM,aAAa,WAAW,SAAY,aAAa,MAAM,IAAI;AACjE,UAAI,eAAe,UAAa,cAAc,EAAG,QAAO;AACxD,UAAI,WAAW,UAAa,eAAe,QAAW;AACpD,cAAM,IAAI,MAAM,gEAAgE,KAAK,UAAU,MAAM,CAAC,EAAE;AAAA,MAC1G;AACA,UAAI,eAAe,UAAa,aAAa,GAAG;AAC9C,cAAM,IAAI,MAAM,gEAAgE,KAAK,UAAU,MAAM,CAAC,EAAE;AAAA,MAC1G;AACA,YAAM,WAAW,aAAa,IAAI,sBAAsB;AACxD,UAAI,aAAa,UAAa,YAAY,EAAG,QAAO;AACpD,UAAI,IAAI,2BAA2B,UAAa,aAAa,QAAW;AACtE,cAAM,IAAI;AAAA,UACR,gEAAgE,KAAK,UAAU,IAAI,sBAAsB,CAAC;AAAA,QAC5G;AAAA,MACF;AACA,UAAI,aAAa,UAAa,WAAW,GAAG;AAC1C,cAAM,IAAI;AAAA,UACR,gEAAgE,KAAK,UAAU,IAAI,sBAAsB,CAAC;AAAA,QAC5G;AAAA,MACF;AACA,aAAO;AAAA,IACT,GAAG;AAAA,IACH,8BAA8B,MAAM;AAClC,YAAM,SAAU,IAAI,YAAoD;AACxE,YAAM,MAAM,WAAW,SAAY,SAAS,IAAI;AAChD,UAAI,QAAQ,UAAa,QAAQ,KAAM,QAAO;AAC9C,YAAM,IAAI,aAAa,GAAG;AAC1B,UAAI,MAAM,UAAa,CAAC,OAAO,UAAU,CAAC,KAAK,IAAI,KAAK,IAAI,oCAAoC;AAC9F,cAAM,IAAI;AAAA,UACR,uEAAuE,kCAAkC,SAAS,KAAK,UAAU,GAAG,CAAC;AAAA,QACvI;AAAA,MACF;AACA,aAAO;AAAA,IACT,GAAG;AAAA,EACL;AACF;","names":[]}