@remnic/core 1.1.11 → 1.1.13

package/dist/chunk-56K5QLHX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/lcm/archive.ts"],"sourcesContent":["import type Database from \"better-sqlite3\";\nimport { log } from \"../logger.js\";\nimport {\n  parseMessageParts,\n  type LcmMessagePartInput,\n  type MessagePartSourceFormat,\n} from \"../message-parts/index.js\";\n\nexport interface LcmMessage {\n  id: number;\n  session_id: string;\n  turn_index: number;\n  role: string;\n  content: string;\n  token_count: number;\n  created_at: string;\n  metadata: string | null;\n}\n\nexport interface LcmSearchResult {\n  turn_index: number;\n  role: string;\n  snippet: string;\n  session_id: string;\n  score: number;\n}\n\nexport interface LcmSearchWithContentResult {\n  id: number;\n  turn_index: number;\n  role: string;\n  content: string;\n  session_id: string;\n  score: number;\n}\n\nexport interface LcmStructuredRecallMatch {\n  part_id: number;\n  message_id: number;\n  turn_index: number;\n  role: string;\n  content: string;\n  session_id: string;\n  kind: string;\n  tool_name: string | null;\n  file_path: string | null;\n  payload: string;\n  score: number;\n}\n\n/** Rough token count: ~4 chars per token. */\nexport function estimateTokens(text: string): number {\n  return Math.ceil(text.length / 4);\n}\n\nexport class LcmArchive {\n  constructor(private readonly db: Database.Database) {}\n\n  /** Append a message to the archive. Returns the row id. */\n  appendMessage(\n    sessionId: string,\n    turnIndex: number,\n    role: string,\n    content: string,\n    metadata?: Record<string, unknown>,\n    parts?: LcmMessagePartInput[],\n  ): number {\n    const tokenCount = estimateTokens(content);\n    const now = new Date().toISOString();\n    const metaJson = metadata ? JSON.stringify(metadata) : null;\n\n    const stmt = this.db.prepare(`\n      INSERT INTO lcm_messages (session_id, turn_index, role, content, token_count, created_at, metadata)\n      VALUES (?, ?, ?, ?, ?, ?, ?)\n    `);\n    const result = stmt.run(sessionId, turnIndex, role, content, tokenCount, now, metaJson);\n    const rowId = Number(result.lastInsertRowid);\n\n    // Keep FTS in sync\n    this.db\n      .prepare(\"INSERT INTO lcm_messages_fts (rowid, content) VALUES (?, ?)\")\n      .run(rowId, content);\n\n    if (parts && parts.length > 0) {\n      this.insertMessageParts(rowId, parts, now);\n    }\n\n    return rowId;\n  }\n\n  /** Append multiple messages in a single transaction. */\n  appendMessages(\n    sessionId: string,\n    messages: Array<{\n      turnIndex: number;\n      role: string;\n      content: string;\n      metadata?: Record<string, unknown>;\n      parts?: LcmMessagePartInput[];\n      rawContent?: unknown;\n      sourceFormat?: MessagePartSourceFormat;\n    }>,\n    options: { messagePartsEnabled?: boolean } = {},\n  ): void {\n    if (messages.length === 0) return;\n    const captureMessageParts = options.messagePartsEnabled !== false;\n\n    const txn = this.db.transaction(() => {\n      for (const msg of messages) {\n        const explicitParts =\n          msg.parts && msg.parts.length > 0 ? msg.parts : undefined;\n        const rawContent = msg.rawContent ?? msg.content;\n        const parts =\n          captureMessageParts\n            ? explicitParts ??\n              parseMessageParts(rawContent, {\n                sourceFormat: msg.sourceFormat,\n                renderedContent: msg.content,\n              })\n            : undefined;\n        this.appendMessage(\n          sessionId,\n          msg.turnIndex,\n          msg.role,\n          msg.content,\n          msg.metadata,\n          parts,\n        );\n      }\n    });\n    txn();\n  }\n\n  insertMessageParts(\n    messageId: number,\n    parts: LcmMessagePartInput[],\n    fallbackCreatedAt: string,\n  ): void {\n    if (parts.length === 0) return;\n    const stmt = this.db.prepare(`\n      INSERT INTO lcm_message_parts (message_id, ordinal, kind, payload, tool_name, file_path, created_at)\n      VALUES (?, ?, ?, ?, ?, ?, ?)\n    `);\n    for (let index = 0; index < parts.length; index += 1) {\n      const part = parts[index]!;\n      const rawPart = part as unknown as Record<string, unknown>;\n      const toolName = part.toolName ?? asNullableString(rawPart.tool_name);\n      const filePath = part.filePath ?? asNullableString(rawPart.file_path);\n      const createdAt = part.createdAt ?? asNullableString(rawPart.created_at);\n      stmt.run(\n        messageId,\n        part.ordinal ?? index,\n        part.kind,\n        JSON.stringify(part.payload ?? {}),\n        toolName ?? null,\n        filePath ?? null,\n        createdAt ?? fallbackCreatedAt,\n      );\n    }\n  }\n\n  /** Get the highest turn_index for a session, or -1 if none. */\n  getMaxTurnIndex(sessionId: string): number {\n    const row = this.db\n      .prepare(\"SELECT MAX(turn_index) as max_turn FROM lcm_messages WHERE session_id = ?\")\n      .get(sessionId) as { max_turn: number | null } | undefined;\n    return row?.max_turn ?? -1;\n  }\n\n  /** Retrieve messages in a turn range (inclusive). */\n  getMessages(sessionId: string, fromTurn: number, toTurn: number): LcmMessage[] {\n    return this.db\n      .prepare(\n        \"SELECT * FROM lcm_messages WHERE session_id = ? AND turn_index >= ? AND turn_index <= ? ORDER BY turn_index\",\n      )\n      .all(sessionId, fromTurn, toTurn) as LcmMessage[];\n  }\n\n  /** Retrieve unsummarized messages (after last leaf summary). */\n  getUnsummarizedMessages(sessionId: string): LcmMessage[] {\n    const lastLeafEnd = this.db\n      .prepare(\n        \"SELECT MAX(msg_end) as last_end FROM lcm_summary_nodes WHERE session_id = ? AND depth = 0\",\n      )\n      .get(sessionId) as { last_end: number | null } | undefined;\n\n    const lastSummarized = lastLeafEnd?.last_end ?? -1;\n    return this.db\n      .prepare(\n        \"SELECT * FROM lcm_messages WHERE session_id = ? AND turn_index > ? ORDER BY turn_index\",\n      )\n      .all(sessionId, lastSummarized) as LcmMessage[];\n  }\n\n  /** Full-text search across all messages. */\n  search(query: string, limit: number, sessionId?: string): LcmSearchResult[] {\n    try {\n      const ftsQuery = sanitizeFtsQuery(query);\n      if (!ftsQuery) return [];\n\n      let sql: string;\n      const params: unknown[] = [ftsQuery];\n\n      if (sessionId) {\n        sql = `\n          SELECT m.turn_index, m.role, snippet(lcm_messages_fts, 0, '>>>', '<<<', '...', 48) as snippet,\n                 m.session_id, rank\n          FROM lcm_messages_fts f\n          JOIN lcm_messages m ON m.id = f.rowid\n          WHERE lcm_messages_fts MATCH ?\n            AND m.session_id = ?\n          ORDER BY rank\n          LIMIT ?\n        `;\n        params.push(sessionId, limit);\n      } else {\n        sql = `\n          SELECT m.turn_index, m.role, snippet(lcm_messages_fts, 0, '>>>', '<<<', '...', 48) as snippet,\n                 m.session_id, rank\n          FROM lcm_messages_fts f\n          JOIN lcm_messages m ON m.id = f.rowid\n          WHERE lcm_messages_fts MATCH ?\n          ORDER BY rank\n          LIMIT ?\n        `;\n        params.push(limit);\n      }\n\n      const rows = this.db.prepare(sql).all(...params) as Array<{\n        turn_index: number;\n        role: string;\n        snippet: string;\n        session_id: string;\n        rank: number;\n      }>;\n\n      return rows.map((r) => ({\n        turn_index: r.turn_index,\n        role: r.role,\n        snippet: r.snippet,\n        session_id: r.session_id,\n        score: -r.rank, // FTS5 rank is negative; negate for ascending score\n      }));\n    } catch (err) {\n      log.debug(`LCM FTS search error: ${err}`);\n      return [];\n    }\n  }\n\n  /**\n   * Full-text search returning focused excerpts around matching terms.\n   * Returns ~1000-char windows centered on query term matches.\n   * Deduplicates by message id and returns results sorted by FTS rank.\n   */\n  searchWithContent(query: string, limit: number, sessionId?: string, excerptChars = 1000): LcmSearchWithContentResult[] {\n    try {\n      const ftsQuery = sanitizeFtsQuery(query);\n      if (!ftsQuery) return [];\n\n      // Extract content words from query for excerpt windowing\n      const queryWords = query\n        .replace(/[^\\w\\s]/g, \" \")\n        .split(/\\s+/)\n        .filter((w) => w.length > 1 && !STOPWORDS.has(w.toLowerCase()))\n        .map((w) => w.toLowerCase());\n\n      let sql: string;\n      const params: unknown[] = [ftsQuery];\n\n      if (sessionId) {\n        sql = `\n          SELECT m.id, m.turn_index, m.role, m.content, m.session_id, rank\n          FROM lcm_messages_fts f\n          JOIN lcm_messages m ON m.id = f.rowid\n          WHERE lcm_messages_fts MATCH ?\n            AND m.session_id = ?\n          ORDER BY rank\n          LIMIT ?\n        `;\n        params.push(sessionId, limit);\n      } else {\n        sql = `\n          SELECT m.id, m.turn_index, m.role, m.content, m.session_id, rank\n          FROM lcm_messages_fts f\n          JOIN lcm_messages m ON m.id = f.rowid\n          WHERE lcm_messages_fts MATCH ?\n          ORDER BY rank\n          LIMIT ?\n        `;\n        params.push(limit);\n      }\n\n      const rows = this.db.prepare(sql).all(...params) as Array<{\n        id: number;\n        turn_index: number;\n        role: string;\n        content: string;\n        session_id: string;\n        rank: number;\n      }>;\n\n      // Deduplicate by message id (same message may match multiple terms)\n      const seen = new Set<number>();\n      const results: LcmSearchWithContentResult[] = [];\n      for (const r of rows) {\n        if (seen.has(r.id)) continue;\n        seen.add(r.id);\n        results.push({\n          id: r.id,\n          turn_index: r.turn_index,\n          role: r.role,\n          content: extractExcerpt(r.content, queryWords, excerptChars),\n          session_id: r.session_id,\n          score: -r.rank,\n        });\n      }\n      return results;\n    } catch (err) {\n      log.debug(`LCM FTS searchWithContent error: ${err}`);\n      return [];\n    }\n  }\n\n  searchStructuredParts(\n    query: string,\n    limit: number,\n    sessionId?: string,\n  ): LcmStructuredRecallMatch[] {\n    const cappedLimit = Math.max(0, Math.min(20, Math.floor(limit)));\n    if (cappedLimit === 0) return [];\n\n    const fileTerms = extractStructuredFileTerms(query);\n    const toolTerms = extractStructuredToolTerms(query);\n    if (fileTerms.length === 0 && toolTerms.length === 0) return [];\n\n    const matchWhere: string[] = [];\n    const whereParams: unknown[] = [];\n    for (const term of fileTerms) {\n      matchWhere.push(\"(p.file_path = ? OR p.file_path LIKE ? ESCAPE '\\\\')\");\n      whereParams.push(term, `%${escapeLike(term)}%`);\n    }\n    for (const term of toolTerms) {\n      matchWhere.push(\"p.tool_name LIKE ? ESCAPE '\\\\'\");\n      whereParams.push(`%${escapeLike(term)}%`);\n    }\n    const where = [`(${matchWhere.join(\" OR \")})`];\n    if (sessionId) {\n      where.push(\"m.session_id = ?\");\n      whereParams.push(sessionId);\n    }\n    const exactFileScoreParams = [...fileTerms];\n    const sqlParams = [...exactFileScoreParams, ...whereParams, cappedLimit];\n\n    const rows = this.db.prepare(`\n      SELECT\n        p.id AS part_id,\n        p.message_id AS message_id,\n        m.turn_index AS turn_index,\n        m.role AS role,\n        m.content AS content,\n        m.session_id AS session_id,\n        p.kind AS kind,\n        p.tool_name AS tool_name,\n        p.file_path AS file_path,\n        p.payload AS payload,\n        CASE\n          WHEN p.file_path IN (${fileTerms.map(() => \"?\").join(\",\") || \"NULL\"}) THEN 3\n          WHEN p.file_path IS NOT NULL THEN 2\n          WHEN p.tool_name IS NOT NULL THEN 1\n          ELSE 0\n        END AS score\n      FROM lcm_message_parts p\n      JOIN lcm_messages m ON m.id = p.message_id\n      WHERE ${where.join(\" AND \")}\n      ORDER BY score DESC, m.turn_index DESC, p.ordinal ASC\n      LIMIT ?\n    `).all(...sqlParams) as LcmStructuredRecallMatch[];\n\n    return rows;\n  }\n\n  /** Get total message count for a session. */\n  getMessageCount(sessionId: string): number {\n    const row = this.db\n      .prepare(\"SELECT COUNT(*) as cnt FROM lcm_messages WHERE session_id = ?\")\n      .get(sessionId) as { cnt: number };\n    return row.cnt;\n  }\n\n  /** Get total message count across all sessions. */\n  getTotalMessageCount(): number {\n    const row = this.db\n      .prepare(\"SELECT COUNT(*) as cnt FROM lcm_messages\")\n      .get() as { cnt: number };\n    return row.cnt;\n  }\n\n  /** Delete all archived messages for one session. */\n  deleteSession(sessionId: string): number {\n    const txn = this.db.transaction(() => {\n      this.db\n        .prepare(\n          \"DELETE FROM lcm_messages_fts WHERE rowid IN (SELECT id FROM lcm_messages WHERE session_id = ?)\",\n        )\n        .run(sessionId);\n      this.db\n        .prepare(\n          \"DELETE FROM lcm_message_parts WHERE message_id IN (SELECT id FROM lcm_messages WHERE session_id = ?)\",\n        )\n        .run(sessionId);\n      const result = this.db\n        .prepare(\"DELETE FROM lcm_messages WHERE session_id = ?\")\n        .run(sessionId);\n      return result.changes;\n    });\n    return txn();\n  }\n\n  /** Delete all archived messages. */\n  deleteAll(): number {\n    const txn = this.db.transaction(() => {\n      this.db.prepare(\"DELETE FROM lcm_messages_fts\").run();\n      this.db.prepare(\"DELETE FROM lcm_message_parts\").run();\n      const result = this.db.prepare(\"DELETE FROM lcm_messages\").run();\n      return result.changes;\n    });\n    return txn();\n  }\n\n  /** Prune messages older than retentionDays. */\n  pruneOldMessages(retentionDays: number): number {\n    const cutoff = new Date(Date.now() - retentionDays * 86400_000).toISOString();\n\n    // Delete from FTS first\n    this.db\n      .prepare(\n        \"DELETE FROM lcm_messages_fts WHERE rowid IN (SELECT id FROM lcm_messages WHERE created_at < ?)\",\n      )\n      .run(cutoff);\n\n    const result = this.db\n      .prepare(\"DELETE FROM lcm_messages WHERE created_at < ?\")\n      .run(cutoff);\n    return result.changes;\n  }\n}\n\n/**\n * Extract a focused excerpt from content centered on query term matches.\n * Returns a window of ~excerptChars around the first matching term.\n * If content is shorter than excerptChars, returns the full content.\n */\nfunction extractExcerpt(content: string, queryWords: string[], excerptChars: number): string {\n  if (content.length <= excerptChars) return content;\n\n  // Find the earliest position of any query word in the content\n  const contentLower = content.toLowerCase();\n  let bestPos = -1;\n  for (const word of queryWords) {\n    const pos = contentLower.indexOf(word);\n    if (pos !== -1 && (bestPos === -1 || pos < bestPos)) {\n      bestPos = pos;\n    }\n  }\n\n  // If no match found (shouldn't happen for FTS results), return start\n  if (bestPos === -1) {\n    return content.slice(0, excerptChars) + \"...\";\n  }\n\n  // Center the window around the match\n  const halfWindow = Math.floor(excerptChars / 2);\n  let start = Math.max(0, bestPos - halfWindow);\n  let end = Math.min(content.length, start + excerptChars);\n\n  // Adjust start if we hit the end\n  if (end === content.length) {\n    start = Math.max(0, end - excerptChars);\n  }\n\n  // Extend to sentence boundaries if possible\n  if (start > 0) {\n    const sentenceStart = content.lastIndexOf(\". \", start);\n    if (sentenceStart !== -1 && start - sentenceStart < 200) {\n      start = sentenceStart + 2;\n    }\n  }\n  if (end < content.length) {\n    const sentenceEnd = content.indexOf(\". \", end - 1);\n    if (sentenceEnd !== -1 && sentenceEnd - end < 200) {\n      end = sentenceEnd + 1;\n    }\n  }\n\n  const prefix = start > 0 ? \"...\" : \"\";\n  const suffix = end < content.length ? \"...\" : \"\";\n  return prefix + content.slice(start, end) + suffix;\n}\n\nconst STOPWORDS = new Set([\n  \"a\", \"an\", \"the\", \"is\", \"are\", \"was\", \"were\", \"be\", \"been\", \"being\",\n  \"have\", \"has\", \"had\", \"do\", \"does\", \"did\", \"will\", \"would\", \"could\",\n  \"should\", \"may\", \"might\", \"shall\", \"can\", \"to\", \"of\", \"in\", \"for\",\n  \"on\", \"with\", \"at\", \"by\", \"from\", \"as\", \"into\", \"about\", \"between\",\n  \"through\", \"during\", \"before\", \"after\", \"and\", \"but\", \"or\", \"nor\",\n  \"not\", \"so\", \"if\", \"then\", \"than\", \"that\", \"this\", \"it\", \"its\",\n  \"what\", \"which\", \"who\", \"whom\", \"how\", \"when\", \"where\", \"why\",\n  \"all\", \"each\", \"every\", \"both\", \"few\", \"more\", \"most\", \"other\",\n  \"some\", \"such\", \"no\", \"only\", \"own\", \"same\", \"just\", \"very\",\n  \"my\", \"your\", \"his\", \"her\", \"our\", \"their\", \"me\", \"him\", \"us\", \"them\",\n  \"i\", \"you\", \"he\", \"she\", \"we\", \"they\",\n]);\n\nfunction extractStructuredFileTerms(query: string): string[] {\n  const terms = new Set<string>();\n  for (const raw of splitQueryTerms(query)) {\n    const cleaned = trimStructuredQueryTerm(raw);\n    if (\n      cleaned.includes(\"/\") ||\n      hasStructuredFileExtension(cleaned)\n    ) {\n      terms.add(cleaned);\n      const basename = cleaned.split(\"/\").pop();\n      if (basename && basename !== cleaned) terms.add(basename);\n    }\n  }\n  return [...terms].filter((term) => term.length > 1).slice(0, 12);\n}\n\nfunction splitQueryTerms(query: string): string[] {\n  const terms: string[] = [];\n  let term = \"\";\n  for (const char of query.slice(0, 20_000)) {\n    if (char === \" \" || char === \"\\n\" || char === \"\\r\" || char === \"\\t\") {\n      if (term.length > 0) terms.push(term);\n      term = \"\";\n      continue;\n    }\n    term += char;\n    if (term.length > 512) {\n      terms.push(term);\n      term = \"\";\n    }\n  }\n  if (term.length > 0) terms.push(term);\n  return terms;\n}\n\nfunction trimStructuredQueryTerm(raw: string): string {\n  const leading = new Set([\"`\", \"'\", \"\\\"\", \"(\", \"[\", \"{\"]);\n  const trailing = new Set([\"`\", \"'\", \"\\\"\", \",\", \".\", \"?\", \"!\", \":\", \";\", \")\", \"]\", \"}\"]);\n  let start = 0;\n  let end = raw.length;\n  while (start < end && leading.has(raw[start]!)) start += 1;\n  while (end > start && trailing.has(raw[end - 1]!)) end -= 1;\n  return raw.slice(start, end);\n}\n\nfunction hasStructuredFileExtension(value: string): boolean {\n  const slash = value.lastIndexOf(\"/\");\n  const basename = value.slice(slash + 1);\n  const dot = basename.lastIndexOf(\".\");\n  if (dot <= 0 || dot === basename.length - 1) return false;\n  const ext = basename.slice(dot + 1);\n  if (ext.length < 1 || ext.length > 12) return false;\n  for (const char of ext) {\n    const code = char.charCodeAt(0);\n    const valid =\n      (code >= 48 && code <= 57) ||\n      (code >= 65 && code <= 90) ||\n      (code >= 97 && code <= 122) ||\n      char === \"_\" ||\n      char === \"+\" ||\n      char === \"-\";\n    if (!valid) return false;\n  }\n  return true;\n}\n\nfunction extractStructuredToolTerms(query: string): string[] {\n  const lower = query.toLowerCase();\n  if (!/\\b(tool|command|invocation|called|used|ran|read|write|patch|edit|grep|search)\\b/.test(lower)) {\n    return [];\n  }\n  return query\n    .replace(/[^\\w.-]/g, \" \")\n    .split(/\\s+/)\n    .filter((term) => term.length > 2 && !STOPWORDS.has(term.toLowerCase()))\n    .slice(0, 8);\n}\n\nfunction escapeLike(value: string): string {\n  return value.replace(/[\\\\%_]/g, (char) => `\\\\${char}`);\n}\n\nfunction asNullableString(value: unknown): string | null {\n  return typeof value === \"string\" && value.trim().length > 0 ? value : null;\n}\n\n/**\n * Sanitize a query for FTS5 MATCH.\n * Uses OR logic so partial matches rank higher than no matches.\n * Filters stopwords to focus on content words.\n */\nfunction sanitizeFtsQuery(raw: string): string {\n  const words = raw\n    .replace(/[^\\w\\s]/g, \" \")\n    .split(/\\s+/)\n    .filter((w) => w.length > 1 && !STOPWORDS.has(w.toLowerCase()));\n  if (words.length === 0) {\n    // If all words were stopwords, fall back to using all words\n    const allWords = raw.replace(/[^\\w\\s]/g, \" \").split(/\\s+/).filter((w) => w.length > 1);\n    if (allWords.length === 0) return \"\";\n    return allWords.map((w) => `\"${w}\"`).join(\" OR \");\n  }\n  return words.map((w) => `\"${w}\"`).join(\" OR \");\n}\n"],"mappings":";;;;;;;;AAmDO,SAAS,eAAe,MAAsB;AACnD,SAAO,KAAK,KAAK,KAAK,SAAS,CAAC;AAClC;AAEO,IAAM,aAAN,MAAiB;AAAA,EACtB,YAA6B,IAAuB;AAAvB;AAAA,EAAwB;AAAA,EAAxB;AAAA;AAAA,EAG7B,cACE,WACA,WACA,MACA,SACA,UACA,OACQ;AACR,UAAM,aAAa,eAAe,OAAO;AACzC,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,UAAM,WAAW,WAAW,KAAK,UAAU,QAAQ,IAAI;AAEvD,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA,KAG5B;AACD,UAAM,SAAS,KAAK,IAAI,WAAW,WAAW,MAAM,SAAS,YAAY,KAAK,QAAQ;AACtF,UAAM,QAAQ,OAAO,OAAO,eAAe;AAG3C,SAAK,GACF,QAAQ,6DAA6D,EACrE,IAAI,OAAO,OAAO;AAErB,QAAI,SAAS,MAAM,SAAS,GAAG;AAC7B,WAAK,mBAAmB,OAAO,OAAO,GAAG;AAAA,IAC3C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,eACE,WACA,UASA,UAA6C,CAAC,GACxC;AACN,QAAI,SAAS,WAAW,EAAG;AAC3B,UAAM,sBAAsB,QAAQ,wBAAwB;AAE5D,UAAM,MAAM,KAAK,GAAG,YAAY,MAAM;AACpC,iBAAW,OAAO,UAAU;AAC1B,cAAM,gBACJ,IAAI,SAAS,IAAI,MAAM,SAAS,IAAI,IAAI,QAAQ;AAClD,cAAM,aAAa,IAAI,cAAc,IAAI;AACzC,cAAM,QACJ,sBACI,iBACA,kBAAkB,YAAY;AAAA,UAC5B,cAAc,IAAI;AAAA,UAClB,iBAAiB,IAAI;AAAA,QACvB,CAAC,IACD;AACN,aAAK;AAAA,UACH;AAAA,UACA,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ;AAAA,QACF;AAAA,MACF;AAAA,IACF,CAAC;AACD,QAAI;AAAA,EACN;AAAA,EAEA,mBACE,WACA,OACA,mBACM;AACN,QAAI,MAAM,WAAW,EAAG;AACxB,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA,KAG5B;AACD,aAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,YAAM,OAAO,MAAM,KAAK;AACxB,YAAM,UAAU;AAChB,YAAM,WAAW,KAAK,YAAY,iBAAiB,QAAQ,SAAS;AACpE,YAAM,WAAW,KAAK,YAAY,iBAAiB,QAAQ,SAAS;AACpE,YAAM,YAAY,KAAK,aAAa,iBAAiB,QAAQ,UAAU;AACvE,WAAK;AAAA,QACH;AAAA,QACA,KAAK,WAAW;AAAA,QAChB,KAAK;AAAA,QACL,KAAK,UAAU,KAAK,WAAW,CAAC,CAAC;AAAA,QACjC,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,aAAa;AAAA,MACf;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,gBAAgB,WAA2B;AACzC,UAAM,MAAM,KAAK,GACd,QAAQ,2EAA2E,EACnF,IAAI,SAAS;AAChB,WAAO,KAAK,YAAY;AAAA,EAC1B;AAAA;AAAA,EAGA,YAAY,WAAmB,UAAkB,QAA8B;AAC7E,WAAO,KAAK,GACT;AAAA,MACC;AAAA,IACF,EACC,IAAI,WAAW,UAAU,MAAM;AAAA,EACpC;AAAA;AAAA,EAGA,wBAAwB,WAAiC;AACvD,UAAM,cAAc,KAAK,GACtB;AAAA,MACC;AAAA,IACF,EACC,IAAI,SAAS;AAEhB,UAAM,iBAAiB,aAAa,YAAY;AAChD,WAAO,KAAK,GACT;AAAA,MACC;AAAA,IACF,EACC,IAAI,WAAW,cAAc;AAAA,EAClC;AAAA;AAAA,EAGA,OAAO,OAAe,OAAe,WAAuC;AAC1E,QAAI;AACF,YAAM,WAAW,iBAAiB,KAAK;AACvC,UAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,UAAI;AACJ,YAAM,SAAoB,CAAC,QAAQ;AAEnC,UAAI,WAAW;AACb,cAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAUN,eAAO,KAAK,WAAW,KAAK;AAAA,MAC9B,OAAO;AACL,cAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASN,eAAO,KAAK,KAAK;AAAA,MACnB;AAEA,YAAM,OAAO,KAAK,GAAG,QAAQ,GAAG,EAAE,IAAI,GAAG,MAAM;AAQ/C,aAAO,KAAK,IAAI,CAAC,OAAO;AAAA,QACtB,YAAY,EAAE;AAAA,QACd,MAAM,EAAE;AAAA,QACR,SAAS,EAAE;AAAA,QACX,YAAY,EAAE;AAAA,QACd,OAAO,CAAC,EAAE;AAAA;AAAA,MACZ,EAAE;AAAA,IACJ,SAAS,KAAK;AACZ,UAAI,MAAM,yBAAyB,GAAG,EAAE;AACxC,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,kBAAkB,OAAe,OAAe,WAAoB,eAAe,KAAoC;AACrH,QAAI;AACF,YAAM,WAAW,iBAAiB,KAAK;AACvC,UAAI,CAAC,SAAU,QAAO,CAAC;AAGvB,YAAM,aAAa,MAChB,QAAQ,YAAY,GAAG,EACvB,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,UAAU,IAAI,EAAE,YAAY,CAAC,CAAC,EAC7D,IAAI,CAAC,MAAM,EAAE,YAAY,CAAC;AAE7B,UAAI;AACJ,YAAM,SAAoB,CAAC,QAAQ;AAEnC,UAAI,WAAW;AACb,cAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASN,eAAO,KAAK,WAAW,KAAK;AAAA,MAC9B,OAAO;AACL,cAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQN,eAAO,KAAK,KAAK;AAAA,MACnB;AAEA,YAAM,OAAO,KAAK,GAAG,QAAQ,GAAG,EAAE,IAAI,GAAG,MAAM;AAU/C,YAAM,OAAO,oBAAI,IAAY;AAC7B,YAAM,UAAwC,CAAC;AAC/C,iBAAW,KAAK,MAAM;AACpB,YAAI,KAAK,IAAI,EAAE,EAAE,EAAG;AACpB,aAAK,IAAI,EAAE,EAAE;AACb,gBAAQ,KAAK;AAAA,UACX,IAAI,EAAE;AAAA,UACN,YAAY,EAAE;AAAA,UACd,MAAM,EAAE;AAAA,UACR,SAAS,eAAe,EAAE,SAAS,YAAY,YAAY;AAAA,UAC3D,YAAY,EAAE;AAAA,UACd,OAAO,CAAC,EAAE;AAAA,QACZ,CAAC;AAAA,MACH;AACA,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,MAAM,oCAAoC,GAAG,EAAE;AACnD,aAAO,CAAC;AAAA,IACV;AAAA,EACF;AAAA,EAEA,sBACE,OACA,OACA,WAC4B;AAC5B,UAAM,cAAc,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,CAAC,CAAC;AAC/D,QAAI,gBAAgB,EAAG,QAAO,CAAC;AAE/B,UAAM,YAAY,2BAA2B,KAAK;AAClD,UAAM,YAAY,2BAA2B,KAAK;AAClD,QAAI,UAAU,WAAW,KAAK,UAAU,WAAW,EAAG,QAAO,CAAC;AAE9D,UAAM,aAAuB,CAAC;AAC9B,UAAM,cAAyB,CAAC;AAChC,eAAW,QAAQ,WAAW;AAC5B,iBAAW,KAAK,qDAAqD;AACrE,kBAAY,KAAK,MAAM,IAAI,WAAW,IAAI,CAAC,GAAG;AAAA,IAChD;AACA,eAAW,QAAQ,WAAW;AAC5B,iBAAW,KAAK,gCAAgC;AAChD,kBAAY,KAAK,IAAI,WAAW,IAAI,CAAC,GAAG;AAAA,IAC1C;AACA,UAAM,QAAQ,CAAC,IAAI,WAAW,KAAK,MAAM,CAAC,GAAG;AAC7C,QAAI,WAAW;AACb,YAAM,KAAK,kBAAkB;AAC7B,kBAAY,KAAK,SAAS;AAAA,IAC5B;AACA,UAAM,uBAAuB,CAAC,GAAG,SAAS;AAC1C,UAAM,YAAY,CAAC,GAAG,sBAAsB,GAAG,aAAa,WAAW;AAEvE,UAAM,OAAO,KAAK,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iCAaA,UAAU,IAAI,MAAM,GAAG,EAAE,KAAK,GAAG,KAAK,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cAO/D,MAAM,KAAK,OAAO,CAAC;AAAA;AAAA;AAAA,KAG5B,EAAE,IAAI,GAAG,SAAS;AAEnB,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,gBAAgB,WAA2B;AACzC,UAAM,MAAM,KAAK,GACd,QAAQ,+DAA+D,EACvE,IAAI,SAAS;AAChB,WAAO,IAAI;AAAA,EACb;AAAA;AAAA,EAGA,uBAA+B;AAC7B,UAAM,MAAM,KAAK,GACd,QAAQ,0CAA0C,EAClD,IAAI;AACP,WAAO,IAAI;AAAA,EACb;AAAA;AAAA,EAGA,cAAc,WAA2B;AACvC,UAAM,MAAM,KAAK,GAAG,YAAY,MAAM;AACpC,WAAK,GACF;AAAA,QACC;AAAA,MACF,EACC,IAAI,SAAS;AAChB,WAAK,GACF;AAAA,QACC;AAAA,MACF,EACC,IAAI,SAAS;AAChB,YAAM,SAAS,KAAK,GACjB,QAAQ,+CAA+C,EACvD,IAAI,SAAS;AAChB,aAAO,OAAO;AAAA,IAChB,CAAC;AACD,WAAO,IAAI;AAAA,EACb;AAAA;AAAA,EAGA,YAAoB;AAClB,UAAM,MAAM,KAAK,GAAG,YAAY,MAAM;AACpC,WAAK,GAAG,QAAQ,8BAA8B,EAAE,IAAI;AACpD,WAAK,GAAG,QAAQ,+BAA+B,EAAE,IAAI;AACrD,YAAM,SAAS,KAAK,GAAG,QAAQ,0BAA0B,EAAE,IAAI;AAC/D,aAAO,OAAO;AAAA,IAChB,CAAC;AACD,WAAO,IAAI;AAAA,EACb;AAAA;AAAA,EAGA,iBAAiB,eAA+B;AAC9C,UAAM,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,gBAAgB,KAAS,EAAE,YAAY;AAG5E,SAAK,GACF;AAAA,MACC;AAAA,IACF,EACC,IAAI,MAAM;AAEb,UAAM,SAAS,KAAK,GACjB,QAAQ,+CAA+C,EACvD,IAAI,MAAM;AACb,WAAO,OAAO;AAAA,EAChB;AACF;AAOA,SAAS,eAAe,SAAiB,YAAsB,cAA8B;AAC3F,MAAI,QAAQ,UAAU,aAAc,QAAO;AAG3C,QAAM,eAAe,QAAQ,YAAY;AACzC,MAAI,UAAU;AACd,aAAW,QAAQ,YAAY;AAC7B,UAAM,MAAM,aAAa,QAAQ,IAAI;AACrC,QAAI,QAAQ,OAAO,YAAY,MAAM,MAAM,UAAU;AACnD,gBAAU;AAAA,IACZ;AAAA,EACF;AAGA,MAAI,YAAY,IAAI;AAClB,WAAO,QAAQ,MAAM,GAAG,YAAY,IAAI;AAAA,EAC1C;AAGA,QAAM,aAAa,KAAK,MAAM,eAAe,CAAC;AAC9C,MAAI,QAAQ,KAAK,IAAI,GAAG,UAAU,UAAU;AAC5C,MAAI,MAAM,KAAK,IAAI,QAAQ,QAAQ,QAAQ,YAAY;AAGvD,MAAI,QAAQ,QAAQ,QAAQ;AAC1B,YAAQ,KAAK,IAAI,GAAG,MAAM,YAAY;AAAA,EACxC;AAGA,MAAI,QAAQ,GAAG;AACb,UAAM,gBAAgB,QAAQ,YAAY,MAAM,KAAK;AACrD,QAAI,kBAAkB,MAAM,QAAQ,gBAAgB,KAAK;AACvD,cAAQ,gBAAgB;AAAA,IAC1B;AAAA,EACF;AACA,MAAI,MAAM,QAAQ,QAAQ;AACxB,UAAM,cAAc,QAAQ,QAAQ,MAAM,MAAM,CAAC;AACjD,QAAI,gBAAgB,MAAM,cAAc,MAAM,KAAK;AACjD,YAAM,cAAc;AAAA,IACtB;AAAA,EACF;AAEA,QAAM,SAAS,QAAQ,IAAI,QAAQ;AACnC,QAAM,SAAS,MAAM,QAAQ,SAAS,QAAQ;AAC9C,SAAO,SAAS,QAAQ,MAAM,OAAO,GAAG,IAAI;AAC9C;AAEA,IAAM,YAAY,oBAAI,IAAI;AAAA,EACxB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAC5D;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAC5D;AAAA,EAAU;AAAA,EAAO;AAAA,EAAS;AAAA,EAAS;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAC5D;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAS;AAAA,EACzD;AAAA,EAAW;AAAA,EAAU;AAAA,EAAU;AAAA,EAAS;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAC5D;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AAAA,EACzD;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EACxD;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACvD;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAQ;AAAA,EACrD;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAO;AAAA,EAAO;AAAA,EAAS;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAC/D;AAAA,EAAK;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AACjC,CAAC;AAED,SAAS,2BAA2B,OAAyB;AAC3D,QAAM,QAAQ,oBAAI,IAAY;AAC9B,aAAW,OAAO,gBAAgB,KAAK,GAAG;AACxC,UAAM,UAAU,wBAAwB,GAAG;AAC3C,QACE,QAAQ,SAAS,GAAG,KACpB,2BAA2B,OAAO,GAClC;AACA,YAAM,IAAI,OAAO;AACjB,YAAM,WAAW,QAAQ,MAAM,GAAG,EAAE,IAAI;AACxC,UAAI,YAAY,aAAa,QAAS,OAAM,IAAI,QAAQ;AAAA,IAC1D;AAAA,EACF;AACA,SAAO,CAAC,GAAG,KAAK,EAAE,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,EAAE,MAAM,GAAG,EAAE;AACjE;AAEA,SAAS,gBAAgB,OAAyB;AAChD,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO;AACX,aAAW,QAAQ,MAAM,MAAM,GAAG,GAAM,GAAG;AACzC,QAAI,SAAS,OAAO,SAAS,QAAQ,SAAS,QAAQ,SAAS,KAAM;AACnE,UAAI,KAAK,SAAS,EAAG,OAAM,KAAK,IAAI;AACpC,aAAO;AACP;AAAA,IACF;AACA,YAAQ;AACR,QAAI,KAAK,SAAS,KAAK;AACrB,YAAM,KAAK,IAAI;AACf,aAAO;AAAA,IACT;AAAA,EACF;AACA,MAAI,KAAK,SAAS,EAAG,OAAM,KAAK,IAAI;AACpC,SAAO;AACT;AAEA,SAAS,wBAAwB,KAAqB;AACpD,QAAM,UAAU,oBAAI,IAAI,CAAC,KAAK,KAAK,KAAM,KAAK,KAAK,GAAG,CAAC;AACvD,QAAM,WAAW,oBAAI,IAAI,CAAC,KAAK,KAAK,KAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,CAAC;AACtF,MAAI,QAAQ;AACZ,MAAI,MAAM,IAAI;AACd,SAAO,QAAQ,OAAO,QAAQ,IAAI,IAAI,KAAK,CAAE,EAAG,UAAS;AACzD,SAAO,MAAM,SAAS,SAAS,IAAI,IAAI,MAAM,CAAC,CAAE,EAAG,QAAO;AAC1D,SAAO,IAAI,MAAM,OAAO,GAAG;AAC7B;AAEA,SAAS,2BAA2B,OAAwB;AAC1D,QAAM,QAAQ,MAAM,YAAY,GAAG;AACnC,QAAM,WAAW,MAAM,MAAM,QAAQ,CAAC;AACtC,QAAM,MAAM,SAAS,YAAY,GAAG;AACpC,MAAI,OAAO,KAAK,QAAQ,SAAS,SAAS,EAAG,QAAO;AACpD,QAAM,MAAM,SAAS,MAAM,MAAM,CAAC;AAClC,MAAI,IAAI,SAAS,KAAK,IAAI,SAAS,GAAI,QAAO;AAC9C,aAAW,QAAQ,KAAK;AACtB,UAAM,OAAO,KAAK,WAAW,CAAC;AAC9B,UAAM,QACH,QAAQ,MAAM,QAAQ,MACtB,QAAQ,MAAM,QAAQ,MACtB,QAAQ,MAAM,QAAQ,OACvB,SAAS,OACT,SAAS,OACT,SAAS;AACX,QAAI,CAAC,MAAO,QAAO;AAAA,EACrB;AACA,SAAO;AACT;AAEA,SAAS,2BAA2B,OAAyB;AAC3D,QAAM,QAAQ,MAAM,YAAY;AAChC,MAAI,CAAC,kFAAkF,KAAK,KAAK,GAAG;AAClG,WAAO,CAAC;AAAA,EACV;AACA,SAAO,MACJ,QAAQ,YAAY,GAAG,EACvB,MAAM,KAAK,EACX,OAAO,CAAC,SAAS,KAAK,SAAS,KAAK,CAAC,UAAU,IAAI,KAAK,YAAY,CAAC,CAAC,EACtE,MAAM,GAAG,CAAC;AACf;AAEA,SAAS,WAAW,OAAuB;AACzC,SAAO,MAAM,QAAQ,WAAW,CAAC,SAAS,KAAK,IAAI,EAAE;AACvD;AAEA,SAAS,iBAAiB,OAA+B;AACvD,SAAO,OAAO,UAAU,YAAY,MAAM,KAAK,EAAE,SAAS,IAAI,QAAQ;AACxE;AAOA,SAAS,iBAAiB,KAAqB;AAC7C,QAAM,QAAQ,IACX,QAAQ,YAAY,GAAG,EACvB,MAAM,KAAK,EACX,OAAO,CAAC,MAAM,EAAE,SAAS,KAAK,CAAC,UAAU,IAAI,EAAE,YAAY,CAAC,CAAC;AAChE,MAAI,MAAM,WAAW,GAAG;AAEtB,UAAM,WAAW,IAAI,QAAQ,YAAY,GAAG,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AACrF,QAAI,SAAS,WAAW,EAAG,QAAO;AAClC,WAAO,SAAS,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,MAAM;AAAA,EAClD;AACA,SAAO,MAAM,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,KAAK,MAAM;AAC/C;","names":[]}

package/dist/chunk-5NXIJZFX.js

@@ -0,0 +1,180 @@
+import {
+  isDirectAnswerEligible
+} from "./chunk-Y4FHOFJ2.js";
+import {
+  throwIfAborted
+} from "./chunk-PVGDJXVK.js";
+import {
+  normalizeRecallTokens
+} from "./chunk-DT5TVLJE.js";
+
+// src/taxonomy/resolver.ts
+var DEFAULT_CATEGORY_ID = "facts";
+function resolveCategory(content, memoryCategory, taxonomy) {
+  const contentTokens = tokenizeKeywordText(content);
+  const matches = taxonomy.categories.filter(
+    (cat) => cat.memoryCategories.includes(memoryCategory)
+  );
+  if (matches.length === 0) {
+    const fallback = taxonomy.categories.find((c) => c.id === DEFAULT_CATEGORY_ID) ?? taxonomy.categories[0];
+    if (!fallback) {
+      return {
+        categoryId: DEFAULT_CATEGORY_ID,
+        confidence: 0,
+        reason: "Taxonomy is empty; using default category",
+        alternatives: []
+      };
+    }
+    const alternatives2 = taxonomy.categories.filter((c) => c.id !== fallback.id).map((c) => ({
+      categoryId: c.id,
+      reason: c.description
+    }));
+    return {
+      categoryId: fallback.id,
+      confidence: 0.3,
+      reason: `No taxonomy category maps to MemoryCategory "${memoryCategory}"; falling back to "${fallback.name}"`,
+      alternatives: alternatives2
+    };
+  }
+  if (matches.length === 1) {
+    const match = matches[0];
+    const alternatives2 = taxonomy.categories.filter((c) => c.id !== match.id).map((c) => ({
+      categoryId: c.id,
+      reason: c.description
+    }));
+    return {
+      categoryId: match.id,
+      confidence: 1,
+      reason: `Unique match: MemoryCategory "${memoryCategory}" maps to "${match.name}"`,
+      alternatives: alternatives2
+    };
+  }
+  const scored = matches.map((cat) => ({
+    cat,
+    keywordScore: computeKeywordScoreForTokens(contentTokens, cat)
+  }));
+  scored.sort((a, b) => {
+    if (b.keywordScore !== a.keywordScore) return b.keywordScore - a.keywordScore;
+    return a.cat.priority - b.cat.priority;
+  });
+  const topScored = scored[0];
+  const best = topScored.keywordScore > 0 ? topScored : {
+    cat: selectFallbackCategory(matches) ?? topScored.cat,
+    keywordScore: 0
+  };
+  const runnerUp = scored[1];
+  const confidence = best.keywordScore > 0 && (!runnerUp || best.keywordScore > runnerUp.keywordScore) ? 0.9 : 0.7;
+  const alternatives = taxonomy.categories.filter((c) => c.id !== best.cat.id).map((c) => ({
+    categoryId: c.id,
+    reason: c.description
+  }));
+  const reason = best.keywordScore > 0 ? `Filing rules for "${best.cat.name}" matched content keywords (priority ${best.cat.priority})` : `No filing rules matched content keywords; using fallback category "${best.cat.name}"`;
+  return {
+    categoryId: best.cat.id,
+    confidence,
+    reason,
+    alternatives
+  };
+}
+function computeKeywordScoreForTokens(contentTokens, cat) {
+  let score = 0;
+  const ruleText = [...cat.filingRules, cat.description].join(" ").toLowerCase();
+  const keywords = tokenizeKeywordText(ruleText);
+  for (const kw of keywords) {
+    if (contentTokens.has(kw)) {
+      score += 1;
+    }
+  }
+  return score;
+}
+function tokenizeKeywordText(value) {
+  return new Set(
+    value.toLowerCase().split(/[^a-z0-9]+/).map((word) => word.trim()).filter((word) => word.length >= 3 && !TAXONOMY_KEYWORD_STOPWORDS.has(word))
+  );
+}
+function selectFallbackCategory(categories) {
+  return categories.find((cat) => cat.id === DEFAULT_CATEGORY_ID) ?? categories.find((cat) => {
+    const text = `${cat.id} ${cat.name} ${cat.description} ${cat.filingRules.join(" ")}`.toLowerCase();
+    return /\b(general|fallback)\b/.test(text);
+  });
+}
+var TAXONOMY_KEYWORD_STOPWORDS = /* @__PURE__ */ new Set([
+  "about",
+  "all",
+  "and",
+  "are",
+  "for",
+  "from",
+  "has",
+  "into",
+  "not",
+  "the",
+  "this",
+  "was",
+  "with"
+]);
+
+// src/direct-answer-wiring.ts
+async function tryDirectAnswer(input) {
+  const { query, namespace, config, sources, queryEntityRefs, abortSignal } = input;
+  const eligibilityConfig = {
+    enabled: config.recallDirectAnswerEnabled,
+    tokenOverlapFloor: config.recallDirectAnswerTokenOverlapFloor,
+    importanceFloor: config.recallDirectAnswerImportanceFloor,
+    ambiguityMargin: config.recallDirectAnswerAmbiguityMargin,
+    eligibleTaxonomyBuckets: config.recallDirectAnswerEligibleTaxonomyBuckets
+  };
+  if (!eligibilityConfig.enabled) {
+    return isDirectAnswerEligible({
+      query,
+      candidates: [],
+      config: eligibilityConfig,
+      queryEntityRefs
+    });
+  }
+  if (normalizeRecallTokens(query).length === 0) {
+    return isDirectAnswerEligible({
+      query,
+      candidates: [],
+      config: eligibilityConfig,
+      queryEntityRefs
+    });
+  }
+  throwIfAborted(abortSignal, "direct-answer wiring aborted");
+  const memories = await sources.listCandidateMemories({ namespace, abortSignal });
+  throwIfAborted(abortSignal, "direct-answer wiring aborted");
+  const candidates = [];
+  for (const memory of memories) {
+    throwIfAborted(abortSignal, "direct-answer wiring aborted");
+    const trustZone = await sources.trustZoneFor(memory.frontmatter.id);
+    throwIfAborted(abortSignal, "direct-answer wiring aborted");
+    if (trustZone !== "trusted") continue;
+    const decision = resolveCategory(
+      memory.content,
+      memory.frontmatter.category,
+      sources.taxonomy
+    );
+    const taxonomyBucket = decision.categoryId;
+    if (!eligibilityConfig.eligibleTaxonomyBuckets.includes(taxonomyBucket)) continue;
+    const importanceScore = sources.importanceFor(memory);
+    candidates.push({
+      memory,
+      trustZone,
+      taxonomyBucket,
+      importanceScore
+    });
+  }
+  throwIfAborted(abortSignal, "direct-answer wiring aborted");
+  return isDirectAnswerEligible({
+    query,
+    candidates,
+    config: eligibilityConfig,
+    queryEntityRefs
+  });
+}
+
+export {
+  resolveCategory,
+  tryDirectAnswer
+};
+//# sourceMappingURL=chunk-5NXIJZFX.js.map

package/dist/chunk-5NXIJZFX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/taxonomy/resolver.ts","../src/direct-answer-wiring.ts"],"sourcesContent":["/**\n * Resolver decision tree for the MECE taxonomy.\n *\n * Given extracted content and its MemoryCategory, determines which\n * taxonomy category the knowledge should be filed under.\n */\n\nimport type { MemoryCategory } from \"../types.js\";\nimport type { ResolverDecision, Taxonomy, TaxonomyCategory } from \"./types.js\";\n\nconst DEFAULT_CATEGORY_ID = \"facts\";\n\n/**\n * Resolve a piece of content to a taxonomy category.\n *\n * Algorithm:\n * 1. Find all taxonomy categories whose `memoryCategories` include\n *    the given `memoryCategory`.\n * 2. If exactly one match, return it with confidence 1.0.\n * 3. If multiple matches, prefer the strongest exact-token keyword\n *    overlap from filing rules. Use priority only as a tie-breaker.\n *    If no filing rules match, choose the explicit/default fallback\n *    category instead of letting low-priority generic terms win.\n * 4. If no match, fall back to the \"facts\" category (or first\n *    category if \"facts\" is absent) with low confidence.\n * 5. Always populate `alternatives` with other plausible categories.\n */\nexport function resolveCategory(\n  content: string,\n  memoryCategory: MemoryCategory,\n  taxonomy: Taxonomy,\n): ResolverDecision {\n  const contentTokens = tokenizeKeywordText(content);\n\n  // Step 1: find matching categories\n  const matches = taxonomy.categories.filter((cat) =>\n    cat.memoryCategories.includes(memoryCategory),\n  );\n\n  if (matches.length === 0) {\n    // No taxonomy category accepts this MemoryCategory — fall back\n    const fallback =\n      taxonomy.categories.find((c) => c.id === DEFAULT_CATEGORY_ID) ??\n      taxonomy.categories[0];\n    if (!fallback) {\n      return {\n        categoryId: DEFAULT_CATEGORY_ID,\n        confidence: 0,\n        reason: \"Taxonomy is empty; using default category\",\n        alternatives: [],\n      };\n    }\n    const alternatives = taxonomy.categories\n      .filter((c) => c.id !== fallback.id)\n      .map((c) => ({\n        categoryId: c.id,\n        reason: c.description,\n      }));\n    return {\n      categoryId: fallback.id,\n      confidence: 0.3,\n      reason: `No taxonomy category maps to MemoryCategory \"${memoryCategory}\"; falling back to \"${fallback.name}\"`,\n      alternatives,\n    };\n  }\n\n  if (matches.length === 1) {\n    const match = matches[0]!;\n    const alternatives = taxonomy.categories\n      .filter((c) => c.id !== match.id)\n      .map((c) => ({\n        categoryId: c.id,\n        reason: c.description,\n      }));\n    return {\n      categoryId: match.id,\n      confidence: 1.0,\n      reason: `Unique match: MemoryCategory \"${memoryCategory}\" maps to \"${match.name}\"`,\n      alternatives,\n    };\n  }\n\n  // Multiple matches — use filing rule keyword heuristics + priority\n  const scored = matches.map((cat) => ({\n    cat,\n    keywordScore: computeKeywordScoreForTokens(contentTokens, cat),\n  }));\n\n  // Sort by keyword score descending, then priority ascending (lower wins)\n  scored.sort((a, b) => {\n    if (b.keywordScore !== a.keywordScore) return b.keywordScore - a.keywordScore;\n    return a.cat.priority - b.cat.priority;\n  });\n\n  const topScored = scored[0]!;\n  const best = topScored.keywordScore > 0\n    ? topScored\n    : {\n        cat: selectFallbackCategory(matches) ?? topScored.cat,\n        keywordScore: 0,\n      };\n  const runnerUp = scored[1];\n\n  // Confidence is higher when keyword match clearly differentiates\n  const confidence =\n    best.keywordScore > 0 && (!runnerUp || best.keywordScore > runnerUp.keywordScore)\n      ? 0.9\n      : 0.7;\n\n  const alternatives = taxonomy.categories\n    .filter((c) => c.id !== best.cat.id)\n    .map((c) => ({\n      categoryId: c.id,\n      reason: c.description,\n    }));\n\n  const reason =\n    best.keywordScore > 0\n      ? `Filing rules for \"${best.cat.name}\" matched content keywords (priority ${best.cat.priority})`\n      : `No filing rules matched content keywords; using fallback category \"${best.cat.name}\"`;\n\n  return {\n    categoryId: best.cat.id,\n    confidence,\n    reason,\n    alternatives,\n  };\n}\n\n/**\n * Compute a simple keyword overlap score between content and\n * a category's filing rules + description.\n */\nfunction computeKeywordScoreForTokens(contentTokens: Set<string>, cat: TaxonomyCategory): number {\n  let score = 0;\n  const ruleText = [...cat.filingRules, cat.description]\n    .join(\" \")\n    .toLowerCase();\n\n  const keywords = tokenizeKeywordText(ruleText);\n\n  for (const kw of keywords) {\n    if (contentTokens.has(kw)) {\n      score += 1;\n    }\n  }\n  return score;\n}\n\nfunction tokenizeKeywordText(value: string): Set<string> {\n  return new Set(\n    value\n      .toLowerCase()\n      .split(/[^a-z0-9]+/)\n      .map((word) => word.trim())\n      .filter((word) => word.length >= 3 && !TAXONOMY_KEYWORD_STOPWORDS.has(word)),\n  );\n}\n\nfunction selectFallbackCategory(\n  categories: readonly TaxonomyCategory[],\n): TaxonomyCategory | undefined {\n  return categories.find((cat) => cat.id === DEFAULT_CATEGORY_ID) ??\n    categories.find((cat) => {\n      const text = `${cat.id} ${cat.name} ${cat.description} ${cat.filingRules.join(\" \")}`.toLowerCase();\n      return /\\b(general|fallback)\\b/.test(text);\n    });\n}\n\nconst TAXONOMY_KEYWORD_STOPWORDS = new Set([\n  \"about\",\n  \"all\",\n  \"and\",\n  \"are\",\n  \"for\",\n  \"from\",\n  \"has\",\n  \"into\",\n  \"not\",\n  \"the\",\n  \"this\",\n  \"was\",\n  \"with\",\n]);\n","/**\n * Direct-answer wiring (issue #518 slice 3).\n *\n * Binds the pure eligibility decision (`direct-answer.ts`) to the data\n * sources needed to build candidates: storage, trust-zones, taxonomy,\n * and importance scoring.  Kept as a separate module so that:\n *\n * - The eligibility layer stays pure and unit-testable without stores.\n * - Each caller injects its own source accessors.  The orchestrator\n *   binding is a follow-on slice; tests here use mock sources.\n * - The wiring is safe to ship alone — nothing calls `tryDirectAnswer`\n *   yet, so enabling this module's presence does not change recall\n *   behavior.  The next slice adds exactly one call site before QMD.\n *\n * Short-circuit contract:\n *\n * - When `config.recallDirectAnswerEnabled === false`, the function\n *   returns the eligibility verdict with reason `\"disabled\"` without\n *   touching any source accessor.  This is the documented default.\n * - When enabled, the wiring cheaply drops non-trusted-zone memories\n *   and ineligible taxonomy buckets before computing importance, so\n *   the eligibility module sees a pre-filtered candidate set.  The\n *   eligibility module still performs the same checks itself — this\n *   module is purely an I/O and prefiltering layer.\n */\n\nimport type { MemoryFile, PluginConfig } from \"./types.js\";\nimport type { TrustZoneName } from \"./trust-zones.js\";\nimport type { Taxonomy } from \"./taxonomy/types.js\";\nimport { resolveCategory } from \"./taxonomy/resolver.js\";\nimport { normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport { throwIfAborted } from \"./abort-error.js\";\nimport {\n  isDirectAnswerEligible,\n  type DirectAnswerCandidate,\n  type DirectAnswerConfig,\n  type DirectAnswerResult,\n} from \"./direct-answer.js\";\n\n/**\n * Caller-provided accessors for candidate sourcing.  Decouples the\n * wiring from any specific storage / trust-zone / importance backend.\n */\nexport interface DirectAnswerSources {\n  /**\n   * List memories eligible to be considered for direct-answer.\n   * Callers are expected to return only active, non-superseded memories\n   * in the requested namespace; the wiring will cheaply re-filter on\n   * trust zone and taxonomy bucket and hand the rest to the eligibility\n   * module, which applies the full gate ladder.\n   */\n  listCandidateMemories(options: {\n    namespace: string;\n    abortSignal?: AbortSignal;\n  }): Promise<MemoryFile[]>;\n  /**\n   * Resolve the trust-zone record for a memory.  Returns `null` when\n   * the memory has no trust-zone record (treated as not trusted).\n   */\n  trustZoneFor(memoryId: string): Promise<TrustZoneName | null>;\n  /**\n   * Resolve a calibrated importance score in [0, 1] for a memory.\n   */\n  importanceFor(memory: MemoryFile): number;\n  /**\n   * Taxonomy used to classify memories into direct-answer buckets.\n   */\n  taxonomy: Taxonomy;\n}\n\nexport interface DirectAnswerWiringInput {\n  query: string;\n  namespace: string;\n  config: Pick<\n    PluginConfig,\n    | \"recallDirectAnswerEnabled\"\n    | \"recallDirectAnswerTokenOverlapFloor\"\n    | \"recallDirectAnswerImportanceFloor\"\n    | \"recallDirectAnswerAmbiguityMargin\"\n    | \"recallDirectAnswerEligibleTaxonomyBuckets\"\n  >;\n  sources: DirectAnswerSources;\n  queryEntityRefs?: string[];\n  abortSignal?: AbortSignal;\n}\n\n/**\n * Attempt direct-answer resolution.  Returns the eligibility verdict\n * produced by `isDirectAnswerEligible` with candidates materialized\n * from the caller-supplied sources.\n */\nexport async function tryDirectAnswer(\n  input: DirectAnswerWiringInput,\n): Promise<DirectAnswerResult> {\n  const { query, namespace, config, sources, queryEntityRefs, abortSignal } = input;\n\n  const eligibilityConfig: DirectAnswerConfig = {\n    enabled: config.recallDirectAnswerEnabled,\n    tokenOverlapFloor: config.recallDirectAnswerTokenOverlapFloor,\n    importanceFloor: config.recallDirectAnswerImportanceFloor,\n    ambiguityMargin: config.recallDirectAnswerAmbiguityMargin,\n    eligibleTaxonomyBuckets: config.recallDirectAnswerEligibleTaxonomyBuckets,\n  };\n\n  // Short-circuit disabled case before touching any I/O.\n  if (!eligibilityConfig.enabled) {\n    return isDirectAnswerEligible({\n      query,\n      candidates: [],\n      config: eligibilityConfig,\n      queryEntityRefs,\n    });\n  }\n\n  // Short-circuit empty-query case before any I/O.  isDirectAnswerEligible\n  // deterministically returns reason \"empty-query\" when the query\n  // normalizes to zero searchable tokens; there's no point materializing\n  // candidates just to reach the same verdict, and doing so would\n  // surface avoidable upstream errors for requests that should exit\n  // immediately.\n  if (normalizeRecallTokens(query).length === 0) {\n    return isDirectAnswerEligible({\n      query,\n      candidates: [],\n      config: eligibilityConfig,\n      queryEntityRefs,\n    });\n  }\n\n  throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n  const memories = await sources.listCandidateMemories({ namespace, abortSignal });\n  throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n  const candidates: DirectAnswerCandidate[] = [];\n\n  for (const memory of memories) {\n    // Throw rather than returning a partial verdict — a mid-loop abort\n    // that left competing candidates unprocessed could otherwise surface\n    // a spurious \"eligible\" result that the ambiguity gate never got a\n    // chance to reject.  The check repeats after every await so an\n    // abort that lands during the in-flight I/O on the final memory\n    // (after which no further iteration would exist) still stops us.\n    throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n\n    const trustZone = await sources.trustZoneFor(memory.frontmatter.id);\n    throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n\n    // Cheap pre-filter: non-trusted memories can't qualify, so skip\n    // taxonomy and importance resolution for them.\n    if (trustZone !== \"trusted\") continue;\n\n    const decision = resolveCategory(\n      memory.content,\n      memory.frontmatter.category,\n      sources.taxonomy,\n    );\n    const taxonomyBucket = decision.categoryId;\n    if (!eligibilityConfig.eligibleTaxonomyBuckets.includes(taxonomyBucket)) continue;\n\n    const importanceScore = sources.importanceFor(memory);\n\n    candidates.push({\n      memory,\n      trustZone,\n      taxonomyBucket,\n      importanceScore,\n    });\n  }\n\n  // Final check — if abort landed during the trust-zone await for the\n  // last memory, the loop condition no longer fires.  Guard before we\n  // hand candidates to the eligibility gate.\n  throwIfAborted(abortSignal, \"direct-answer wiring aborted\");\n\n  return isDirectAnswerEligible({\n    query,\n    candidates,\n    config: eligibilityConfig,\n    queryEntityRefs,\n  });\n}\n"],"mappings":";;;;;;;;;;;AAUA,IAAM,sBAAsB;AAiBrB,SAAS,gBACd,SACA,gBACA,UACkB;AAClB,QAAM,gBAAgB,oBAAoB,OAAO;AAGjD,QAAM,UAAU,SAAS,WAAW;AAAA,IAAO,CAAC,QAC1C,IAAI,iBAAiB,SAAS,cAAc;AAAA,EAC9C;AAEA,MAAI,QAAQ,WAAW,GAAG;AAExB,UAAM,WACJ,SAAS,WAAW,KAAK,CAAC,MAAM,EAAE,OAAO,mBAAmB,KAC5D,SAAS,WAAW,CAAC;AACvB,QAAI,CAAC,UAAU;AACb,aAAO;AAAA,QACL,YAAY;AAAA,QACZ,YAAY;AAAA,QACZ,QAAQ;AAAA,QACR,cAAc,CAAC;AAAA,MACjB;AAAA,IACF;AACA,UAAMA,gBAAe,SAAS,WAC3B,OAAO,CAAC,MAAM,EAAE,OAAO,SAAS,EAAE,EAClC,IAAI,CAAC,OAAO;AAAA,MACX,YAAY,EAAE;AAAA,MACd,QAAQ,EAAE;AAAA,IACZ,EAAE;AACJ,WAAO;AAAA,MACL,YAAY,SAAS;AAAA,MACrB,YAAY;AAAA,MACZ,QAAQ,gDAAgD,cAAc,uBAAuB,SAAS,IAAI;AAAA,MAC1G,cAAAA;AAAA,IACF;AAAA,EACF;AAEA,MAAI,QAAQ,WAAW,GAAG;AACxB,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAMA,gBAAe,SAAS,WAC3B,OAAO,CAAC,MAAM,EAAE,OAAO,MAAM,EAAE,EAC/B,IAAI,CAAC,OAAO;AAAA,MACX,YAAY,EAAE;AAAA,MACd,QAAQ,EAAE;AAAA,IACZ,EAAE;AACJ,WAAO;AAAA,MACL,YAAY,MAAM;AAAA,MAClB,YAAY;AAAA,MACZ,QAAQ,iCAAiC,cAAc,cAAc,MAAM,IAAI;AAAA,MAC/E,cAAAA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,SAAS,QAAQ,IAAI,CAAC,SAAS;AAAA,IACnC;AAAA,IACA,cAAc,6BAA6B,eAAe,GAAG;AAAA,EAC/D,EAAE;AAGF,SAAO,KAAK,CAAC,GAAG,MAAM;AACpB,QAAI,EAAE,iBAAiB,EAAE,aAAc,QAAO,EAAE,eAAe,EAAE;AACjE,WAAO,EAAE,IAAI,WAAW,EAAE,IAAI;AAAA,EAChC,CAAC;AAED,QAAM,YAAY,OAAO,CAAC;AAC1B,QAAM,OAAO,UAAU,eAAe,IAClC,YACA;AAAA,IACE,KAAK,uBAAuB,OAAO,KAAK,UAAU;AAAA,IAClD,cAAc;AAAA,EAChB;AACJ,QAAM,WAAW,OAAO,CAAC;AAGzB,QAAM,aACJ,KAAK,eAAe,MAAM,CAAC,YAAY,KAAK,eAAe,SAAS,gBAChE,MACA;AAEN,QAAM,eAAe,SAAS,WAC3B,OAAO,CAAC,MAAM,EAAE,OAAO,KAAK,IAAI,EAAE,EAClC,IAAI,CAAC,OAAO;AAAA,IACX,YAAY,EAAE;AAAA,IACd,QAAQ,EAAE;AAAA,EACZ,EAAE;AAEJ,QAAM,SACJ,KAAK,eAAe,IAChB,qBAAqB,KAAK,IAAI,IAAI,wCAAwC,KAAK,IAAI,QAAQ,MAC3F,sEAAsE,KAAK,IAAI,IAAI;AAEzF,SAAO;AAAA,IACL,YAAY,KAAK,IAAI;AAAA,IACrB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAMA,SAAS,6BAA6B,eAA4B,KAA+B;AAC/F,MAAI,QAAQ;AACZ,QAAM,WAAW,CAAC,GAAG,IAAI,aAAa,IAAI,WAAW,EAClD,KAAK,GAAG,EACR,YAAY;AAEf,QAAM,WAAW,oBAAoB,QAAQ;AAE7C,aAAW,MAAM,UAAU;AACzB,QAAI,cAAc,IAAI,EAAE,GAAG;AACzB,eAAS;AAAA,IACX;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,OAA4B;AACvD,SAAO,IAAI;AAAA,IACT,MACG,YAAY,EACZ,MAAM,YAAY,EAClB,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,EACzB,OAAO,CAAC,SAAS,KAAK,UAAU,KAAK,CAAC,2BAA2B,IAAI,IAAI,CAAC;AAAA,EAC/E;AACF;AAEA,SAAS,uBACP,YAC8B;AAC9B,SAAO,WAAW,KAAK,CAAC,QAAQ,IAAI,OAAO,mBAAmB,KAC5D,WAAW,KAAK,CAAC,QAAQ;AACvB,UAAM,OAAO,GAAG,IAAI,EAAE,IAAI,IAAI,IAAI,IAAI,IAAI,WAAW,IAAI,IAAI,YAAY,KAAK,GAAG,CAAC,GAAG,YAAY;AACjG,WAAO,yBAAyB,KAAK,IAAI;AAAA,EAC3C,CAAC;AACL;AAEA,IAAM,6BAA6B,oBAAI,IAAI;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;;;AC5FD,eAAsB,gBACpB,OAC6B;AAC7B,QAAM,EAAE,OAAO,WAAW,QAAQ,SAAS,iBAAiB,YAAY,IAAI;AAE5E,QAAM,oBAAwC;AAAA,IAC5C,SAAS,OAAO;AAAA,IAChB,mBAAmB,OAAO;AAAA,IAC1B,iBAAiB,OAAO;AAAA,IACxB,iBAAiB,OAAO;AAAA,IACxB,yBAAyB,OAAO;AAAA,EAClC;AAGA,MAAI,CAAC,kBAAkB,SAAS;AAC9B,WAAO,uBAAuB;AAAA,MAC5B;AAAA,MACA,YAAY,CAAC;AAAA,MACb,QAAQ;AAAA,MACR;AAAA,IACF,CAAC;AAAA,EACH;AAQA,MAAI,sBAAsB,KAAK,EAAE,WAAW,GAAG;AAC7C,WAAO,uBAAuB;AAAA,MAC5B;AAAA,MACA,YAAY,CAAC;AAAA,MACb,QAAQ;AAAA,MACR;AAAA,IACF,CAAC;AAAA,EACH;AAEA,iBAAe,aAAa,8BAA8B;AAC1D,QAAM,WAAW,MAAM,QAAQ,sBAAsB,EAAE,WAAW,YAAY,CAAC;AAC/E,iBAAe,aAAa,8BAA8B;AAC1D,QAAM,aAAsC,CAAC;AAE7C,aAAW,UAAU,UAAU;AAO7B,mBAAe,aAAa,8BAA8B;AAE1D,UAAM,YAAY,MAAM,QAAQ,aAAa,OAAO,YAAY,EAAE;AAClE,mBAAe,aAAa,8BAA8B;AAI1D,QAAI,cAAc,UAAW;AAE7B,UAAM,WAAW;AAAA,MACf,OAAO;AAAA,MACP,OAAO,YAAY;AAAA,MACnB,QAAQ;AAAA,IACV;AACA,UAAM,iBAAiB,SAAS;AAChC,QAAI,CAAC,kBAAkB,wBAAwB,SAAS,cAAc,EAAG;AAEzE,UAAM,kBAAkB,QAAQ,cAAc,MAAM;AAEpD,eAAW,KAAK;AAAA,MACd;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF,CAAC;AAAA,EACH;AAKA,iBAAe,aAAa,8BAA8B;AAE1D,SAAO,uBAAuB;AAAA,IAC5B;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR;AAAA,EACF,CAAC;AACH;","names":["alternatives"]}