@remnic/core 9.69.102 → 9.69.104

package/dist/chunk-HFOY2SBG.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/preferences/preference-drift.ts","../src/contradiction/resolution.ts"],"sourcesContent":["/**\n * Preference drift detection (issue #2371).\n *\n * Remnic already handles *explicit* preference change: the contradiction scan\n * catches a new statement that conflicts with a stored one, and temporal\n * supersession retires a fact that gets restated. Both require new evidence to\n * arrive. This module covers the opposite failure mode the agent-memory survey\n * calls stale preference reuse: a `category: preference` memory keeps being\n * injected at full prominence even though the last N days of conversation\n * contain no corroboration for it — or contain behavioral evidence pointing the\n * other way that never rose to an explicit contradiction.\n *\n * Per aging preference the scan gathers recent same-namespace evidence, then\n * classifies:\n *\n *   - `corroborated` — recent evidence restates or is consistent with it.\n *   - `stale`        — the lookback window held nothing either way.\n *   - `drifted`      — recent evidence points away from it (judge verdict\n *                      `contradicts`), so a review item is opened.\n *   - `skipped`      — the classification could not be made honestly:\n *                      `backend_unavailable` (evidence lookup failed — §22:\n *                      never counted as \"no evidence\") or\n *                      `verification_unavailable` (evidence exists but no LLM\n *                      could judge it, so neither a positive nor a negative\n *                      claim is warranted).\n *\n * Apply mode stamps `lastCorroborated` / `driftState` and opens review items.\n * It never auto-deletes and never auto-supersedes: drift is inference, and the\n * least-privileged default for an inferred change to user state is \"ask\"\n * (Review Prevention Checklist §36). Resolution runs through the existing\n * review queue and `review_resolve`, with the drift verbs `keep`, `supersede`,\n * and `archive`.\n *\n * Deliberately NOT part of `runMemoryGovernance` — same isolation decision as\n * procedure mining and procedure-library maintenance.\n */\n\nimport path from \"node:path\";\nimport type { MemoryFile, MemoryStatus, PluginConfig } from \"../types.js\";\nimport type { StorageManager } from \"../storage.js\";\nimport type { LocalLlmClient } from \"../local-llm.js\";\nimport type { FallbackLlmClient } from \"../fallback-llm.js\";\nimport type { SemanticDedupHit, SemanticDedupLookup } from \"../dedup/semantic.js\";\nimport {\n  judgeContradictionPairs,\n  type ContradictionJudgeInput,\n  type ContradictionJudgeResult,\n} from \"../contradiction/contradiction-judge.js\";\nimport {\n  computeMemoryContentHash,\n  writePairs,\n  type ContradictionPair,\n} from \"../contradiction/contradiction-review.js\";\nimport { resolveScanStorage, type ScanStorageResolution } from \"../contradiction/contradiction-scan.js\";\nimport { bumpMemoryCorpusVersionForDir } from \"../memory-corpus-version.js\";\nimport { composeMemoryEnvelope } from \"../write-envelope.js\";\nimport { readJsonFile, writeJsonFileAtomic } from \"../json-store.js\";\nimport { log } from \"../logger.js\";\n\nconst DRIFT_ACTOR = \"preference-drift\";\nconst DRIFT_RULE_VERSION = \"preference-drift:1\";\nconst DAY_MS = 24 * 60 * 60 * 1000;\n\n/** Evidence hits fetched per preference. Bounded so one scan cannot fan out. */\nconst EVIDENCE_LOOKUP_LIMIT = 5;\n\nexport type PreferenceDriftClassification =\n  | \"corroborated\"\n  | \"stale\"\n  | \"drifted\"\n  | \"skipped\";\n\nexport type PreferenceDriftSkipReason =\n  | \"backend_unavailable\"\n  | \"verification_unavailable\";\n\nexport interface PreferenceDriftEvidence {\n  memoryId: string;\n  /** Similarity score reported by the evidence lookup. */\n  score: number;\n  /** `updated` (or `created`) of the evidence memory, ISO 8601. */\n  observedAt: string;\n}\n\nexport interface PreferenceDriftFinding {\n  memoryId: string;\n  classification: PreferenceDriftClassification;\n  /** Set only for `classification: \"skipped\"`. */\n  skipped?: PreferenceDriftSkipReason;\n  /** Age of the preference in whole days at the run instant. */\n  ageDays: number;\n  /** Existing `lastCorroborated` stamp, or null when never corroborated. */\n  lastCorroborated: string | null;\n  reason: string;\n  evidence: PreferenceDriftEvidence[];\n  /** Review pair id opened for a `drifted` finding in apply mode. */\n  reviewPairId?: string;\n}\n\nexport interface PreferenceDriftReport {\n  schemaVersion: 1;\n  generatedAt: string;\n  mode: \"shadow\" | \"apply\";\n  namespace?: string;\n  /** Active preferences examined after the min-age filter and per-run cap. */\n  scanned: number;\n  /** Active preferences that passed the category/status filter before the cap. */\n  eligible: number;\n  findings: PreferenceDriftFinding[];\n  counts: Record<PreferenceDriftClassification, number>;\n  /** Frontmatter stamps + review items actually written. Always 0 in shadow mode. */\n  appliedCount: number;\n  reviewItemsOpened: number;\n  elapsedMs: number;\n  skippedReason?: \"drift_disabled\" | \"scan_disabled\";\n}\n\nexport interface PreferenceDriftMarker {\n  schemaVersion: 1;\n  lastRunAt: string;\n  lastApplyAt: string | null;\n  appliedCount: number;\n}\n\nexport interface PreferenceDriftDependencies {\n  storage: StorageManager;\n  config: PluginConfig;\n  memoryDir: string;\n  /** Pre-built evidence lookup. Superseded by `embeddingLookupFactory`. */\n  embeddingLookup?: SemanticDedupLookup;\n  /** Builds a namespace-scoped evidence lookup from the scan's own storage. */\n  embeddingLookupFactory?: (storage: StorageManager) => SemanticDedupLookup | undefined;\n  storageForNamespace?: (\n    namespace: string | undefined,\n  ) => StorageManager | ScanStorageResolution | Promise<StorageManager | ScanStorageResolution>;\n  localLlm: LocalLlmClient | null;\n  fallbackLlm: FallbackLlmClient | null;\n  namespace?: string;\n  /** When true (and `driftDetection.enabled`), stamps and review items are written. */\n  apply?: boolean;\n  now?: Date;\n}\n\nfunction driftMarkerPath(memoryDir: string): string {\n  return path.join(memoryDir, \"state\", \"preference-drift.json\");\n}\n\n/** Read the last-run marker. Absent marker (or shadow-only history) → null apply timestamp. */\nexport async function readPreferenceDriftMarker(\n  memoryDir: string,\n): Promise<PreferenceDriftMarker | null> {\n  try {\n    const raw = await readJsonFile(driftMarkerPath(memoryDir));\n    if (raw === null || typeof raw !== \"object\" || Array.isArray(raw)) return null;\n    const m = raw as Record<string, unknown>;\n    if (typeof m.lastRunAt !== \"string\") return null;\n    return {\n      schemaVersion: 1,\n      lastRunAt: m.lastRunAt,\n      lastApplyAt: typeof m.lastApplyAt === \"string\" ? m.lastApplyAt : null,\n      appliedCount: typeof m.appliedCount === \"number\" ? m.appliedCount : 0,\n    };\n  } catch {\n    return null;\n  }\n}\n\nfunction tsMs(value: unknown): number | null {\n  if (typeof value !== \"string\") return null;\n  const ms = Date.parse(value);\n  return Number.isFinite(ms) ? ms : null;\n}\n\n/**\n * Statuses that make a memory a drift candidate. Stated as an inclusion set,\n * never an exclusion list, so a newly added status can never leak through\n * (§41): `superseded`, `archived`, `quarantined`, `rejected`, and\n * `pending_review` preferences are all excluded by construction.\n */\nconst CANDIDATE_STATUSES: Partial<Record<MemoryStatus, true>> = { active: true };\n\n/**\n * Deterministic candidate order (§12): oldest preference first, stable id\n * tiebreak, so the per-run cap always selects the same slice on identical\n * fixtures.\n */\nfunction compareCandidates(a: MemoryFile, b: MemoryFile): number {\n  const aMs = tsMs(a.frontmatter.created) ?? tsMs(a.frontmatter.updated) ?? 0;\n  const bMs = tsMs(b.frontmatter.created) ?? tsMs(b.frontmatter.updated) ?? 0;\n  if (aMs !== bMs) return aMs < bMs ? -1 : 1;\n  const aId = a.frontmatter.id ?? \"\";\n  const bId = b.frontmatter.id ?? \"\";\n  if (aId !== bId) return aId < bId ? -1 : 1;\n  return 0;\n}\n\ntype EvidenceResult =\n  | { ok: true; hits: PreferenceDriftEvidence[]; hitMemories: MemoryFile[] }\n  | { ok: false; reason: \"backend_unavailable\" };\n\n/**\n * Gather recent same-namespace evidence for one preference.\n *\n * §22: an empty result and a failed backend are DIFFERENT outcomes. The\n * `SemanticDedupLookup` contract is that implementations throw when the\n * embedding backend is unavailable and return `[]` only when a reachable\n * backend reports no hits, so the throw is the failure signal — it must never\n * be swallowed into \"no evidence\", which would mark a live preference stale.\n */\nasync function gatherEvidence(\n  preference: MemoryFile,\n  lookup: SemanticDedupLookup,\n  byId: ReadonlyMap<string, MemoryFile>,\n  windowStartMs: number,\n  nowMs: number,\n): Promise<EvidenceResult> {\n  let raw: SemanticDedupHit[];\n  try {\n    raw = await lookup(preference.content, EVIDENCE_LOOKUP_LIMIT);\n  } catch (err) {\n    log.debug(\"[preference-drift] evidence lookup failed\", {\n      memoryId: preference.frontmatter.id,\n      error: err instanceof Error ? err.message : String(err),\n    });\n    return { ok: false, reason: \"backend_unavailable\" };\n  }\n\n  const hits: PreferenceDriftEvidence[] = [];\n  const hitMemories: MemoryFile[] = [];\n  for (const hit of raw) {\n    if (hit.id === preference.frontmatter.id) continue;\n    const memory = byId.get(hit.id);\n    if (!memory) continue;\n    const observedMs = tsMs(memory.frontmatter.updated) ?? tsMs(memory.frontmatter.created);\n    if (observedMs === null) continue;\n    // Half-open window [windowStart, now): a memory observed exactly at the\n    // window start counts, one observed exactly at the run instant does not\n    // (§23).\n    if (observedMs < windowStartMs || observedMs >= nowMs) continue;\n    hits.push({\n      memoryId: hit.id,\n      score: hit.score,\n      observedAt: memory.frontmatter.updated ?? memory.frontmatter.created ?? \"\",\n    });\n    hitMemories.push(memory);\n  }\n  return { ok: true, hits, hitMemories };\n}\n\n/**\n * Map judge verdicts over a preference's evidence to a drift classification.\n *\n * - `contradicts` on any hit wins: the preference has drifted.\n * - `duplicates` means the evidence restates the preference → corroborated.\n * - `independent` is evidence about something else, so it corroborates\n *   nothing; with no better verdict the preference is stale.\n * - `needs-user` (which is also what the judge returns when no LLM is\n *   reachable) leaves the question genuinely unanswered. Stamping\n *   `lastCorroborated` would assert something unverified and stamping `stale`\n *   would contradict the evidence we did find, so the honest outcome is\n *   `skipped: verification_unavailable`.\n */\nfunction classifyFromVerdicts(\n  verdicts: readonly ContradictionJudgeResult[],\n): { classification: PreferenceDriftClassification; skipped?: PreferenceDriftSkipReason; reason: string; driftedAgainst?: string } {\n  const contradiction = verdicts.find((v) => v.verdict === \"contradicts\");\n  if (contradiction) {\n    return {\n      classification: \"drifted\",\n      reason: `recent evidence points away from this preference: ${contradiction.rationale}`,\n      driftedAgainst: contradiction.memoryIdB,\n    };\n  }\n  const restatement = verdicts.find((v) => v.verdict === \"duplicates\");\n  if (restatement) {\n    return {\n      classification: \"corroborated\",\n      reason: `recent evidence restates this preference: ${restatement.rationale}`,\n    };\n  }\n  if (verdicts.some((v) => v.verdict === \"needs-user\")) {\n    return {\n      classification: \"skipped\",\n      skipped: \"verification_unavailable\",\n      reason: \"recent evidence found but no judge verdict was available to classify it\",\n    };\n  }\n  return {\n    classification: \"stale\",\n    reason: \"recent evidence is independent of this preference — no corroboration either way\",\n  };\n}\n\n/**\n * Run one preference-drift pass over a namespace.\n *\n * Shadow mode (the default) performs NO writes — not even the run marker.\n * Applying requires `apply: true` AND `driftDetection.enabled: true`.\n */\nexport async function runPreferenceDriftScan(\n  deps: PreferenceDriftDependencies,\n): Promise<PreferenceDriftReport> {\n  const startTime = Date.now();\n  const now = deps.now ?? new Date();\n  const nowIso = now.toISOString();\n  const nowMs = now.getTime();\n  const mode: \"shadow\" | \"apply\" = deps.apply === true ? \"apply\" : \"shadow\";\n  const cfg = deps.config.driftDetection;\n\n  const emptyCounts: Record<PreferenceDriftClassification, number> = {\n    corroborated: 0,\n    stale: 0,\n    drifted: 0,\n    skipped: 0,\n  };\n\n  if (cfg?.enabled !== true) {\n    return {\n      schemaVersion: 1,\n      generatedAt: nowIso,\n      mode,\n      scanned: 0,\n      eligible: 0,\n      findings: [],\n      counts: emptyCounts,\n      appliedCount: 0,\n      reviewItemsOpened: 0,\n      elapsedMs: Date.now() - startTime,\n      skippedReason: \"drift_disabled\",\n    };\n  }\n  // `0` is the documented disable value and must behave as a true zero (§33).\n  if (cfg.maxCandidatesPerRun === 0) {\n    return {\n      schemaVersion: 1,\n      generatedAt: nowIso,\n      mode,\n      scanned: 0,\n      eligible: 0,\n      findings: [],\n      counts: emptyCounts,\n      appliedCount: 0,\n      reviewItemsOpened: 0,\n      elapsedMs: Date.now() - startTime,\n      skippedReason: \"scan_disabled\",\n    };\n  }\n\n  const { storage, namespace } = await resolveScanStorage(deps, deps.namespace?.trim() || undefined);\n  const lookup = deps.embeddingLookupFactory\n    ? deps.embeddingLookupFactory(storage)\n    : deps.embeddingLookup;\n\n  let all: MemoryFile[];\n  try {\n    all = await storage.readAllMemories();\n  } catch (err) {\n    log.warn(\n      `[preference-drift] failed to read memories: ${err instanceof Error ? err.message : String(err)}`,\n    );\n    all = [];\n  }\n\n  const byId = new Map<string, MemoryFile>();\n  for (const m of all) {\n    const id = m.frontmatter.id;\n    if (typeof id === \"string\" && id.length > 0) byId.set(id, m);\n  }\n\n  const minAgeMs = cfg.minAgeDays * DAY_MS;\n  const eligible = all.filter((m) => {\n    const fm = m.frontmatter;\n    if (fm.category !== \"preference\") return false;\n    if (CANDIDATE_STATUSES[fm.status ?? \"active\"] !== true) return false;\n    if (typeof fm.id !== \"string\" || fm.id.length === 0) return false;\n    if (!m.content || m.content.trim().length === 0) return false;\n    const bornMs = tsMs(fm.created) ?? tsMs(fm.updated);\n    if (bornMs === null) return false;\n    return nowMs - bornMs >= minAgeMs;\n  });\n\n  const candidates = [...eligible].sort(compareCandidates).slice(0, cfg.maxCandidatesPerRun);\n\n  const report: PreferenceDriftReport = {\n    schemaVersion: 1,\n    generatedAt: nowIso,\n    mode,\n    namespace,\n    scanned: candidates.length,\n    eligible: eligible.length,\n    findings: [],\n    counts: { ...emptyCounts },\n    appliedCount: 0,\n    reviewItemsOpened: 0,\n    elapsedMs: 0,\n  };\n\n  const windowStartMs = nowMs - cfg.lookbackDays * DAY_MS;\n  // One judge cache per run so the module-level singleton never leaks across\n  // namespaces or scans.\n  const judgeCache = new Map<string, ContradictionJudgeResult>();\n  const driftedPairs: Array<{ preference: MemoryFile; evidenceId: string; finding: PreferenceDriftFinding; rationale: string; confidence: number }> = [];\n  const stamps: Array<{ memory: MemoryFile; patch: { driftState?: \"stale\"; lastCorroborated?: string }; reasonCode: string }> = [];\n\n  for (const preference of candidates) {\n    const bornMs = tsMs(preference.frontmatter.created) ?? tsMs(preference.frontmatter.updated) ?? nowMs;\n    const finding: PreferenceDriftFinding = {\n      memoryId: preference.frontmatter.id,\n      classification: \"stale\",\n      ageDays: Math.floor((nowMs - bornMs) / DAY_MS),\n      lastCorroborated: preference.frontmatter.lastCorroborated ?? null,\n      reason: \"\",\n      evidence: [],\n    };\n\n    if (!lookup) {\n      finding.classification = \"skipped\";\n      finding.skipped = \"backend_unavailable\";\n      finding.reason = \"no evidence lookup is configured, so corroboration cannot be checked\";\n      report.findings.push(finding);\n      report.counts.skipped += 1;\n      continue;\n    }\n\n    const evidence = await gatherEvidence(preference, lookup, byId, windowStartMs, nowMs);\n    if (!evidence.ok) {\n      finding.classification = \"skipped\";\n      finding.skipped = evidence.reason;\n      finding.reason = \"evidence lookup backend was unavailable — not classified as stale\";\n      report.findings.push(finding);\n      report.counts.skipped += 1;\n      continue;\n    }\n    finding.evidence = evidence.hits;\n\n    if (evidence.hits.length === 0) {\n      finding.classification = \"stale\";\n      finding.reason = `no corroborating evidence in the last ${cfg.lookbackDays} days`;\n      report.findings.push(finding);\n      report.counts.stale += 1;\n      stamps.push({ memory: preference, patch: { driftState: \"stale\" }, reasonCode: \"drift_stale\" });\n      continue;\n    }\n\n    // The judge call happens only when candidate evidence exists.\n    const judgeInputs: ContradictionJudgeInput[] = evidence.hitMemories.map((hit) => ({\n      memoryIdA: preference.frontmatter.id,\n      memoryIdB: hit.frontmatter.id,\n      textA: preference.content,\n      textB: hit.content,\n      categoryA: preference.frontmatter.category,\n      categoryB: hit.frontmatter.category,\n    }));\n    const judged = await judgeContradictionPairs(\n      judgeInputs,\n      deps.config,\n      deps.localLlm,\n      deps.fallbackLlm,\n      judgeCache,\n    );\n    // Preserve evidence order (score desc) so the verdict scan is deterministic\n    // rather than dependent on Map iteration of the judge's keyed results.\n    const orderedVerdicts: ContradictionJudgeResult[] = [];\n    for (const input of judgeInputs) {\n      for (const result of judged.results.values()) {\n        if (result.memoryIdA === input.memoryIdA && result.memoryIdB === input.memoryIdB) {\n          orderedVerdicts.push(result);\n          break;\n        }\n      }\n    }\n\n    const outcome = classifyFromVerdicts(orderedVerdicts);\n    finding.classification = outcome.classification;\n    finding.reason = outcome.reason;\n    if (outcome.skipped) finding.skipped = outcome.skipped;\n    report.findings.push(finding);\n    report.counts[outcome.classification] += 1;\n\n    if (outcome.classification === \"corroborated\") {\n      stamps.push({\n        memory: preference,\n        patch: { lastCorroborated: nowIso, driftState: undefined },\n        reasonCode: \"drift_corroborated\",\n      });\n    } else if (outcome.classification === \"stale\") {\n      stamps.push({ memory: preference, patch: { driftState: \"stale\" }, reasonCode: \"drift_stale\" });\n    } else if (outcome.classification === \"drifted\" && outcome.driftedAgainst) {\n      const verdict = orderedVerdicts.find((v) => v.verdict === \"contradicts\");\n      driftedPairs.push({\n        preference,\n        evidenceId: outcome.driftedAgainst,\n        finding,\n        rationale: verdict?.rationale ?? outcome.reason,\n        confidence: verdict?.confidence ?? 0,\n      });\n    }\n  }\n\n  if (mode === \"shadow\") {\n    report.elapsedMs = Date.now() - startTime;\n    return report;\n  }\n\n  let writes = 0;\n  for (const stamp of stamps) {\n    try {\n      // `driftState: undefined` is an explicit clear: writeMemoryFrontmatter\n      // merges the patch over existing frontmatter, and the serializer omits\n      // undefined fields, so a corroborated preference loses its stale mark.\n      await storage.writeMemoryFrontmatter(stamp.memory, { ...stamp.patch, updated: nowIso }, {\n        at: now,\n        actor: DRIFT_ACTOR,\n        reasonCode: stamp.reasonCode,\n        ruleVersion: DRIFT_RULE_VERSION,\n      });\n      writes += 1;\n      report.appliedCount += 1;\n    } catch (err) {\n      log.warn(\n        `[preference-drift] stamp ${stamp.reasonCode} on ${stamp.memory.frontmatter.id} failed: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  }\n\n  if (driftedPairs.length > 0) {\n    const queueEntries: Array<Omit<ContradictionPair, \"pairId\"> & { memoryIds: [string, string] }> =\n      driftedPairs.map((d) => ({\n        memoryIds: [d.preference.frontmatter.id, d.evidenceId],\n        kind: \"preference-drift\",\n        // A drift finding IS a detected conflict, so the honest verdict is\n        // `contradicts`; `kind` is what distinguishes it from a pair the\n        // contradiction scan produced. Existing review surfaces render it\n        // unchanged.\n        verdict: \"contradicts\",\n        rationale: d.rationale,\n        confidence: d.confidence,\n        detectedAt: nowIso,\n        memoryContentHashes: {\n          [d.preference.frontmatter.id]: computeMemoryContentHash(\n            d.preference.content,\n            d.preference.frontmatter.category,\n          ),\n        },\n        namespace,\n      }));\n    const written = writePairs(deps.memoryDir, queueEntries);\n    report.reviewItemsOpened = written.length;\n    report.appliedCount += written.length;\n    for (const entry of written) {\n      const match = driftedPairs.find((d) => d.preference.frontmatter.id === entry.memoryIds[0]);\n      if (match) match.finding.reviewPairId = entry.pairId;\n    }\n  }\n\n  if (writes > 0) {\n    // Frontmatter stamps bypass the extraction write pipeline, so bump the\n    // shared corpus version out of band — otherwise hot recall caches keep\n    // serving pre-stamp frontmatter and the damping stage never sees the new\n    // `driftState` (§25/§31).\n    bumpMemoryCorpusVersionForDir(storage.dir);\n    if (storage.dir !== deps.memoryDir) bumpMemoryCorpusVersionForDir(deps.memoryDir);\n  }\n  try {\n    await writeJsonFileAtomic(driftMarkerPath(deps.memoryDir), {\n      schemaVersion: 1,\n      lastRunAt: nowIso,\n      lastApplyAt: nowIso,\n      appliedCount: report.appliedCount,\n    } satisfies PreferenceDriftMarker);\n  } catch (err) {\n    log.warn(\n      `[preference-drift] failed to persist run marker: ${err instanceof Error ? err.message : String(err)}`,\n    );\n  }\n\n  report.elapsedMs = Date.now() - startTime;\n  return report;\n}\n\n// ── Review resolution ────────────────────────────────────────────────────────\n\nexport interface PreferenceDriftResolutionOptions {\n  /** Replacement preference text. Required for `supersede`. */\n  mergedContent?: string;\n  /** Fires after a resolution leaves a durable memory mutation in the namespace. */\n  onMemoryWritten?: (namespace: string | undefined, storageDir: string) => void;\n  now?: Date;\n}\n\nexport interface PreferenceDriftResolutionResult {\n  affectedIds: string[];\n  message: string;\n}\n\n/**\n * Execute a `kind: \"preference-drift\"` resolution verb.\n *\n * The first memory id on the item is the aging preference; the second is the\n * evidence that pointed away from it. Only the preference is ever mutated —\n * the evidence memory is a witness, not a target.\n *\n * - `keep`      — the preference still holds: stamp `lastCorroborated`, clear\n *                 `driftState`.\n * - `supersede` — write the corrected preference and retire the old one\n *                 through the normal supersession path.\n * - `archive`   — demote the preference to `archived`. Demotion, never\n *                 deletion; page versioning snapshots the overwrite.\n *\n * Callers resolve the pair record itself (`resolvePair`); this function owns\n * only the memory-side effects.\n */\nexport async function resolvePreferenceDrift(\n  storage: StorageManager,\n  pair: Pick<ContradictionPair, \"pairId\" | \"memoryIds\" | \"namespace\">,\n  verb: \"keep\" | \"supersede\" | \"archive\",\n  options: PreferenceDriftResolutionOptions = {},\n): Promise<PreferenceDriftResolutionResult> {\n  const now = options.now ?? new Date();\n  const nowIso = now.toISOString();\n  const preferenceId = pair.memoryIds[0];\n  const preference = await storage.getMemoryById(preferenceId);\n  if (!preference) {\n    return { affectedIds: [], message: `Preference ${preferenceId} not found; not resolving ${pair.pairId}` };\n  }\n\n  const touched = (): void => {\n    try {\n      options.onMemoryWritten?.(pair.namespace, storage.dir);\n    } catch (err) {\n      log.warn(\n        `[preference-drift] catalog write touch failed for ${pair.pairId}: ${err instanceof Error ? err.message : String(err)}`,\n      );\n    }\n  };\n\n  if (verb === \"keep\") {\n    await storage.writeMemoryFrontmatter(\n      preference,\n      { lastCorroborated: nowIso, driftState: undefined, updated: nowIso },\n      { at: now, actor: DRIFT_ACTOR, reasonCode: \"drift_kept\", ruleVersion: DRIFT_RULE_VERSION },\n    );\n    bumpMemoryCorpusVersionForDir(storage.dir);\n    touched();\n    return { affectedIds: [preferenceId], message: `Preference ${preferenceId} confirmed still current` };\n  }\n\n  if (verb === \"archive\") {\n    const archivedPath = await storage.archiveMemory(preference, {\n      at: now,\n      actor: DRIFT_ACTOR,\n      reasonCode: \"drift_archived\",\n      ruleVersion: DRIFT_RULE_VERSION,\n      relatedMemoryIds: [pair.memoryIds[1]],\n    });\n    if (archivedPath === null) {\n      return { affectedIds: [], message: `Preference ${preferenceId} could not be archived; not resolving` };\n    }\n    bumpMemoryCorpusVersionForDir(storage.dir);\n    touched();\n    return { affectedIds: [preferenceId], message: `Preference ${preferenceId} archived` };\n  }\n\n  const replacementText = options.mergedContent?.trim();\n  if (!replacementText) {\n    return {\n      affectedIds: [],\n      message: \"supersede requires mergedContent carrying the updated preference; no memories changed\",\n    };\n  }\n\n  // Sealed-envelope write: the replacement text is user- or LLM-supplied, so\n  // compose with salvage and warn-log any dropped optional field rather than\n  // failing the whole resolution on a cosmetic value.\n  const envelope = composeMemoryEnvelope(\n    {\n      content: replacementText,\n      category: \"preference\",\n      confidence: preference.frontmatter.confidence ?? 0.8,\n      tags: [\"preference-drift\", \"supersede\"],\n      entityRef: preference.frontmatter.entityRef,\n    },\n    { source: DRIFT_ACTOR },\n    { salvage: true },\n  );\n  if (envelope.salvageNotes.length > 0) {\n    log.warn(`[preference-drift] supersede write salvaged invalid fields: ${envelope.salvageNotes.join(\"; \")}`);\n  }\n  const written = await storage.writeSealedMemory(envelope, {\n    actor: DRIFT_ACTOR,\n    lineage: [preferenceId],\n    // `update` is the operator for \"newer version of the same claim\" — the\n    // drift replacement restates one preference, it does not merge two.\n    derivedVia: \"update\",\n  });\n  // A tombstone-blocked replacement is NOT active, so superseding the old\n  // preference to it would retire the only live copy (§14: never destroy old\n  // state before the new state is confirmed viable).\n  if (written.tombstoneBlocked) {\n    return {\n      affectedIds: [],\n      message: `Replacement preference for ${pair.pairId} was tombstone-blocked (pending_review); not resolving — original kept active`,\n    };\n  }\n  const superseded = await storage.supersedeMemory(\n    preferenceId,\n    written.id,\n    `preference drift resolved by supersede (${pair.pairId})`,\n    undefined,\n    { actor: DRIFT_ACTOR },\n  );\n  bumpMemoryCorpusVersionForDir(storage.dir);\n  touched();\n  if (!superseded) {\n    return {\n      affectedIds: [written.id],\n      message: `Replacement ${written.id} written but superseding ${preferenceId} failed; both remain — re-run resolution`,\n    };\n  }\n  return {\n    affectedIds: [preferenceId, written.id],\n    message: `Preference ${preferenceId} superseded by ${written.id}`,\n  };\n}\n","/**\n * Resolution Verbs — executes user-chosen resolution actions on contradiction pairs (issue #520).\n *\n * All resolution paths delegate to StorageManager.supersedeMemory. Do not\n * reimplement supersession logic here (rule 22: deduplicate resolution).\n */\n\nimport { log } from \"../logger.js\";\nimport { composeMemoryEnvelope } from \"../write-envelope.js\";\nimport type { StorageManager } from \"../storage.js\";\nimport type { MemoryCategory, MemoryFile } from \"../types.js\";\nimport type { ResolutionVerb } from \"./contradiction-review.js\";\nimport {\n  CONTRADICTION_VERBS,\n  PREFERENCE_DRIFT_VERBS,\n  readPair,\n  resolvePair,\n} from \"./contradiction-review.js\";\nimport { resolvePreferenceDrift } from \"../preferences/preference-drift.js\";\n\nexport interface ResolutionResult {\n  pairId: string;\n  verb: ResolutionVerb;\n  /** Memory IDs affected by the resolution. */\n  affectedIds: string[];\n  /** Human-readable status. */\n  message: string;\n}\n\nexport interface ExecuteResolutionOptions {\n  /** Existing merged memory to supersede both source memories to. */\n  mergedMemoryId?: string;\n  /** Content for a new merged memory. Required for merge when mergedMemoryId is omitted. */\n  mergedContent?: string;\n  /** Category for a newly created merged memory. Defaults to the shared source category, or fact. */\n  mergedCategory?: MemoryCategory;\n  /** Resolve storage for the pair namespace, or the default namespace for legacy unscoped pairs. */\n  storageForNamespace?: (namespace: string | undefined) => StorageManager | Promise<StorageManager>;\n  /**\n   * Best-effort hook invoked after a contradiction resolution leaves a durable\n   * mutation in the namespace's memory files (issue #1499 sweep, NH1dX / NH3X3).\n   * Every mutating verb — `merge` (creates a new memory and supersedes both\n   * sources), `keep-a`, and `keep-b` (supersede the losing source + rewrite\n   * frontmatter) — writes directly to the pair's (possibly DYNAMIC) namespace\n   * storage, bypassing the extraction write path that records catalog writes. So\n   * without this the namespace's `lastWriteAt` stays stale and QMD maintenance /\n   * `writtenSince` can skip a namespace whose only post-write mutation is\n   * resolving a contradiction. It fires after the resolution commits, or after a\n   * failed resolution/rollback path when durable memory changes are still left on\n   * disk. If a failure rolls back cleanly, this is never called, so the catalog\n   * never records a write that did not survive (rule #25). Non-mutating verbs\n   * (`both-valid`, `needs-more-context`) never trigger it. Callers wire this to\n   * `Orchestrator.recordCatalogWrite(namespace, storageDir)`. Must be\n   * failure-tolerant: it is fire-and-forget and must never affect resolution.\n   */\n  onMergedMemoryWritten?: (namespace: string | undefined, storageDir: string) => void;\n}\n\n/**\n * Every verb the `review_resolve` surface accepts, across both review-item\n * kinds (issue #2371). This is a *surface-level* gate only: per-kind validity\n * is enforced inside {@link executeResolution}, which is the first place the\n * item's `kind` is known. Callers therefore reject an unknown verb early and\n * a cross-kind verb precisely.\n */\nconst VALID_VERBS: readonly ResolutionVerb[] = [...CONTRADICTION_VERBS, ...PREFERENCE_DRIFT_VERBS];\n\nexport function isValidResolutionVerb(value: string): value is ResolutionVerb {\n  return VALID_VERBS.includes(value as ResolutionVerb);\n}\n\n/**\n * Execute a resolution verb on a contradiction pair.\n *\n * - `keep-a`: Supersede B, keep A active.\n * - `keep-b`: Supersede A, keep B active.\n * - `merge`: Create or verify a real merged memory, then supersede both inputs.\n * - `both-valid`: Mark pair as reviewed; no memories are superseded.\n * - `needs-more-context`: Defer; no action, short cooldown.\n */\nexport async function executeResolution(\n  memoryDir: string,\n  storage: StorageManager,\n  pairId: string,\n  verb: ResolutionVerb,\n  options: ExecuteResolutionOptions = {},\n): Promise<ResolutionResult> {\n  if (typeof verb !== \"string\" || !isValidResolutionVerb(verb)) {\n    throw new Error(`Invalid contradiction resolution verb: ${String(verb)}`);\n  }\n\n  const pair = readPair(memoryDir, pairId);\n  if (!pair) {\n    return { pairId, verb, affectedIds: [], message: `Pair ${pairId} not found` };\n  }\n\n  if (pair.namespace && !options.storageForNamespace) {\n    throw new Error(\n      \"contradiction resolution requires storageForNamespace for namespaced pairs so callers resolve the correct namespace storage\",\n    );\n  }\n\n  const resolutionStorage = options.storageForNamespace\n    ? await options.storageForNamespace(pair.namespace)\n    : storage;\n\n  if (pair.resolution && pair.resolution !== \"needs-more-context\") {\n    return { pairId, verb, affectedIds: [], message: `Pair already resolved with verb \"${pair.resolution}\"` };\n  }\n  // Verb validity is per review-item kind (issue #2371). A preference-drift\n  // item never accepts keep-a/keep-b/merge (there is no \"B\" to keep — the\n  // second id is witness evidence, not a competing claim), and a contradiction\n  // pair never accepts keep/supersede/archive. Rejecting the cross-kind verb\n  // here, after the record is loaded, is the only place both kinds are known.\n  const isDriftItem = pair.kind === \"preference-drift\";\n  const verbMatchesKind = isDriftItem\n    ? PREFERENCE_DRIFT_VERBS.includes(verb)\n    : CONTRADICTION_VERBS.includes(verb);\n  if (!verbMatchesKind) {\n    const allowed = (isDriftItem ? PREFERENCE_DRIFT_VERBS : CONTRADICTION_VERBS).join(\", \");\n    return {\n      pairId,\n      verb,\n      affectedIds: [],\n      message: `Verb \"${verb}\" is not valid for a ${isDriftItem ? \"preference-drift\" : \"contradiction\"} item. Valid: ${allowed}`,\n    };\n  }\n\n  if (isDriftItem) {\n    const outcome = await resolvePreferenceDrift(\n      resolutionStorage,\n      pair,\n      verb as \"keep\" | \"supersede\" | \"archive\",\n      {\n        mergedContent: options.mergedContent,\n        onMemoryWritten: options.onMergedMemoryWritten,\n      },\n    );\n    // Only record the terminal resolution when memories actually changed;\n    // a refused resolution must stay actionable in the queue.\n    if (outcome.affectedIds.length > 0) resolvePair(memoryDir, pairId, verb);\n    return { pairId, verb, affectedIds: outcome.affectedIds, message: outcome.message };\n  }\n\n\n  const [idA, idB] = pair.memoryIds;\n  const affectedIds: string[] = [];\n  let message = \"\";\n  let supersedeFailed = false;\n  let rollbackAfterResolveFailure: (() => Promise<boolean>) | null = null;\n  // Deferred catalog-write touch for any resolution that leaves durable namespace\n  // memory mutations (issue #1499 sweep, NH1dX / NH3X3). Rule #25: never record a\n  // catalog touch for a write that is fully rolled back. Successful mutating\n  // resolutions invoke it after `resolvePair` persists. Failed paths invoke it\n  // only when rollback inspection shows the namespace still differs from the\n  // pre-mutation snapshot.\n  let recordCatalogWriteTouch: (() => void) | null = null;\n  // Returns the deferred touch fn for a mutating verb (or null when the caller\n  // wired no catalog hook), so each branch assigns `recordCatalogWriteTouch`\n  // directly in the function body — keeping TS control-flow narrowing intact at\n  // the post-commit invocation below.\n  const buildCatalogTouch = (): (() => void) | null => {\n    if (!options.onMergedMemoryWritten) return null;\n    const onMergedMemoryWritten = options.onMergedMemoryWritten;\n    const namespace = pair.namespace;\n    const storageDir = resolutionStorage.dir;\n    return () => onMergedMemoryWritten(namespace, storageDir);\n  };\n  const catalogWriteTouch = buildCatalogTouch();\n  const recordCatalogWriteTouchSafely = (context: string, touch = catalogWriteTouch): void => {\n    if (!touch) return;\n    try {\n      touch();\n    } catch (err) {\n      log.warn(\n        \"[contradiction-resolution] catalog write touch failed for pair=%s context=%s: %s\",\n        pairId,\n        context,\n        err instanceof Error ? err.message : err,\n      );\n    }\n  };\n  const touchCatalogIfRollbackLeftChange = async (\n    context: string,\n    snapshots: MemoryFile[],\n    replacement?: Extract<MergeReplacement, { ok: true }>,\n  ): Promise<void> => {\n    if (!catalogWriteTouch) return;\n    if (await rollbackLeftDurableMutation(resolutionStorage, snapshots, replacement)) {\n      recordCatalogWriteTouchSafely(context);\n    }\n  };\n\n  switch (verb) {\n    case \"keep-a\": {\n      const keepTarget = await validateKeepTarget(resolutionStorage, pairId, idA);\n      if (!keepTarget.ok) {\n        supersedeFailed = true;\n        message = keepTarget.message;\n        break;\n      }\n      const sourceB = await loadSourceSnapshot(resolutionStorage, idB);\n      const ok = sourceB\n        ? await supersedeSafe(resolutionStorage, idB, idA, \"contradiction-resolution:keep-a\")\n        : false;\n      if (ok) {\n        affectedIds.push(idB);\n        rollbackAfterResolveFailure = async () =>\n          restoreMemorySnapshot(resolutionStorage, sourceB!, \"contradiction-resolution:keep-a-rollback\");\n        // keep-a superseded idB in this namespace — record a catalog touch once\n        // the resolution durably commits (NH3X3).\n        recordCatalogWriteTouch = catalogWriteTouch;\n        message = `Kept ${idA}, superseded ${idB}`;\n      }\n      else {\n        supersedeFailed = true;\n        const rolledBack = sourceB\n          ? await restoreMemorySnapshot(resolutionStorage, sourceB, \"contradiction-resolution:keep-a-rollback\")\n          : false;\n        if (sourceB && !rolledBack) {\n          await touchCatalogIfRollbackLeftChange(\"keep-a-rollback-incomplete\", [sourceB]);\n        }\n        message = rolledBack\n          ? `Supersede failed for ${idB}; restored ${idB} and did not resolve`\n          : `Supersede failed for ${idB}; rollback incomplete for ${idB} and pair is not resolved`;\n      }\n      break;\n    }\n    case \"keep-b\": {\n      const keepTarget = await validateKeepTarget(resolutionStorage, pairId, idB);\n      if (!keepTarget.ok) {\n        supersedeFailed = true;\n        message = keepTarget.message;\n        break;\n      }\n      const sourceA = await loadSourceSnapshot(resolutionStorage, idA);\n      const ok = sourceA\n        ? await supersedeSafe(resolutionStorage, idA, idB, \"contradiction-resolution:keep-b\")\n        : false;\n      if (ok) {\n        affectedIds.push(idA);\n        rollbackAfterResolveFailure = async () =>\n          restoreMemorySnapshot(resolutionStorage, sourceA!, \"contradiction-resolution:keep-b-rollback\");\n        // keep-b superseded idA in this namespace — record a catalog touch once\n        // the resolution durably commits (NH3X3).\n        recordCatalogWriteTouch = catalogWriteTouch;\n        message = `Kept ${idB}, superseded ${idA}`;\n      }\n      else {\n        supersedeFailed = true;\n        const rolledBack = sourceA\n          ? await restoreMemorySnapshot(resolutionStorage, sourceA, \"contradiction-resolution:keep-b-rollback\")\n          : false;\n        if (sourceA && !rolledBack) {\n          await touchCatalogIfRollbackLeftChange(\"keep-b-rollback-incomplete\", [sourceA]);\n        }\n        message = rolledBack\n          ? `Supersede failed for ${idA}; restored ${idA} and did not resolve`\n          : `Supersede failed for ${idA}; rollback incomplete for ${idA} and pair is not resolved`;\n      }\n      break;\n    }\n    case \"merge\": {\n      const replacement = await prepareMergeReplacement(resolutionStorage, pairId, idA, idB, options);\n      if (!replacement.ok) {\n        supersedeFailed = true;\n        message = replacement.message;\n        break;\n      }\n\n      const okA = await supersedeSafe(resolutionStorage, idA, replacement.mergedId, \"contradiction-resolution:merge\");\n      if (!okA) {\n        supersedeFailed = true;\n        const rolledBackA = await restoreMemorySnapshot(resolutionStorage, replacement.sourceA);\n        message = rolledBackA\n          ? `Merge failed for ${idA}; restored ${idA} and did not resolve`\n          : `Merge failed for ${idA}; rollback incomplete for ${idA} and pair is not resolved`;\n        if (rolledBackA) {\n          await cleanupCreatedReplacement(resolutionStorage, replacement);\n        }\n        else {\n          await touchCatalogIfRollbackLeftChange(\"merge-first-rollback-incomplete\", [replacement.sourceA], replacement);\n        }\n        break;\n      }\n\n      const okB = await supersedeSafe(resolutionStorage, idB, replacement.mergedId, \"contradiction-resolution:merge\");\n      if (!okB) {\n        supersedeFailed = true;\n        const rolledBackA = await restoreMemorySnapshot(resolutionStorage, replacement.sourceA);\n        const rolledBackB = await restoreMemorySnapshot(resolutionStorage, replacement.sourceB);\n        message = rolledBackA && rolledBackB\n          ? `Merge failed for ${idB}; restored ${idA} and ${idB} and did not resolve`\n          : `Merge failed for ${idB}; rollback incomplete for ${[\n            rolledBackA ? undefined : idA,\n            rolledBackB ? undefined : idB,\n          ].filter(Boolean).join(\", \")} and pair is not resolved`;\n        if (rolledBackA && rolledBackB) {\n          await cleanupCreatedReplacement(resolutionStorage, replacement);\n        }\n        else {\n          await touchCatalogIfRollbackLeftChange(\n            \"merge-second-rollback-incomplete\",\n            [replacement.sourceA, replacement.sourceB],\n            replacement,\n          );\n        }\n        break;\n      }\n\n      affectedIds.push(idA, idB);\n      rollbackAfterResolveFailure = async () => {\n        const rolledBackA = await restoreMemorySnapshot(resolutionStorage, replacement.sourceA);\n        const rolledBackB = await restoreMemorySnapshot(resolutionStorage, replacement.sourceB);\n        if (rolledBackA && rolledBackB) {\n          await cleanupCreatedReplacement(resolutionStorage, replacement);\n        }\n        return rolledBackA && rolledBackB;\n      };\n      // Catalog write touch (issue #1499 sweep): the merge supersedes BOTH sources\n      // (and, when created, writes a fresh merged memory) in the pair's (possibly\n      // dynamic) namespace storage — but the resolution is not durable yet\n      // (resolvePair persists below, and a failure rolls the merge back). Defer\n      // the touch so it fires ONLY after the resolution commits past the rollback\n      // point (NH1dX, rule #25). Arm it for EVERY successful merge — even reusing\n      // an existing merged-id still supersedes both sources, a namespace mutation\n      // that must refresh `lastWriteAt` (NH3X3). Otherwise a dynamic namespace\n      // whose only durable mutation is a contradiction merge stays invisible to\n      // QMD maintenance / `writtenSince`. Best-effort on the caller side.\n      recordCatalogWriteTouch = catalogWriteTouch;\n      message = `Both memories superseded by merged ${replacement.mergedId}`;\n      break;\n    }\n    case \"both-valid\": {\n      message = \"Pair marked as both-valid; cooldown applied\";\n      break;\n    }\n    case \"needs-more-context\": {\n      message = \"Deferred; no action taken, short cooldown applied\";\n      break;\n    }\n  }\n\n  if (!supersedeFailed) {\n    let resolved = false;\n    try {\n      resolved = resolvePair(memoryDir, pairId, verb) !== null;\n    } catch (err) {\n      log.warn(\n        \"[contradiction-resolution] failed to persist pair=%s verb=%s: %s\",\n        pairId,\n        verb,\n        err instanceof Error ? err.message : err,\n      );\n    }\n    if (!resolved) {\n      if (rollbackAfterResolveFailure) {\n        const rolledBack = await rollbackAfterResolveFailure();\n        affectedIds.length = 0;\n        message = rolledBack\n          ? `Resolution persistence failed; rolled back memory changes and did not resolve ${pairId}`\n          : \"Resolution persistence failed; rollback incomplete and pair is not resolved\";\n        if (!rolledBack && recordCatalogWriteTouch) {\n          recordCatalogWriteTouchSafely(\"resolve-persistence-rollback-incomplete\", recordCatalogWriteTouch);\n        }\n      } else {\n        message = \"Resolution persistence failed; pair is not resolved\";\n      }\n    } else if (recordCatalogWriteTouch) {\n      // The resolution durably committed (memory mutated AND the resolution\n      // persisted past the rollback point). Only now is it safe to record the\n      // catalog write for the namespace mutation (NH1dX / NH3X3, rule #25).\n      // Best-effort: the caller's callback swallows errors; guard here so a\n      // throwing callback never derails a successful resolution.\n      recordCatalogWriteTouchSafely(\"resolved\", recordCatalogWriteTouch);\n    }\n  }\n  log.info(\"[contradiction-resolution] pair=%s verb=%s affected=%d\", pairId, verb, affectedIds.length);\n  return { pairId, verb, affectedIds, message };\n}\n\ntype MergeReplacement =\n  | {\n      ok: true;\n      mergedId: string;\n      sourceA: MemoryFile;\n      sourceB: MemoryFile;\n      created: boolean;\n    }\n  | {\n      ok: false;\n      message: string;\n    };\n\nasync function prepareMergeReplacement(\n  storage: StorageManager,\n  pairId: string,\n  idA: string,\n  idB: string,\n  options: ExecuteResolutionOptions,\n): Promise<MergeReplacement> {\n  const sourceA = await storage.getMemoryById(idA);\n  const sourceB = await storage.getMemoryById(idB);\n  if (!sourceA || !sourceB) {\n    return { ok: false, message: `Merge requires both source memories to exist; not resolving ${pairId}` };\n  }\n\n  const requestedMergedId = options.mergedMemoryId?.trim();\n  if (requestedMergedId) {\n    if (requestedMergedId === idA || requestedMergedId === idB) {\n      return { ok: false, message: \"Merge replacement must be distinct from both source memories; not resolving\" };\n    }\n    const replacement = await storage.getMemoryById(requestedMergedId);\n    if (!replacement) {\n      return { ok: false, message: `Merged memory ${requestedMergedId} not found; not resolving` };\n    }\n    const replacementStatus = replacement.frontmatter.status ?? \"active\";\n    if (replacementStatus !== \"active\") {\n      return {\n        ok: false,\n        message: `Merged memory ${requestedMergedId} is ${replacementStatus}; not resolving`,\n      };\n    }\n    return { ok: true, mergedId: requestedMergedId, sourceA, sourceB, created: false };\n  }\n\n  const mergedContent = options.mergedContent;\n  if (typeof mergedContent !== \"string\" || mergedContent.trim().length === 0) {\n    return {\n      ok: false,\n      message: \"Merge requires mergedMemoryId or mergedContent; no memories changed\",\n    };\n  }\n\n  const category = options.mergedCategory ?? mergedMemoryCategory(sourceA, sourceB);\n  let mergedId: string;\n  try {\n    // Sealed-envelope write (issue #1989 PR4): merged content is\n    // LLM-produced — salvage; drops are warn-logged.\n    const mergeEnvelope = composeMemoryEnvelope(\n      {\n        content: mergedContent,\n        category,\n        confidence: Math.min(sourceA.frontmatter.confidence ?? 0.8, sourceB.frontmatter.confidence ?? 0.8),\n        tags: [\"contradiction-resolution\", \"merge\"],\n      },\n      { source: \"contradiction-resolution\" },\n      { salvage: true },\n    );\n    if (mergeEnvelope.salvageNotes.length > 0) {\n      log.warn(`contradiction-resolution write salvaged invalid fields: ${mergeEnvelope.salvageNotes.join(\"; \")}`);\n    }\n    const mergeResult = await storage.writeSealedMemory(mergeEnvelope, {\n      actor: \"contradiction-resolution\",\n      lineage: [idA, idB],\n      derivedVia: \"merge\",\n    });\n    mergedId = mergeResult.id;\n    if (mergeResult.tombstoneBlocked) {\n      // #1645: merged content matched a tombstone (pending_review). Don't\n      // supersede both sources to a non-active replacement — that retires\n      // the only active copies. Clean up the pending merge and abort the pair.\n      await cleanupMemoryId(storage, mergedId);\n      return { ok: false, message: `Merged memory for ${pairId} was tombstone-blocked (pending_review); not resolving — sources kept active` };\n    }\n  } catch (err) {\n    log.warn(\n      \"[contradiction-resolution] merged memory creation failed for %s: %s\",\n      pairId,\n      err instanceof Error ? err.message : err,\n    );\n    return { ok: false, message: `Merged memory could not be created; not resolving ${pairId}` };\n  }\n  const replacement = await storage.getMemoryById(mergedId);\n  if (!replacement) {\n    await cleanupMemoryId(storage, mergedId);\n    return { ok: false, message: `Merged memory ${mergedId} could not be verified; not resolving` };\n  }\n  return { ok: true, mergedId, sourceA, sourceB, created: true };\n}\n\nfunction mergedMemoryCategory(sourceA: MemoryFile, sourceB: MemoryFile): MemoryCategory {\n  return sourceA.frontmatter.category === sourceB.frontmatter.category\n    ? sourceA.frontmatter.category\n    : \"fact\";\n}\n\ntype KeepTargetValidation =\n  | { ok: true }\n  | { ok: false; message: string };\n\nasync function validateKeepTarget(\n  storage: StorageManager,\n  pairId: string,\n  keepId: string,\n): Promise<KeepTargetValidation> {\n  const target = await loadSourceSnapshot(storage, keepId);\n  if (!target) {\n    return { ok: false, message: `Kept memory ${keepId} not found; not resolving ${pairId}` };\n  }\n\n  const status = target.frontmatter.status ?? \"active\";\n  if (status !== \"active\") {\n    return { ok: false, message: `Kept memory ${keepId} is ${status}; not resolving ${pairId}` };\n  }\n\n  return { ok: true };\n}\n\nasync function loadSourceSnapshot(storage: StorageManager, memoryId: string): Promise<MemoryFile | null> {\n  try {\n    return await storage.getMemoryById(memoryId);\n  } catch (err) {\n    log.warn(\n      \"[contradiction-resolution] source snapshot failed for %s: %s\",\n      memoryId,\n      err instanceof Error ? err.message : err,\n    );\n    return null;\n  }\n}\n\nasync function restoreMemorySnapshot(\n  storage: StorageManager,\n  memory: MemoryFile,\n  reasonCode = \"contradiction-resolution:merge-rollback\",\n): Promise<boolean> {\n  try {\n    const current = await storage.getMemoryById(memory.frontmatter.id);\n    if (!current) return false;\n    const restoredFrontmatter: Partial<MemoryFile[\"frontmatter\"]> = {\n      ...memory.frontmatter,\n      status: memory.frontmatter.status,\n      supersededBy: memory.frontmatter.supersededBy,\n      supersededAt: memory.frontmatter.supersededAt,\n    };\n    return await storage.writeMemoryFrontmatter(current, restoredFrontmatter, {\n      actor: \"contradiction-resolution\",\n      reasonCode,\n    });\n  } catch (err) {\n    log.warn(\n      \"[contradiction-resolution] rollback failed for %s: %s\",\n      memory.frontmatter.id,\n      err instanceof Error ? err.message : err,\n    );\n    return false;\n  }\n}\n\nasync function rollbackLeftDurableMutation(\n  storage: StorageManager,\n  snapshots: MemoryFile[],\n  replacement?: Extract<MergeReplacement, { ok: true }>,\n): Promise<boolean> {\n  for (const snapshot of snapshots) {\n    try {\n      const current = await storage.getMemoryById(snapshot.frontmatter.id);\n      if (!current) return true;\n      if (supersessionStateChanged(current, snapshot)) return true;\n    } catch (err) {\n      log.warn(\n        \"[contradiction-resolution] rollback inspection failed for %s: %s\",\n        snapshot.frontmatter.id,\n        err instanceof Error ? err.message : err,\n      );\n      return true;\n    }\n  }\n\n  if (replacement?.created) {\n    try {\n      return (await storage.getMemoryById(replacement.mergedId)) !== null;\n    } catch (err) {\n      log.warn(\n        \"[contradiction-resolution] rollback replacement inspection failed for %s: %s\",\n        replacement.mergedId,\n        err instanceof Error ? err.message : err,\n      );\n      return true;\n    }\n  }\n\n  return false;\n}\n\nfunction supersessionStateChanged(current: MemoryFile, snapshot: MemoryFile): boolean {\n  return (\n    current.frontmatter.status !== snapshot.frontmatter.status ||\n    current.frontmatter.supersededBy !== snapshot.frontmatter.supersededBy ||\n    current.frontmatter.supersededAt !== snapshot.frontmatter.supersededAt\n  );\n}\n\nasync function cleanupCreatedReplacement(storage: StorageManager, replacement: Extract<MergeReplacement, { ok: true }>): Promise<void> {\n  if (!replacement.created) return;\n  await cleanupMemoryId(storage, replacement.mergedId);\n}\n\nasync function cleanupMemoryId(storage: StorageManager, memoryId: string): Promise<void> {\n  try {\n    const memory = await storage.getMemoryById(memoryId);\n    const invalidated = await storage.invalidateMemory(memoryId);\n    if (invalidated && memory?.frontmatter.category === \"fact\") {\n      await storage.removeFactContentHashesForMemories([memory]);\n    }\n  } catch (err) {\n    log.warn(\n      \"[contradiction-resolution] cleanup failed for merged memory %s: %s\",\n      memoryId,\n      err instanceof Error ? err.message : err,\n    );\n  }\n}\n\nasync function supersedeSafe(\n  storage: StorageManager,\n  oldId: string,\n  newId: string,\n  reason: string,\n): Promise<boolean> {\n  try {\n    const result = await storage.supersedeMemory(oldId, newId, reason);\n    if (result === false) {\n      log.warn(\"[contradiction-resolution] supersede returned false for %s → %s\", oldId, newId);\n      return false;\n    }\n    return true;\n  } catch (err) {\n    log.warn(\n      \"[contradiction-resolution] supersede failed %s → %s: %s\",\n      oldId,\n      newId,\n      err instanceof Error ? err.message : err,\n    );\n    return false;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAqCA,OAAO,UAAU;AAsBjB,IAAM,cAAc;AACpB,IAAM,qBAAqB;AAC3B,IAAM,SAAS,KAAK,KAAK,KAAK;AAG9B,IAAM,wBAAwB;AA+E9B,SAAS,gBAAgB,WAA2B;AAClD,SAAO,KAAK,KAAK,WAAW,SAAS,uBAAuB;AAC9D;AAGA,eAAsB,0BACpB,WACuC;AACvC,MAAI;AACF,UAAM,MAAM,MAAM,aAAa,gBAAgB,SAAS,CAAC;AACzD,QAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,EAAG,QAAO;AAC1E,UAAM,IAAI;AACV,QAAI,OAAO,EAAE,cAAc,SAAU,QAAO;AAC5C,WAAO;AAAA,MACL,eAAe;AAAA,MACf,WAAW,EAAE;AAAA,MACb,aAAa,OAAO,EAAE,gBAAgB,WAAW,EAAE,cAAc;AAAA,MACjE,cAAc,OAAO,EAAE,iBAAiB,WAAW,EAAE,eAAe;AAAA,IACtE;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,KAAK,OAA+B;AAC3C,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,KAAK,KAAK,MAAM,KAAK;AAC3B,SAAO,OAAO,SAAS,EAAE,IAAI,KAAK;AACpC;AAQA,IAAM,qBAA0D,EAAE,QAAQ,KAAK;AAO/E,SAAS,kBAAkB,GAAe,GAAuB;AAC/D,QAAM,MAAM,KAAK,EAAE,YAAY,OAAO,KAAK,KAAK,EAAE,YAAY,OAAO,KAAK;AAC1E,QAAM,MAAM,KAAK,EAAE,YAAY,OAAO,KAAK,KAAK,EAAE,YAAY,OAAO,KAAK;AAC1E,MAAI,QAAQ,IAAK,QAAO,MAAM,MAAM,KAAK;AACzC,QAAM,MAAM,EAAE,YAAY,MAAM;AAChC,QAAM,MAAM,EAAE,YAAY,MAAM;AAChC,MAAI,QAAQ,IAAK,QAAO,MAAM,MAAM,KAAK;AACzC,SAAO;AACT;AAeA,eAAe,eACb,YACA,QACA,MACA,eACA,OACyB;AACzB,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,OAAO,WAAW,SAAS,qBAAqB;AAAA,EAC9D,SAAS,KAAK;AACZ,QAAI,MAAM,6CAA6C;AAAA,MACrD,UAAU,WAAW,YAAY;AAAA,MACjC,OAAO,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAAA,IACxD,CAAC;AACD,WAAO,EAAE,IAAI,OAAO,QAAQ,sBAAsB;AAAA,EACpD;AAEA,QAAM,OAAkC,CAAC;AACzC,QAAM,cAA4B,CAAC;AACnC,aAAW,OAAO,KAAK;AACrB,QAAI,IAAI,OAAO,WAAW,YAAY,GAAI;AAC1C,UAAM,SAAS,KAAK,IAAI,IAAI,EAAE;AAC9B,QAAI,CAAC,OAAQ;AACb,UAAM,aAAa,KAAK,OAAO,YAAY,OAAO,KAAK,KAAK,OAAO,YAAY,OAAO;AACtF,QAAI,eAAe,KAAM;AAIzB,QAAI,aAAa,iBAAiB,cAAc,MAAO;AACvD,SAAK,KAAK;AAAA,MACR,UAAU,IAAI;AAAA,MACd,OAAO,IAAI;AAAA,MACX,YAAY,OAAO,YAAY,WAAW,OAAO,YAAY,WAAW;AAAA,IAC1E,CAAC;AACD,gBAAY,KAAK,MAAM;AAAA,EACzB;AACA,SAAO,EAAE,IAAI,MAAM,MAAM,YAAY;AACvC;AAeA,SAAS,qBACP,UACiI;AACjI,QAAM,gBAAgB,SAAS,KAAK,CAAC,MAAM,EAAE,YAAY,aAAa;AACtE,MAAI,eAAe;AACjB,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,QAAQ,qDAAqD,cAAc,SAAS;AAAA,MACpF,gBAAgB,cAAc;AAAA,IAChC;AAAA,EACF;AACA,QAAM,cAAc,SAAS,KAAK,CAAC,MAAM,EAAE,YAAY,YAAY;AACnE,MAAI,aAAa;AACf,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,QAAQ,6CAA6C,YAAY,SAAS;AAAA,IAC5E;AAAA,EACF;AACA,MAAI,SAAS,KAAK,CAAC,MAAM,EAAE,YAAY,YAAY,GAAG;AACpD,WAAO;AAAA,MACL,gBAAgB;AAAA,MAChB,SAAS;AAAA,MACT,QAAQ;AAAA,IACV;AAAA,EACF;AACA,SAAO;AAAA,IACL,gBAAgB;AAAA,IAChB,QAAQ;AAAA,EACV;AACF;AAQA,eAAsB,uBACpB,MACgC;AAChC,QAAM,YAAY,KAAK,IAAI;AAC3B,QAAM,MAAM,KAAK,OAAO,oBAAI,KAAK;AACjC,QAAM,SAAS,IAAI,YAAY;AAC/B,QAAM,QAAQ,IAAI,QAAQ;AAC1B,QAAM,OAA2B,KAAK,UAAU,OAAO,UAAU;AACjE,QAAM,MAAM,KAAK,OAAO;AAExB,QAAM,cAA6D;AAAA,IACjE,cAAc;AAAA,IACd,OAAO;AAAA,IACP,SAAS;AAAA,IACT,SAAS;AAAA,EACX;AAEA,MAAI,KAAK,YAAY,MAAM;AACzB,WAAO;AAAA,MACL,eAAe;AAAA,MACf,aAAa;AAAA,MACb;AAAA,MACA,SAAS;AAAA,MACT,UAAU;AAAA,MACV,UAAU,CAAC;AAAA,MACX,QAAQ;AAAA,MACR,cAAc;AAAA,MACd,mBAAmB;AAAA,MACnB,WAAW,KAAK,IAAI,IAAI;AAAA,MACxB,eAAe;AAAA,IACjB;AAAA,EACF;AAEA,MAAI,IAAI,wBAAwB,GAAG;AACjC,WAAO;AAAA,MACL,eAAe;AAAA,MACf,aAAa;AAAA,MACb;AAAA,MACA,SAAS;AAAA,MACT,UAAU;AAAA,MACV,UAAU,CAAC;AAAA,MACX,QAAQ;AAAA,MACR,cAAc;AAAA,MACd,mBAAmB;AAAA,MACnB,WAAW,KAAK,IAAI,IAAI;AAAA,MACxB,eAAe;AAAA,IACjB;AAAA,EACF;AAEA,QAAM,EAAE,SAAS,UAAU,IAAI,MAAM,mBAAmB,MAAM,KAAK,WAAW,KAAK,KAAK,MAAS;AACjG,QAAM,SAAS,KAAK,yBAChB,KAAK,uBAAuB,OAAO,IACnC,KAAK;AAET,MAAI;AACJ,MAAI;AACF,UAAM,MAAM,QAAQ,gBAAgB;AAAA,EACtC,SAAS,KAAK;AACZ,QAAI;AAAA,MACF,+CAA+C,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IACjG;AACA,UAAM,CAAC;AAAA,EACT;AAEA,QAAM,OAAO,oBAAI,IAAwB;AACzC,aAAW,KAAK,KAAK;AACnB,UAAM,KAAK,EAAE,YAAY;AACzB,QAAI,OAAO,OAAO,YAAY,GAAG,SAAS,EAAG,MAAK,IAAI,IAAI,CAAC;AAAA,EAC7D;AAEA,QAAM,WAAW,IAAI,aAAa;AAClC,QAAM,WAAW,IAAI,OAAO,CAAC,MAAM;AACjC,UAAM,KAAK,EAAE;AACb,QAAI,GAAG,aAAa,aAAc,QAAO;AACzC,QAAI,mBAAmB,GAAG,UAAU,QAAQ,MAAM,KAAM,QAAO;AAC/D,QAAI,OAAO,GAAG,OAAO,YAAY,GAAG,GAAG,WAAW,EAAG,QAAO;AAC5D,QAAI,CAAC,EAAE,WAAW,EAAE,QAAQ,KAAK,EAAE,WAAW,EAAG,QAAO;AACxD,UAAM,SAAS,KAAK,GAAG,OAAO,KAAK,KAAK,GAAG,OAAO;AAClD,QAAI,WAAW,KAAM,QAAO;AAC5B,WAAO,QAAQ,UAAU;AAAA,EAC3B,CAAC;AAED,QAAM,aAAa,CAAC,GAAG,QAAQ,EAAE,KAAK,iBAAiB,EAAE,MAAM,GAAG,IAAI,mBAAmB;AAEzF,QAAM,SAAgC;AAAA,IACpC,eAAe;AAAA,IACf,aAAa;AAAA,IACb;AAAA,IACA;AAAA,IACA,SAAS,WAAW;AAAA,IACpB,UAAU,SAAS;AAAA,IACnB,UAAU,CAAC;AAAA,IACX,QAAQ,EAAE,GAAG,YAAY;AAAA,IACzB,cAAc;AAAA,IACd,mBAAmB;AAAA,IACnB,WAAW;AAAA,EACb;AAEA,QAAM,gBAAgB,QAAQ,IAAI,eAAe;AAGjD,QAAM,aAAa,oBAAI,IAAsC;AAC7D,QAAM,eAA8I,CAAC;AACrJ,QAAM,SAAwH,CAAC;AAE/H,aAAW,cAAc,YAAY;AACnC,UAAM,SAAS,KAAK,WAAW,YAAY,OAAO,KAAK,KAAK,WAAW,YAAY,OAAO,KAAK;AAC/F,UAAM,UAAkC;AAAA,MACtC,UAAU,WAAW,YAAY;AAAA,MACjC,gBAAgB;AAAA,MAChB,SAAS,KAAK,OAAO,QAAQ,UAAU,MAAM;AAAA,MAC7C,kBAAkB,WAAW,YAAY,oBAAoB;AAAA,MAC7D,QAAQ;AAAA,MACR,UAAU,CAAC;AAAA,IACb;AAEA,QAAI,CAAC,QAAQ;AACX,cAAQ,iBAAiB;AACzB,cAAQ,UAAU;AAClB,cAAQ,SAAS;AACjB,aAAO,SAAS,KAAK,OAAO;AAC5B,aAAO,OAAO,WAAW;AACzB;AAAA,IACF;AAEA,UAAM,WAAW,MAAM,eAAe,YAAY,QAAQ,MAAM,eAAe,KAAK;AACpF,QAAI,CAAC,SAAS,IAAI;AAChB,cAAQ,iBAAiB;AACzB,cAAQ,UAAU,SAAS;AAC3B,cAAQ,SAAS;AACjB,aAAO,SAAS,KAAK,OAAO;AAC5B,aAAO,OAAO,WAAW;AACzB;AAAA,IACF;AACA,YAAQ,WAAW,SAAS;AAE5B,QAAI,SAAS,KAAK,WAAW,GAAG;AAC9B,cAAQ,iBAAiB;AACzB,cAAQ,SAAS,yCAAyC,IAAI,YAAY;AAC1E,aAAO,SAAS,KAAK,OAAO;AAC5B,aAAO,OAAO,SAAS;AACvB,aAAO,KAAK,EAAE,QAAQ,YAAY,OAAO,EAAE,YAAY,QAAQ,GAAG,YAAY,cAAc,CAAC;AAC7F;AAAA,IACF;AAGA,UAAM,cAAyC,SAAS,YAAY,IAAI,CAAC,SAAS;AAAA,MAChF,WAAW,WAAW,YAAY;AAAA,MAClC,WAAW,IAAI,YAAY;AAAA,MAC3B,OAAO,WAAW;AAAA,MAClB,OAAO,IAAI;AAAA,MACX,WAAW,WAAW,YAAY;AAAA,MAClC,WAAW,IAAI,YAAY;AAAA,IAC7B,EAAE;AACF,UAAM,SAAS,MAAM;AAAA,MACnB;AAAA,MACA,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL;AAAA,IACF;AAGA,UAAM,kBAA8C,CAAC;AACrD,eAAW,SAAS,aAAa;AAC/B,iBAAW,UAAU,OAAO,QAAQ,OAAO,GAAG;AAC5C,YAAI,OAAO,cAAc,MAAM,aAAa,OAAO,cAAc,MAAM,WAAW;AAChF,0BAAgB,KAAK,MAAM;AAC3B;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,UAAM,UAAU,qBAAqB,eAAe;AACpD,YAAQ,iBAAiB,QAAQ;AACjC,YAAQ,SAAS,QAAQ;AACzB,QAAI,QAAQ,QAAS,SAAQ,UAAU,QAAQ;AAC/C,WAAO,SAAS,KAAK,OAAO;AAC5B,WAAO,OAAO,QAAQ,cAAc,KAAK;AAEzC,QAAI,QAAQ,mBAAmB,gBAAgB;AAC7C,aAAO,KAAK;AAAA,QACV,QAAQ;AAAA,QACR,OAAO,EAAE,kBAAkB,QAAQ,YAAY,OAAU;AAAA,QACzD,YAAY;AAAA,MACd,CAAC;AAAA,IACH,WAAW,QAAQ,mBAAmB,SAAS;AAC7C,aAAO,KAAK,EAAE,QAAQ,YAAY,OAAO,EAAE,YAAY,QAAQ,GAAG,YAAY,cAAc,CAAC;AAAA,IAC/F,WAAW,QAAQ,mBAAmB,aAAa,QAAQ,gBAAgB;AACzE,YAAM,UAAU,gBAAgB,KAAK,CAAC,MAAM,EAAE,YAAY,aAAa;AACvE,mBAAa,KAAK;AAAA,QAChB;AAAA,QACA,YAAY,QAAQ;AAAA,QACpB;AAAA,QACA,WAAW,SAAS,aAAa,QAAQ;AAAA,QACzC,YAAY,SAAS,cAAc;AAAA,MACrC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,MAAI,SAAS,UAAU;AACrB,WAAO,YAAY,KAAK,IAAI,IAAI;AAChC,WAAO;AAAA,EACT;AAEA,MAAI,SAAS;AACb,aAAW,SAAS,QAAQ;AAC1B,QAAI;AAIF,YAAM,QAAQ,uBAAuB,MAAM,QAAQ,EAAE,GAAG,MAAM,OAAO,SAAS,OAAO,GAAG;AAAA,QACtF,IAAI;AAAA,QACJ,OAAO;AAAA,QACP,YAAY,MAAM;AAAA,QAClB,aAAa;AAAA,MACf,CAAC;AACD,gBAAU;AACV,aAAO,gBAAgB;AAAA,IACzB,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,4BAA4B,MAAM,UAAU,OAAO,MAAM,OAAO,YAAY,EAAE,YAAY,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MAC5I;AAAA,IACF;AAAA,EACF;AAEA,MAAI,aAAa,SAAS,GAAG;AAC3B,UAAM,eACJ,aAAa,IAAI,CAAC,OAAO;AAAA,MACvB,WAAW,CAAC,EAAE,WAAW,YAAY,IAAI,EAAE,UAAU;AAAA,MACrD,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA,MAKN,SAAS;AAAA,MACT,WAAW,EAAE;AAAA,MACb,YAAY,EAAE;AAAA,MACd,YAAY;AAAA,MACZ,qBAAqB;AAAA,QACnB,CAAC,EAAE,WAAW,YAAY,EAAE,GAAG;AAAA,UAC7B,EAAE,WAAW;AAAA,UACb,EAAE,WAAW,YAAY;AAAA,QAC3B;AAAA,MACF;AAAA,MACA;AAAA,IACF,EAAE;AACJ,UAAM,UAAU,WAAW,KAAK,WAAW,YAAY;AACvD,WAAO,oBAAoB,QAAQ;AACnC,WAAO,gBAAgB,QAAQ;AAC/B,eAAW,SAAS,SAAS;AAC3B,YAAM,QAAQ,aAAa,KAAK,CAAC,MAAM,EAAE,WAAW,YAAY,OAAO,MAAM,UAAU,CAAC,CAAC;AACzF,UAAI,MAAO,OAAM,QAAQ,eAAe,MAAM;AAAA,IAChD;AAAA,EACF;AAEA,MAAI,SAAS,GAAG;AAKd,kCAA8B,QAAQ,GAAG;AACzC,QAAI,QAAQ,QAAQ,KAAK,UAAW,+BAA8B,KAAK,SAAS;AAAA,EAClF;AACA,MAAI;AACF,UAAM,oBAAoB,gBAAgB,KAAK,SAAS,GAAG;AAAA,MACzD,eAAe;AAAA,MACf,WAAW;AAAA,MACX,aAAa;AAAA,MACb,cAAc,OAAO;AAAA,IACvB,CAAiC;AAAA,EACnC,SAAS,KAAK;AACZ,QAAI;AAAA,MACF,oDAAoD,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,IACtG;AAAA,EACF;AAEA,SAAO,YAAY,KAAK,IAAI,IAAI;AAChC,SAAO;AACT;AAkCA,eAAsB,uBACpB,SACA,MACA,MACA,UAA4C,CAAC,GACH;AAC1C,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,SAAS,IAAI,YAAY;AAC/B,QAAM,eAAe,KAAK,UAAU,CAAC;AACrC,QAAM,aAAa,MAAM,QAAQ,cAAc,YAAY;AAC3D,MAAI,CAAC,YAAY;AACf,WAAO,EAAE,aAAa,CAAC,GAAG,SAAS,cAAc,YAAY,6BAA6B,KAAK,MAAM,GAAG;AAAA,EAC1G;AAEA,QAAM,UAAU,MAAY;AAC1B,QAAI;AACF,cAAQ,kBAAkB,KAAK,WAAW,QAAQ,GAAG;AAAA,IACvD,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,qDAAqD,KAAK,MAAM,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACvH;AAAA,IACF;AAAA,EACF;AAEA,MAAI,SAAS,QAAQ;AACnB,UAAM,QAAQ;AAAA,MACZ;AAAA,MACA,EAAE,kBAAkB,QAAQ,YAAY,QAAW,SAAS,OAAO;AAAA,MACnE,EAAE,IAAI,KAAK,OAAO,aAAa,YAAY,cAAc,aAAa,mBAAmB;AAAA,IAC3F;AACA,kCAA8B,QAAQ,GAAG;AACzC,YAAQ;AACR,WAAO,EAAE,aAAa,CAAC,YAAY,GAAG,SAAS,cAAc,YAAY,2BAA2B;AAAA,EACtG;AAEA,MAAI,SAAS,WAAW;AACtB,UAAM,eAAe,MAAM,QAAQ,cAAc,YAAY;AAAA,MAC3D,IAAI;AAAA,MACJ,OAAO;AAAA,MACP,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,kBAAkB,CAAC,KAAK,UAAU,CAAC,CAAC;AAAA,IACtC,CAAC;AACD,QAAI,iBAAiB,MAAM;AACzB,aAAO,EAAE,aAAa,CAAC,GAAG,SAAS,cAAc,YAAY,wCAAwC;AAAA,IACvG;AACA,kCAA8B,QAAQ,GAAG;AACzC,YAAQ;AACR,WAAO,EAAE,aAAa,CAAC,YAAY,GAAG,SAAS,cAAc,YAAY,YAAY;AAAA,EACvF;AAEA,QAAM,kBAAkB,QAAQ,eAAe,KAAK;AACpD,MAAI,CAAC,iBAAiB;AACpB,WAAO;AAAA,MACL,aAAa,CAAC;AAAA,MACd,SAAS;AAAA,IACX;AAAA,EACF;AAKA,QAAM,WAAW;AAAA,IACf;AAAA,MACE,SAAS;AAAA,MACT,UAAU;AAAA,MACV,YAAY,WAAW,YAAY,cAAc;AAAA,MACjD,MAAM,CAAC,oBAAoB,WAAW;AAAA,MACtC,WAAW,WAAW,YAAY;AAAA,IACpC;AAAA,IACA,EAAE,QAAQ,YAAY;AAAA,IACtB,EAAE,SAAS,KAAK;AAAA,EAClB;AACA,MAAI,SAAS,aAAa,SAAS,GAAG;AACpC,QAAI,KAAK,+DAA+D,SAAS,aAAa,KAAK,IAAI,CAAC,EAAE;AAAA,EAC5G;AACA,QAAM,UAAU,MAAM,QAAQ,kBAAkB,UAAU;AAAA,IACxD,OAAO;AAAA,IACP,SAAS,CAAC,YAAY;AAAA;AAAA;AAAA,IAGtB,YAAY;AAAA,EACd,CAAC;AAID,MAAI,QAAQ,kBAAkB;AAC5B,WAAO;AAAA,MACL,aAAa,CAAC;AAAA,MACd,SAAS,8BAA8B,KAAK,MAAM;AAAA,IACpD;AAAA,EACF;AACA,QAAM,aAAa,MAAM,QAAQ;AAAA,IAC/B;AAAA,IACA,QAAQ;AAAA,IACR,2CAA2C,KAAK,MAAM;AAAA,IACtD;AAAA,IACA,EAAE,OAAO,YAAY;AAAA,EACvB;AACA,gCAA8B,QAAQ,GAAG;AACzC,UAAQ;AACR,MAAI,CAAC,YAAY;AACf,WAAO;AAAA,MACL,aAAa,CAAC,QAAQ,EAAE;AAAA,MACxB,SAAS,eAAe,QAAQ,EAAE,4BAA4B,YAAY;AAAA,IAC5E;AAAA,EACF;AACA,SAAO;AAAA,IACL,aAAa,CAAC,cAAc,QAAQ,EAAE;AAAA,IACtC,SAAS,cAAc,YAAY,kBAAkB,QAAQ,EAAE;AAAA,EACjE;AACF;;;AClpBA,IAAM,cAAyC,CAAC,GAAG,qBAAqB,GAAG,sBAAsB;AAE1F,SAAS,sBAAsB,OAAwC;AAC5E,SAAO,YAAY,SAAS,KAAuB;AACrD;AAWA,eAAsB,kBACpB,WACA,SACA,QACA,MACA,UAAoC,CAAC,GACV;AAC3B,MAAI,OAAO,SAAS,YAAY,CAAC,sBAAsB,IAAI,GAAG;AAC5D,UAAM,IAAI,MAAM,0CAA0C,OAAO,IAAI,CAAC,EAAE;AAAA,EAC1E;AAEA,QAAM,OAAO,SAAS,WAAW,MAAM;AACvC,MAAI,CAAC,MAAM;AACT,WAAO,EAAE,QAAQ,MAAM,aAAa,CAAC,GAAG,SAAS,QAAQ,MAAM,aAAa;AAAA,EAC9E;AAEA,MAAI,KAAK,aAAa,CAAC,QAAQ,qBAAqB;AAClD,UAAM,IAAI;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,oBAAoB,QAAQ,sBAC9B,MAAM,QAAQ,oBAAoB,KAAK,SAAS,IAChD;AAEJ,MAAI,KAAK,cAAc,KAAK,eAAe,sBAAsB;AAC/D,WAAO,EAAE,QAAQ,MAAM,aAAa,CAAC,GAAG,SAAS,oCAAoC,KAAK,UAAU,IAAI;AAAA,EAC1G;AAMA,QAAM,cAAc,KAAK,SAAS;AAClC,QAAM,kBAAkB,cACpB,uBAAuB,SAAS,IAAI,IACpC,oBAAoB,SAAS,IAAI;AACrC,MAAI,CAAC,iBAAiB;AACpB,UAAM,WAAW,cAAc,yBAAyB,qBAAqB,KAAK,IAAI;AACtF,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,aAAa,CAAC;AAAA,MACd,SAAS,SAAS,IAAI,wBAAwB,cAAc,qBAAqB,eAAe,iBAAiB,OAAO;AAAA,IAC1H;AAAA,EACF;AAEA,MAAI,aAAa;AACf,UAAM,UAAU,MAAM;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,QACE,eAAe,QAAQ;AAAA,QACvB,iBAAiB,QAAQ;AAAA,MAC3B;AAAA,IACF;AAGA,QAAI,QAAQ,YAAY,SAAS,EAAG,aAAY,WAAW,QAAQ,IAAI;AACvE,WAAO,EAAE,QAAQ,MAAM,aAAa,QAAQ,aAAa,SAAS,QAAQ,QAAQ;AAAA,EACpF;AAGA,QAAM,CAAC,KAAK,GAAG,IAAI,KAAK;AACxB,QAAM,cAAwB,CAAC;AAC/B,MAAI,UAAU;AACd,MAAI,kBAAkB;AACtB,MAAI,8BAA+D;AAOnE,MAAI,0BAA+C;AAKnD,QAAM,oBAAoB,MAA2B;AACnD,QAAI,CAAC,QAAQ,sBAAuB,QAAO;AAC3C,UAAM,wBAAwB,QAAQ;AACtC,UAAM,YAAY,KAAK;AACvB,UAAM,aAAa,kBAAkB;AACrC,WAAO,MAAM,sBAAsB,WAAW,UAAU;AAAA,EAC1D;AACA,QAAM,oBAAoB,kBAAkB;AAC5C,QAAM,gCAAgC,CAAC,SAAiB,QAAQ,sBAA4B;AAC1F,QAAI,CAAC,MAAO;AACZ,QAAI;AACF,YAAM;AAAA,IACR,SAAS,KAAK;AACZ,UAAI;AAAA,QACF;AAAA,QACA;AAAA,QACA;AAAA,QACA,eAAe,QAAQ,IAAI,UAAU;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AACA,QAAM,mCAAmC,OACvC,SACA,WACA,gBACkB;AAClB,QAAI,CAAC,kBAAmB;AACxB,QAAI,MAAM,4BAA4B,mBAAmB,WAAW,WAAW,GAAG;AAChF,oCAA8B,OAAO;AAAA,IACvC;AAAA,EACF;AAEA,UAAQ,MAAM;AAAA,IACZ,KAAK,UAAU;AACb,YAAM,aAAa,MAAM,mBAAmB,mBAAmB,QAAQ,GAAG;AAC1E,UAAI,CAAC,WAAW,IAAI;AAClB,0BAAkB;AAClB,kBAAU,WAAW;AACrB;AAAA,MACF;AACA,YAAM,UAAU,MAAM,mBAAmB,mBAAmB,GAAG;AAC/D,YAAM,KAAK,UACP,MAAM,cAAc,mBAAmB,KAAK,KAAK,iCAAiC,IAClF;AACJ,UAAI,IAAI;AACN,oBAAY,KAAK,GAAG;AACpB,sCAA8B,YAC5B,sBAAsB,mBAAmB,SAAU,0CAA0C;AAG/F,kCAA0B;AAC1B,kBAAU,QAAQ,GAAG,gBAAgB,GAAG;AAAA,MAC1C,OACK;AACH,0BAAkB;AAClB,cAAM,aAAa,UACf,MAAM,sBAAsB,mBAAmB,SAAS,0CAA0C,IAClG;AACJ,YAAI,WAAW,CAAC,YAAY;AAC1B,gBAAM,iCAAiC,8BAA8B,CAAC,OAAO,CAAC;AAAA,QAChF;AACA,kBAAU,aACN,wBAAwB,GAAG,cAAc,GAAG,yBAC5C,wBAAwB,GAAG,6BAA6B,GAAG;AAAA,MACjE;AACA;AAAA,IACF;AAAA,IACA,KAAK,UAAU;AACb,YAAM,aAAa,MAAM,mBAAmB,mBAAmB,QAAQ,GAAG;AAC1E,UAAI,CAAC,WAAW,IAAI;AAClB,0BAAkB;AAClB,kBAAU,WAAW;AACrB;AAAA,MACF;AACA,YAAM,UAAU,MAAM,mBAAmB,mBAAmB,GAAG;AAC/D,YAAM,KAAK,UACP,MAAM,cAAc,mBAAmB,KAAK,KAAK,iCAAiC,IAClF;AACJ,UAAI,IAAI;AACN,oBAAY,KAAK,GAAG;AACpB,sCAA8B,YAC5B,sBAAsB,mBAAmB,SAAU,0CAA0C;AAG/F,kCAA0B;AAC1B,kBAAU,QAAQ,GAAG,gBAAgB,GAAG;AAAA,MAC1C,OACK;AACH,0BAAkB;AAClB,cAAM,aAAa,UACf,MAAM,sBAAsB,mBAAmB,SAAS,0CAA0C,IAClG;AACJ,YAAI,WAAW,CAAC,YAAY;AAC1B,gBAAM,iCAAiC,8BAA8B,CAAC,OAAO,CAAC;AAAA,QAChF;AACA,kBAAU,aACN,wBAAwB,GAAG,cAAc,GAAG,yBAC5C,wBAAwB,GAAG,6BAA6B,GAAG;AAAA,MACjE;AACA;AAAA,IACF;AAAA,IACA,KAAK,SAAS;AACZ,YAAM,cAAc,MAAM,wBAAwB,mBAAmB,QAAQ,KAAK,KAAK,OAAO;AAC9F,UAAI,CAAC,YAAY,IAAI;AACnB,0BAAkB;AAClB,kBAAU,YAAY;AACtB;AAAA,MACF;AAEA,YAAM,MAAM,MAAM,cAAc,mBAAmB,KAAK,YAAY,UAAU,gCAAgC;AAC9G,UAAI,CAAC,KAAK;AACR,0BAAkB;AAClB,cAAM,cAAc,MAAM,sBAAsB,mBAAmB,YAAY,OAAO;AACtF,kBAAU,cACN,oBAAoB,GAAG,cAAc,GAAG,yBACxC,oBAAoB,GAAG,6BAA6B,GAAG;AAC3D,YAAI,aAAa;AACf,gBAAM,0BAA0B,mBAAmB,WAAW;AAAA,QAChE,OACK;AACH,gBAAM,iCAAiC,mCAAmC,CAAC,YAAY,OAAO,GAAG,WAAW;AAAA,QAC9G;AACA;AAAA,MACF;AAEA,YAAM,MAAM,MAAM,cAAc,mBAAmB,KAAK,YAAY,UAAU,gCAAgC;AAC9G,UAAI,CAAC,KAAK;AACR,0BAAkB;AAClB,cAAM,cAAc,MAAM,sBAAsB,mBAAmB,YAAY,OAAO;AACtF,cAAM,cAAc,MAAM,sBAAsB,mBAAmB,YAAY,OAAO;AACtF,kBAAU,eAAe,cACrB,oBAAoB,GAAG,cAAc,GAAG,QAAQ,GAAG,yBACnD,oBAAoB,GAAG,6BAA6B;AAAA,UACpD,cAAc,SAAY;AAAA,UAC1B,cAAc,SAAY;AAAA,QAC5B,EAAE,OAAO,OAAO,EAAE,KAAK,IAAI,CAAC;AAC9B,YAAI,eAAe,aAAa;AAC9B,gBAAM,0BAA0B,mBAAmB,WAAW;AAAA,QAChE,OACK;AACH,gBAAM;AAAA,YACJ;AAAA,YACA,CAAC,YAAY,SAAS,YAAY,OAAO;AAAA,YACzC;AAAA,UACF;AAAA,QACF;AACA;AAAA,MACF;AAEA,kBAAY,KAAK,KAAK,GAAG;AACzB,oCAA8B,YAAY;AACxC,cAAM,cAAc,MAAM,sBAAsB,mBAAmB,YAAY,OAAO;AACtF,cAAM,cAAc,MAAM,sBAAsB,mBAAmB,YAAY,OAAO;AACtF,YAAI,eAAe,aAAa;AAC9B,gBAAM,0BAA0B,mBAAmB,WAAW;AAAA,QAChE;AACA,eAAO,eAAe;AAAA,MACxB;AAWA,gCAA0B;AAC1B,gBAAU,sCAAsC,YAAY,QAAQ;AACpE;AAAA,IACF;AAAA,IACA,KAAK,cAAc;AACjB,gBAAU;AACV;AAAA,IACF;AAAA,IACA,KAAK,sBAAsB;AACzB,gBAAU;AACV;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,iBAAiB;AACpB,QAAI,WAAW;AACf,QAAI;AACF,iBAAW,YAAY,WAAW,QAAQ,IAAI,MAAM;AAAA,IACtD,SAAS,KAAK;AACZ,UAAI;AAAA,QACF;AAAA,QACA;AAAA,QACA;AAAA,QACA,eAAe,QAAQ,IAAI,UAAU;AAAA,MACvC;AAAA,IACF;AACA,QAAI,CAAC,UAAU;AACb,UAAI,6BAA6B;AAC/B,cAAM,aAAa,MAAM,4BAA4B;AACrD,oBAAY,SAAS;AACrB,kBAAU,aACN,iFAAiF,MAAM,KACvF;AACJ,YAAI,CAAC,cAAc,yBAAyB;AAC1C,wCAA8B,2CAA2C,uBAAuB;AAAA,QAClG;AAAA,MACF,OAAO;AACL,kBAAU;AAAA,MACZ;AAAA,IACF,WAAW,yBAAyB;AAMlC,oCAA8B,YAAY,uBAAuB;AAAA,IACnE;AAAA,EACF;AACA,MAAI,KAAK,0DAA0D,QAAQ,MAAM,YAAY,MAAM;AACnG,SAAO,EAAE,QAAQ,MAAM,aAAa,QAAQ;AAC9C;AAeA,eAAe,wBACb,SACA,QACA,KACA,KACA,SAC2B;AAC3B,QAAM,UAAU,MAAM,QAAQ,cAAc,GAAG;AAC/C,QAAM,UAAU,MAAM,QAAQ,cAAc,GAAG;AAC/C,MAAI,CAAC,WAAW,CAAC,SAAS;AACxB,WAAO,EAAE,IAAI,OAAO,SAAS,+DAA+D,MAAM,GAAG;AAAA,EACvG;AAEA,QAAM,oBAAoB,QAAQ,gBAAgB,KAAK;AACvD,MAAI,mBAAmB;AACrB,QAAI,sBAAsB,OAAO,sBAAsB,KAAK;AAC1D,aAAO,EAAE,IAAI,OAAO,SAAS,8EAA8E;AAAA,IAC7G;AACA,UAAMA,eAAc,MAAM,QAAQ,cAAc,iBAAiB;AACjE,QAAI,CAACA,cAAa;AAChB,aAAO,EAAE,IAAI,OAAO,SAAS,iBAAiB,iBAAiB,4BAA4B;AAAA,IAC7F;AACA,UAAM,oBAAoBA,aAAY,YAAY,UAAU;AAC5D,QAAI,sBAAsB,UAAU;AAClC,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,SAAS,iBAAiB,iBAAiB,OAAO,iBAAiB;AAAA,MACrE;AAAA,IACF;AACA,WAAO,EAAE,IAAI,MAAM,UAAU,mBAAmB,SAAS,SAAS,SAAS,MAAM;AAAA,EACnF;AAEA,QAAM,gBAAgB,QAAQ;AAC9B,MAAI,OAAO,kBAAkB,YAAY,cAAc,KAAK,EAAE,WAAW,GAAG;AAC1E,WAAO;AAAA,MACL,IAAI;AAAA,MACJ,SAAS;AAAA,IACX;AAAA,EACF;AAEA,QAAM,WAAW,QAAQ,kBAAkB,qBAAqB,SAAS,OAAO;AAChF,MAAI;AACJ,MAAI;AAGF,UAAM,gBAAgB;AAAA,MACpB;AAAA,QACE,SAAS;AAAA,QACT;AAAA,QACA,YAAY,KAAK,IAAI,QAAQ,YAAY,cAAc,KAAK,QAAQ,YAAY,cAAc,GAAG;AAAA,QACjG,MAAM,CAAC,4BAA4B,OAAO;AAAA,MAC5C;AAAA,MACA,EAAE,QAAQ,2BAA2B;AAAA,MACrC,EAAE,SAAS,KAAK;AAAA,IAClB;AACA,QAAI,cAAc,aAAa,SAAS,GAAG;AACzC,UAAI,KAAK,2DAA2D,cAAc,aAAa,KAAK,IAAI,CAAC,EAAE;AAAA,IAC7G;AACA,UAAM,cAAc,MAAM,QAAQ,kBAAkB,eAAe;AAAA,MACjE,OAAO;AAAA,MACP,SAAS,CAAC,KAAK,GAAG;AAAA,MAClB,YAAY;AAAA,IACd,CAAC;AACD,eAAW,YAAY;AACvB,QAAI,YAAY,kBAAkB;AAIhC,YAAM,gBAAgB,SAAS,QAAQ;AACvC,aAAO,EAAE,IAAI,OAAO,SAAS,qBAAqB,MAAM,oFAA+E;AAAA,IACzI;AAAA,EACF,SAAS,KAAK;AACZ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA,eAAe,QAAQ,IAAI,UAAU;AAAA,IACvC;AACA,WAAO,EAAE,IAAI,OAAO,SAAS,qDAAqD,MAAM,GAAG;AAAA,EAC7F;AACA,QAAM,cAAc,MAAM,QAAQ,cAAc,QAAQ;AACxD,MAAI,CAAC,aAAa;AAChB,UAAM,gBAAgB,SAAS,QAAQ;AACvC,WAAO,EAAE,IAAI,OAAO,SAAS,iBAAiB,QAAQ,wCAAwC;AAAA,EAChG;AACA,SAAO,EAAE,IAAI,MAAM,UAAU,SAAS,SAAS,SAAS,KAAK;AAC/D;AAEA,SAAS,qBAAqB,SAAqB,SAAqC;AACtF,SAAO,QAAQ,YAAY,aAAa,QAAQ,YAAY,WACxD,QAAQ,YAAY,WACpB;AACN;AAMA,eAAe,mBACb,SACA,QACA,QAC+B;AAC/B,QAAM,SAAS,MAAM,mBAAmB,SAAS,MAAM;AACvD,MAAI,CAAC,QAAQ;AACX,WAAO,EAAE,IAAI,OAAO,SAAS,eAAe,MAAM,6BAA6B,MAAM,GAAG;AAAA,EAC1F;AAEA,QAAM,SAAS,OAAO,YAAY,UAAU;AAC5C,MAAI,WAAW,UAAU;AACvB,WAAO,EAAE,IAAI,OAAO,SAAS,eAAe,MAAM,OAAO,MAAM,mBAAmB,MAAM,GAAG;AAAA,EAC7F;AAEA,SAAO,EAAE,IAAI,KAAK;AACpB;AAEA,eAAe,mBAAmB,SAAyB,UAA8C;AACvG,MAAI;AACF,WAAO,MAAM,QAAQ,cAAc,QAAQ;AAAA,EAC7C,SAAS,KAAK;AACZ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA,eAAe,QAAQ,IAAI,UAAU;AAAA,IACvC;AACA,WAAO;AAAA,EACT;AACF;AAEA,eAAe,sBACb,SACA,QACA,aAAa,2CACK;AAClB,MAAI;AACF,UAAM,UAAU,MAAM,QAAQ,cAAc,OAAO,YAAY,EAAE;AACjE,QAAI,CAAC,QAAS,QAAO;AACrB,UAAM,sBAA0D;AAAA,MAC9D,GAAG,OAAO;AAAA,MACV,QAAQ,OAAO,YAAY;AAAA,MAC3B,cAAc,OAAO,YAAY;AAAA,MACjC,cAAc,OAAO,YAAY;AAAA,IACnC;AACA,WAAO,MAAM,QAAQ,uBAAuB,SAAS,qBAAqB;AAAA,MACxE,OAAO;AAAA,MACP;AAAA,IACF,CAAC;AAAA,EACH,SAAS,KAAK;AACZ,QAAI;AAAA,MACF;AAAA,MACA,OAAO,YAAY;AAAA,MACnB,eAAe,QAAQ,IAAI,UAAU;AAAA,IACvC;AACA,WAAO;AAAA,EACT;AACF;AAEA,eAAe,4BACb,SACA,WACA,aACkB;AAClB,aAAW,YAAY,WAAW;AAChC,QAAI;AACF,YAAM,UAAU,MAAM,QAAQ,cAAc,SAAS,YAAY,EAAE;AACnE,UAAI,CAAC,QAAS,QAAO;AACrB,UAAI,yBAAyB,SAAS,QAAQ,EAAG,QAAO;AAAA,IAC1D,SAAS,KAAK;AACZ,UAAI;AAAA,QACF;AAAA,QACA,SAAS,YAAY;AAAA,QACrB,eAAe,QAAQ,IAAI,UAAU;AAAA,MACvC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,MAAI,aAAa,SAAS;AACxB,QAAI;AACF,aAAQ,MAAM,QAAQ,cAAc,YAAY,QAAQ,MAAO;AAAA,IACjE,SAAS,KAAK;AACZ,UAAI;AAAA,QACF;AAAA,QACA,YAAY;AAAA,QACZ,eAAe,QAAQ,IAAI,UAAU;AAAA,MACvC;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAEA,SAAO;AACT;AAEA,SAAS,yBAAyB,SAAqB,UAA+B;AACpF,SACE,QAAQ,YAAY,WAAW,SAAS,YAAY,UACpD,QAAQ,YAAY,iBAAiB,SAAS,YAAY,gBAC1D,QAAQ,YAAY,iBAAiB,SAAS,YAAY;AAE9D;AAEA,eAAe,0BAA0B,SAAyB,aAAqE;AACrI,MAAI,CAAC,YAAY,QAAS;AAC1B,QAAM,gBAAgB,SAAS,YAAY,QAAQ;AACrD;AAEA,eAAe,gBAAgB,SAAyB,UAAiC;AACvF,MAAI;AACF,UAAM,SAAS,MAAM,QAAQ,cAAc,QAAQ;AACnD,UAAM,cAAc,MAAM,QAAQ,iBAAiB,QAAQ;AAC3D,QAAI,eAAe,QAAQ,YAAY,aAAa,QAAQ;AAC1D,YAAM,QAAQ,mCAAmC,CAAC,MAAM,CAAC;AAAA,IAC3D;AAAA,EACF,SAAS,KAAK;AACZ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA,eAAe,QAAQ,IAAI,UAAU;AAAA,IACvC;AAAA,EACF;AACF;AAEA,eAAe,cACb,SACA,OACA,OACA,QACkB;AAClB,MAAI;AACF,UAAM,SAAS,MAAM,QAAQ,gBAAgB,OAAO,OAAO,MAAM;AACjE,QAAI,WAAW,OAAO;AACpB,UAAI,KAAK,wEAAmE,OAAO,KAAK;AACxF,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,QAAI;AAAA,MACF;AAAA,MACA;AAAA,MACA;AAAA,MACA,eAAe,QAAQ,IAAI,UAAU;AAAA,IACvC;AACA,WAAO;AAAA,EACT;AACF;","names":["replacement"]}

package/dist/chunk-HVDEKJJR.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/entity-retrieval.ts"],"sourcesContent":["import { resolveNamespaceCapabilities } from \"./capabilities.js\";\nimport { renderAuthorityBoundContent } from \"./recall-context-composition.js\";\nimport { createHash } from \"node:crypto\";\nimport { sanitizeMemoryContent } from \"./sanitize.js\";\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { collectNativeKnowledgeChunks, type NativeKnowledgeChunk } from \"./native-knowledge.js\";\nimport { compareEntityTimestamps, normalizeEntityName, type StorageManager } from \"./storage.js\";\nimport { normalizeEntityText, resolveRequestedEntitySectionKeys } from \"./entity-schema.js\";\nimport type { EntityStructuredSection, MemoryFile, PluginConfig, TranscriptEntry } from \"./types.js\";\nimport { truncateGraphemeSafe } from \"./whitespace.js\";\nimport { containsPhrase } from \"./entity-retrieval-boundaries.js\";\nimport {\n  detectEntityQueryMode,\n  isStructuralEntityFollowUpQuery,\n  type EntityQueryMode,\n} from \"./entity-retrieval-i18n.js\";\nimport { buildOriginStructuredSections, sanitizeOriginatedFacts, type EntityOriginStructuredSection } from \"./entity-origin-fields.js\";\nimport {\n  checkEntityRecallAbort,\n  entityRecallSectionAbsent,\n  yieldEntityRecallScan,\n  yieldEntityRecallScanEvery,\n} from \"./entity-recall-cancellation.js\";\nconst ENTITY_INDEX_VERSION = 3;\nconst RECENT_TRANSCRIPT_LOOKBACK_HOURS = 24;\nconst INSTRUCTION_LIKE_RE = /\\b(always|never|must|should|remember to|do not|don't|process|workflow|template|checklist|instruction)\\b/i;\nconst METADATA_WRAPPER_RE = /^(source|context|metadata|notes?):/i;\nconst BELIEF_LEDGER_SECTION_KEY = \"belief_ledger\";\nconst BELIEF_LEDGER_FACT_RE = /^claim=([^;]+);\\s*status=([^;]+);\\s*updatedAt=([^;]+);\\s*(.+)$/;\ntype EntityMentionIndexEntry = {\n  canonicalId: string;\n  name: string;\n  type: string;\n  summary?: string;\n  aliases: string[];\n  facts: string[];\n  timelineFacts: string[];\n  timelineFactOrigins?: Array<string | undefined>;\n  structuredSections: EntityOriginStructuredSection[];\n  timeline: Array<{\n    timestamp: string;\n    text: string;\n    source?: string;\n    sessionKey?: string;\n    principal?: string;\n    origin?: string;\n  }>;\n  relationships: Array<{ target: string; label: string }>;\n  activity: Array<{ date: string; note: string }>;\n  factCount: number;\n  memorySnippets: string[]; memorySnippetOrigins?: Array<string | undefined>;\n  nativeChunks: Array<{\n    chunkId: string;\n    title: string;\n    sourceKind: NativeKnowledgeChunk[\"sourceKind\"];\n    sourcePath: string;\n    snippet: string;\n    derivedDate?: string;\n  }>;\n};\ntype EntityMentionIndex = {\n  version: number;\n  updatedAt: string;\n  entityStatusVersion?: number;\n  entities: EntityMentionIndexEntry[];\n};\ntype EntityCandidate = {\n  entry: EntityMentionIndexEntry;\n  alias: string;\n  score: number;\n  source: \"query\" | \"recent_turn\";\n};\ntype EntityHintSnippet = {\n  text: string;\n  score: number;\n  kind: \"summary\" | \"fact\" | \"section\" | \"relationship\" | \"activity\" | \"memory\" | \"native\"; origin?: string;\n};\nexport interface BuildEntityRecallSectionOptions {\n  config: PluginConfig;\n  storage: StorageManager;\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>;\n  query: string;\n  recallNamespaces?: string[];\n  recentTurns: number;\n  maxHints: number;\n  maxSupportingFacts: number;\n  maxRelatedEntities: number;\n  maxChars: number;\n  transcriptEntries: TranscriptEntry[];\n  originAuthorityEnabled?: boolean; untrustedOrigins?: readonly string[];\n  /**\n   * Cancels the build at its next checkpoint (issue #2291).  Entity recall reads\n   * every entity and memory file across the recalled namespaces, which is\n   * minutes of work on a large or slow store; without this the scan kept running\n   * after the recall that asked for it had been abandoned.\n   */\n  abortSignal?: AbortSignal;\n}\nfunction tokenize(value: string): string[] {\n  return normalizeEntityText(value).split(/\\s+/).filter((token) => token.length >= 2);\n}\nfunction uniqueStrings(values: string[]): string[] {\n  return [...new Set(values.map((value) => value.trim()).filter((value) => value.length > 0))];\n}\nfunction compactLine(value: string, maxLength: number = 220): string {\n  const normalized = value.replace(/\\s+/g, \" \").trim();\n  if (normalized.length <= maxLength) return normalized;\n  return `${truncateGraphemeSafe(normalized, maxLength - 1).trimEnd()}…`;\n}\nfunction dedupeHintSnippetsByText(snippets: EntityHintSnippet[]): EntityHintSnippet[] {\n  const deduped = new Map<string, EntityHintSnippet>();\n  for (const snippet of snippets) {\n    const key = normalizeEntityText(snippet.text);\n    const existing = deduped.get(key);\n    if (!existing) {\n      deduped.set(key, snippet);\n      continue;\n    }\n    if (existing.origin !== snippet.origin) {\n      existing.origin = undefined;\n    }\n  }\n  return [...deduped.values()];\n}\nfunction isBeliefLedgerSection(section: Pick<EntityStructuredSection, \"key\">): boolean {\n  return normalizeEntityText(section.key).replace(/\\s+/g, \"_\") === BELIEF_LEDGER_SECTION_KEY;\n}\nfunction beliefLedgerFactKeys(sections: EntityStructuredSection[]): Set<string> {\n  const keys = new Set<string>();\n  for (const section of sections) {\n    if (!isBeliefLedgerSection(section)) continue;\n    for (const fact of section.facts) {\n      keys.add(normalizeEntityText(fact));\n    }\n  }\n  return keys;\n}\ntype RecalledEntityFact = { text: string; sourceIndex: number };\nfunction recallFactsForStructuredSection(section: EntityStructuredSection): RecalledEntityFact[] {\n  if (!isBeliefLedgerSection(section)) {\n    return section.facts.map((text, sourceIndex) => ({ text, sourceIndex }));\n  }\n  return currentActiveBeliefLedgerFactTexts(section.facts);\n}\nfunction currentActiveBeliefLedgerFactTexts(facts: string[]): RecalledEntityFact[] {\n  const byClaim = new Map<string, { status: string; updatedAtMs: number; texts: RecalledEntityFact[] }>();\n  for (const [sourceIndex, fact] of facts.entries()) {\n    const match = BELIEF_LEDGER_FACT_RE.exec(fact.trim());\n    if (!match) continue;\n    const [, claimId, status, updatedAt, text] = match;\n    const updatedAtMs = Date.parse(updatedAt);\n    if (!claimId?.trim() || !status?.trim() || !Number.isFinite(updatedAtMs) || !text?.trim()) continue;\n    const normalizedStatus = status.trim().toLowerCase();\n    const normalizedClaimId = claimId.trim();\n    const current = byClaim.get(normalizedClaimId);\n    const inactiveTieWins =\n      current &&\n      updatedAtMs === current.updatedAtMs &&\n      current.status === \"active\" &&\n      normalizedStatus !== \"active\";\n    if (!current || updatedAtMs > current.updatedAtMs || inactiveTieWins) {\n      byClaim.set(normalizedClaimId, { status: normalizedStatus, updatedAtMs, texts: [{ text: text.trim(), sourceIndex }] });\n      continue;\n    }\n    if (updatedAtMs === current.updatedAtMs && current.status === normalizedStatus) {\n      current.texts.push({ text: text.trim(), sourceIndex });\n    }\n  }\n  return [...byClaim.values()].flatMap((current) => current.status === \"active\" ? current.texts : []);\n}\nfunction relationLine(entry: EntityMentionIndexEntry, relationship: { target: string; label: string }): string {\n  const normalizedLabel = relationship.label.replace(/\\s+/g, \" \").trim();\n  if (normalizedLabel.length === 0) return `${entry.name} is connected to ${relationship.target}`;\n  return `${entry.name} ${normalizedLabel} ${relationship.target}`;\n}\nfunction scoreAliasMatch(query: string, alias: string): number {\n  const normalizedQuery = normalizeEntityText(query);\n  const normalizedAlias = normalizeEntityText(alias);\n  if (!normalizedAlias) return 0;\n  if (normalizedQuery === normalizedAlias) return 10;\n  if (containsPhrase(normalizedQuery, normalizedAlias)) return 8 + Math.min(normalizedAlias.split(/\\s+/).length, 3);\n  const queryTokens = new Set(tokenize(normalizedQuery));\n  const aliasTokens = tokenize(normalizedAlias);\n  if (aliasTokens.length === 0) return 0;\n  const overlap = aliasTokens.filter((token) => queryTokens.has(token)).length;\n  if (overlap === 0) return 0;\n  // Cross-entity contamination guard (#682 PR 2/3 R-2). For multi-token\n  // aliases, partial-token overlap that hits ONLY shared common tokens\n  // (like \"person\" in \"Person-A1\" / \"Person-B1\") would surface every\n  // similarly-prefixed entity for a query that named only one. Require\n  // that the overlap include at least one DISTINCTIVE alias token —\n  // i.e. a token that does not also appear in any other entity's\n  // alias-token vocabulary. Since this function is pure / per-pair, we\n  // approximate \"distinctive\" by requiring the overlap to include at\n  // least one token that is not a substring-of common identifier\n  // affixes. The aliasTokens with length > 1 must contribute at least\n  // one non-affix overlap. \"Alice Example\" ([\"alice\", \"example\"])\n  // matched by query \"Tell me about Alice\" → overlap = 1 on \"alice\",\n  // and \"alice\" is not an affix → score = 1. \"Person-A1\" tokens\n  // [\"person\", \"a1\"] matched by query \"Who is Person-B1?\" → overlap =\n  // 1 on \"person\", and \"person\" IS an affix → score = 0.\n  if (aliasTokens.length > 1) {\n    const nonAffixOverlap = aliasTokens.filter(\n      (token) => queryTokens.has(token) && !isAliasAffixToken(token),\n    ).length;\n    if (nonAffixOverlap === 0) return 0;\n  }\n  return overlap;\n}\n/**\n * Tokens that look like type prefixes / generic role identifiers and\n * therefore should not, on their own, count as evidence that a\n * multi-token alias matches a query (#682 PR 2/3 R-2).\n *\n * Kept as a small explicit list rather than a regex so additions are\n * deliberate. The list mirrors the entity types listed in\n * `entity-schema.ts` plus the most common generic role identifiers\n * that frequently appear as the leading token of a display name.\n */\nconst ALIAS_AFFIX_TOKENS = new Set<string>([\n  \"person\", \"people\", \"user\", \"users\", \"team\", \"teams\",\n  \"project\", \"projects\", \"topic\", \"topics\",\n  \"org\", \"orgs\", \"organization\", \"organizations\", \"company\", \"companies\",\n  \"place\", \"places\", \"tool\", \"tools\", \"service\", \"services\",\n  \"system\", \"systems\", \"agent\", \"agents\", \"bot\", \"bots\",\n]);\nfunction isAliasAffixToken(token: string): boolean {\n  return ALIAS_AFFIX_TOKENS.has(token);\n}\nfunction isLikelyInstructionLike(value: string): boolean {\n  return INSTRUCTION_LIKE_RE.test(value) || METADATA_WRAPPER_RE.test(value);\n}\nfunction sanitizeEntityFact(fact: string): string {\n  const sanitized = sanitizeMemoryContent(fact);\n  const clean = sanitized.text.trim();\n  if (!clean) return \"\";\n  if (INSTRUCTION_LIKE_RE.test(clean) && clean.length > 100) return \"\";\n  return clean;\n}\nfunction scoreHintSnippet(snippet: EntityHintSnippet, queryTokens: string[]): EntityHintSnippet | null {\n  const normalized = normalizeEntityText(snippet.text);\n  if (!normalized) return null;\n  const scored = { ...snippet };\n  if (isLikelyInstructionLike(scored.text) && scored.kind !== \"summary\") {\n    scored.score -= 3;\n  }\n  const overlap = queryTokens.filter((token) => normalized.includes(token)).length;\n  scored.score += overlap * 2;\n  if (METADATA_WRAPPER_RE.test(scored.text)) scored.score -= 2;\n  if (scored.text.length <= 160) scored.score += 1;\n  return scored.score > 0 ? scored : null;\n}\nfunction sortTimelineEntriesDesc(\n  left: EntityMentionIndexEntry[\"timeline\"][number],\n  right: EntityMentionIndexEntry[\"timeline\"][number],\n): number {\n  const timestampOrder = compareEntityTimestamps(right.timestamp, left.timestamp);\n  if (timestampOrder !== 0) {\n    return timestampOrder;\n  }\n  return right.text.localeCompare(left.text);\n}\nfunction jaccardSimilarity(a: string, b: string): number {\n  const aTokens = new Set(tokenize(a));\n  const bTokens = new Set(tokenize(b));\n  if (aTokens.size === 0 || bTokens.size === 0) return 0;\n  let intersection = 0;\n  for (const token of aTokens) {\n    if (bTokens.has(token)) intersection += 1;\n  }\n  const union = new Set([...aTokens, ...bTokens]).size;\n  return union === 0 ? 0 : intersection / union;\n}\nfunction buildAliasIndex(entries: EntityMentionIndexEntry[]): Map<string, EntityMentionIndexEntry[]> {\n  const index = new Map<string, EntityMentionIndexEntry[]>();\n  for (const entry of entries) {\n    const aliases = uniqueStrings([entry.name, ...entry.aliases]).map(normalizeEntityText).filter(Boolean);\n    for (const alias of aliases) {\n      const existing = index.get(alias) ?? [];\n      existing.push(entry);\n      index.set(alias, existing);\n    }\n  }\n  return index;\n}\nasync function readNativeChunks(\n  config: PluginConfig,\n  recallNamespaces?: string[],\n): Promise<NativeKnowledgeChunk[]> {\n  if (!config.nativeKnowledge?.enabled) return [];\n  return collectNativeKnowledgeChunks({\n    workspaceDir: config.workspaceDir,\n    memoryDir: config.memoryDir,\n    config: config.nativeKnowledge,\n    recallNamespaces: resolveNamespaceCapabilities(config).namespaces ? recallNamespaces : undefined,\n    defaultNamespace: config.defaultNamespace,\n  }).catch(() => []);\n}\nasync function resolveEntityIndexStorages(\n  storage: StorageManager,\n  config: PluginConfig,\n  recallNamespaces?: string[],\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>,\n): Promise<StorageManager[]> {\n  if (\n    !resolveNamespaceCapabilities(config).namespaces ||\n    !namespaceStorage ||\n    !recallNamespaces ||\n    recallNamespaces.length === 0\n  ) {\n    return [storage];\n  }\n  const storages: StorageManager[] = [];\n  const seenDirs = new Set<string>();\n  for (const namespace of uniqueStrings(recallNamespaces)) {\n    try {\n      const scopedStorage = await namespaceStorage(namespace);\n      const storageDir = path.resolve(scopedStorage.dir);\n      if (seenDirs.has(storageDir)) continue;\n      seenDirs.add(storageDir);\n      storages.push(scopedStorage);\n    } catch {\n      continue;\n    }\n  }\n  return storages.length > 0 ? storages : [storage];\n}\nfunction entityIndexStatePath(storage: StorageManager): string {\n  return path.join(storage.dir, \"state\", \"entity-mention-index.json\");\n}\n\nasync function readEntityIndexState(storage: StorageManager): Promise<EntityMentionIndex | null> {\n  const raw = await readFile(entityIndexStatePath(storage), \"utf-8\").catch(() => \"\");\n  if (!raw) return null;\n  try {\n    const parsed = JSON.parse(raw) as Partial<EntityMentionIndex>;\n    if (parsed.version !== ENTITY_INDEX_VERSION || !Array.isArray(parsed.entities)) return null;\n    return parsed as EntityMentionIndex;\n  } catch {\n    return null;\n  }\n}\nasync function readCurrentPersistedEntityIndex(\n  storage: StorageManager,\n  config: PluginConfig,\n  recallNamespaces?: string[],\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>,\n): Promise<EntityMentionIndex | null> {\n  if (\n    resolveNamespaceCapabilities(config).namespaces &&\n    namespaceStorage &&\n    recallNamespaces &&\n    recallNamespaces.length > 0\n  ) {\n    return null;\n  }\n  const index = await readEntityIndexState(storage);\n  if (!index || index.entityStatusVersion !== storage.getMemoryStatusVersion()) {\n    return null;\n  }\n  return index;\n}\nconst namespaceEntityIndexCache = new Map<string, EntityMentionIndex>();\nconst MAX_NAMESPACE_ENTITY_INDEX_CACHE_ENTRIES = 32;\n\nfunction nativeEntityIndexRevision(chunks: NativeKnowledgeChunk[]): string {\n  const projection = chunks.map((chunk) => [\n    chunk.chunkId,\n    chunk.sourcePath,\n    chunk.title,\n    chunk.sourceKind,\n    uniqueStrings(chunk.aliases ?? []),\n    compactLine(chunk.content, 180),\n    chunk.derivedDate ?? null,\n  ]);\n  return createHash(\"sha256\").update(JSON.stringify(projection)).digest(\"hex\");\n}\nfunction namespaceEntityIndexCacheKey(\n  storages: StorageManager[],\n  recallNamespaces: string[],\n  nativeRevision: string,\n): string {\n  const namespaceKey = uniqueStrings(recallNamespaces).join(\"\\u001f\");\n  const storageKey = storages\n    .map((scopedStorage) => {\n      const aliases = Object.entries(scopedStorage.entityAliases)\n        .sort(([left], [right]) => left.localeCompare(right));\n      return (\n        `${path.resolve(scopedStorage.dir)}@${scopedStorage.getMemoryStatusVersion()}` +\n        `:${scopedStorage.getMemoryCorpusVersion()}:${scopedStorage.getEntityMutationVersion()}` +\n        `:${scopedStorage.hotCacheKeyId()}:${JSON.stringify(aliases)}`\n      );\n    })\n    .join(\"\\u001f\");\n  return `${namespaceKey}\\u001e${storageKey}\\u001e${nativeRevision}`;\n}\nfunction rememberNamespaceEntityIndex(key: string, index: EntityMentionIndex): void {\n  if (namespaceEntityIndexCache.size >= MAX_NAMESPACE_ENTITY_INDEX_CACHE_ENTRIES) {\n    const oldestKey = namespaceEntityIndexCache.keys().next().value;\n    if (typeof oldestKey === \"string\") namespaceEntityIndexCache.delete(oldestKey);\n  }\n  namespaceEntityIndexCache.set(key, index);\n}\n\nasync function writeEntityIndexState(storage: StorageManager, index: EntityMentionIndex): Promise<void> {\n  const statePath = entityIndexStatePath(storage);\n  await mkdir(path.dirname(statePath), { recursive: true });\n  const nextContent = JSON.stringify(index, null, 2) + \"\\n\";\n  const currentContent = await readFile(statePath, \"utf-8\").catch(() => \"\");\n  if (currentContent === nextContent) return;\n  await writeFile(statePath, nextContent, \"utf-8\");\n}\n\nfunction nativePseudoCanonicalId(chunk: NativeKnowledgeChunk): string {\n  return `native:${createHash(\"sha256\").update(chunk.sourcePath).digest(\"hex\").slice(0, 12)}`;\n}\n\nfunction createPseudoNativeEntry(chunk: NativeKnowledgeChunk): EntityMentionIndexEntry {\n  const canonicalId = nativePseudoCanonicalId(chunk);\n  return {\n    canonicalId,\n    name: chunk.title,\n    type: chunk.sourceKind,\n    aliases: uniqueStrings(chunk.aliases ?? []),\n    facts: [],\n    structuredSections: [],\n    timelineFacts: [],\n    timeline: [],\n    relationships: [],\n    activity: [],\n    factCount: 0,\n    memorySnippets: [],\n    nativeChunks: [\n      {\n        chunkId: chunk.chunkId,\n        title: chunk.title,\n        sourceKind: chunk.sourceKind,\n        sourcePath: chunk.sourcePath,\n        snippet: compactLine(chunk.content, 180),\n        derivedDate: chunk.derivedDate,\n      },\n    ],\n  };\n}\n\nfunction mergeNativeChunk(entry: EntityMentionIndexEntry, chunk: NativeKnowledgeChunk): void {\n  const existing = entry.nativeChunks.find((item) => item.chunkId === chunk.chunkId);\n  if (existing) return;\n  entry.nativeChunks.push({\n    chunkId: chunk.chunkId,\n    title: chunk.title,\n    sourceKind: chunk.sourceKind,\n    sourcePath: chunk.sourcePath,\n    snippet: compactLine(chunk.content, 180),\n    derivedDate: chunk.derivedDate,\n  });\n  entry.aliases = uniqueStrings([...entry.aliases, ...(chunk.aliases ?? [])]);\n}\n\nfunction hasFreshNativeExplicitMention(\n  index: EntityMentionIndex,\n  nativeChunks: NativeKnowledgeChunk[],\n  query: string,\n): boolean {\n  if (nativeChunks.length === 0) return false;\n  const nativeCanonicalIds = new Set(nativeChunks.map(nativePseudoCanonicalId));\n  const freshNativeIndex: EntityMentionIndex = {\n    ...index,\n    entities: [\n      ...index.entities.filter((entry) => !nativeCanonicalIds.has(entry.canonicalId)),\n      ...nativeChunks.map(createPseudoNativeEntry),\n    ],\n  };\n  return resolveLanguageIndependentExplicitCandidates(freshNativeIndex, query).length > 0;\n}\n\nasync function buildEntityMentionIndex(\n  storage: StorageManager,\n  config: PluginConfig,\n  recallNamespaces?: string[],\n  namespaceStorage?: (namespace: string) => Promise<StorageManager>,\n  nativeChunksOverride?: NativeKnowledgeChunk[],\n  resolvedStorages?: StorageManager[],\n  abortSignal?: AbortSignal,\n): Promise<EntityMentionIndex> {\n  checkEntityRecallAbort(abortSignal);\n  const storages = resolvedStorages ?? await resolveEntityIndexStorages(\n    storage,\n    config,\n    recallNamespaces,\n    namespaceStorage,\n  );\n  const shouldPersistIndex =\n    storages.length === 1 && path.resolve(storages[0]!.dir) === path.resolve(storage.dir);\n  const entityStatusVersionBefore = shouldPersistIndex ? storage.getMemoryStatusVersion() : undefined;\n  const [previousIndex, entityFileSets, memorySets, nativeChunks] = await Promise.all([\n    shouldPersistIndex ? readEntityIndexState(storage) : Promise.resolve(null),\n    Promise.all(storages.map((scopedStorage) => scopedStorage.readAllEntityFiles({ abortSignal }))),\n    Promise.all(storages.map((scopedStorage) => scopedStorage.readAllMemories({ abortSignal }))),\n    nativeChunksOverride ? Promise.resolve(nativeChunksOverride) : readNativeChunks(config, recallNamespaces),\n  ]);\n  // The bulk reads now stop at their own scan boundaries (issue #2307); this\n  // checkpoint still guards the (larger) indexing pass over their results.\n  checkEntityRecallAbort(abortSignal);\n  // Pair each entity with the storage that owns it (#1534): canonical ids must\n  // reflect that store's aliases and historical migration mappings, never another\n  // namespace's.\n  const entityRecords = entityFileSets.flatMap((set, index) =>\n    set.map((entity) => ({ entity, storage: storages[index]! })),\n  );\n  const memories = memorySets.flat();\n\n  // The two passes over the corpus below never await real I/O, so without an\n  // explicit yield they hold the event loop and no recall section deadline can\n  // fire during them (issue #2291).\n  let scanned = 0;\n  const entities = new Map<string, EntityMentionIndexEntry>();\n  for (const { entity, storage: entityStorage } of entityRecords) {\n    scanned += 1;\n    await yieldEntityRecallScanEvery(scanned, abortSignal);\n    const canonicalId =\n      typeof entityStorage.normalizeEntityName === \"function\"\n        ? entityStorage.normalizeEntityName(entity.name, entity.type)\n        : normalizeEntityName(entity.name, entity.type, entityStorage.entityAliases);\n    const rawStructuredSections = entity.structuredSections ?? [];\n    const rawBeliefLedgerFactKeys = beliefLedgerFactKeys(rawStructuredSections);\n    const sanitizedFacts = entity.facts\n      .map((fact) => sanitizeEntityFact(fact))\n      .filter(Boolean)\n      .filter((fact) => !rawBeliefLedgerFactKeys.has(normalizeEntityText(fact)))\n      .map((fact) => compactLine(fact, 180));\n    const { facts: timelineFacts, origins: timelineFactOrigins } = sanitizeOriginatedFacts(\n      entity.timeline,\n      sanitizeEntityFact,\n      compactLine,\n      true,\n    );\n    const structuredSections = buildOriginStructuredSections(\n      rawStructuredSections,\n      recallFactsForStructuredSection,\n      sanitizeEntityFact,\n      compactLine,\n    );\n    entities.set(canonicalId, {\n      canonicalId,\n      name: entity.name,\n      type: entity.type,\n      aliases: uniqueStrings(entity.aliases),\n      summary: entity.synthesis?.trim() || entity.summary?.trim() || undefined,\n      facts: sanitizedFacts,\n      timelineFacts,\n      ...(timelineFactOrigins.some((origin) => origin !== undefined) ? { timelineFactOrigins } : {}),\n      structuredSections,\n      timeline: entity.timeline.map((entry) => ({ ...entry })),\n      relationships: entity.relationships.map((relationship) => ({ ...relationship })),\n      activity: entity.activity.map((activity) => ({ ...activity })),\n      factCount: sanitizedFacts.length,\n      memorySnippets: [],\n      nativeChunks: [],\n    });\n  }\n\n  scanned = 0;\n  for (const memory of memories) {\n    scanned += 1;\n    await yieldEntityRecallScanEvery(scanned, abortSignal);\n    const entry = typeof memory.frontmatter.entityRef === \"string\" ? entities.get(memory.frontmatter.entityRef) : undefined;\n    if (!entry) continue;\n    const snippet = await readMemorySnippet(memory);\n    if (entry.memorySnippets.includes(snippet)) continue;\n    entry.memorySnippets.push(snippet);\n    entry.memorySnippetOrigins = [...(entry.memorySnippetOrigins ?? []), memory.frontmatter.origin];\n  }\n  // Each remaining phase is another synchronous pass over the whole index\n  // (alias map, native-chunk merge, sort, two full serializations). Yield between\n  // them so a section deadline can fire between passes instead of only after all\n  // of them (issue #2291).\n  await yieldEntityRecallScan(abortSignal);\n  const aliasIndex = buildAliasIndex([...entities.values()]);\n  for (const chunk of nativeChunks) {\n    const existingPseudo = entities.get(nativePseudoCanonicalId(chunk));\n    if (existingPseudo) {\n      mergeNativeChunk(existingPseudo, chunk);\n      continue;\n    }\n    const candidateAliases = uniqueStrings([chunk.title, ...(chunk.aliases ?? [])]).map(normalizeEntityText).filter(Boolean);\n    let matched = false;\n    for (const alias of candidateAliases) {\n      for (const entry of aliasIndex.get(alias) ?? []) {\n        mergeNativeChunk(entry, chunk);\n        matched = true;\n      }\n    }\n    if (matched) continue;\n    const pseudoEntry = createPseudoNativeEntry(chunk);\n    entities.set(pseudoEntry.canonicalId, pseudoEntry);\n  }\n\n  await yieldEntityRecallScan(abortSignal);\n  const sortedEntities = [...entities.values()].sort((left, right) => left.name.localeCompare(right.name));\n  await yieldEntityRecallScan(abortSignal);\n  const previousEntities = previousIndex ? JSON.stringify(previousIndex.entities) : \"\";\n  await yieldEntityRecallScan(abortSignal);\n  const nextEntities = JSON.stringify(sortedEntities);\n  const entityStatusVersionAfter = shouldPersistIndex ? storage.getMemoryStatusVersion() : undefined;\n  const canPersistIndex = shouldPersistIndex && entityStatusVersionBefore === entityStatusVersionAfter;\n  const index: EntityMentionIndex = {\n    version: ENTITY_INDEX_VERSION,\n    updatedAt:\n      previousIndex && previousEntities === nextEntities\n        ? previousIndex.updatedAt\n        : new Date().toISOString(),\n    entityStatusVersion: canPersistIndex ? entityStatusVersionAfter : undefined,\n    entities: sortedEntities,\n  };\n  if (canPersistIndex) {\n    // A build the caller has abandoned must not leave a persisted index behind:\n    // the write is I/O the timed-out recall no longer needs, and the next recall\n    // is already competing for the same disk.\n    checkEntityRecallAbort(abortSignal);\n    await writeEntityIndexState(storage, index);\n  }\n  return index;\n}\n\nfunction resolveExplicitCandidates(\n  index: EntityMentionIndex,\n  query: string,\n): EntityCandidate[] {\n  const candidates: EntityCandidate[] = [];\n  for (const entry of index.entities) {\n    const aliases = uniqueStrings([entry.name, ...entry.aliases]);\n    let bestAlias = \"\";\n    let bestScore = 0;\n    for (const alias of aliases) {\n      const score = scoreAliasMatch(query, alias);\n      if (score > bestScore) {\n        bestAlias = alias;\n        bestScore = score;\n      }\n    }\n    if (bestScore <= 0) continue;\n    candidates.push({ entry, alias: bestAlias, score: bestScore, source: \"query\" });\n  }\n  return candidates.sort((left, right) => right.score - left.score);\n}\n\nconst EXPLICIT_ENTITY_MENTION_SCORE = 9;\n\nconst IMPLICIT_ENTITY_STOP_WORDS = new Set([\n  \"a\",\n  \"an\",\n  \"and\",\n  \"are\",\n  \"as\",\n  \"at\",\n  \"be\",\n  \"by\",\n  \"can\",\n  \"do\",\n  \"for\",\n  \"from\",\n  \"has\",\n  \"how\",\n  \"i\",\n  \"if\",\n  \"in\",\n  \"is\",\n  \"it\",\n  \"me\",\n  \"my\",\n  \"of\",\n  \"on\",\n  \"or\",\n  \"the\",\n  \"to\",\n  \"was\",\n  \"what\",\n  \"when\",\n  \"where\",\n  \"who\",\n  \"why\",\n  \"with\",\n  \"you\",\n  \"your\",\n]);\n\nfunction isDistinctiveImplicitAlias(normalizedAlias: string): boolean {\n  const tokens = normalizedAlias.split(/\\s+/).filter(Boolean);\n  if (tokens.length > 1 && tokens.every((token) => IMPLICIT_ENTITY_STOP_WORDS.has(token))) return false;\n  if (tokens.length !== 1) return true;\n  const token = tokens[0]!;\n  return Array.from(token).length > 1 && !IMPLICIT_ENTITY_STOP_WORDS.has(token);\n}\n\nfunction isShortLatinAlias(alias: string): boolean {\n  return /^[A-Za-z]{2,3}$/.test(alias.trim());\n}\n\nfunction hasStrongShortLatinAliasMention(query: string, alias: string): boolean {\n  const normalizedAlias = alias.trim();\n  const titleCaseAlias = `${normalizedAlias[0]!.toUpperCase()}${normalizedAlias.slice(1).toLowerCase()}`;\n  const forms = new Set([normalizedAlias, normalizedAlias.toUpperCase(), titleCaseAlias]);\n  return [...forms].some((form) => {\n    if (form === form.toLowerCase()) return false;\n    const escaped = form.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\");\n    return new RegExp(`(?:^|[^A-Za-z0-9])${escaped}(?:$|[^A-Za-z0-9])`).test(query);\n  });\n}\n\nfunction resolveLanguageIndependentExplicitCandidates(\n  index: EntityMentionIndex,\n  query: string,\n): EntityCandidate[] {\n  const canonicalIdsByAlias = new Map<string, Set<string>>();\n  for (const entry of index.entities) {\n    for (const alias of uniqueStrings([entry.name, ...entry.aliases])) {\n      const normalizedAlias = normalizeEntityText(alias);\n      if (!normalizedAlias) continue;\n      const canonicalIds = canonicalIdsByAlias.get(normalizedAlias) ?? new Set<string>();\n      canonicalIds.add(entry.canonicalId);\n      canonicalIdsByAlias.set(normalizedAlias, canonicalIds);\n    }\n  }\n\n  const candidates: EntityCandidate[] = [];\n  for (const entry of index.entities) {\n    let bestAlias = \"\";\n    let bestScore = 0;\n    for (const alias of uniqueStrings([entry.name, ...entry.aliases])) {\n      const normalizedAlias = normalizeEntityText(alias);\n      const score = scoreAliasMatch(query, alias);\n      if (\n        !normalizedAlias ||\n        !isDistinctiveImplicitAlias(normalizedAlias) ||\n        (isShortLatinAlias(alias) && !hasStrongShortLatinAliasMention(query, alias)) ||\n        canonicalIdsByAlias.get(normalizedAlias)?.size !== 1 ||\n        score < EXPLICIT_ENTITY_MENTION_SCORE ||\n        score <= bestScore\n      ) {\n        continue;\n      }\n      bestAlias = alias;\n      bestScore = score;\n    }\n    if (bestAlias) {\n      candidates.push({ entry, alias: bestAlias, score: bestScore, source: \"query\" });\n    }\n  }\n\n  return candidates.sort(\n    (left, right) => right.score - left.score || left.entry.name.localeCompare(right.entry.name),\n  );\n}\n\nfunction resolveRecentTurnCandidates(\n  index: EntityMentionIndex,\n  transcriptEntries: TranscriptEntry[],\n  recentTurns: number,\n): EntityCandidate[] {\n  if (recentTurns <= 0 || transcriptEntries.length === 0) return [];\n  const recentEntries = transcriptEntries.slice(-recentTurns);\n  const candidates = new Map<string, EntityCandidate>();\n  for (let indexOffset = recentEntries.length - 1; indexOffset >= 0; indexOffset -= 1) {\n    const turn = recentEntries[indexOffset];\n    const recencyBoost = recentEntries.length - indexOffset;\n    const roleWeight = turn.role === \"user\" ? 2 : turn.role === \"assistant\" ? -1 : 0;\n    for (const entry of index.entities) {\n      const aliases = uniqueStrings([entry.name, ...entry.aliases]);\n      for (const alias of aliases) {\n        const score = scoreAliasMatch(turn.content, alias);\n        if (score <= 0) continue;\n        const current = candidates.get(entry.canonicalId);\n        const weightedScore = score + Math.max(0, 6 - recencyBoost) + roleWeight;\n        if (!current || weightedScore > current.score) {\n          candidates.set(entry.canonicalId, {\n            entry,\n            alias,\n            score: weightedScore,\n            source: \"recent_turn\",\n          });\n        }\n      }\n    }\n  }\n  return [...candidates.values()].sort((left, right) => right.score - left.score);\n}\n\nasync function readMemorySnippet(memory: MemoryFile): Promise<string> {\n  const content = memory.content.replace(/\\s+/g, \" \").trim();\n  return compactLine(content, 180);\n}\n\nasync function buildHintSnippets(\n  entry: EntityMentionIndexEntry,\n  queryTokens: string[],\n  mode: EntityQueryMode,\n  maxSupportingFacts: number,\n  requestedSectionKeys: Set<string>,\n): Promise<EntityHintSnippet[]> {\n  const snippets: EntityHintSnippet[] = [];\n  const aliasTokens = new Set(tokenize(uniqueStrings([entry.name, ...entry.aliases]).join(\" \")));\n  if (entry.summary) {\n    snippets.push({ text: compactLine(entry.summary, 180), score: 10, kind: \"summary\" });\n  }\n  if (requestedSectionKeys.size > 0) {\n    for (const section of entry.structuredSections) {\n      if (!requestedSectionKeys.has(normalizeEntityText(section.key).replace(/\\s+/g, \"_\"))) continue;\n      for (const [index, fact] of section.facts.entries()) {\n        snippets.push({\n          text: fact,\n          score: mode === \"direct\" ? 8 : 9,\n          kind: \"section\",\n          origin: section.factOrigins?.[index],\n        });\n      }\n    }\n  } else {\n    for (const [index, fact] of entry.timelineFacts.entries()) {\n      snippets.push({\n        text: fact,\n        score: mode === \"direct\" ? 6 : 7,\n        kind: \"fact\",\n        origin: entry.timelineFactOrigins?.[index],\n      });\n    }\n    for (const section of entry.structuredSections) {\n      for (const [index, fact] of section.facts.entries()) {\n        const normalizedFact = normalizeEntityText(fact);\n        const hasNonAliasQueryOverlap = queryTokens.some((token) =>\n          !aliasTokens.has(token) && normalizedFact.includes(token)\n        );\n        if (entry.timelineFacts.length > 0 && !hasNonAliasQueryOverlap) {\n          continue;\n        }\n        snippets.push({\n          text: fact,\n          score: mode === \"direct\" ? 6 : 7,\n          kind: \"fact\",\n          origin: section.factOrigins?.[index],\n        });\n      }\n    }\n    if (entry.timelineFacts.length === 0 && entry.structuredSections.length === 0) {\n      for (const fact of entry.facts) {\n        if (!fact.trim()) continue;\n        snippets.push({ text: fact, score: mode === \"direct\" ? 6 : 7, kind: \"fact\" });\n      }\n    }\n  }\n\n  if (requestedSectionKeys.size === 0) {\n    for (const relationship of entry.relationships) {\n      snippets.push({\n        text: compactLine(relationLine(entry, relationship), 180),\n        score: mode === \"direct\" && entry.type.toLowerCase() === \"person\" ? 6 : 4,\n        kind: \"relationship\",\n      });\n    }\n\n    for (const activity of entry.activity) {\n      snippets.push({\n        text: compactLine(`${activity.date}: ${activity.note}`, 180),\n        score: 4,\n        kind: \"activity\",\n      });\n    }\n\n    for (const [index, memorySnippet] of entry.memorySnippets.slice(0, Math.min(maxSupportingFacts, 4)).entries()) {\n      snippets.push({ text: memorySnippet, score: 5, kind: \"memory\", origin: entry.memorySnippetOrigins?.[index] });\n    }\n\n    for (const chunk of entry.nativeChunks) {\n      snippets.push({\n        text: compactLine(chunk.snippet, 180),\n        score: 3,\n        kind: \"native\",\n      });\n    }\n  }\n\n  const deduped = new Map<string, EntityHintSnippet>();\n  for (const snippet of snippets) {\n    const scored = scoreHintSnippet(snippet, queryTokens);\n    if (!scored) continue;\n    const normalized = normalizeEntityText(scored.text);\n    const existing = deduped.get(normalized);\n    if (!existing) {\n      deduped.set(normalized, scored);\n    } else if (existing.origin !== scored.origin) {\n      deduped.set(normalized, { ...(scored.score > existing.score ? scored : existing), origin: undefined });\n    } else if (scored.score > existing.score) {\n      deduped.set(normalized, scored);\n    }\n  }\n\n  return [...deduped.values()]\n    .filter((snippet) => snippet.score > 0)\n    .sort((left, right) => right.score - left.score)\n    .slice(0, maxSupportingFacts);\n}\n\nfunction summarizeUncertainty(snippets: EntityHintSnippet[]): string | null {\n  const direct = snippets.filter((snippet) =>\n    snippet.kind === \"summary\"\n    || snippet.kind === \"fact\"\n    || snippet.kind === \"section\"\n    || snippet.kind === \"memory\"\n  );\n  if (direct.length < 2) return null;\n  for (let index = 0; index < direct.length; index += 1) {\n    for (let compare = index + 1; compare < direct.length; compare += 1) {\n      if (jaccardSimilarity(direct[index].text, direct[compare].text) < 0.2) {\n        return \"Evidence is mixed across stored facts; treat the hints below as partial and verify before answering definitively.\";\n      }\n    }\n  }\n  return null;\n}\n\nfunction formatEntityHintSection(\n  candidates: Array<{\n    candidate: EntityCandidate;\n    snippets: EntityHintSnippet[];\n    uncertainty: string | null;\n  }>,\n  queryTokens: string[],\n  mode: EntityQueryMode,\n  maxRelatedEntities: number,\n  maxChars: number,\n  originAuthorityEnabled: boolean, untrustedOrigins: readonly string[],\n): string | null {\n  if (candidates.length === 0) return null;\n  const lines: string[] = [\"## entity_answer_hints\", \"\"];\n  // #1955 review: non-native snippet kinds may embed extraction-written content\n  // without per-field origin — fence as unknown (least privilege; plumbing #2397).\n  const renderSnippet = (snippet: EntityHintSnippet): string => snippet.kind !== \"native\"\n    ? renderAuthorityBoundContent(snippet.text, snippet.origin, { enabled: originAuthorityEnabled, untrustedOrigins }) : snippet.text;\n  // (see comment above)\n  // #1955 review: inline fields (names/types/aliases/targets) cannot carry the\n  // multi-line block fence without collapsing the hint list structure —\n  // per-field origin plumbing is tracked in #2397.\n  for (const { candidate, snippets, uncertainty } of candidates) {\n    const hasSummary = Boolean(candidate.entry.summary?.trim());\n    const preferredTopSnippets = hasSummary\n      ? snippets.filter((snippet) => snippet.kind !== \"fact\")\n      : snippets;\n    let topSnippets = (\n      preferredTopSnippets.length > 0 ? preferredTopSnippets : snippets\n    ).slice(0, 3);\n    const buildTimelineSnippets = (seedExcludedTexts: Set<string>): EntityHintSnippet[] => {\n      const explicitTimelinePool = dedupeHintSnippetsByText(\n        (candidate.entry.timeline ?? [])\n          .slice()\n          .sort(sortTimelineEntriesDesc)\n          .map((entry) => {\n            const text = sanitizeEntityFact(entry.text);\n            return text\n              ? scoreHintSnippet({\n                text: compactLine(text, 180),\n                score: 7,\n                kind: \"activity\" as const,\n                origin: entry.origin,\n              }, queryTokens)\n              : null;\n          })\n          .filter((snippet): snippet is EntityHintSnippet => snippet !== null)\n          .filter((snippet) => !seedExcludedTexts.has(normalizeEntityText(snippet.text))),\n      ).slice(0, 2);\n      const activityTimelinePool = dedupeHintSnippetsByText(\n        snippets\n          .filter((snippet) => (\n            snippet.kind === \"activity\" || snippet.kind === \"memory\"\n          ) && !seedExcludedTexts.has(normalizeEntityText(snippet.text))),\n      ).slice(0, 2);\n      return explicitTimelinePool.length > 0\n        ? explicitTimelinePool\n        : activityTimelinePool.length > 0\n          ? activityTimelinePool\n          : dedupeHintSnippetsByText(\n            snippets\n              .filter((snippet) => (\n                snippet.kind === \"fact\" || snippet.kind === \"summary\"\n              ) && !seedExcludedTexts.has(normalizeEntityText(snippet.text))),\n          ).slice(0, 2);\n    };\n    const baseTopSnippetTexts = new Set(topSnippets.map((snippet) => normalizeEntityText(snippet.text)));\n    const timelinePool = mode !== \"direct\" ? buildTimelineSnippets(baseTopSnippetTexts) : [];\n    if (mode !== \"direct\" && hasSummary && topSnippets.length < 2) {\n      if (timelinePool.length > 0) {\n        topSnippets = [...topSnippets, timelinePool[0]!].slice(0, 3);\n      }\n    }\n    const topSnippetTexts = new Set(topSnippets.map((snippet) => normalizeEntityText(snippet.text)));\n    lines.push(`- target: ${candidate.entry.name} (${candidate.entry.type})`);\n    lines.push(`- resolution: ${candidate.source === \"recent_turn\" ? \"carried forward from recent turns via alias\" : \"matched alias\"} \"${candidate.alias}\"${candidate.source === \"recent_turn\" ? \"\" : \" in the query\"}`);\n    if (uncertainty) lines.push(`- uncertainty: ${uncertainty}`);\n    if (topSnippets.length > 0) {\n      lines.push(\"- likely answer:\");\n      for (const snippet of topSnippets) {\n        lines.push(`  - ${renderSnippet(snippet)}`);\n      }\n    }\n    if (mode !== \"direct\") {\n      const fallbackTimeline = timelinePool.filter(\n        (snippet) => !topSnippetTexts.has(normalizeEntityText(snippet.text)),\n      );\n      if (fallbackTimeline.length > 0) {\n        lines.push(\"- recent timeline:\");\n        for (const snippet of fallbackTimeline) {\n          lines.push(`  - ${renderSnippet(snippet)}`);\n        }\n      }\n    }\n    const related = candidate.entry.relationships.slice(0, maxRelatedEntities).map((relationship) => relationship.target);\n    if (related.length > 0) {\n      lines.push(`- related entities: ${related.join(\", \")}`);\n    }\n    lines.push(`- support counts: facts=${candidate.entry.factCount}, memories=${candidate.entry.memorySnippets.length}, native=${candidate.entry.nativeChunks.length}`);\n    lines.push(\"\");\n  }\n\n  let result = lines.join(\"\\n\");\n  if (result.length > maxChars) {\n    result = `${truncateGraphemeSafe(result, Math.max(0, maxChars - 15)).trimEnd()}\\n\\n...(trimmed)\\n`;\n  }\n  return result.trim().length > 0 ? result.trimEnd() : null;\n}\n\nexport async function buildEntityRecallSection(options: BuildEntityRecallSectionOptions): Promise<string | null> {\n  // Checkpoints sit at the real I/O boundaries below (persisted-index read,\n  // native-chunk read, storage resolution, index build).  The per-candidate\n  // formatting that follows never awaits real I/O, so a deadline that fires\n  // during a scan is observed here (issue #2291).\n  checkEntityRecallAbort(options.abortSignal);\n  const prefixedMode = detectEntityQueryMode(options.query);\n  // #2193: in zero-pronoun scripts a short question with no entity name\n  // never trips a pronoun word list, so the structural signal routes it\n  // into the same coreference path as an English \"what about him?\".\n  // Latin-script queries stay on the cue tables / English rules so the\n  // generic technical-question guard keeps working. Resolution gates.\n  const structuralFollowUp = prefixedMode === null\n    && isStructuralEntityFollowUpQuery(\n      options.query,\n      options.recentTurns > 0 && options.transcriptEntries.length > 0,\n    );\n  const earlyMode = prefixedMode ?? (structuralFollowUp ? \"follow_up\" : null);\n  const persistedIndex = earlyMode\n    ? null\n    : await readCurrentPersistedEntityIndex(\n      options.storage,\n      options.config,\n      options.recallNamespaces,\n      options.namespaceStorage,\n    );\n  checkEntityRecallAbort(options.abortSignal);\n  let nativeChunks: NativeKnowledgeChunk[] | undefined;\n  if (\n    !earlyMode &&\n    persistedIndex &&\n    resolveLanguageIndependentExplicitCandidates(persistedIndex, options.query).length === 0\n  ) {\n    nativeChunks = await readNativeChunks(options.config, options.recallNamespaces);\n    if (!hasFreshNativeExplicitMention(persistedIndex, nativeChunks, options.query)) {\n      return entityRecallSectionAbsent(options.abortSignal);\n    }\n  }\n  const namespaceScoped =\n    resolveNamespaceCapabilities(options.config).namespaces &&\n    options.namespaceStorage !== undefined &&\n    (options.recallNamespaces?.length ?? 0) > 0;\n  if (namespaceScoped) {\n    nativeChunks = await readNativeChunks(options.config, options.recallNamespaces);\n  }\n  const resolvedStorages = namespaceScoped\n    ? await resolveEntityIndexStorages(\n      options.storage,\n      options.config,\n      options.recallNamespaces,\n      options.namespaceStorage,\n    )\n    : undefined;\n  const namespaceCacheKey =\n    resolvedStorages && options.recallNamespaces && nativeChunks\n      ? namespaceEntityIndexCacheKey(\n        resolvedStorages,\n        options.recallNamespaces,\n        nativeEntityIndexRevision(nativeChunks),\n      )\n      : undefined;\n  let index: EntityMentionIndex | undefined = namespaceCacheKey\n    ? namespaceEntityIndexCache.get(namespaceCacheKey)\n    : undefined;\n  checkEntityRecallAbort(options.abortSignal);\n  if (!index) {\n    index = await buildEntityMentionIndex(\n      options.storage,\n      options.config,\n      options.recallNamespaces,\n      options.namespaceStorage,\n      nativeChunks,\n      resolvedStorages,\n      options.abortSignal,\n    );\n    if (namespaceCacheKey) rememberNamespaceEntityIndex(namespaceCacheKey, index);\n  }\n  // Candidate resolution is another synchronous pass over every entity and alias,\n  // reached even on a cache hit that did no I/O at all — so yield here too, or a\n  // cached corpus could still hold the loop past the section budget (issue #2291).\n  await yieldEntityRecallScan(options.abortSignal);\n  const explicitCandidates = resolveExplicitCandidates(index, options.query);\n  await yieldEntityRecallScan(options.abortSignal);\n  const queryCandidates = prefixedMode\n    ? explicitCandidates\n    : resolveLanguageIndependentExplicitCandidates(index, options.query);\n  if (\n    queryCandidates.length === 0\n    && /^what does (?:this|that|it|the|a|an|my|our|your|their)\\b/i.test(normalizeEntityText(options.query))\n  ) {\n    return entityRecallSectionAbsent(options.abortSignal);\n  }\n\n  // Explicit mentions keep #2161 behavior (direct mode) even when the\n  // structural follow-up signal also fired; only name-less short questions\n  // fall through to coreference.\n  const mode = prefixedMode\n    ?? (queryCandidates.length > 0\n      ? \"direct\"\n      : structuralFollowUp\n        ? \"follow_up\"\n        : null);\n  if (!mode) return entityRecallSectionAbsent(options.abortSignal);\n\n  const candidates = queryCandidates.length > 0\n    ? queryCandidates\n    : resolveRecentTurnCandidates(index, options.transcriptEntries, options.recentTurns);\n\n  if (candidates.length === 0) return entityRecallSectionAbsent(options.abortSignal);\n\n  const queryTokens = tokenize(options.query);\n  const candidateLimit = queryCandidates.length === 0 && mode === \"follow_up\"\n    ? 1\n    : options.maxHints;\n  const rankedCandidates = candidates.slice(0, candidateLimit);\n  const enriched = await Promise.all(\n    rankedCandidates.map(async (candidate) => {\n      const requestedSectionKeys = new Set(\n        resolveRequestedEntitySectionKeys(\n          options.query,\n          candidate.entry.type,\n          candidate.entry.structuredSections,\n          options.config.entitySchemas,\n        ),\n      );\n      const snippets = await buildHintSnippets(\n        candidate.entry,\n        queryTokens,\n        mode,\n        options.maxSupportingFacts,\n        requestedSectionKeys,\n      );\n      return {\n        candidate,\n        snippets,\n        uncertainty: summarizeUncertainty(snippets),\n      };\n    }),\n  );\n\n  const section = formatEntityHintSection(\n    enriched,\n    queryTokens,\n    mode,\n    options.maxRelatedEntities,\n    options.maxChars,\n    options.originAuthorityEnabled === true,\n    options.untrustedOrigins ?? [],\n  );\n  // `entityRecallSectionAbsent` so a cancelled build is not recorded as a\n  // successful section that simply found no entities.\n  if (!section) return entityRecallSectionAbsent(options.abortSignal);\n  return section;\n}\n\nexport async function readRecentEntityTranscriptEntries(\n  transcriptEntriesPromise: Promise<TranscriptEntry[]>,\n  recentTurns: number,\n): Promise<TranscriptEntry[]> {\n  if (recentTurns <= 0) return [];\n  const transcriptEntries = await transcriptEntriesPromise.catch(() => []);\n  if (transcriptEntries.length === 0) return [];\n  return transcriptEntries.slice(-Math.max(1, recentTurns * 2));\n}\n\nexport const entityIndexVersion = ENTITY_INDEX_VERSION;\nexport const entityRecentTranscriptLookbackHours = RECENT_TRANSCRIPT_LOOKBACK_HOURS;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,SAAS,kBAAkB;AAE3B,SAAS,OAAO,UAAU,iBAAiB;AAC3C,OAAO,UAAU;AAmBjB,IAAM,uBAAuB;AAC7B,IAAM,mCAAmC;AACzC,IAAM,sBAAsB;AAC5B,IAAM,sBAAsB;AAC5B,IAAM,4BAA4B;AAClC,IAAM,wBAAwB;AAsE9B,SAAS,SAAS,OAAyB;AACzC,SAAO,oBAAoB,KAAK,EAAE,MAAM,KAAK,EAAE,OAAO,CAAC,UAAU,MAAM,UAAU,CAAC;AACpF;AACA,SAAS,cAAc,QAA4B;AACjD,SAAO,CAAC,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,EAAE,OAAO,CAAC,UAAU,MAAM,SAAS,CAAC,CAAC,CAAC;AAC7F;AACA,SAAS,YAAY,OAAe,YAAoB,KAAa;AACnE,QAAM,aAAa,MAAM,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACnD,MAAI,WAAW,UAAU,UAAW,QAAO;AAC3C,SAAO,GAAG,qBAAqB,YAAY,YAAY,CAAC,EAAE,QAAQ,CAAC;AACrE;AACA,SAAS,yBAAyB,UAAoD;AACpF,QAAM,UAAU,oBAAI,IAA+B;AACnD,aAAW,WAAW,UAAU;AAC9B,UAAM,MAAM,oBAAoB,QAAQ,IAAI;AAC5C,UAAM,WAAW,QAAQ,IAAI,GAAG;AAChC,QAAI,CAAC,UAAU;AACb,cAAQ,IAAI,KAAK,OAAO;AACxB;AAAA,IACF;AACA,QAAI,SAAS,WAAW,QAAQ,QAAQ;AACtC,eAAS,SAAS;AAAA,IACpB;AAAA,EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC;AAC7B;AACA,SAAS,sBAAsB,SAAwD;AACrF,SAAO,oBAAoB,QAAQ,GAAG,EAAE,QAAQ,QAAQ,GAAG,MAAM;AACnE;AACA,SAAS,qBAAqB,UAAkD;AAC9E,QAAM,OAAO,oBAAI,IAAY;AAC7B,aAAW,WAAW,UAAU;AAC9B,QAAI,CAAC,sBAAsB,OAAO,EAAG;AACrC,eAAW,QAAQ,QAAQ,OAAO;AAChC,WAAK,IAAI,oBAAoB,IAAI,CAAC;AAAA,IACpC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gCAAgC,SAAwD;AAC/F,MAAI,CAAC,sBAAsB,OAAO,GAAG;AACnC,WAAO,QAAQ,MAAM,IAAI,CAAC,MAAM,iBAAiB,EAAE,MAAM,YAAY,EAAE;AAAA,EACzE;AACA,SAAO,mCAAmC,QAAQ,KAAK;AACzD;AACA,SAAS,mCAAmC,OAAuC;AACjF,QAAM,UAAU,oBAAI,IAAkF;AACtG,aAAW,CAAC,aAAa,IAAI,KAAK,MAAM,QAAQ,GAAG;AACjD,UAAM,QAAQ,sBAAsB,KAAK,KAAK,KAAK,CAAC;AACpD,QAAI,CAAC,MAAO;AACZ,UAAM,CAAC,EAAE,SAAS,QAAQ,WAAW,IAAI,IAAI;AAC7C,UAAM,cAAc,KAAK,MAAM,SAAS;AACxC,QAAI,CAAC,SAAS,KAAK,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,OAAO,SAAS,WAAW,KAAK,CAAC,MAAM,KAAK,EAAG;AAC3F,UAAM,mBAAmB,OAAO,KAAK,EAAE,YAAY;AACnD,UAAM,oBAAoB,QAAQ,KAAK;AACvC,UAAM,UAAU,QAAQ,IAAI,iBAAiB;AAC7C,UAAM,kBACJ,WACA,gBAAgB,QAAQ,eACxB,QAAQ,WAAW,YACnB,qBAAqB;AACvB,QAAI,CAAC,WAAW,cAAc,QAAQ,eAAe,iBAAiB;AACpE,cAAQ,IAAI,mBAAmB,EAAE,QAAQ,kBAAkB,aAAa,OAAO,CAAC,EAAE,MAAM,KAAK,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC;AACrH;AAAA,IACF;AACA,QAAI,gBAAgB,QAAQ,eAAe,QAAQ,WAAW,kBAAkB;AAC9E,cAAQ,MAAM,KAAK,EAAE,MAAM,KAAK,KAAK,GAAG,YAAY,CAAC;AAAA,IACvD;AAAA,EACF;AACA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,EAAE,QAAQ,CAAC,YAAY,QAAQ,WAAW,WAAW,QAAQ,QAAQ,CAAC,CAAC;AACpG;AACA,SAAS,aAAa,OAAgC,cAAyD;AAC7G,QAAM,kBAAkB,aAAa,MAAM,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACrE,MAAI,gBAAgB,WAAW,EAAG,QAAO,GAAG,MAAM,IAAI,oBAAoB,aAAa,MAAM;AAC7F,SAAO,GAAG,MAAM,IAAI,IAAI,eAAe,IAAI,aAAa,MAAM;AAChE;AACA,SAAS,gBAAgB,OAAe,OAAuB;AAC7D,QAAM,kBAAkB,oBAAoB,KAAK;AACjD,QAAM,kBAAkB,oBAAoB,KAAK;AACjD,MAAI,CAAC,gBAAiB,QAAO;AAC7B,MAAI,oBAAoB,gBAAiB,QAAO;AAChD,MAAI,eAAe,iBAAiB,eAAe,EAAG,QAAO,IAAI,KAAK,IAAI,gBAAgB,MAAM,KAAK,EAAE,QAAQ,CAAC;AAChH,QAAM,cAAc,IAAI,IAAI,SAAS,eAAe,CAAC;AACrD,QAAM,cAAc,SAAS,eAAe;AAC5C,MAAI,YAAY,WAAW,EAAG,QAAO;AACrC,QAAM,UAAU,YAAY,OAAO,CAAC,UAAU,YAAY,IAAI,KAAK,CAAC,EAAE;AACtE,MAAI,YAAY,EAAG,QAAO;AAgB1B,MAAI,YAAY,SAAS,GAAG;AAC1B,UAAM,kBAAkB,YAAY;AAAA,MAClC,CAAC,UAAU,YAAY,IAAI,KAAK,KAAK,CAAC,kBAAkB,KAAK;AAAA,IAC/D,EAAE;AACF,QAAI,oBAAoB,EAAG,QAAO;AAAA,EACpC;AACA,SAAO;AACT;AAWA,IAAM,qBAAqB,oBAAI,IAAY;AAAA,EACzC;AAAA,EAAU;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAC7C;AAAA,EAAW;AAAA,EAAY;AAAA,EAAS;AAAA,EAChC;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAgB;AAAA,EAAiB;AAAA,EAAW;AAAA,EAC3D;AAAA,EAAS;AAAA,EAAU;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAW;AAAA,EAC/C;AAAA,EAAU;AAAA,EAAW;AAAA,EAAS;AAAA,EAAU;AAAA,EAAO;AACjD,CAAC;AACD,SAAS,kBAAkB,OAAwB;AACjD,SAAO,mBAAmB,IAAI,KAAK;AACrC;AACA,SAAS,wBAAwB,OAAwB;AACvD,SAAO,oBAAoB,KAAK,KAAK,KAAK,oBAAoB,KAAK,KAAK;AAC1E;AACA,SAAS,mBAAmB,MAAsB;AAChD,QAAM,YAAY,sBAAsB,IAAI;AAC5C,QAAM,QAAQ,UAAU,KAAK,KAAK;AAClC,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,oBAAoB,KAAK,KAAK,KAAK,MAAM,SAAS,IAAK,QAAO;AAClE,SAAO;AACT;AACA,SAAS,iBAAiB,SAA4B,aAAiD;AACrG,QAAM,aAAa,oBAAoB,QAAQ,IAAI;AACnD,MAAI,CAAC,WAAY,QAAO;AACxB,QAAM,SAAS,EAAE,GAAG,QAAQ;AAC5B,MAAI,wBAAwB,OAAO,IAAI,KAAK,OAAO,SAAS,WAAW;AACrE,WAAO,SAAS;AAAA,EAClB;AACA,QAAM,UAAU,YAAY,OAAO,CAAC,UAAU,WAAW,SAAS,KAAK,CAAC,EAAE;AAC1E,SAAO,SAAS,UAAU;AAC1B,MAAI,oBAAoB,KAAK,OAAO,IAAI,EAAG,QAAO,SAAS;AAC3D,MAAI,OAAO,KAAK,UAAU,IAAK,QAAO,SAAS;AAC/C,SAAO,OAAO,QAAQ,IAAI,SAAS;AACrC;AACA,SAAS,wBACP,MACA,OACQ;AACR,QAAM,iBAAiB,wBAAwB,MAAM,WAAW,KAAK,SAAS;AAC9E,MAAI,mBAAmB,GAAG;AACxB,WAAO;AAAA,EACT;AACA,SAAO,MAAM,KAAK,cAAc,KAAK,IAAI;AAC3C;AACA,SAAS,kBAAkB,GAAW,GAAmB;AACvD,QAAM,UAAU,IAAI,IAAI,SAAS,CAAC,CAAC;AACnC,QAAM,UAAU,IAAI,IAAI,SAAS,CAAC,CAAC;AACnC,MAAI,QAAQ,SAAS,KAAK,QAAQ,SAAS,EAAG,QAAO;AACrD,MAAI,eAAe;AACnB,aAAW,SAAS,SAAS;AAC3B,QAAI,QAAQ,IAAI,KAAK,EAAG,iBAAgB;AAAA,EAC1C;AACA,QAAM,SAAQ,oBAAI,IAAI,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,GAAE;AAChD,SAAO,UAAU,IAAI,IAAI,eAAe;AAC1C;AACA,SAAS,gBAAgB,SAA4E;AACnG,QAAM,QAAQ,oBAAI,IAAuC;AACzD,aAAW,SAAS,SAAS;AAC3B,UAAM,UAAU,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,EAAE,IAAI,mBAAmB,EAAE,OAAO,OAAO;AACrG,eAAW,SAAS,SAAS;AAC3B,YAAM,WAAW,MAAM,IAAI,KAAK,KAAK,CAAC;AACtC,eAAS,KAAK,KAAK;AACnB,YAAM,IAAI,OAAO,QAAQ;AAAA,IAC3B;AAAA,EACF;AACA,SAAO;AACT;AACA,eAAe,iBACb,QACA,kBACiC;AACjC,MAAI,CAAC,OAAO,iBAAiB,QAAS,QAAO,CAAC;AAC9C,SAAO,6BAA6B;AAAA,IAClC,cAAc,OAAO;AAAA,IACrB,WAAW,OAAO;AAAA,IAClB,QAAQ,OAAO;AAAA,IACf,kBAAkB,6BAA6B,MAAM,EAAE,aAAa,mBAAmB;AAAA,IACvF,kBAAkB,OAAO;AAAA,EAC3B,CAAC,EAAE,MAAM,MAAM,CAAC,CAAC;AACnB;AACA,eAAe,2BACb,SACA,QACA,kBACA,kBAC2B;AAC3B,MACE,CAAC,6BAA6B,MAAM,EAAE,cACtC,CAAC,oBACD,CAAC,oBACD,iBAAiB,WAAW,GAC5B;AACA,WAAO,CAAC,OAAO;AAAA,EACjB;AACA,QAAM,WAA6B,CAAC;AACpC,QAAM,WAAW,oBAAI,IAAY;AACjC,aAAW,aAAa,cAAc,gBAAgB,GAAG;AACvD,QAAI;AACF,YAAM,gBAAgB,MAAM,iBAAiB,SAAS;AACtD,YAAM,aAAa,KAAK,QAAQ,cAAc,GAAG;AACjD,UAAI,SAAS,IAAI,UAAU,EAAG;AAC9B,eAAS,IAAI,UAAU;AACvB,eAAS,KAAK,aAAa;AAAA,IAC7B,QAAQ;AACN;AAAA,IACF;AAAA,EACF;AACA,SAAO,SAAS,SAAS,IAAI,WAAW,CAAC,OAAO;AAClD;AACA,SAAS,qBAAqB,SAAiC;AAC7D,SAAO,KAAK,KAAK,QAAQ,KAAK,SAAS,2BAA2B;AACpE;AAEA,eAAe,qBAAqB,SAA6D;AAC/F,QAAM,MAAM,MAAM,SAAS,qBAAqB,OAAO,GAAG,OAAO,EAAE,MAAM,MAAM,EAAE;AACjF,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,YAAY,wBAAwB,CAAC,MAAM,QAAQ,OAAO,QAAQ,EAAG,QAAO;AACvF,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AACA,eAAe,gCACb,SACA,QACA,kBACA,kBACoC;AACpC,MACE,6BAA6B,MAAM,EAAE,cACrC,oBACA,oBACA,iBAAiB,SAAS,GAC1B;AACA,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,MAAM,qBAAqB,OAAO;AAChD,MAAI,CAAC,SAAS,MAAM,wBAAwB,QAAQ,uBAAuB,GAAG;AAC5E,WAAO;AAAA,EACT;AACA,SAAO;AACT;AACA,IAAM,4BAA4B,oBAAI,IAAgC;AACtE,IAAM,2CAA2C;AAEjD,SAAS,0BAA0B,QAAwC;AACzE,QAAM,aAAa,OAAO,IAAI,CAAC,UAAU;AAAA,IACvC,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,cAAc,MAAM,WAAW,CAAC,CAAC;AAAA,IACjC,YAAY,MAAM,SAAS,GAAG;AAAA,IAC9B,MAAM,eAAe;AAAA,EACvB,CAAC;AACD,SAAO,WAAW,QAAQ,EAAE,OAAO,KAAK,UAAU,UAAU,CAAC,EAAE,OAAO,KAAK;AAC7E;AACA,SAAS,6BACP,UACA,kBACA,gBACQ;AACR,QAAM,eAAe,cAAc,gBAAgB,EAAE,KAAK,GAAQ;AAClE,QAAM,aAAa,SAChB,IAAI,CAAC,kBAAkB;AACtB,UAAM,UAAU,OAAO,QAAQ,cAAc,aAAa,EACvD,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,KAAK,MAAM,KAAK,cAAc,KAAK,CAAC;AACtD,WACE,GAAG,KAAK,QAAQ,cAAc,GAAG,CAAC,IAAI,cAAc,uBAAuB,CAAC,IACxE,cAAc,uBAAuB,CAAC,IAAI,cAAc,yBAAyB,CAAC,IAClF,cAAc,cAAc,CAAC,IAAI,KAAK,UAAU,OAAO,CAAC;AAAA,EAEhE,CAAC,EACA,KAAK,GAAQ;AAChB,SAAO,GAAG,YAAY,IAAS,UAAU,IAAS,cAAc;AAClE;AACA,SAAS,6BAA6B,KAAa,OAAiC;AAClF,MAAI,0BAA0B,QAAQ,0CAA0C;AAC9E,UAAM,YAAY,0BAA0B,KAAK,EAAE,KAAK,EAAE;AAC1D,QAAI,OAAO,cAAc,SAAU,2BAA0B,OAAO,SAAS;AAAA,EAC/E;AACA,4BAA0B,IAAI,KAAK,KAAK;AAC1C;AAEA,eAAe,sBAAsB,SAAyB,OAA0C;AACtG,QAAM,YAAY,qBAAqB,OAAO;AAC9C,QAAM,MAAM,KAAK,QAAQ,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AACxD,QAAM,cAAc,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI;AACrD,QAAM,iBAAiB,MAAM,SAAS,WAAW,OAAO,EAAE,MAAM,MAAM,EAAE;AACxE,MAAI,mBAAmB,YAAa;AACpC,QAAM,UAAU,WAAW,aAAa,OAAO;AACjD;AAEA,SAAS,wBAAwB,OAAqC;AACpE,SAAO,UAAU,WAAW,QAAQ,EAAE,OAAO,MAAM,UAAU,EAAE,OAAO,KAAK,EAAE,MAAM,GAAG,EAAE,CAAC;AAC3F;AAEA,SAAS,wBAAwB,OAAsD;AACrF,QAAM,cAAc,wBAAwB,KAAK;AACjD,SAAO;AAAA,IACL;AAAA,IACA,MAAM,MAAM;AAAA,IACZ,MAAM,MAAM;AAAA,IACZ,SAAS,cAAc,MAAM,WAAW,CAAC,CAAC;AAAA,IAC1C,OAAO,CAAC;AAAA,IACR,oBAAoB,CAAC;AAAA,IACrB,eAAe,CAAC;AAAA,IAChB,UAAU,CAAC;AAAA,IACX,eAAe,CAAC;AAAA,IAChB,UAAU,CAAC;AAAA,IACX,WAAW;AAAA,IACX,gBAAgB,CAAC;AAAA,IACjB,cAAc;AAAA,MACZ;AAAA,QACE,SAAS,MAAM;AAAA,QACf,OAAO,MAAM;AAAA,QACb,YAAY,MAAM;AAAA,QAClB,YAAY,MAAM;AAAA,QAClB,SAAS,YAAY,MAAM,SAAS,GAAG;AAAA,QACvC,aAAa,MAAM;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,iBAAiB,OAAgC,OAAmC;AAC3F,QAAM,WAAW,MAAM,aAAa,KAAK,CAAC,SAAS,KAAK,YAAY,MAAM,OAAO;AACjF,MAAI,SAAU;AACd,QAAM,aAAa,KAAK;AAAA,IACtB,SAAS,MAAM;AAAA,IACf,OAAO,MAAM;AAAA,IACb,YAAY,MAAM;AAAA,IAClB,YAAY,MAAM;AAAA,IAClB,SAAS,YAAY,MAAM,SAAS,GAAG;AAAA,IACvC,aAAa,MAAM;AAAA,EACrB,CAAC;AACD,QAAM,UAAU,cAAc,CAAC,GAAG,MAAM,SAAS,GAAI,MAAM,WAAW,CAAC,CAAE,CAAC;AAC5E;AAEA,SAAS,8BACP,OACA,cACA,OACS;AACT,MAAI,aAAa,WAAW,EAAG,QAAO;AACtC,QAAM,qBAAqB,IAAI,IAAI,aAAa,IAAI,uBAAuB,CAAC;AAC5E,QAAM,mBAAuC;AAAA,IAC3C,GAAG;AAAA,IACH,UAAU;AAAA,MACR,GAAG,MAAM,SAAS,OAAO,CAAC,UAAU,CAAC,mBAAmB,IAAI,MAAM,WAAW,CAAC;AAAA,MAC9E,GAAG,aAAa,IAAI,uBAAuB;AAAA,IAC7C;AAAA,EACF;AACA,SAAO,6CAA6C,kBAAkB,KAAK,EAAE,SAAS;AACxF;AAEA,eAAe,wBACb,SACA,QACA,kBACA,kBACA,sBACA,kBACA,aAC6B;AAC7B,yBAAuB,WAAW;AAClC,QAAM,WAAW,oBAAoB,MAAM;AAAA,IACzC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,QAAM,qBACJ,SAAS,WAAW,KAAK,KAAK,QAAQ,SAAS,CAAC,EAAG,GAAG,MAAM,KAAK,QAAQ,QAAQ,GAAG;AACtF,QAAM,4BAA4B,qBAAqB,QAAQ,uBAAuB,IAAI;AAC1F,QAAM,CAAC,eAAe,gBAAgB,YAAY,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,IAClF,qBAAqB,qBAAqB,OAAO,IAAI,QAAQ,QAAQ,IAAI;AAAA,IACzE,QAAQ,IAAI,SAAS,IAAI,CAAC,kBAAkB,cAAc,mBAAmB,EAAE,YAAY,CAAC,CAAC,CAAC;AAAA,IAC9F,QAAQ,IAAI,SAAS,IAAI,CAAC,kBAAkB,cAAc,gBAAgB,EAAE,YAAY,CAAC,CAAC,CAAC;AAAA,IAC3F,uBAAuB,QAAQ,QAAQ,oBAAoB,IAAI,iBAAiB,QAAQ,gBAAgB;AAAA,EAC1G,CAAC;AAGD,yBAAuB,WAAW;AAIlC,QAAM,gBAAgB,eAAe;AAAA,IAAQ,CAAC,KAAKA,WACjD,IAAI,IAAI,CAAC,YAAY,EAAE,QAAQ,SAAS,SAASA,MAAK,EAAG,EAAE;AAAA,EAC7D;AACA,QAAM,WAAW,WAAW,KAAK;AAKjC,MAAI,UAAU;AACd,QAAM,WAAW,oBAAI,IAAqC;AAC1D,aAAW,EAAE,QAAQ,SAAS,cAAc,KAAK,eAAe;AAC9D,eAAW;AACX,UAAM,2BAA2B,SAAS,WAAW;AACrD,UAAM,cACJ,OAAO,cAAc,wBAAwB,aACzC,cAAc,oBAAoB,OAAO,MAAM,OAAO,IAAI,IAC1D,oBAAoB,OAAO,MAAM,OAAO,MAAM,cAAc,aAAa;AAC/E,UAAM,wBAAwB,OAAO,sBAAsB,CAAC;AAC5D,UAAM,0BAA0B,qBAAqB,qBAAqB;AAC1E,UAAM,iBAAiB,OAAO,MAC3B,IAAI,CAAC,SAAS,mBAAmB,IAAI,CAAC,EACtC,OAAO,OAAO,EACd,OAAO,CAAC,SAAS,CAAC,wBAAwB,IAAI,oBAAoB,IAAI,CAAC,CAAC,EACxE,IAAI,CAAC,SAAS,YAAY,MAAM,GAAG,CAAC;AACvC,UAAM,EAAE,OAAO,eAAe,SAAS,oBAAoB,IAAI;AAAA,MAC7D,OAAO;AAAA,MACP;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,UAAM,qBAAqB;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,aAAS,IAAI,aAAa;AAAA,MACxB;AAAA,MACA,MAAM,OAAO;AAAA,MACb,MAAM,OAAO;AAAA,MACb,SAAS,cAAc,OAAO,OAAO;AAAA,MACrC,SAAS,OAAO,WAAW,KAAK,KAAK,OAAO,SAAS,KAAK,KAAK;AAAA,MAC/D,OAAO;AAAA,MACP;AAAA,MACA,GAAI,oBAAoB,KAAK,CAAC,WAAW,WAAW,MAAS,IAAI,EAAE,oBAAoB,IAAI,CAAC;AAAA,MAC5F;AAAA,MACA,UAAU,OAAO,SAAS,IAAI,CAAC,WAAW,EAAE,GAAG,MAAM,EAAE;AAAA,MACvD,eAAe,OAAO,cAAc,IAAI,CAAC,kBAAkB,EAAE,GAAG,aAAa,EAAE;AAAA,MAC/E,UAAU,OAAO,SAAS,IAAI,CAAC,cAAc,EAAE,GAAG,SAAS,EAAE;AAAA,MAC7D,WAAW,eAAe;AAAA,MAC1B,gBAAgB,CAAC;AAAA,MACjB,cAAc,CAAC;AAAA,IACjB,CAAC;AAAA,EACH;AAEA,YAAU;AACV,aAAW,UAAU,UAAU;AAC7B,eAAW;AACX,UAAM,2BAA2B,SAAS,WAAW;AACrD,UAAM,QAAQ,OAAO,OAAO,YAAY,cAAc,WAAW,SAAS,IAAI,OAAO,YAAY,SAAS,IAAI;AAC9G,QAAI,CAAC,MAAO;AACZ,UAAM,UAAU,MAAM,kBAAkB,MAAM;AAC9C,QAAI,MAAM,eAAe,SAAS,OAAO,EAAG;AAC5C,UAAM,eAAe,KAAK,OAAO;AACjC,UAAM,uBAAuB,CAAC,GAAI,MAAM,wBAAwB,CAAC,GAAI,OAAO,YAAY,MAAM;AAAA,EAChG;AAKA,QAAM,sBAAsB,WAAW;AACvC,QAAM,aAAa,gBAAgB,CAAC,GAAG,SAAS,OAAO,CAAC,CAAC;AACzD,aAAW,SAAS,cAAc;AAChC,UAAM,iBAAiB,SAAS,IAAI,wBAAwB,KAAK,CAAC;AAClE,QAAI,gBAAgB;AAClB,uBAAiB,gBAAgB,KAAK;AACtC;AAAA,IACF;AACA,UAAM,mBAAmB,cAAc,CAAC,MAAM,OAAO,GAAI,MAAM,WAAW,CAAC,CAAE,CAAC,EAAE,IAAI,mBAAmB,EAAE,OAAO,OAAO;AACvH,QAAI,UAAU;AACd,eAAW,SAAS,kBAAkB;AACpC,iBAAW,SAAS,WAAW,IAAI,KAAK,KAAK,CAAC,GAAG;AAC/C,yBAAiB,OAAO,KAAK;AAC7B,kBAAU;AAAA,MACZ;AAAA,IACF;AACA,QAAI,QAAS;AACb,UAAM,cAAc,wBAAwB,KAAK;AACjD,aAAS,IAAI,YAAY,aAAa,WAAW;AAAA,EACnD;AAEA,QAAM,sBAAsB,WAAW;AACvC,QAAM,iBAAiB,CAAC,GAAG,SAAS,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC;AACvG,QAAM,sBAAsB,WAAW;AACvC,QAAM,mBAAmB,gBAAgB,KAAK,UAAU,cAAc,QAAQ,IAAI;AAClF,QAAM,sBAAsB,WAAW;AACvC,QAAM,eAAe,KAAK,UAAU,cAAc;AAClD,QAAM,2BAA2B,qBAAqB,QAAQ,uBAAuB,IAAI;AACzF,QAAM,kBAAkB,sBAAsB,8BAA8B;AAC5E,QAAM,QAA4B;AAAA,IAChC,SAAS;AAAA,IACT,WACE,iBAAiB,qBAAqB,eAClC,cAAc,aACd,oBAAI,KAAK,GAAE,YAAY;AAAA,IAC7B,qBAAqB,kBAAkB,2BAA2B;AAAA,IAClE,UAAU;AAAA,EACZ;AACA,MAAI,iBAAiB;AAInB,2BAAuB,WAAW;AAClC,UAAM,sBAAsB,SAAS,KAAK;AAAA,EAC5C;AACA,SAAO;AACT;AAEA,SAAS,0BACP,OACA,OACmB;AACnB,QAAM,aAAgC,CAAC;AACvC,aAAW,SAAS,MAAM,UAAU;AAClC,UAAM,UAAU,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC;AAC5D,QAAI,YAAY;AAChB,QAAI,YAAY;AAChB,eAAW,SAAS,SAAS;AAC3B,YAAM,QAAQ,gBAAgB,OAAO,KAAK;AAC1C,UAAI,QAAQ,WAAW;AACrB,oBAAY;AACZ,oBAAY;AAAA,MACd;AAAA,IACF;AACA,QAAI,aAAa,EAAG;AACpB,eAAW,KAAK,EAAE,OAAO,OAAO,WAAW,OAAO,WAAW,QAAQ,QAAQ,CAAC;AAAA,EAChF;AACA,SAAO,WAAW,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AAClE;AAEA,IAAM,gCAAgC;AAEtC,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;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;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;AAED,SAAS,2BAA2B,iBAAkC;AACpE,QAAM,SAAS,gBAAgB,MAAM,KAAK,EAAE,OAAO,OAAO;AAC1D,MAAI,OAAO,SAAS,KAAK,OAAO,MAAM,CAACC,WAAU,2BAA2B,IAAIA,MAAK,CAAC,EAAG,QAAO;AAChG,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,QAAQ,OAAO,CAAC;AACtB,SAAO,MAAM,KAAK,KAAK,EAAE,SAAS,KAAK,CAAC,2BAA2B,IAAI,KAAK;AAC9E;AAEA,SAAS,kBAAkB,OAAwB;AACjD,SAAO,kBAAkB,KAAK,MAAM,KAAK,CAAC;AAC5C;AAEA,SAAS,gCAAgC,OAAe,OAAwB;AAC9E,QAAM,kBAAkB,MAAM,KAAK;AACnC,QAAM,iBAAiB,GAAG,gBAAgB,CAAC,EAAG,YAAY,CAAC,GAAG,gBAAgB,MAAM,CAAC,EAAE,YAAY,CAAC;AACpG,QAAM,QAAQ,oBAAI,IAAI,CAAC,iBAAiB,gBAAgB,YAAY,GAAG,cAAc,CAAC;AACtF,SAAO,CAAC,GAAG,KAAK,EAAE,KAAK,CAAC,SAAS;AAC/B,QAAI,SAAS,KAAK,YAAY,EAAG,QAAO;AACxC,UAAM,UAAU,KAAK,QAAQ,uBAAuB,MAAM;AAC1D,WAAO,IAAI,OAAO,qBAAqB,OAAO,oBAAoB,EAAE,KAAK,KAAK;AAAA,EAChF,CAAC;AACH;AAEA,SAAS,6CACP,OACA,OACmB;AACnB,QAAM,sBAAsB,oBAAI,IAAyB;AACzD,aAAW,SAAS,MAAM,UAAU;AAClC,eAAW,SAAS,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG;AACjE,YAAM,kBAAkB,oBAAoB,KAAK;AACjD,UAAI,CAAC,gBAAiB;AACtB,YAAM,eAAe,oBAAoB,IAAI,eAAe,KAAK,oBAAI,IAAY;AACjF,mBAAa,IAAI,MAAM,WAAW;AAClC,0BAAoB,IAAI,iBAAiB,YAAY;AAAA,IACvD;AAAA,EACF;AAEA,QAAM,aAAgC,CAAC;AACvC,aAAW,SAAS,MAAM,UAAU;AAClC,QAAI,YAAY;AAChB,QAAI,YAAY;AAChB,eAAW,SAAS,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG;AACjE,YAAM,kBAAkB,oBAAoB,KAAK;AACjD,YAAM,QAAQ,gBAAgB,OAAO,KAAK;AAC1C,UACE,CAAC,mBACD,CAAC,2BAA2B,eAAe,KAC1C,kBAAkB,KAAK,KAAK,CAAC,gCAAgC,OAAO,KAAK,KAC1E,oBAAoB,IAAI,eAAe,GAAG,SAAS,KACnD,QAAQ,iCACR,SAAS,WACT;AACA;AAAA,MACF;AACA,kBAAY;AACZ,kBAAY;AAAA,IACd;AACA,QAAI,WAAW;AACb,iBAAW,KAAK,EAAE,OAAO,OAAO,WAAW,OAAO,WAAW,QAAQ,QAAQ,CAAC;AAAA,IAChF;AAAA,EACF;AAEA,SAAO,WAAW;AAAA,IAChB,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,SAAS,KAAK,MAAM,KAAK,cAAc,MAAM,MAAM,IAAI;AAAA,EAC7F;AACF;AAEA,SAAS,4BACP,OACA,mBACA,aACmB;AACnB,MAAI,eAAe,KAAK,kBAAkB,WAAW,EAAG,QAAO,CAAC;AAChE,QAAM,gBAAgB,kBAAkB,MAAM,CAAC,WAAW;AAC1D,QAAM,aAAa,oBAAI,IAA6B;AACpD,WAAS,cAAc,cAAc,SAAS,GAAG,eAAe,GAAG,eAAe,GAAG;AACnF,UAAM,OAAO,cAAc,WAAW;AACtC,UAAM,eAAe,cAAc,SAAS;AAC5C,UAAM,aAAa,KAAK,SAAS,SAAS,IAAI,KAAK,SAAS,cAAc,KAAK;AAC/E,eAAW,SAAS,MAAM,UAAU;AAClC,YAAM,UAAU,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC;AAC5D,iBAAW,SAAS,SAAS;AAC3B,cAAM,QAAQ,gBAAgB,KAAK,SAAS,KAAK;AACjD,YAAI,SAAS,EAAG;AAChB,cAAM,UAAU,WAAW,IAAI,MAAM,WAAW;AAChD,cAAM,gBAAgB,QAAQ,KAAK,IAAI,GAAG,IAAI,YAAY,IAAI;AAC9D,YAAI,CAAC,WAAW,gBAAgB,QAAQ,OAAO;AAC7C,qBAAW,IAAI,MAAM,aAAa;AAAA,YAChC;AAAA,YACA;AAAA,YACA,OAAO;AAAA,YACP,QAAQ;AAAA,UACV,CAAC;AAAA,QACH;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,CAAC,GAAG,WAAW,OAAO,CAAC,EAAE,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK;AAChF;AAEA,eAAe,kBAAkB,QAAqC;AACpE,QAAM,UAAU,OAAO,QAAQ,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACzD,SAAO,YAAY,SAAS,GAAG;AACjC;AAEA,eAAe,kBACb,OACA,aACA,MACA,oBACA,sBAC8B;AAC9B,QAAM,WAAgC,CAAC;AACvC,QAAM,cAAc,IAAI,IAAI,SAAS,cAAc,CAAC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;AAC7F,MAAI,MAAM,SAAS;AACjB,aAAS,KAAK,EAAE,MAAM,YAAY,MAAM,SAAS,GAAG,GAAG,OAAO,IAAI,MAAM,UAAU,CAAC;AAAA,EACrF;AACA,MAAI,qBAAqB,OAAO,GAAG;AACjC,eAAW,WAAW,MAAM,oBAAoB;AAC9C,UAAI,CAAC,qBAAqB,IAAI,oBAAoB,QAAQ,GAAG,EAAE,QAAQ,QAAQ,GAAG,CAAC,EAAG;AACtF,iBAAW,CAAC,OAAO,IAAI,KAAK,QAAQ,MAAM,QAAQ,GAAG;AACnD,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,OAAO,SAAS,WAAW,IAAI;AAAA,UAC/B,MAAM;AAAA,UACN,QAAQ,QAAQ,cAAc,KAAK;AAAA,QACrC,CAAC;AAAA,MACH;AAAA,IACF;AAAA,EACF,OAAO;AACL,eAAW,CAAC,OAAO,IAAI,KAAK,MAAM,cAAc,QAAQ,GAAG;AACzD,eAAS,KAAK;AAAA,QACZ,MAAM;AAAA,QACN,OAAO,SAAS,WAAW,IAAI;AAAA,QAC/B,MAAM;AAAA,QACN,QAAQ,MAAM,sBAAsB,KAAK;AAAA,MAC3C,CAAC;AAAA,IACH;AACA,eAAW,WAAW,MAAM,oBAAoB;AAC9C,iBAAW,CAAC,OAAO,IAAI,KAAK,QAAQ,MAAM,QAAQ,GAAG;AACnD,cAAM,iBAAiB,oBAAoB,IAAI;AAC/C,cAAM,0BAA0B,YAAY;AAAA,UAAK,CAAC,UAChD,CAAC,YAAY,IAAI,KAAK,KAAK,eAAe,SAAS,KAAK;AAAA,QAC1D;AACA,YAAI,MAAM,cAAc,SAAS,KAAK,CAAC,yBAAyB;AAC9D;AAAA,QACF;AACA,iBAAS,KAAK;AAAA,UACZ,MAAM;AAAA,UACN,OAAO,SAAS,WAAW,IAAI;AAAA,UAC/B,MAAM;AAAA,UACN,QAAQ,QAAQ,cAAc,KAAK;AAAA,QACrC,CAAC;AAAA,MACH;AAAA,IACF;AACA,QAAI,MAAM,cAAc,WAAW,KAAK,MAAM,mBAAmB,WAAW,GAAG;AAC7E,iBAAW,QAAQ,MAAM,OAAO;AAC9B,YAAI,CAAC,KAAK,KAAK,EAAG;AAClB,iBAAS,KAAK,EAAE,MAAM,MAAM,OAAO,SAAS,WAAW,IAAI,GAAG,MAAM,OAAO,CAAC;AAAA,MAC9E;AAAA,IACF;AAAA,EACF;AAEA,MAAI,qBAAqB,SAAS,GAAG;AACnC,eAAW,gBAAgB,MAAM,eAAe;AAC9C,eAAS,KAAK;AAAA,QACZ,MAAM,YAAY,aAAa,OAAO,YAAY,GAAG,GAAG;AAAA,QACxD,OAAO,SAAS,YAAY,MAAM,KAAK,YAAY,MAAM,WAAW,IAAI;AAAA,QACxE,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAEA,eAAW,YAAY,MAAM,UAAU;AACrC,eAAS,KAAK;AAAA,QACZ,MAAM,YAAY,GAAG,SAAS,IAAI,KAAK,SAAS,IAAI,IAAI,GAAG;AAAA,QAC3D,OAAO;AAAA,QACP,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAEA,eAAW,CAAC,OAAO,aAAa,KAAK,MAAM,eAAe,MAAM,GAAG,KAAK,IAAI,oBAAoB,CAAC,CAAC,EAAE,QAAQ,GAAG;AAC7G,eAAS,KAAK,EAAE,MAAM,eAAe,OAAO,GAAG,MAAM,UAAU,QAAQ,MAAM,uBAAuB,KAAK,EAAE,CAAC;AAAA,IAC9G;AAEA,eAAW,SAAS,MAAM,cAAc;AACtC,eAAS,KAAK;AAAA,QACZ,MAAM,YAAY,MAAM,SAAS,GAAG;AAAA,QACpC,OAAO;AAAA,QACP,MAAM;AAAA,MACR,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,UAAU,oBAAI,IAA+B;AACnD,aAAW,WAAW,UAAU;AAC9B,UAAM,SAAS,iBAAiB,SAAS,WAAW;AACpD,QAAI,CAAC,OAAQ;AACb,UAAM,aAAa,oBAAoB,OAAO,IAAI;AAClD,UAAM,WAAW,QAAQ,IAAI,UAAU;AACvC,QAAI,CAAC,UAAU;AACb,cAAQ,IAAI,YAAY,MAAM;AAAA,IAChC,WAAW,SAAS,WAAW,OAAO,QAAQ;AAC5C,cAAQ,IAAI,YAAY,EAAE,GAAI,OAAO,QAAQ,SAAS,QAAQ,SAAS,UAAW,QAAQ,OAAU,CAAC;AAAA,IACvG,WAAW,OAAO,QAAQ,SAAS,OAAO;AACxC,cAAQ,IAAI,YAAY,MAAM;AAAA,IAChC;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,QAAQ,OAAO,CAAC,EACxB,OAAO,CAAC,YAAY,QAAQ,QAAQ,CAAC,EACrC,KAAK,CAAC,MAAM,UAAU,MAAM,QAAQ,KAAK,KAAK,EAC9C,MAAM,GAAG,kBAAkB;AAChC;AAEA,SAAS,qBAAqB,UAA8C;AAC1E,QAAM,SAAS,SAAS;AAAA,IAAO,CAAC,YAC9B,QAAQ,SAAS,aACd,QAAQ,SAAS,UACjB,QAAQ,SAAS,aACjB,QAAQ,SAAS;AAAA,EACtB;AACA,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,aAAS,UAAU,QAAQ,GAAG,UAAU,OAAO,QAAQ,WAAW,GAAG;AACnE,UAAI,kBAAkB,OAAO,KAAK,EAAE,MAAM,OAAO,OAAO,EAAE,IAAI,IAAI,KAAK;AACrE,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,wBACP,YAKA,aACA,MACA,oBACA,UACA,wBAAiC,kBAClB;AACf,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,QAAM,QAAkB,CAAC,0BAA0B,EAAE;AAGrD,QAAM,gBAAgB,CAAC,YAAuC,QAAQ,SAAS,WAC3E,4BAA4B,QAAQ,MAAM,QAAQ,QAAQ,EAAE,SAAS,wBAAwB,iBAAiB,CAAC,IAAI,QAAQ;AAK/H,aAAW,EAAE,WAAW,UAAU,YAAY,KAAK,YAAY;AAC7D,UAAM,aAAa,QAAQ,UAAU,MAAM,SAAS,KAAK,CAAC;AAC1D,UAAM,uBAAuB,aACzB,SAAS,OAAO,CAAC,YAAY,QAAQ,SAAS,MAAM,IACpD;AACJ,QAAI,eACF,qBAAqB,SAAS,IAAI,uBAAuB,UACzD,MAAM,GAAG,CAAC;AACZ,UAAM,wBAAwB,CAAC,sBAAwD;AACrF,YAAM,uBAAuB;AAAA,SAC1B,UAAU,MAAM,YAAY,CAAC,GAC3B,MAAM,EACN,KAAK,uBAAuB,EAC5B,IAAI,CAAC,UAAU;AACd,gBAAM,OAAO,mBAAmB,MAAM,IAAI;AAC1C,iBAAO,OACH,iBAAiB;AAAA,YACjB,MAAM,YAAY,MAAM,GAAG;AAAA,YAC3B,OAAO;AAAA,YACP,MAAM;AAAA,YACN,QAAQ,MAAM;AAAA,UAChB,GAAG,WAAW,IACZ;AAAA,QACN,CAAC,EACA,OAAO,CAAC,YAA0C,YAAY,IAAI,EAClE,OAAO,CAAC,YAAY,CAAC,kBAAkB,IAAI,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClF,EAAE,MAAM,GAAG,CAAC;AACZ,YAAM,uBAAuB;AAAA,QAC3B,SACG,OAAO,CAAC,aACP,QAAQ,SAAS,cAAc,QAAQ,SAAS,aAC7C,CAAC,kBAAkB,IAAI,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClE,EAAE,MAAM,GAAG,CAAC;AACZ,aAAO,qBAAqB,SAAS,IACjC,uBACA,qBAAqB,SAAS,IAC5B,uBACA;AAAA,QACA,SACG,OAAO,CAAC,aACP,QAAQ,SAAS,UAAU,QAAQ,SAAS,cACzC,CAAC,kBAAkB,IAAI,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAAA,MAClE,EAAE,MAAM,GAAG,CAAC;AAAA,IAClB;AACA,UAAM,sBAAsB,IAAI,IAAI,YAAY,IAAI,CAAC,YAAY,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AACnG,UAAM,eAAe,SAAS,WAAW,sBAAsB,mBAAmB,IAAI,CAAC;AACvF,QAAI,SAAS,YAAY,cAAc,YAAY,SAAS,GAAG;AAC7D,UAAI,aAAa,SAAS,GAAG;AAC3B,sBAAc,CAAC,GAAG,aAAa,aAAa,CAAC,CAAE,EAAE,MAAM,GAAG,CAAC;AAAA,MAC7D;AAAA,IACF;AACA,UAAM,kBAAkB,IAAI,IAAI,YAAY,IAAI,CAAC,YAAY,oBAAoB,QAAQ,IAAI,CAAC,CAAC;AAC/F,UAAM,KAAK,aAAa,UAAU,MAAM,IAAI,KAAK,UAAU,MAAM,IAAI,GAAG;AACxE,UAAM,KAAK,iBAAiB,UAAU,WAAW,gBAAgB,gDAAgD,eAAe,KAAK,UAAU,KAAK,IAAI,UAAU,WAAW,gBAAgB,KAAK,eAAe,EAAE;AACnN,QAAI,YAAa,OAAM,KAAK,kBAAkB,WAAW,EAAE;AAC3D,QAAI,YAAY,SAAS,GAAG;AAC1B,YAAM,KAAK,kBAAkB;AAC7B,iBAAW,WAAW,aAAa;AACjC,cAAM,KAAK,OAAO,cAAc,OAAO,CAAC,EAAE;AAAA,MAC5C;AAAA,IACF;AACA,QAAI,SAAS,UAAU;AACrB,YAAM,mBAAmB,aAAa;AAAA,QACpC,CAAC,YAAY,CAAC,gBAAgB,IAAI,oBAAoB,QAAQ,IAAI,CAAC;AAAA,MACrE;AACA,UAAI,iBAAiB,SAAS,GAAG;AAC/B,cAAM,KAAK,oBAAoB;AAC/B,mBAAW,WAAW,kBAAkB;AACtC,gBAAM,KAAK,OAAO,cAAc,OAAO,CAAC,EAAE;AAAA,QAC5C;AAAA,MACF;AAAA,IACF;AACA,UAAM,UAAU,UAAU,MAAM,cAAc,MAAM,GAAG,kBAAkB,EAAE,IAAI,CAAC,iBAAiB,aAAa,MAAM;AACpH,QAAI,QAAQ,SAAS,GAAG;AACtB,YAAM,KAAK,uBAAuB,QAAQ,KAAK,IAAI,CAAC,EAAE;AAAA,IACxD;AACA,UAAM,KAAK,2BAA2B,UAAU,MAAM,SAAS,cAAc,UAAU,MAAM,eAAe,MAAM,YAAY,UAAU,MAAM,aAAa,MAAM,EAAE;AACnK,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,SAAS,MAAM,KAAK,IAAI;AAC5B,MAAI,OAAO,SAAS,UAAU;AAC5B,aAAS,GAAG,qBAAqB,QAAQ,KAAK,IAAI,GAAG,WAAW,EAAE,CAAC,EAAE,QAAQ,CAAC;AAAA;AAAA;AAAA;AAAA,EAChF;AACA,SAAO,OAAO,KAAK,EAAE,SAAS,IAAI,OAAO,QAAQ,IAAI;AACvD;AAEA,eAAsB,yBAAyB,SAAkE;AAK/G,yBAAuB,QAAQ,WAAW;AAC1C,QAAM,eAAe,sBAAsB,QAAQ,KAAK;AAMxD,QAAM,qBAAqB,iBAAiB,QACvC;AAAA,IACD,QAAQ;AAAA,IACR,QAAQ,cAAc,KAAK,QAAQ,kBAAkB,SAAS;AAAA,EAChE;AACF,QAAM,YAAY,iBAAiB,qBAAqB,cAAc;AACtE,QAAM,iBAAiB,YACnB,OACA,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV;AACF,yBAAuB,QAAQ,WAAW;AAC1C,MAAI;AACJ,MACE,CAAC,aACD,kBACA,6CAA6C,gBAAgB,QAAQ,KAAK,EAAE,WAAW,GACvF;AACA,mBAAe,MAAM,iBAAiB,QAAQ,QAAQ,QAAQ,gBAAgB;AAC9E,QAAI,CAAC,8BAA8B,gBAAgB,cAAc,QAAQ,KAAK,GAAG;AAC/E,aAAO,0BAA0B,QAAQ,WAAW;AAAA,IACtD;AAAA,EACF;AACA,QAAM,kBACJ,6BAA6B,QAAQ,MAAM,EAAE,cAC7C,QAAQ,qBAAqB,WAC5B,QAAQ,kBAAkB,UAAU,KAAK;AAC5C,MAAI,iBAAiB;AACnB,mBAAe,MAAM,iBAAiB,QAAQ,QAAQ,QAAQ,gBAAgB;AAAA,EAChF;AACA,QAAM,mBAAmB,kBACrB,MAAM;AAAA,IACN,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ;AAAA,EACV,IACE;AACJ,QAAM,oBACJ,oBAAoB,QAAQ,oBAAoB,eAC5C;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR,0BAA0B,YAAY;AAAA,EACxC,IACE;AACN,MAAI,QAAwC,oBACxC,0BAA0B,IAAI,iBAAiB,IAC/C;AACJ,yBAAuB,QAAQ,WAAW;AAC1C,MAAI,CAAC,OAAO;AACV,YAAQ,MAAM;AAAA,MACZ,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,IACV;AACA,QAAI,kBAAmB,8BAA6B,mBAAmB,KAAK;AAAA,EAC9E;AAIA,QAAM,sBAAsB,QAAQ,WAAW;AAC/C,QAAM,qBAAqB,0BAA0B,OAAO,QAAQ,KAAK;AACzE,QAAM,sBAAsB,QAAQ,WAAW;AAC/C,QAAM,kBAAkB,eACpB,qBACA,6CAA6C,OAAO,QAAQ,KAAK;AACrE,MACE,gBAAgB,WAAW,KACxB,4DAA4D,KAAK,oBAAoB,QAAQ,KAAK,CAAC,GACtG;AACA,WAAO,0BAA0B,QAAQ,WAAW;AAAA,EACtD;AAKA,QAAM,OAAO,iBACP,gBAAgB,SAAS,IACzB,WACA,qBACE,cACA;AACR,MAAI,CAAC,KAAM,QAAO,0BAA0B,QAAQ,WAAW;AAE/D,QAAM,aAAa,gBAAgB,SAAS,IACxC,kBACA,4BAA4B,OAAO,QAAQ,mBAAmB,QAAQ,WAAW;AAErF,MAAI,WAAW,WAAW,EAAG,QAAO,0BAA0B,QAAQ,WAAW;AAEjF,QAAM,cAAc,SAAS,QAAQ,KAAK;AAC1C,QAAM,iBAAiB,gBAAgB,WAAW,KAAK,SAAS,cAC5D,IACA,QAAQ;AACZ,QAAM,mBAAmB,WAAW,MAAM,GAAG,cAAc;AAC3D,QAAM,WAAW,MAAM,QAAQ;AAAA,IAC7B,iBAAiB,IAAI,OAAO,cAAc;AACxC,YAAM,uBAAuB,IAAI;AAAA,QAC/B;AAAA,UACE,QAAQ;AAAA,UACR,UAAU,MAAM;AAAA,UAChB,UAAU,MAAM;AAAA,UAChB,QAAQ,OAAO;AAAA,QACjB;AAAA,MACF;AACA,YAAM,WAAW,MAAM;AAAA,QACrB,UAAU;AAAA,QACV;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,MACF;AACA,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,aAAa,qBAAqB,QAAQ;AAAA,MAC5C;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,UAAU;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,QAAQ,2BAA2B;AAAA,IACnC,QAAQ,oBAAoB,CAAC;AAAA,EAC/B;AAGA,MAAI,CAAC,QAAS,QAAO,0BAA0B,QAAQ,WAAW;AAClE,SAAO;AACT;AAEA,eAAsB,kCACpB,0BACA,aAC4B;AAC5B,MAAI,eAAe,EAAG,QAAO,CAAC;AAC9B,QAAM,oBAAoB,MAAM,yBAAyB,MAAM,MAAM,CAAC,CAAC;AACvE,MAAI,kBAAkB,WAAW,EAAG,QAAO,CAAC;AAC5C,SAAO,kBAAkB,MAAM,CAAC,KAAK,IAAI,GAAG,cAAc,CAAC,CAAC;AAC9D;AAEO,IAAM,qBAAqB;AAC3B,IAAM,sCAAsC;","names":["index","token"]}

package/dist/chunk-JNAOTN7B.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/maintenance/rebuild-memory-projection.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, rm, stat } from \"node:fs/promises\";\nimport { StorageManager } from \"../storage.js\";\nimport { log } from \"../logger.js\";\nimport {\n  listMemoryGovernanceRuns,\n  readMemoryGovernanceRunArtifact,\n} from \"./memory-governance.js\";\nimport { loadPersistedNativeKnowledgeChunks } from \"../native-knowledge.js\";\nimport { toBackupStamp } from \"./backup-stamp.js\";\nimport type {\n  MemoryFile,\n  MemoryLifecycleEvent,\n  MemoryProjectionCurrentState,\n  MemoryStatus,\n} from \"../types.js\";\nimport {\n  buildLifecycleEventsForMemory,\n  inferMemoryStatus,\n  MEMORY_LIFECYCLE_EVENT_SORT_ORDER,\n  memoryLifecycleEventProjectionIdentity,\n  sortMemoryLifecycleEvents,\n  toMemoryPathRel,\n} from \"../memory-lifecycle-ledger-utils.js\";\nimport {\n  getMemoryProjectionPath,\n  initializeMemoryProjectionDb,\n  isProjectedMemoryPathValid,\n  type ProjectedEntityMentionRow,\n  type MemoryProjectionGovernanceAppliedActionRow,\n  type MemoryProjectionGovernanceReviewQueueRow,\n  type ProjectedNativeKnowledgeChunkRow,\n  MEMORY_PROJECTION_SCHEMA_VERSION,\n  memoryCurrentSelectExpressions,\n  parseCurrentRow,\n  readProjectedEntityMentions,\n  readProjectedGovernanceRecord,\n  readProjectedNativeKnowledgeChunks,\n  parseTimelineRows,\n} from \"../memory-projection-store.js\";\nimport {\n  normalizeProjectionPreview,\n  normalizeProjectionTags,\n} from \"../memory-projection-format.js\";\nimport { openBetterSqlite3 } from \"../runtime/better-sqlite.js\";\nimport { commitPreparedFileAtomically } from \"./atomic-file.js\";\nimport { isSupportPassportPrivateMemory } from \"../support-passport/card-projection.js\";\n\nexport interface RebuildMemoryProjectionOptions {\n  memoryDir: string;\n  /** Reuse the caller's live StorageManager (must be rooted at memoryDir). */\n  storage?: StorageManager;\n  defaultNamespace?: string;\n  dryRun?: boolean;\n  now?: Date;\n  updatedAfter?: string;\n  updatedBefore?: string;\n}\n\nexport type {\n  SkippedBlankIdMemory,\n  SkippedBlankIdTimelineEvent,\n  SkippedDuplicateMemory,\n  SkippedDuplicateTimelineEvent,\n} from \"./projection-support.js\";\nimport {\n  assertInjectedStorageRooted,\n  readProjectedEntityMentionRows,\n  readProjectedGovernanceRows,\n  readProjectedNativeKnowledgeRows,\n  writeProjectionMetaHighWater,\n} from \"./projection-support.js\";\nimport type {\n  SkippedBlankIdMemory,\n  SkippedBlankIdTimelineEvent,\n  SkippedDuplicateMemory,\n  SkippedDuplicateTimelineEvent,\n} from \"./projection-support.js\";\nimport { isErrnoCode } from \"../utils/errno.js\";\n\n\nexport interface RebuildMemoryProjectionResult {\n  dryRun: boolean;\n  scannedMemories: number;\n  currentRows: number;\n  timelineRows: number;\n  entityMentionRows: number;\n  nativeKnowledgeRows: number;\n  reviewQueueRows: number;\n  outputPath: string;\n  backupPath?: string;\n  usedLifecycleLedger: boolean;\n  skippedDuplicateMemories: SkippedDuplicateMemory[];\n  skippedBlankIdMemories: SkippedBlankIdMemory[];\n  skippedDuplicateTimelineEvents: SkippedDuplicateTimelineEvent[];\n  skippedBlankIdTimelineEvents: SkippedBlankIdTimelineEvent[];\n  scope: {\n    updatedAfter: string | null;\n    updatedBefore: string | null;\n  };\n}\n\nexport interface VerifyMemoryProjectionOptions {\n  memoryDir: string;\n  defaultNamespace?: string;\n  updatedAfter?: string;\n  updatedBefore?: string;\n}\n\nexport interface VerifyMemoryProjectionResult {\n  outputPath: string;\n  projectionExists: boolean;\n  ok: boolean;\n  expectedCurrentRows: number;\n  actualCurrentRows: number;\n  expectedTimelineRows: number;\n  actualTimelineRows: number;\n  expectedEntityMentionRows: number;\n  actualEntityMentionRows: number;\n  expectedNativeKnowledgeRows: number;\n  actualNativeKnowledgeRows: number;\n  expectedReviewQueueRows: number;\n  actualReviewQueueRows: number;\n  missingCurrentMemoryIds: string[];\n  extraCurrentMemoryIds: string[];\n  mismatchedCurrentMemoryIds: string[];\n  missingTimelineEventIds: string[];\n  extraTimelineEventIds: string[];\n  missingEntityMentionKeys: string[];\n  extraEntityMentionKeys: string[];\n  mismatchedEntityMentionKeys: string[];\n  missingNativeKnowledgeChunkIds: string[];\n  extraNativeKnowledgeChunkIds: string[];\n  mismatchedNativeKnowledgeChunkIds: string[];\n  missingReviewQueueEntryIds: string[];\n  extraReviewQueueEntryIds: string[];\n  mismatchedReviewQueueEntryIds: string[];\n  usedLifecycleLedger: boolean;\n  scope: {\n    updatedAfter: string | null;\n    updatedBefore: string | null;\n  };\n}\n\nexport interface RepairMemoryProjectionOptions extends RebuildMemoryProjectionOptions {}\n\nexport interface RepairMemoryProjectionResult {\n  dryRun: boolean;\n  repaired: boolean;\n  verify: VerifyMemoryProjectionResult;\n  rebuild?: RebuildMemoryProjectionResult;\n}\n\nexport async function backupExistingProjection(\n  memoryDir: string,\n  outputPath: string,\n  now: Date,\n): Promise<string | undefined> {\n  try {\n    await stat(outputPath);\n  } catch (err) {\n    if (isErrnoCode(err, \"ENOENT\")) {\n      return undefined;\n    }\n    throw err;\n  }\n\n  const backupPath = path.join(\n    memoryDir,\n    \"archive\",\n    \"memory-projection\",\n    toBackupStamp(now),\n    \"state\",\n    \"memory-projection.sqlite\",\n  );\n  return backupPath;\n}\n\nfunction inferProjectedStatus(pathRel: string, memory: MemoryFile): MemoryStatus {\n  return inferMemoryStatus(memory.frontmatter, pathRel);\n}\n\nfunction toCurrentStateRow(memoryDir: string, memory: MemoryFile): MemoryProjectionCurrentState {\n  const pathRel = toMemoryPathRel(memoryDir, memory.path);\n  return {\n    memoryId: memory.frontmatter.id,\n    category: memory.frontmatter.category,\n    status: inferProjectedStatus(pathRel, memory),\n    lifecycleState: memory.frontmatter.lifecycleState,\n    path: memory.path,\n    pathRel,\n    created: memory.frontmatter.created,\n    updated: memory.frontmatter.updated,\n    archivedAt: memory.frontmatter.archivedAt,\n    supersededAt: memory.frontmatter.supersededAt,\n    entityRef: memory.frontmatter.entityRef,\n    source: memory.frontmatter.source,\n    confidence: memory.frontmatter.confidence,\n    confidenceTier: memory.frontmatter.confidenceTier,\n    memoryKind: memory.frontmatter.memoryKind,\n    accessCount: memory.frontmatter.accessCount,\n    lastAccessed: memory.frontmatter.lastAccessed,\n    tags: normalizeProjectionTags(memory.frontmatter.tags),\n    preview: normalizeProjectionPreview(memory.content),\n    privateRecord: isSupportPassportPrivateMemory(memory),\n  };\n}\n\nfunction buildEntityMentionRows(\n  currentRows: MemoryProjectionCurrentState[],\n): ProjectedEntityMentionRow[] {\n  return currentRows.flatMap((row) => {\n    const mentions: ProjectedEntityMentionRow[] = [];\n    if (row.entityRef) {\n      mentions.push({\n        memoryId: row.memoryId,\n        entityRef: row.entityRef,\n        mentionSource: \"frontmatter.entityRef\",\n        created: row.created,\n        updated: row.updated,\n      });\n    }\n    for (const tag of row.tags ?? []) {\n      if (!tag.includes(\":\")) continue;\n      mentions.push({\n        memoryId: row.memoryId,\n        entityRef: tag,\n        mentionSource: \"tag\",\n        created: row.created,\n        updated: row.updated,\n      });\n    }\n    return mentions;\n  });\n}\n\nfunction buildGovernanceActionRowKey(action: {\n  action: string;\n  memoryId: string;\n  reasonCode: string;\n  originalPath: string;\n  currentPath: string;\n}): string {\n  return [\n    action.action,\n    action.memoryId,\n    action.reasonCode,\n    action.originalPath,\n    action.currentPath,\n  ].join(\"::\");\n}\n\nasync function loadLatestGovernanceProjection(memoryDir: string): Promise<{\n  runId: string;\n  summary: unknown;\n  metrics: unknown;\n  reviewQueueRows: MemoryProjectionGovernanceReviewQueueRow[];\n  appliedActionRows: MemoryProjectionGovernanceAppliedActionRow[];\n  report: string;\n} | null> {\n  const runId = (await listMemoryGovernanceRuns(memoryDir))[0];\n  if (!runId) return null;\n  try {\n    const artifact = await readMemoryGovernanceRunArtifact(memoryDir, runId);\n    return {\n      runId,\n      summary: artifact.summary,\n      metrics: artifact.metrics,\n      reviewQueueRows: artifact.reviewQueue.map((entry) => ({\n        runId,\n        entryId: entry.entryId,\n        memoryId: entry.memoryId,\n        path: entry.path,\n        reasonCode: entry.reasonCode,\n        severity: entry.severity,\n        suggestedAction: entry.suggestedAction,\n        suggestedStatus: entry.suggestedStatus,\n        relatedMemoryIds: [...entry.relatedMemoryIds],\n      })),\n      appliedActionRows: artifact.appliedActions.map((action) => ({\n        runId,\n        rowKey: buildGovernanceActionRowKey(action),\n        action: action.action,\n        memoryId: action.memoryId,\n        reasonCode: action.reasonCode,\n        beforeStatus: action.beforeStatus,\n        afterStatus: action.afterStatus,\n        originalPath: action.originalPath,\n        currentPath: action.currentPath,\n      })),\n      report: artifact.report,\n    };\n  } catch {\n    return null;\n  }\n}\n\nfunction loadTimelineEvents(\n  memories: MemoryFile[],\n  lifecycleEvents: MemoryLifecycleEvent[],\n): { events: MemoryLifecycleEvent[]; usedLifecycleLedger: boolean } {\n  if (lifecycleEvents.length > 0) {\n    return {\n      events: sortMemoryLifecycleEvents(lifecycleEvents),\n      usedLifecycleLedger: true,\n    };\n  }\n\n  return {\n    events: sortMemoryLifecycleEvents(memories.flatMap((memory) => buildLifecycleEventsForMemory(memory))),\n    usedLifecycleLedger: false,\n  };\n}\n\nfunction normalizeScopedIso(value: string | undefined): string | null {\n  if (!value) return null;\n  const trimmed = value.trim();\n  if (!trimmed) return null;\n  const parsed = new Date(trimmed);\n  if (Number.isNaN(parsed.getTime())) {\n    throw new Error(`invalid projection scope timestamp: ${value}`);\n  }\n  return parsed.toISOString();\n}\n\nfunction normalizeProjectionScope(options: {\n  updatedAfter?: string;\n  updatedBefore?: string;\n}): {\n  updatedAfter: string | null;\n  updatedBefore: string | null;\n} {\n  const updatedAfter = normalizeScopedIso(options.updatedAfter);\n  const updatedBefore = normalizeScopedIso(options.updatedBefore);\n  if (\n    updatedAfter &&\n    updatedBefore &&\n    new Date(updatedAfter).getTime() > new Date(updatedBefore).getTime()\n  ) {\n    throw new Error(\"updatedAfter must be less than or equal to updatedBefore\");\n  }\n  return {\n    updatedAfter,\n    updatedBefore,\n  };\n}\n\nfunction hasScopedProjectionFilter(scope: {\n  updatedAfter: string | null;\n  updatedBefore: string | null;\n}): boolean {\n  return scope.updatedAfter !== null || scope.updatedBefore !== null;\n}\n\nfunction memoryScopeTimestamp(memory: MemoryFile): string {\n  const candidate = memory.frontmatter.updated || memory.frontmatter.created;\n  return candidate;\n}\n\nfunction isTimestampInProjectionScope(\n  timestamp: string,\n  scope: { updatedAfter: string | null; updatedBefore: string | null },\n): boolean {\n  if (!scope.updatedAfter && !scope.updatedBefore) return true;\n  const parsed = new Date(timestamp);\n  if (Number.isNaN(parsed.getTime())) return false;\n  if (scope.updatedAfter && parsed.getTime() < new Date(scope.updatedAfter).getTime()) return false;\n  if (scope.updatedBefore && parsed.getTime() >= new Date(scope.updatedBefore).getTime()) return false;\n  return true;\n}\n\nfunction filterMemoriesForProjectionScope(\n  memories: MemoryFile[],\n  scope: { updatedAfter: string | null; updatedBefore: string | null },\n): MemoryFile[] {\n  if (!scope.updatedAfter && !scope.updatedBefore) return memories;\n  return memories.filter((memory) => isTimestampInProjectionScope(memoryScopeTimestamp(memory), scope));\n}\n\nfunction filterCurrentStateRowsForProjectionScope(\n  rows: MemoryProjectionCurrentState[],\n  scope: { updatedAfter: string | null; updatedBefore: string | null },\n): MemoryProjectionCurrentState[] {\n  if (!scope.updatedAfter && !scope.updatedBefore) return rows;\n  return rows.filter((row) => isTimestampInProjectionScope(row.updated || row.created, scope));\n}\n\nfunction serializeCurrentStateRow(row: MemoryProjectionCurrentState): string {\n  return JSON.stringify({\n    memoryId: row.memoryId,\n    category: row.category,\n    status: row.status,\n    lifecycleState: row.lifecycleState ?? null,\n    pathRel: row.pathRel,\n    created: row.created,\n    updated: row.updated,\n    archivedAt: row.archivedAt ?? null,\n    supersededAt: row.supersededAt ?? null,\n    entityRef: row.entityRef ?? null,\n    source: row.source,\n    confidence: row.confidence,\n    confidenceTier: row.confidenceTier,\n    memoryKind: row.memoryKind ?? null,\n    accessCount: row.accessCount ?? null,\n    lastAccessed: row.lastAccessed ?? null,\n    tags: row.tags ?? [],\n    preview: row.preview ?? \"\",\n    privateRecord: row.privateRecord === true,\n  });\n}\n\nfunction serializeTimelineEvent(event: MemoryLifecycleEvent): string {\n  return JSON.stringify({\n    eventId: event.eventId,\n    memoryId: event.memoryId,\n    eventType: event.eventType,\n    timestamp: event.timestamp,\n    actor: event.actor,\n    reasonCode: event.reasonCode ?? null,\n    ruleVersion: event.ruleVersion,\n    relatedMemoryIds: event.relatedMemoryIds ?? [],\n    before: event.before ?? null,\n    after: event.after ?? null,\n    correlationId: event.correlationId ?? null,\n  });\n}\n\nfunction serializeEntityMentionRow(row: ProjectedEntityMentionRow): string {\n  return JSON.stringify(row);\n}\n\nfunction serializeNativeKnowledgeRow(row: ProjectedNativeKnowledgeChunkRow): string {\n  return JSON.stringify({\n    chunkId: row.chunkId,\n    sourceKind: row.sourceKind,\n    sourcePath: row.sourcePath,\n    title: row.title,\n    startLine: row.startLine,\n    endLine: row.endLine,\n    namespace: row.namespace ?? null,\n    privacyClass: row.privacyClass ?? null,\n    derivedDate: row.derivedDate ?? null,\n    sessionKey: row.sessionKey ?? null,\n    workflowKey: row.workflowKey ?? null,\n    author: row.author ?? null,\n    agent: row.agent ?? null,\n    sourceHash: row.sourceHash ?? null,\n    preview: row.preview,\n  });\n}\n\nfunction serializeGovernanceReviewQueueRow(\n  row: MemoryProjectionGovernanceReviewQueueRow,\n): string {\n  return JSON.stringify({\n    runId: row.runId,\n    entryId: row.entryId,\n    memoryId: row.memoryId,\n    path: row.path,\n    reasonCode: row.reasonCode,\n    severity: row.severity,\n    suggestedAction: row.suggestedAction,\n    suggestedStatus: row.suggestedStatus ?? null,\n    relatedMemoryIds: row.relatedMemoryIds,\n  });\n}\n\nfunction selectProjectionMemories(\n  tiers: MemoryFile[][],\n): {\n  allMemories: MemoryFile[];\n  memories: MemoryFile[];\n  skippedDuplicateMemories: SkippedDuplicateMemory[];\n  skippedBlankIdMemories: SkippedBlankIdMemory[];\n} {\n  const allMemories = tiers.flat();\n  const memories: MemoryFile[] = [];\n  const keptById = new Map<string, MemoryFile>();\n  const skippedDuplicateMemories: SkippedDuplicateMemory[] = [];\n  const skippedBlankIdMemories: SkippedBlankIdMemory[] = [];\n\n  // Tier order is authoritative: hot wins over cold, and cold wins over archive.\n  // Paths break ties within a tier so the winner does not depend on readdir order.\n  for (const tier of tiers) {\n    for (const memory of [...tier].sort((left, right) => left.path.localeCompare(right.path))) {\n      const memoryId = memory.frontmatter.id.trim();\n      if (!memoryId) {\n        skippedBlankIdMemories.push({ path: memory.path });\n        log.warn(`projection rebuild skipped blank memory id: path=${memory.path}`);\n        continue;\n      }\n      const kept = keptById.get(memoryId);\n      if (kept) {\n        skippedDuplicateMemories.push({\n          memoryId,\n          keptPath: kept.path,\n          skippedPath: memory.path,\n        });\n        log.warn(\n          `projection rebuild skipped duplicate memory id=${memoryId}: kept=${kept.path} skipped=${memory.path}`,\n        );\n        continue;\n      }\n      keptById.set(memoryId, memory);\n      memories.push(memory);\n    }\n  }\n\n  return { allMemories, memories, skippedDuplicateMemories, skippedBlankIdMemories };\n}\n\nfunction deduplicateTimelineEvents(\n  events: MemoryLifecycleEvent[],\n  sourcePathFor: (event: MemoryLifecycleEvent) => string,\n): {\n  events: MemoryLifecycleEvent[];\n  skipped: SkippedDuplicateTimelineEvent[];\n  skippedBlankIds: SkippedBlankIdTimelineEvent[];\n} {\n  const keptById = new Map<string, { event: MemoryLifecycleEvent; path: string }>();\n  const unique: MemoryLifecycleEvent[] = [];\n  const skipped: SkippedDuplicateTimelineEvent[] = [];\n  const skippedBlankIds: SkippedBlankIdTimelineEvent[] = [];\n  for (const event of sortMemoryLifecycleEvents(events)) {\n    const sourcePath = sourcePathFor(event);\n    if (!event.memoryId.trim()) {\n      skippedBlankIds.push({ eventId: event.eventId, path: sourcePath });\n      log.warn(\n        `projection rebuild skipped timeline event with blank memory id: `\n        + `event_id=${event.eventId} path=${sourcePath}`,\n      );\n      continue;\n    }\n    const kept = keptById.get(event.eventId);\n    if (kept) {\n      skipped.push({\n        eventId: event.eventId,\n        keptPath: kept.path,\n        skippedPath: sourcePath,\n      });\n      log.warn(\n        `projection rebuild skipped duplicate timeline event_id=${event.eventId}: `\n        + `kept=${kept.path} skipped=${sourcePath}`,\n      );\n      continue;\n    }\n    keptById.set(event.eventId, { event, path: sourcePath });\n    unique.push(event);\n  }\n  return { events: unique, skipped, skippedBlankIds };\n}\n\nasync function loadAuthoritativeProjectionSnapshot(options: {\n  memoryDir: string;\n  defaultNamespace?: string;\n  storage?: StorageManager;\n  updatedAfter?: string;\n  updatedBefore?: string;\n}): Promise<{\n  allMemories: MemoryFile[];\n  currentRows: MemoryProjectionCurrentState[];\n  timelineRows: MemoryLifecycleEvent[];\n  scopedCurrentRows: MemoryProjectionCurrentState[];\n  scopedTimelineRows: MemoryLifecycleEvent[];\n  entityMentionRows: ProjectedEntityMentionRow[];\n  scopedEntityMentionRows: ProjectedEntityMentionRow[];\n  nativeKnowledgeRows: ProjectedNativeKnowledgeChunkRow[];\n  governance:\n    | {\n      runId: string;\n      summary: unknown;\n      metrics: unknown;\n      reviewQueueRows: MemoryProjectionGovernanceReviewQueueRow[];\n      appliedActionRows: MemoryProjectionGovernanceAppliedActionRow[];\n      report: string;\n    }\n    | null;\n  usedLifecycleLedger: boolean;\n  sourceLifecycleLedgerEventCount: number;\n  scope: {\n    updatedAfter: string | null;\n    updatedBefore: string | null;\n  };\n  skippedDuplicateMemories: SkippedDuplicateMemory[];\n  skippedBlankIdMemories: SkippedBlankIdMemory[];\n  skippedDuplicateTimelineEvents: SkippedDuplicateTimelineEvent[];\n  skippedBlankIdTimelineEvents: SkippedBlankIdTimelineEvent[];\n}> {\n  const storage = assertInjectedStorageRooted(\"rebuildMemoryProjection\", options.memoryDir, options.storage) ?? new StorageManager(options.memoryDir);\n  // Force a fresh disk read — projection verify/rebuild must see the true\n  // on-disk state, not a potentially stale in-process cache.\n  storage.invalidateAllMemoriesCacheForDir();\n  const selected = selectProjectionMemories([\n    await storage.readAllMemories(),\n    await storage.readAllColdMemories(),\n    await storage.readArchivedMemories(),\n  ]);\n  const allMemories = selected.allMemories;\n  const projectionMemories = selected.memories;\n  const lifecycleEvents = await storage.readAllMemoryLifecycleEvents();\n  const timeline = loadTimelineEvents(projectionMemories, lifecycleEvents);\n  const lifecycleLedgerPath = path.join(\n    options.memoryDir,\n    \"state\",\n    \"memory-lifecycle-ledger.jsonl\",\n  );\n  const memoryPathById = new Map(\n    projectionMemories.map((memory) => [memory.frontmatter.id, memory.path]),\n  );\n  const deduplicatedTimeline = deduplicateTimelineEvents(\n    timeline.events,\n    (event) => timeline.usedLifecycleLedger\n      ? lifecycleLedgerPath\n      : memoryPathById.get(event.memoryId) ?? lifecycleLedgerPath,\n  );\n  const events = deduplicatedTimeline.events;\n  const usedLifecycleLedger = timeline.usedLifecycleLedger;\n  const sourceLifecycleLedgerEventCount = new Set(\n    lifecycleEvents.map(memoryLifecycleEventProjectionIdentity),\n  ).size;\n  const currentRows = projectionMemories.map((memory) => toCurrentStateRow(options.memoryDir, memory));\n  const scope = normalizeProjectionScope(options);\n  const scopedMemories = filterMemoriesForProjectionScope(projectionMemories, scope);\n  const scopedMemoryIds = new Set(scopedMemories.map((memory) => memory.frontmatter.id));\n  const nativeKnowledgeRows = await loadPersistedNativeKnowledgeChunks({\n    memoryDir: options.memoryDir,\n    defaultNamespace: options.defaultNamespace ?? \"default\",\n  }).then((rows) => rows.map((row) => ({\n    chunkId: row.chunkId,\n    sourceKind: row.sourceKind,\n    sourcePath: row.sourcePath,\n    title: row.title,\n    startLine: row.startLine,\n    endLine: row.endLine,\n    namespace: row.namespace ?? options.defaultNamespace ?? \"default\",\n    privacyClass: row.privacyClass,\n    derivedDate: row.derivedDate,\n    sessionKey: row.sessionKey,\n    workflowKey: row.workflowKey,\n    author: row.author,\n    agent: row.agent,\n    sourceHash: row.sourceHash,\n    preview: normalizeProjectionPreview(row.content),\n  })));\n  const governance = await loadLatestGovernanceProjection(options.memoryDir);\n  const entityMentionRows = buildEntityMentionRows(currentRows);\n\n  return {\n    allMemories,\n    currentRows,\n    timelineRows: events,\n    scopedCurrentRows: currentRows.filter((row) => scopedMemoryIds.has(row.memoryId)),\n    scopedTimelineRows: events.filter((event) => scopedMemoryIds.has(event.memoryId)),\n    entityMentionRows,\n    scopedEntityMentionRows: entityMentionRows.filter((row) => scopedMemoryIds.has(row.memoryId)),\n    nativeKnowledgeRows,\n    governance,\n    usedLifecycleLedger,\n    sourceLifecycleLedgerEventCount,\n    scope,\n    skippedDuplicateMemories: selected.skippedDuplicateMemories,\n    skippedBlankIdMemories: selected.skippedBlankIdMemories,\n    skippedDuplicateTimelineEvents: deduplicatedTimeline.skipped,\n    skippedBlankIdTimelineEvents: deduplicatedTimeline.skippedBlankIds,\n  };\n}\n\nfunction readProjectedCurrentRows(\n  memoryDir: string,\n): { projectionExists: boolean; rows: MemoryProjectionCurrentState[] } {\n  const dbPath = getMemoryProjectionPath(memoryDir);\n  try {\n    const db = openBetterSqlite3(dbPath, { readonly: true, fileMustExist: true });\n    try {\n      const selectExpressions = memoryCurrentSelectExpressions(db);\n      const rows = db.prepare(`\n        SELECT\n          memory_id,\n          category,\n          status,\n          lifecycle_state,\n          path_rel,\n          created_at,\n          updated_at,\n          archived_at,\n          superseded_at,\n          entity_ref,\n          source,\n          confidence,\n          confidence_tier,\n          memory_kind,\n          access_count,\n          last_accessed,\n          ${selectExpressions.tagsJson}, ${selectExpressions.previewText}, ${selectExpressions.privateRecord}\n        FROM memory_current\n      `).all() as Array<Record<string, unknown>>;\n\n      return {\n        projectionExists: true,\n        rows: rows\n          .map((row) => parseCurrentRow(memoryDir, row))\n          .filter((row): row is MemoryProjectionCurrentState => row !== null),\n      };\n    } finally {\n      db.close();\n    }\n  } catch {\n    return { projectionExists: false, rows: [] };\n  }\n}\n\nfunction readProjectedTimelineRows(\n  memoryDir: string,\n): { projectionExists: boolean; rows: MemoryLifecycleEvent[] } {\n  const dbPath = getMemoryProjectionPath(memoryDir);\n  try {\n    const db = openBetterSqlite3(dbPath, { readonly: true, fileMustExist: true });\n    try {\n      const rows = db.prepare(`\n        SELECT\n          event_id,\n          memory_id,\n          event_type,\n          timestamp,\n          actor,\n          reason_code,\n          rule_version,\n          related_memory_ids_json,\n          before_json,\n          after_json,\n          correlation_id\n        FROM memory_timeline\n      `).all() as Array<Record<string, unknown>>;\n\n      return {\n        projectionExists: true,\n        rows: parseTimelineRows(rows),\n      };\n    } finally {\n      db.close();\n    }\n  } catch {\n    return { projectionExists: false, rows: [] };\n  }\n}\n\n\nfunction writeProjectionDb(\n  dbPath: string,\n  nowIso: string,\n  currentRows: MemoryProjectionCurrentState[],\n  timelineRows: MemoryLifecycleEvent[],\n  entityMentionRows: ProjectedEntityMentionRow[],\n  nativeKnowledgeRows: ProjectedNativeKnowledgeChunkRow[],\n  governance: Awaited<ReturnType<typeof loadLatestGovernanceProjection>>,\n  usedLifecycleLedger: boolean,\n  sourceLifecycleLedgerEventCount: number,\n): void {\n  const db = openBetterSqlite3(dbPath);\n  const memoryDir = path.dirname(path.dirname(dbPath));\n  try {\n    initializeMemoryProjectionDb(db);\n\n    const insertMeta = db.prepare(\"INSERT OR REPLACE INTO meta(key, value) VALUES (?, ?)\");\n    insertMeta.run(\"schemaVersion\", String(MEMORY_PROJECTION_SCHEMA_VERSION));\n    insertMeta.run(\"rebuiltAt\", nowIso);\n    insertMeta.run(\"usedLifecycleLedger\", usedLifecycleLedger ? \"true\" : \"false\");\n    writeProjectionMetaHighWater(insertMeta, sourceLifecycleLedgerEventCount, timelineRows);\n    insertMeta.run(\"latestGovernanceRunId\", governance?.runId ?? \"\");\n\n    const insertCurrent = db.prepare(`\n      INSERT INTO memory_current (\n        memory_id,\n        category,\n        status,\n        lifecycle_state,\n        path_rel,\n        path_valid,\n        created_at,\n        updated_at,\n        archived_at,\n        superseded_at,\n        entity_ref,\n        source,\n        confidence,\n        confidence_tier,\n        memory_kind,\n        access_count,\n        last_accessed,\n        tags_json, preview_text, private_record\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertTimeline = db.prepare(`\n      INSERT INTO memory_timeline (\n        event_id,\n        memory_id,\n        event_type,\n        timestamp,\n        event_order,\n        actor,\n        reason_code,\n        rule_version,\n        related_memory_ids_json,\n        before_json,\n        after_json,\n        correlation_id\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertEntityMention = db.prepare(`\n      INSERT INTO memory_entity_mentions (\n        memory_id,\n        entity_ref,\n        mention_source,\n        created_at,\n        updated_at\n      ) VALUES (?, ?, ?, ?, ?)\n    `);\n\n    const insertNativeKnowledge = db.prepare(`\n      INSERT INTO native_knowledge_chunks (\n        chunk_id,\n        source_kind,\n        source_path,\n        title,\n        start_line,\n        end_line,\n        namespace,\n        privacy_class,\n        derived_date,\n        session_key,\n        workflow_key,\n        author,\n        agent,\n        source_hash,\n        preview_text\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertGovernanceReviewQueue = db.prepare(`\n      INSERT INTO memory_review_queue (\n        entry_id,\n        run_id,\n        memory_id,\n        path,\n        reason_code,\n        severity,\n        suggested_action,\n        suggested_status,\n        related_memory_ids_json\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertGovernanceAppliedAction = db.prepare(`\n      INSERT INTO memory_review_actions (\n        row_key,\n        run_id,\n        action,\n        memory_id,\n        reason_code,\n        before_status,\n        after_status,\n        original_path,\n        current_path\n      ) VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const insertGovernanceRun = db.prepare(`\n      INSERT INTO memory_review_runs (\n        run_id,\n        created_at,\n        mode,\n        summary_json,\n        metrics_json,\n        applied_actions_json,\n        report_markdown\n      ) VALUES (?, ?, ?, ?, ?, ?, ?)\n    `);\n\n    const writeTx = db.transaction(() => {\n      for (const row of currentRows) {\n        insertCurrent.run(\n          row.memoryId,\n          row.category,\n          row.status,\n          row.lifecycleState ?? null,\n          row.pathRel,\n          isProjectedMemoryPathValid(memoryDir, row.pathRel) ? 1 : 0,\n          row.created,\n          row.updated,\n          row.archivedAt ?? null,\n          row.supersededAt ?? null,\n          row.entityRef ?? null,\n          row.source,\n          row.confidence,\n          row.confidenceTier,\n          row.memoryKind ?? null,\n          row.accessCount ?? null,\n          row.lastAccessed ?? null, JSON.stringify(row.tags ?? []), row.preview ?? \"\",\n          row.privateRecord === true ? 1 : 0,\n        );\n      }\n\n      for (const event of timelineRows) {\n        insertTimeline.run(\n          event.eventId,\n          event.memoryId,\n          event.eventType,\n          event.timestamp,\n          MEMORY_LIFECYCLE_EVENT_SORT_ORDER[event.eventType],\n          event.actor,\n          event.reasonCode ?? null,\n          event.ruleVersion,\n          JSON.stringify(event.relatedMemoryIds ?? []),\n          event.before ? JSON.stringify(event.before) : null,\n          event.after ? JSON.stringify(event.after) : null,\n          event.correlationId ?? null,\n        );\n      }\n\n      for (const row of entityMentionRows) {\n        insertEntityMention.run(\n          row.memoryId,\n          row.entityRef,\n          row.mentionSource,\n          row.created,\n          row.updated,\n        );\n      }\n\n      for (const row of nativeKnowledgeRows) {\n        insertNativeKnowledge.run(\n          row.chunkId,\n          row.sourceKind,\n          row.sourcePath,\n          row.title,\n          row.startLine,\n          row.endLine,\n          row.namespace ?? null,\n          row.privacyClass ?? null,\n          row.derivedDate ?? null,\n          row.sessionKey ?? null,\n          row.workflowKey ?? null,\n          row.author ?? null,\n          row.agent ?? null,\n          row.sourceHash ?? null,\n          row.preview,\n        );\n      }\n\n      for (const row of governance?.reviewQueueRows ?? []) {\n        insertGovernanceReviewQueue.run(\n          row.entryId,\n          row.runId,\n          row.memoryId,\n          row.path,\n          row.reasonCode,\n          row.severity,\n          row.suggestedAction,\n          row.suggestedStatus ?? null,\n          JSON.stringify(row.relatedMemoryIds),\n        );\n      }\n\n      for (const row of governance?.appliedActionRows ?? []) {\n        insertGovernanceAppliedAction.run(\n          row.rowKey,\n          row.runId,\n          row.action,\n          row.memoryId,\n          row.reasonCode,\n          row.beforeStatus,\n          row.afterStatus ?? null,\n          row.originalPath,\n          row.currentPath,\n        );\n      }\n\n      if (governance) {\n        const createdAt =\n          typeof (governance.summary as { createdAt?: unknown } | undefined)?.createdAt === \"string\"\n            ? (governance.summary as { createdAt: string }).createdAt\n            : nowIso;\n        const mode =\n          typeof (governance.summary as { mode?: unknown } | undefined)?.mode === \"string\"\n            ? (governance.summary as { mode: string }).mode\n            : \"shadow\";\n        insertGovernanceRun.run(\n          governance.runId,\n          createdAt,\n          mode,\n          JSON.stringify(governance.summary ?? null),\n          JSON.stringify(governance.metrics ?? null),\n          JSON.stringify(\n            (governance.appliedActionRows ?? []).map((row) => ({\n              action: row.action,\n              memoryId: row.memoryId,\n              reasonCode: row.reasonCode,\n              beforeStatus: row.beforeStatus,\n              afterStatus: row.afterStatus,\n              originalPath: row.originalPath,\n              currentPath: row.currentPath,\n            })),\n          ),\n          governance.report,\n        );\n      }\n    });\n\n    writeTx();\n  } finally {\n    db.close();\n  }\n}\n\nfunction mergeScopedCurrentRows(\n  existingRows: MemoryProjectionCurrentState[],\n  replacementRows: MemoryProjectionCurrentState[],\n  scopedMemoryIds: Set<string>,\n): MemoryProjectionCurrentState[] {\n  return [...existingRows.filter((row) => !scopedMemoryIds.has(row.memoryId)), ...replacementRows]\n    .sort((a, b) => a.memoryId.localeCompare(b.memoryId));\n}\n\nfunction mergeScopedTimelineRows(\n  existingRows: MemoryLifecycleEvent[],\n  replacementRows: MemoryLifecycleEvent[],\n  scopedMemoryIds: Set<string>,\n): MemoryLifecycleEvent[] {\n  return sortMemoryLifecycleEvents([\n    ...existingRows.filter((event) => !scopedMemoryIds.has(event.memoryId)),\n    ...replacementRows,\n  ]);\n}\n\nfunction mergeScopedEntityMentionRows(\n  existingRows: ProjectedEntityMentionRow[],\n  replacementRows: ProjectedEntityMentionRow[],\n  scopedMemoryIds: Set<string>,\n): ProjectedEntityMentionRow[] {\n  return [\n    ...existingRows.filter((row) => !scopedMemoryIds.has(row.memoryId)),\n    ...replacementRows,\n  ].sort((left, right) =>\n    [left.entityRef, left.memoryId, left.mentionSource].join(\"::\").localeCompare(\n      [right.entityRef, right.memoryId, right.mentionSource].join(\"::\"),\n    )\n  );\n}\n\nexport async function rebuildMemoryProjection(\n  options: RebuildMemoryProjectionOptions,\n): Promise<RebuildMemoryProjectionResult> {\n  const dryRun = options.dryRun !== false;\n  const now = options.now ?? new Date();\n  const outputPath = getMemoryProjectionPath(options.memoryDir);\n  const snapshot = await loadAuthoritativeProjectionSnapshot(options);\n\n  let backupPath: string | undefined;\n  if (!dryRun) {\n    let nextCurrentRows = snapshot.currentRows;\n    let nextTimelineRows = snapshot.timelineRows;\n    let nextEntityMentionRows = snapshot.entityMentionRows;\n    let nextNativeKnowledgeRows = snapshot.nativeKnowledgeRows;\n    let nextGovernance = snapshot.governance;\n    if (hasScopedProjectionFilter(snapshot.scope)) {\n      nextCurrentRows = snapshot.scopedCurrentRows;\n      nextTimelineRows = snapshot.scopedTimelineRows;\n      nextEntityMentionRows = snapshot.scopedEntityMentionRows;\n      const projectedCurrent = readProjectedCurrentRows(options.memoryDir);\n      const projectedTimeline = readProjectedTimelineRows(options.memoryDir);\n      const projectedEntityMentions = readProjectedEntityMentionRows(options.memoryDir);\n      const projectedNativeKnowledge = readProjectedNativeKnowledgeRows(options.memoryDir);\n      const projectedGovernance = readProjectedGovernanceRows(options.memoryDir);\n      if (projectedCurrent.projectionExists && projectedTimeline.projectionExists) {\n        const actualScopedCurrentRows = filterCurrentStateRowsForProjectionScope(\n          projectedCurrent.rows,\n          snapshot.scope,\n        );\n        const scopedMemoryIds = new Set([\n          ...snapshot.scopedCurrentRows.map((row) => row.memoryId),\n          ...snapshot.scopedTimelineRows.map((event) => event.memoryId),\n          ...actualScopedCurrentRows.map((row) => row.memoryId),\n        ]);\n        nextCurrentRows = mergeScopedCurrentRows(\n          projectedCurrent.rows,\n          snapshot.scopedCurrentRows,\n          scopedMemoryIds,\n        );\n        nextTimelineRows = mergeScopedTimelineRows(\n          projectedTimeline.rows,\n          snapshot.scopedTimelineRows,\n          scopedMemoryIds,\n        );\n        nextEntityMentionRows = mergeScopedEntityMentionRows(\n          projectedEntityMentions.rows,\n          snapshot.scopedEntityMentionRows,\n          scopedMemoryIds,\n        );\n      }\n      if (projectedNativeKnowledge.projectionExists) {\n        // Native knowledge rows are always loaded from the full persisted sync state,\n        // so scoped memory rebuilds should publish the fresh snapshot instead of\n        // pinning the projection to stale previously projected rows.\n        nextNativeKnowledgeRows = snapshot.nativeKnowledgeRows;\n      }\n      if (projectedGovernance.projectionExists && projectedGovernance.runId) {\n        // Governance rows are also sourced from standalone artifact snapshots, so\n        // scoped memory rebuilds should keep the latest governance artifact data\n        // instead of restoring whatever happened to be in the prior projection.\n        nextGovernance = snapshot.governance;\n      }\n    }\n\n    const tempPath = `${outputPath}.tmp`;\n    await mkdir(path.dirname(outputPath), { recursive: true });\n    await rm(tempPath, { force: true });\n    writeProjectionDb(\n      tempPath,\n      now.toISOString(),\n      nextCurrentRows,\n      nextTimelineRows,\n      nextEntityMentionRows,\n      nextNativeKnowledgeRows,\n      nextGovernance,\n      snapshot.usedLifecycleLedger,\n      snapshot.sourceLifecycleLedgerEventCount,\n    );\n    backupPath = await backupExistingProjection(options.memoryDir, outputPath, now);\n    backupPath = await commitPreparedFileAtomically(tempPath, outputPath, backupPath);\n  }\n\n  return {\n    dryRun,\n    scannedMemories: snapshot.allMemories.length,\n    currentRows: snapshot.scopedCurrentRows.length,\n    timelineRows: snapshot.scopedTimelineRows.length,\n    entityMentionRows: snapshot.scopedEntityMentionRows.length,\n    nativeKnowledgeRows: snapshot.nativeKnowledgeRows.length,\n    reviewQueueRows: snapshot.governance?.reviewQueueRows.length ?? 0,\n    outputPath,\n    backupPath,\n    usedLifecycleLedger: snapshot.usedLifecycleLedger,\n    skippedDuplicateMemories: snapshot.skippedDuplicateMemories,\n    skippedBlankIdMemories: snapshot.skippedBlankIdMemories,\n    skippedDuplicateTimelineEvents: snapshot.skippedDuplicateTimelineEvents,\n    skippedBlankIdTimelineEvents: snapshot.skippedBlankIdTimelineEvents,\n    scope: snapshot.scope,\n  };\n}\n\nexport async function verifyMemoryProjection(\n  options: VerifyMemoryProjectionOptions,\n): Promise<VerifyMemoryProjectionResult> {\n  const outputPath = getMemoryProjectionPath(options.memoryDir);\n  const snapshot = await loadAuthoritativeProjectionSnapshot(options);\n  const projectedCurrent = readProjectedCurrentRows(options.memoryDir);\n  const projectedTimeline = readProjectedTimelineRows(options.memoryDir);\n  const projectedEntityMentions = readProjectedEntityMentionRows(options.memoryDir);\n  const projectedNativeKnowledge = readProjectedNativeKnowledgeRows(options.memoryDir);\n  const projectedGovernance = readProjectedGovernanceRows(options.memoryDir);\n  const projectionExists = projectedCurrent.projectionExists\n    || projectedTimeline.projectionExists\n    || projectedEntityMentions.projectionExists\n    || projectedNativeKnowledge.projectionExists\n    || projectedGovernance.projectionExists;\n\n  const actualScopedCurrentRows = filterCurrentStateRowsForProjectionScope(projectedCurrent.rows, snapshot.scope);\n  const expectedCurrentById = new Map(\n    snapshot.scopedCurrentRows.map((row) => [row.memoryId, serializeCurrentStateRow(row)]),\n  );\n  const actualCurrentById = new Map(\n    actualScopedCurrentRows.map((row) => [row.memoryId, serializeCurrentStateRow(row)]),\n  );\n\n  const missingCurrentMemoryIds = [...expectedCurrentById.keys()]\n    .filter((memoryId) => !actualCurrentById.has(memoryId))\n    .sort();\n  const extraCurrentMemoryIds = [...actualCurrentById.keys()]\n    .filter((memoryId) => !expectedCurrentById.has(memoryId))\n    .sort();\n  const mismatchedCurrentMemoryIds = [...expectedCurrentById.keys()]\n    .filter((memoryId) =>\n      actualCurrentById.has(memoryId) && actualCurrentById.get(memoryId) !== expectedCurrentById.get(memoryId)\n    )\n    .sort();\n\n  const selectedMemoryIds = new Set([\n    ...snapshot.scopedCurrentRows.map((row) => row.memoryId),\n    ...actualScopedCurrentRows.map((row) => row.memoryId),\n  ]);\n  const expectedTimelineById = new Map(\n    snapshot.scopedTimelineRows.map((event) => [event.eventId, serializeTimelineEvent(event)]),\n  );\n  const actualTimelineRows = projectedTimeline.rows.filter((event) => selectedMemoryIds.has(event.memoryId));\n  const actualTimelineById = new Map(\n    actualTimelineRows.map((event) => [event.eventId, serializeTimelineEvent(event)]),\n  );\n  const missingTimelineEventIds = [...expectedTimelineById.keys()]\n    .filter((eventId) => !actualTimelineById.has(eventId))\n    .sort();\n  const extraTimelineEventIds = [...actualTimelineById.keys()]\n    .filter((eventId) => !expectedTimelineById.has(eventId))\n    .sort();\n\n  const expectedEntityMentionsByKey = new Map(\n    snapshot.scopedEntityMentionRows.map((row) => [\n      `${row.memoryId}::${row.entityRef}::${row.mentionSource}`,\n      serializeEntityMentionRow(row),\n    ]),\n  );\n  const actualScopedEntityMentionRows = projectedEntityMentions.rows.filter((row) => selectedMemoryIds.has(row.memoryId));\n  const actualEntityMentionsByKey = new Map(\n    actualScopedEntityMentionRows.map((row) => [\n      `${row.memoryId}::${row.entityRef}::${row.mentionSource}`,\n      serializeEntityMentionRow(row),\n    ]),\n  );\n  const missingEntityMentionKeys = [...expectedEntityMentionsByKey.keys()]\n    .filter((key) => !actualEntityMentionsByKey.has(key))\n    .sort();\n  const extraEntityMentionKeys = [...actualEntityMentionsByKey.keys()]\n    .filter((key) => !expectedEntityMentionsByKey.has(key))\n    .sort();\n  const mismatchedEntityMentionKeys = [...expectedEntityMentionsByKey.keys()]\n    .filter((key) =>\n      actualEntityMentionsByKey.has(key) && actualEntityMentionsByKey.get(key) !== expectedEntityMentionsByKey.get(key)\n    )\n    .sort();\n\n  const expectedNativeKnowledgeById = new Map(\n    snapshot.nativeKnowledgeRows.map((row) => [row.chunkId, serializeNativeKnowledgeRow(row)]),\n  );\n  const actualNativeKnowledgeById = new Map(\n    projectedNativeKnowledge.rows.map((row) => [row.chunkId, serializeNativeKnowledgeRow(row)]),\n  );\n  const missingNativeKnowledgeChunkIds = [...expectedNativeKnowledgeById.keys()]\n    .filter((chunkId) => !actualNativeKnowledgeById.has(chunkId))\n    .sort();\n  const extraNativeKnowledgeChunkIds = [...actualNativeKnowledgeById.keys()]\n    .filter((chunkId) => !expectedNativeKnowledgeById.has(chunkId))\n    .sort();\n  const mismatchedNativeKnowledgeChunkIds = [...expectedNativeKnowledgeById.keys()]\n    .filter((chunkId) =>\n      actualNativeKnowledgeById.has(chunkId) && actualNativeKnowledgeById.get(chunkId) !== expectedNativeKnowledgeById.get(chunkId)\n    )\n    .sort();\n\n  const expectedReviewQueueById = new Map(\n    (snapshot.governance?.reviewQueueRows ?? []).map((row) => [\n      `${row.runId}::${row.entryId}`,\n      serializeGovernanceReviewQueueRow(row),\n    ]),\n  );\n  const actualReviewQueueById = new Map(\n    projectedGovernance.reviewQueueRows.map((row) => [\n      `${row.runId}::${row.entryId}`,\n      serializeGovernanceReviewQueueRow(row),\n    ]),\n  );\n  const missingReviewQueueEntryIds = [...expectedReviewQueueById.keys()]\n    .filter((entryId) => !actualReviewQueueById.has(entryId))\n    .sort();\n  const extraReviewQueueEntryIds = [...actualReviewQueueById.keys()]\n    .filter((entryId) => !expectedReviewQueueById.has(entryId))\n    .sort();\n  const mismatchedReviewQueueEntryIds = [...expectedReviewQueueById.keys()]\n    .filter((entryId) =>\n      actualReviewQueueById.has(entryId) && actualReviewQueueById.get(entryId) !== expectedReviewQueueById.get(entryId)\n    )\n    .sort();\n\n  return {\n    outputPath,\n    projectionExists,\n    ok:\n      projectionExists &&\n      missingCurrentMemoryIds.length === 0 &&\n      extraCurrentMemoryIds.length === 0 &&\n      mismatchedCurrentMemoryIds.length === 0 &&\n      missingTimelineEventIds.length === 0 &&\n      extraTimelineEventIds.length === 0 &&\n      missingEntityMentionKeys.length === 0 &&\n      extraEntityMentionKeys.length === 0 &&\n      mismatchedEntityMentionKeys.length === 0 &&\n      missingNativeKnowledgeChunkIds.length === 0 &&\n      extraNativeKnowledgeChunkIds.length === 0 &&\n      mismatchedNativeKnowledgeChunkIds.length === 0 &&\n      missingReviewQueueEntryIds.length === 0 &&\n      extraReviewQueueEntryIds.length === 0 &&\n      mismatchedReviewQueueEntryIds.length === 0,\n    expectedCurrentRows: snapshot.scopedCurrentRows.length,\n    actualCurrentRows: actualScopedCurrentRows.length,\n    expectedTimelineRows: snapshot.scopedTimelineRows.length,\n    actualTimelineRows: actualTimelineRows.length,\n    expectedEntityMentionRows: snapshot.scopedEntityMentionRows.length,\n    actualEntityMentionRows: actualScopedEntityMentionRows.length,\n    expectedNativeKnowledgeRows: snapshot.nativeKnowledgeRows.length,\n    actualNativeKnowledgeRows: projectedNativeKnowledge.rows.length,\n    expectedReviewQueueRows: snapshot.governance?.reviewQueueRows.length ?? 0,\n    actualReviewQueueRows: projectedGovernance.reviewQueueRows.length,\n    missingCurrentMemoryIds,\n    extraCurrentMemoryIds,\n    mismatchedCurrentMemoryIds,\n    missingTimelineEventIds,\n    extraTimelineEventIds,\n    missingEntityMentionKeys,\n    extraEntityMentionKeys,\n    mismatchedEntityMentionKeys,\n    missingNativeKnowledgeChunkIds,\n    extraNativeKnowledgeChunkIds,\n    mismatchedNativeKnowledgeChunkIds,\n    missingReviewQueueEntryIds,\n    extraReviewQueueEntryIds,\n    mismatchedReviewQueueEntryIds,\n    usedLifecycleLedger: snapshot.usedLifecycleLedger,\n    scope: snapshot.scope,\n  };\n}\n\nexport async function repairMemoryProjection(\n  options: RepairMemoryProjectionOptions,\n): Promise<RepairMemoryProjectionResult> {\n  const dryRun = options.dryRun !== false;\n  const verify = await verifyMemoryProjection(options);\n  if (verify.ok) {\n    return {\n      dryRun,\n      repaired: false,\n      verify,\n    };\n  }\n  if (dryRun) {\n    return {\n      dryRun: true,\n      repaired: false,\n      verify,\n    };\n  }\n\n  const rebuild = await rebuildMemoryProjection({\n    ...options,\n    dryRun: false,\n  });\n  const verified = await verifyMemoryProjection(options);\n  return {\n    dryRun: false,\n    repaired: verified.ok,\n    verify: verified,\n    rebuild,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,IAAI,YAAY;AAwJhC,eAAsB,yBACpB,WACA,YACA,KAC6B;AAC7B,MAAI;AACF,UAAM,KAAK,UAAU;AAAA,EACvB,SAAS,KAAK;AACZ,QAAI,YAAY,KAAK,QAAQ,GAAG;AAC9B,aAAO;AAAA,IACT;AACA,UAAM;AAAA,EACR;AAEA,QAAM,aAAa,KAAK;AAAA,IACtB;AAAA,IACA;AAAA,IACA;AAAA,IACA,cAAc,GAAG;AAAA,IACjB;AAAA,IACA;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,SAAiB,QAAkC;AAC/E,SAAO,kBAAkB,OAAO,aAAa,OAAO;AACtD;AAEA,SAAS,kBAAkB,WAAmB,QAAkD;AAC9F,QAAM,UAAU,gBAAgB,WAAW,OAAO,IAAI;AACtD,SAAO;AAAA,IACL,UAAU,OAAO,YAAY;AAAA,IAC7B,UAAU,OAAO,YAAY;AAAA,IAC7B,QAAQ,qBAAqB,SAAS,MAAM;AAAA,IAC5C,gBAAgB,OAAO,YAAY;AAAA,IACnC,MAAM,OAAO;AAAA,IACb;AAAA,IACA,SAAS,OAAO,YAAY;AAAA,IAC5B,SAAS,OAAO,YAAY;AAAA,IAC5B,YAAY,OAAO,YAAY;AAAA,IAC/B,cAAc,OAAO,YAAY;AAAA,IACjC,WAAW,OAAO,YAAY;AAAA,IAC9B,QAAQ,OAAO,YAAY;AAAA,IAC3B,YAAY,OAAO,YAAY;AAAA,IAC/B,gBAAgB,OAAO,YAAY;AAAA,IACnC,YAAY,OAAO,YAAY;AAAA,IAC/B,aAAa,OAAO,YAAY;AAAA,IAChC,cAAc,OAAO,YAAY;AAAA,IACjC,MAAM,wBAAwB,OAAO,YAAY,IAAI;AAAA,IACrD,SAAS,2BAA2B,OAAO,OAAO;AAAA,IAClD,eAAe,+BAA+B,MAAM;AAAA,EACtD;AACF;AAEA,SAAS,uBACP,aAC6B;AAC7B,SAAO,YAAY,QAAQ,CAAC,QAAQ;AAClC,UAAM,WAAwC,CAAC;AAC/C,QAAI,IAAI,WAAW;AACjB,eAAS,KAAK;AAAA,QACZ,UAAU,IAAI;AAAA,QACd,WAAW,IAAI;AAAA,QACf,eAAe;AAAA,QACf,SAAS,IAAI;AAAA,QACb,SAAS,IAAI;AAAA,MACf,CAAC;AAAA,IACH;AACA,eAAW,OAAO,IAAI,QAAQ,CAAC,GAAG;AAChC,UAAI,CAAC,IAAI,SAAS,GAAG,EAAG;AACxB,eAAS,KAAK;AAAA,QACZ,UAAU,IAAI;AAAA,QACd,WAAW;AAAA,QACX,eAAe;AAAA,QACf,SAAS,IAAI;AAAA,QACb,SAAS,IAAI;AAAA,MACf,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT,CAAC;AACH;AAEA,SAAS,4BAA4B,QAM1B;AACT,SAAO;AAAA,IACL,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,IACP,OAAO;AAAA,EACT,EAAE,KAAK,IAAI;AACb;AAEA,eAAe,+BAA+B,WAOpC;AACR,QAAM,SAAS,MAAM,yBAAyB,SAAS,GAAG,CAAC;AAC3D,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI;AACF,UAAM,WAAW,MAAM,gCAAgC,WAAW,KAAK;AACvE,WAAO;AAAA,MACL;AAAA,MACA,SAAS,SAAS;AAAA,MAClB,SAAS,SAAS;AAAA,MAClB,iBAAiB,SAAS,YAAY,IAAI,CAAC,WAAW;AAAA,QACpD;AAAA,QACA,SAAS,MAAM;AAAA,QACf,UAAU,MAAM;AAAA,QAChB,MAAM,MAAM;AAAA,QACZ,YAAY,MAAM;AAAA,QAClB,UAAU,MAAM;AAAA,QAChB,iBAAiB,MAAM;AAAA,QACvB,iBAAiB,MAAM;AAAA,QACvB,kBAAkB,CAAC,GAAG,MAAM,gBAAgB;AAAA,MAC9C,EAAE;AAAA,MACF,mBAAmB,SAAS,eAAe,IAAI,CAAC,YAAY;AAAA,QAC1D;AAAA,QACA,QAAQ,4BAA4B,MAAM;AAAA,QAC1C,QAAQ,OAAO;AAAA,QACf,UAAU,OAAO;AAAA,QACjB,YAAY,OAAO;AAAA,QACnB,cAAc,OAAO;AAAA,QACrB,aAAa,OAAO;AAAA,QACpB,cAAc,OAAO;AAAA,QACrB,aAAa,OAAO;AAAA,MACtB,EAAE;AAAA,MACF,QAAQ,SAAS;AAAA,IACnB;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,mBACP,UACA,iBACkE;AAClE,MAAI,gBAAgB,SAAS,GAAG;AAC9B,WAAO;AAAA,MACL,QAAQ,0BAA0B,eAAe;AAAA,MACjD,qBAAqB;AAAA,IACvB;AAAA,EACF;AAEA,SAAO;AAAA,IACL,QAAQ,0BAA0B,SAAS,QAAQ,CAAC,WAAW,8BAA8B,MAAM,CAAC,CAAC;AAAA,IACrG,qBAAqB;AAAA,EACvB;AACF;AAEA,SAAS,mBAAmB,OAA0C;AACpE,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,CAAC,QAAS,QAAO;AACrB,QAAM,SAAS,IAAI,KAAK,OAAO;AAC/B,MAAI,OAAO,MAAM,OAAO,QAAQ,CAAC,GAAG;AAClC,UAAM,IAAI,MAAM,uCAAuC,KAAK,EAAE;AAAA,EAChE;AACA,SAAO,OAAO,YAAY;AAC5B;AAEA,SAAS,yBAAyB,SAMhC;AACA,QAAM,eAAe,mBAAmB,QAAQ,YAAY;AAC5D,QAAM,gBAAgB,mBAAmB,QAAQ,aAAa;AAC9D,MACE,gBACA,iBACA,IAAI,KAAK,YAAY,EAAE,QAAQ,IAAI,IAAI,KAAK,aAAa,EAAE,QAAQ,GACnE;AACA,UAAM,IAAI,MAAM,0DAA0D;AAAA,EAC5E;AACA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,0BAA0B,OAGvB;AACV,SAAO,MAAM,iBAAiB,QAAQ,MAAM,kBAAkB;AAChE;AAEA,SAAS,qBAAqB,QAA4B;AACxD,QAAM,YAAY,OAAO,YAAY,WAAW,OAAO,YAAY;AACnE,SAAO;AACT;AAEA,SAAS,6BACP,WACA,OACS;AACT,MAAI,CAAC,MAAM,gBAAgB,CAAC,MAAM,cAAe,QAAO;AACxD,QAAM,SAAS,IAAI,KAAK,SAAS;AACjC,MAAI,OAAO,MAAM,OAAO,QAAQ,CAAC,EAAG,QAAO;AAC3C,MAAI,MAAM,gBAAgB,OAAO,QAAQ,IAAI,IAAI,KAAK,MAAM,YAAY,EAAE,QAAQ,EAAG,QAAO;AAC5F,MAAI,MAAM,iBAAiB,OAAO,QAAQ,KAAK,IAAI,KAAK,MAAM,aAAa,EAAE,QAAQ,EAAG,QAAO;AAC/F,SAAO;AACT;AAEA,SAAS,iCACP,UACA,OACc;AACd,MAAI,CAAC,MAAM,gBAAgB,CAAC,MAAM,cAAe,QAAO;AACxD,SAAO,SAAS,OAAO,CAAC,WAAW,6BAA6B,qBAAqB,MAAM,GAAG,KAAK,CAAC;AACtG;AAEA,SAAS,yCACP,MACA,OACgC;AAChC,MAAI,CAAC,MAAM,gBAAgB,CAAC,MAAM,cAAe,QAAO;AACxD,SAAO,KAAK,OAAO,CAAC,QAAQ,6BAA6B,IAAI,WAAW,IAAI,SAAS,KAAK,CAAC;AAC7F;AAEA,SAAS,yBAAyB,KAA2C;AAC3E,SAAO,KAAK,UAAU;AAAA,IACpB,UAAU,IAAI;AAAA,IACd,UAAU,IAAI;AAAA,IACd,QAAQ,IAAI;AAAA,IACZ,gBAAgB,IAAI,kBAAkB;AAAA,IACtC,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,SAAS,IAAI;AAAA,IACb,YAAY,IAAI,cAAc;AAAA,IAC9B,cAAc,IAAI,gBAAgB;AAAA,IAClC,WAAW,IAAI,aAAa;AAAA,IAC5B,QAAQ,IAAI;AAAA,IACZ,YAAY,IAAI;AAAA,IAChB,gBAAgB,IAAI;AAAA,IACpB,YAAY,IAAI,cAAc;AAAA,IAC9B,aAAa,IAAI,eAAe;AAAA,IAChC,cAAc,IAAI,gBAAgB;AAAA,IAClC,MAAM,IAAI,QAAQ,CAAC;AAAA,IACnB,SAAS,IAAI,WAAW;AAAA,IACxB,eAAe,IAAI,kBAAkB;AAAA,EACvC,CAAC;AACH;AAEA,SAAS,uBAAuB,OAAqC;AACnE,SAAO,KAAK,UAAU;AAAA,IACpB,SAAS,MAAM;AAAA,IACf,UAAU,MAAM;AAAA,IAChB,WAAW,MAAM;AAAA,IACjB,WAAW,MAAM;AAAA,IACjB,OAAO,MAAM;AAAA,IACb,YAAY,MAAM,cAAc;AAAA,IAChC,aAAa,MAAM;AAAA,IACnB,kBAAkB,MAAM,oBAAoB,CAAC;AAAA,IAC7C,QAAQ,MAAM,UAAU;AAAA,IACxB,OAAO,MAAM,SAAS;AAAA,IACtB,eAAe,MAAM,iBAAiB;AAAA,EACxC,CAAC;AACH;AAEA,SAAS,0BAA0B,KAAwC;AACzE,SAAO,KAAK,UAAU,GAAG;AAC3B;AAEA,SAAS,4BAA4B,KAA+C;AAClF,SAAO,KAAK,UAAU;AAAA,IACpB,SAAS,IAAI;AAAA,IACb,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,IAChB,OAAO,IAAI;AAAA,IACX,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,WAAW,IAAI,aAAa;AAAA,IAC5B,cAAc,IAAI,gBAAgB;AAAA,IAClC,aAAa,IAAI,eAAe;AAAA,IAChC,YAAY,IAAI,cAAc;AAAA,IAC9B,aAAa,IAAI,eAAe;AAAA,IAChC,QAAQ,IAAI,UAAU;AAAA,IACtB,OAAO,IAAI,SAAS;AAAA,IACpB,YAAY,IAAI,cAAc;AAAA,IAC9B,SAAS,IAAI;AAAA,EACf,CAAC;AACH;AAEA,SAAS,kCACP,KACQ;AACR,SAAO,KAAK,UAAU;AAAA,IACpB,OAAO,IAAI;AAAA,IACX,SAAS,IAAI;AAAA,IACb,UAAU,IAAI;AAAA,IACd,MAAM,IAAI;AAAA,IACV,YAAY,IAAI;AAAA,IAChB,UAAU,IAAI;AAAA,IACd,iBAAiB,IAAI;AAAA,IACrB,iBAAiB,IAAI,mBAAmB;AAAA,IACxC,kBAAkB,IAAI;AAAA,EACxB,CAAC;AACH;AAEA,SAAS,yBACP,OAMA;AACA,QAAM,cAAc,MAAM,KAAK;AAC/B,QAAM,WAAyB,CAAC;AAChC,QAAM,WAAW,oBAAI,IAAwB;AAC7C,QAAM,2BAAqD,CAAC;AAC5D,QAAM,yBAAiD,CAAC;AAIxD,aAAW,QAAQ,OAAO;AACxB,eAAW,UAAU,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,MAAM,UAAU,KAAK,KAAK,cAAc,MAAM,IAAI,CAAC,GAAG;AACzF,YAAM,WAAW,OAAO,YAAY,GAAG,KAAK;AAC5C,UAAI,CAAC,UAAU;AACb,+BAAuB,KAAK,EAAE,MAAM,OAAO,KAAK,CAAC;AACjD,YAAI,KAAK,oDAAoD,OAAO,IAAI,EAAE;AAC1E;AAAA,MACF;AACA,YAAM,OAAO,SAAS,IAAI,QAAQ;AAClC,UAAI,MAAM;AACR,iCAAyB,KAAK;AAAA,UAC5B;AAAA,UACA,UAAU,KAAK;AAAA,UACf,aAAa,OAAO;AAAA,QACtB,CAAC;AACD,YAAI;AAAA,UACF,kDAAkD,QAAQ,UAAU,KAAK,IAAI,YAAY,OAAO,IAAI;AAAA,QACtG;AACA;AAAA,MACF;AACA,eAAS,IAAI,UAAU,MAAM;AAC7B,eAAS,KAAK,MAAM;AAAA,IACtB;AAAA,EACF;AAEA,SAAO,EAAE,aAAa,UAAU,0BAA0B,uBAAuB;AACnF;AAEA,SAAS,0BACP,QACA,eAKA;AACA,QAAM,WAAW,oBAAI,IAA2D;AAChF,QAAM,SAAiC,CAAC;AACxC,QAAM,UAA2C,CAAC;AAClD,QAAM,kBAAiD,CAAC;AACxD,aAAW,SAAS,0BAA0B,MAAM,GAAG;AACrD,UAAM,aAAa,cAAc,KAAK;AACtC,QAAI,CAAC,MAAM,SAAS,KAAK,GAAG;AAC1B,sBAAgB,KAAK,EAAE,SAAS,MAAM,SAAS,MAAM,WAAW,CAAC;AACjE,UAAI;AAAA,QACF,4EACc,MAAM,OAAO,SAAS,UAAU;AAAA,MAChD;AACA;AAAA,IACF;AACA,UAAM,OAAO,SAAS,IAAI,MAAM,OAAO;AACvC,QAAI,MAAM;AACR,cAAQ,KAAK;AAAA,QACX,SAAS,MAAM;AAAA,QACf,UAAU,KAAK;AAAA,QACf,aAAa;AAAA,MACf,CAAC;AACD,UAAI;AAAA,QACF,0DAA0D,MAAM,OAAO,UAC7D,KAAK,IAAI,YAAY,UAAU;AAAA,MAC3C;AACA;AAAA,IACF;AACA,aAAS,IAAI,MAAM,SAAS,EAAE,OAAO,MAAM,WAAW,CAAC;AACvD,WAAO,KAAK,KAAK;AAAA,EACnB;AACA,SAAO,EAAE,QAAQ,QAAQ,SAAS,gBAAgB;AACpD;AAEA,eAAe,oCAAoC,SAmChD;AACD,QAAM,UAAU,4BAA4B,2BAA2B,QAAQ,WAAW,QAAQ,OAAO,KAAK,IAAI,eAAe,QAAQ,SAAS;AAGlJ,UAAQ,iCAAiC;AACzC,QAAM,WAAW,yBAAyB;AAAA,IACxC,MAAM,QAAQ,gBAAgB;AAAA,IAC9B,MAAM,QAAQ,oBAAoB;AAAA,IAClC,MAAM,QAAQ,qBAAqB;AAAA,EACrC,CAAC;AACD,QAAM,cAAc,SAAS;AAC7B,QAAM,qBAAqB,SAAS;AACpC,QAAM,kBAAkB,MAAM,QAAQ,6BAA6B;AACnE,QAAM,WAAW,mBAAmB,oBAAoB,eAAe;AACvE,QAAM,sBAAsB,KAAK;AAAA,IAC/B,QAAQ;AAAA,IACR;AAAA,IACA;AAAA,EACF;AACA,QAAM,iBAAiB,IAAI;AAAA,IACzB,mBAAmB,IAAI,CAAC,WAAW,CAAC,OAAO,YAAY,IAAI,OAAO,IAAI,CAAC;AAAA,EACzE;AACA,QAAM,uBAAuB;AAAA,IAC3B,SAAS;AAAA,IACT,CAAC,UAAU,SAAS,sBAChB,sBACA,eAAe,IAAI,MAAM,QAAQ,KAAK;AAAA,EAC5C;AACA,QAAM,SAAS,qBAAqB;AACpC,QAAM,sBAAsB,SAAS;AACrC,QAAM,kCAAkC,IAAI;AAAA,IAC1C,gBAAgB,IAAI,sCAAsC;AAAA,EAC5D,EAAE;AACF,QAAM,cAAc,mBAAmB,IAAI,CAAC,WAAW,kBAAkB,QAAQ,WAAW,MAAM,CAAC;AACnG,QAAM,QAAQ,yBAAyB,OAAO;AAC9C,QAAM,iBAAiB,iCAAiC,oBAAoB,KAAK;AACjF,QAAM,kBAAkB,IAAI,IAAI,eAAe,IAAI,CAAC,WAAW,OAAO,YAAY,EAAE,CAAC;AACrF,QAAM,sBAAsB,MAAM,mCAAmC;AAAA,IACnE,WAAW,QAAQ;AAAA,IACnB,kBAAkB,QAAQ,oBAAoB;AAAA,EAChD,CAAC,EAAE,KAAK,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS;AAAA,IACnC,SAAS,IAAI;AAAA,IACb,YAAY,IAAI;AAAA,IAChB,YAAY,IAAI;AAAA,IAChB,OAAO,IAAI;AAAA,IACX,WAAW,IAAI;AAAA,IACf,SAAS,IAAI;AAAA,IACb,WAAW,IAAI,aAAa,QAAQ,oBAAoB;AAAA,IACxD,cAAc,IAAI;AAAA,IAClB,aAAa,IAAI;AAAA,IACjB,YAAY,IAAI;AAAA,IAChB,aAAa,IAAI;AAAA,IACjB,QAAQ,IAAI;AAAA,IACZ,OAAO,IAAI;AAAA,IACX,YAAY,IAAI;AAAA,IAChB,SAAS,2BAA2B,IAAI,OAAO;AAAA,EACjD,EAAE,CAAC;AACH,QAAM,aAAa,MAAM,+BAA+B,QAAQ,SAAS;AACzE,QAAM,oBAAoB,uBAAuB,WAAW;AAE5D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,cAAc;AAAA,IACd,mBAAmB,YAAY,OAAO,CAAC,QAAQ,gBAAgB,IAAI,IAAI,QAAQ,CAAC;AAAA,IAChF,oBAAoB,OAAO,OAAO,CAAC,UAAU,gBAAgB,IAAI,MAAM,QAAQ,CAAC;AAAA,IAChF;AAAA,IACA,yBAAyB,kBAAkB,OAAO,CAAC,QAAQ,gBAAgB,IAAI,IAAI,QAAQ,CAAC;AAAA,IAC5F;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,0BAA0B,SAAS;AAAA,IACnC,wBAAwB,SAAS;AAAA,IACjC,gCAAgC,qBAAqB;AAAA,IACrD,8BAA8B,qBAAqB;AAAA,EACrD;AACF;AAEA,SAAS,yBACP,WACqE;AACrE,QAAM,SAAS,wBAAwB,SAAS;AAChD,MAAI;AACF,UAAM,KAAK,kBAAkB,QAAQ,EAAE,UAAU,MAAM,eAAe,KAAK,CAAC;AAC5E,QAAI;AACF,YAAM,oBAAoB,+BAA+B,EAAE;AAC3D,YAAM,OAAO,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAkBlB,kBAAkB,QAAQ,KAAK,kBAAkB,WAAW,KAAK,kBAAkB,aAAa;AAAA;AAAA,OAErG,EAAE,IAAI;AAEP,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,MAAM,KACH,IAAI,CAAC,QAAQ,gBAAgB,WAAW,GAAG,CAAC,EAC5C,OAAO,CAAC,QAA6C,QAAQ,IAAI;AAAA,MACtE;AAAA,IACF,UAAE;AACA,SAAG,MAAM;AAAA,IACX;AAAA,EACF,QAAQ;AACN,WAAO,EAAE,kBAAkB,OAAO,MAAM,CAAC,EAAE;AAAA,EAC7C;AACF;AAEA,SAAS,0BACP,WAC6D;AAC7D,QAAM,SAAS,wBAAwB,SAAS;AAChD,MAAI;AACF,UAAM,KAAK,kBAAkB,QAAQ,EAAE,UAAU,MAAM,eAAe,KAAK,CAAC;AAC5E,QAAI;AACF,YAAM,OAAO,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAcvB,EAAE,IAAI;AAEP,aAAO;AAAA,QACL,kBAAkB;AAAA,QAClB,MAAM,kBAAkB,IAAI;AAAA,MAC9B;AAAA,IACF,UAAE;AACA,SAAG,MAAM;AAAA,IACX;AAAA,EACF,QAAQ;AACN,WAAO,EAAE,kBAAkB,OAAO,MAAM,CAAC,EAAE;AAAA,EAC7C;AACF;AAGA,SAAS,kBACP,QACA,QACA,aACA,cACA,mBACA,qBACA,YACA,qBACA,iCACM;AACN,QAAM,KAAK,kBAAkB,MAAM;AACnC,QAAM,YAAY,KAAK,QAAQ,KAAK,QAAQ,MAAM,CAAC;AACnD,MAAI;AACF,iCAA6B,EAAE;AAE/B,UAAM,aAAa,GAAG,QAAQ,uDAAuD;AACrF,eAAW,IAAI,iBAAiB,OAAO,gCAAgC,CAAC;AACxE,eAAW,IAAI,aAAa,MAAM;AAClC,eAAW,IAAI,uBAAuB,sBAAsB,SAAS,OAAO;AAC5E,iCAA6B,YAAY,iCAAiC,YAAY;AACtF,eAAW,IAAI,yBAAyB,YAAY,SAAS,EAAE;AAE/D,UAAM,gBAAgB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAqBhC;AAED,UAAM,iBAAiB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAejC;AAED,UAAM,sBAAsB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAQtC;AAED,UAAM,wBAAwB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAkBxC;AAED,UAAM,8BAA8B,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAY9C;AAED,UAAM,gCAAgC,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAYhD;AAED,UAAM,sBAAsB,GAAG,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,KAUtC;AAED,UAAM,UAAU,GAAG,YAAY,MAAM;AACnC,iBAAW,OAAO,aAAa;AAC7B,sBAAc;AAAA,UACZ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,kBAAkB;AAAA,UACtB,IAAI;AAAA,UACJ,2BAA2B,WAAW,IAAI,OAAO,IAAI,IAAI;AAAA,UACzD,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,cAAc;AAAA,UAClB,IAAI,gBAAgB;AAAA,UACpB,IAAI,aAAa;AAAA,UACjB,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,cAAc;AAAA,UAClB,IAAI,eAAe;AAAA,UACnB,IAAI,gBAAgB;AAAA,UAAM,KAAK,UAAU,IAAI,QAAQ,CAAC,CAAC;AAAA,UAAG,IAAI,WAAW;AAAA,UACzE,IAAI,kBAAkB,OAAO,IAAI;AAAA,QACnC;AAAA,MACF;AAEA,iBAAW,SAAS,cAAc;AAChC,uBAAe;AAAA,UACb,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,MAAM;AAAA,UACN,kCAAkC,MAAM,SAAS;AAAA,UACjD,MAAM;AAAA,UACN,MAAM,cAAc;AAAA,UACpB,MAAM;AAAA,UACN,KAAK,UAAU,MAAM,oBAAoB,CAAC,CAAC;AAAA,UAC3C,MAAM,SAAS,KAAK,UAAU,MAAM,MAAM,IAAI;AAAA,UAC9C,MAAM,QAAQ,KAAK,UAAU,MAAM,KAAK,IAAI;AAAA,UAC5C,MAAM,iBAAiB;AAAA,QACzB;AAAA,MACF;AAEA,iBAAW,OAAO,mBAAmB;AACnC,4BAAoB;AAAA,UAClB,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,QACN;AAAA,MACF;AAEA,iBAAW,OAAO,qBAAqB;AACrC,8BAAsB;AAAA,UACpB,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,aAAa;AAAA,UACjB,IAAI,gBAAgB;AAAA,UACpB,IAAI,eAAe;AAAA,UACnB,IAAI,cAAc;AAAA,UAClB,IAAI,eAAe;AAAA,UACnB,IAAI,UAAU;AAAA,UACd,IAAI,SAAS;AAAA,UACb,IAAI,cAAc;AAAA,UAClB,IAAI;AAAA,QACN;AAAA,MACF;AAEA,iBAAW,OAAO,YAAY,mBAAmB,CAAC,GAAG;AACnD,oCAA4B;AAAA,UAC1B,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,mBAAmB;AAAA,UACvB,KAAK,UAAU,IAAI,gBAAgB;AAAA,QACrC;AAAA,MACF;AAEA,iBAAW,OAAO,YAAY,qBAAqB,CAAC,GAAG;AACrD,sCAA8B;AAAA,UAC5B,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI;AAAA,UACJ,IAAI,eAAe;AAAA,UACnB,IAAI;AAAA,UACJ,IAAI;AAAA,QACN;AAAA,MACF;AAEA,UAAI,YAAY;AACd,cAAM,YACJ,OAAQ,WAAW,SAAiD,cAAc,WAC7E,WAAW,QAAkC,YAC9C;AACN,cAAM,OACJ,OAAQ,WAAW,SAA4C,SAAS,WACnE,WAAW,QAA6B,OACzC;AACN,4BAAoB;AAAA,UAClB,WAAW;AAAA,UACX;AAAA,UACA;AAAA,UACA,KAAK,UAAU,WAAW,WAAW,IAAI;AAAA,UACzC,KAAK,UAAU,WAAW,WAAW,IAAI;AAAA,UACzC,KAAK;AAAA,aACF,WAAW,qBAAqB,CAAC,GAAG,IAAI,CAAC,SAAS;AAAA,cACjD,QAAQ,IAAI;AAAA,cACZ,UAAU,IAAI;AAAA,cACd,YAAY,IAAI;AAAA,cAChB,cAAc,IAAI;AAAA,cAClB,aAAa,IAAI;AAAA,cACjB,cAAc,IAAI;AAAA,cAClB,aAAa,IAAI;AAAA,YACnB,EAAE;AAAA,UACJ;AAAA,UACA,WAAW;AAAA,QACb;AAAA,MACF;AAAA,IACF,CAAC;AAED,YAAQ;AAAA,EACV,UAAE;AACA,OAAG,MAAM;AAAA,EACX;AACF;AAEA,SAAS,uBACP,cACA,iBACA,iBACgC;AAChC,SAAO,CAAC,GAAG,aAAa,OAAO,CAAC,QAAQ,CAAC,gBAAgB,IAAI,IAAI,QAAQ,CAAC,GAAG,GAAG,eAAe,EAC5F,KAAK,CAAC,GAAG,MAAM,EAAE,SAAS,cAAc,EAAE,QAAQ,CAAC;AACxD;AAEA,SAAS,wBACP,cACA,iBACA,iBACwB;AACxB,SAAO,0BAA0B;AAAA,IAC/B,GAAG,aAAa,OAAO,CAAC,UAAU,CAAC,gBAAgB,IAAI,MAAM,QAAQ,CAAC;AAAA,IACtE,GAAG;AAAA,EACL,CAAC;AACH;AAEA,SAAS,6BACP,cACA,iBACA,iBAC6B;AAC7B,SAAO;AAAA,IACL,GAAG,aAAa,OAAO,CAAC,QAAQ,CAAC,gBAAgB,IAAI,IAAI,QAAQ,CAAC;AAAA,IAClE,GAAG;AAAA,EACL,EAAE;AAAA,IAAK,CAAC,MAAM,UACZ,CAAC,KAAK,WAAW,KAAK,UAAU,KAAK,aAAa,EAAE,KAAK,IAAI,EAAE;AAAA,MAC7D,CAAC,MAAM,WAAW,MAAM,UAAU,MAAM,aAAa,EAAE,KAAK,IAAI;AAAA,IAClE;AAAA,EACF;AACF;AAEA,eAAsB,wBACpB,SACwC;AACxC,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,aAAa,wBAAwB,QAAQ,SAAS;AAC5D,QAAM,WAAW,MAAM,oCAAoC,OAAO;AAElE,MAAI;AACJ,MAAI,CAAC,QAAQ;AACX,QAAI,kBAAkB,SAAS;AAC/B,QAAI,mBAAmB,SAAS;AAChC,QAAI,wBAAwB,SAAS;AACrC,QAAI,0BAA0B,SAAS;AACvC,QAAI,iBAAiB,SAAS;AAC9B,QAAI,0BAA0B,SAAS,KAAK,GAAG;AAC7C,wBAAkB,SAAS;AAC3B,yBAAmB,SAAS;AAC5B,8BAAwB,SAAS;AACjC,YAAM,mBAAmB,yBAAyB,QAAQ,SAAS;AACnE,YAAM,oBAAoB,0BAA0B,QAAQ,SAAS;AACrE,YAAM,0BAA0B,+BAA+B,QAAQ,SAAS;AAChF,YAAM,2BAA2B,iCAAiC,QAAQ,SAAS;AACnF,YAAM,sBAAsB,4BAA4B,QAAQ,SAAS;AACzE,UAAI,iBAAiB,oBAAoB,kBAAkB,kBAAkB;AAC3E,cAAM,0BAA0B;AAAA,UAC9B,iBAAiB;AAAA,UACjB,SAAS;AAAA,QACX;AACA,cAAM,kBAAkB,oBAAI,IAAI;AAAA,UAC9B,GAAG,SAAS,kBAAkB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,UACvD,GAAG,SAAS,mBAAmB,IAAI,CAAC,UAAU,MAAM,QAAQ;AAAA,UAC5D,GAAG,wBAAwB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,QACtD,CAAC;AACD,0BAAkB;AAAA,UAChB,iBAAiB;AAAA,UACjB,SAAS;AAAA,UACT;AAAA,QACF;AACA,2BAAmB;AAAA,UACjB,kBAAkB;AAAA,UAClB,SAAS;AAAA,UACT;AAAA,QACF;AACA,gCAAwB;AAAA,UACtB,wBAAwB;AAAA,UACxB,SAAS;AAAA,UACT;AAAA,QACF;AAAA,MACF;AACA,UAAI,yBAAyB,kBAAkB;AAI7C,kCAA0B,SAAS;AAAA,MACrC;AACA,UAAI,oBAAoB,oBAAoB,oBAAoB,OAAO;AAIrE,yBAAiB,SAAS;AAAA,MAC5B;AAAA,IACF;AAEA,UAAM,WAAW,GAAG,UAAU;AAC9B,UAAM,MAAM,KAAK,QAAQ,UAAU,GAAG,EAAE,WAAW,KAAK,CAAC;AACzD,UAAM,GAAG,UAAU,EAAE,OAAO,KAAK,CAAC;AAClC;AAAA,MACE;AAAA,MACA,IAAI,YAAY;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT,SAAS;AAAA,IACX;AACA,iBAAa,MAAM,yBAAyB,QAAQ,WAAW,YAAY,GAAG;AAC9E,iBAAa,MAAM,6BAA6B,UAAU,YAAY,UAAU;AAAA,EAClF;AAEA,SAAO;AAAA,IACL;AAAA,IACA,iBAAiB,SAAS,YAAY;AAAA,IACtC,aAAa,SAAS,kBAAkB;AAAA,IACxC,cAAc,SAAS,mBAAmB;AAAA,IAC1C,mBAAmB,SAAS,wBAAwB;AAAA,IACpD,qBAAqB,SAAS,oBAAoB;AAAA,IAClD,iBAAiB,SAAS,YAAY,gBAAgB,UAAU;AAAA,IAChE;AAAA,IACA;AAAA,IACA,qBAAqB,SAAS;AAAA,IAC9B,0BAA0B,SAAS;AAAA,IACnC,wBAAwB,SAAS;AAAA,IACjC,gCAAgC,SAAS;AAAA,IACzC,8BAA8B,SAAS;AAAA,IACvC,OAAO,SAAS;AAAA,EAClB;AACF;AAEA,eAAsB,uBACpB,SACuC;AACvC,QAAM,aAAa,wBAAwB,QAAQ,SAAS;AAC5D,QAAM,WAAW,MAAM,oCAAoC,OAAO;AAClE,QAAM,mBAAmB,yBAAyB,QAAQ,SAAS;AACnE,QAAM,oBAAoB,0BAA0B,QAAQ,SAAS;AACrE,QAAM,0BAA0B,+BAA+B,QAAQ,SAAS;AAChF,QAAM,2BAA2B,iCAAiC,QAAQ,SAAS;AACnF,QAAM,sBAAsB,4BAA4B,QAAQ,SAAS;AACzE,QAAM,mBAAmB,iBAAiB,oBACrC,kBAAkB,oBAClB,wBAAwB,oBACxB,yBAAyB,oBACzB,oBAAoB;AAEzB,QAAM,0BAA0B,yCAAyC,iBAAiB,MAAM,SAAS,KAAK;AAC9G,QAAM,sBAAsB,IAAI;AAAA,IAC9B,SAAS,kBAAkB,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU,yBAAyB,GAAG,CAAC,CAAC;AAAA,EACvF;AACA,QAAM,oBAAoB,IAAI;AAAA,IAC5B,wBAAwB,IAAI,CAAC,QAAQ,CAAC,IAAI,UAAU,yBAAyB,GAAG,CAAC,CAAC;AAAA,EACpF;AAEA,QAAM,0BAA0B,CAAC,GAAG,oBAAoB,KAAK,CAAC,EAC3D,OAAO,CAAC,aAAa,CAAC,kBAAkB,IAAI,QAAQ,CAAC,EACrD,KAAK;AACR,QAAM,wBAAwB,CAAC,GAAG,kBAAkB,KAAK,CAAC,EACvD,OAAO,CAAC,aAAa,CAAC,oBAAoB,IAAI,QAAQ,CAAC,EACvD,KAAK;AACR,QAAM,6BAA6B,CAAC,GAAG,oBAAoB,KAAK,CAAC,EAC9D;AAAA,IAAO,CAAC,aACP,kBAAkB,IAAI,QAAQ,KAAK,kBAAkB,IAAI,QAAQ,MAAM,oBAAoB,IAAI,QAAQ;AAAA,EACzG,EACC,KAAK;AAER,QAAM,oBAAoB,oBAAI,IAAI;AAAA,IAChC,GAAG,SAAS,kBAAkB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,IACvD,GAAG,wBAAwB,IAAI,CAAC,QAAQ,IAAI,QAAQ;AAAA,EACtD,CAAC;AACD,QAAM,uBAAuB,IAAI;AAAA,IAC/B,SAAS,mBAAmB,IAAI,CAAC,UAAU,CAAC,MAAM,SAAS,uBAAuB,KAAK,CAAC,CAAC;AAAA,EAC3F;AACA,QAAM,qBAAqB,kBAAkB,KAAK,OAAO,CAAC,UAAU,kBAAkB,IAAI,MAAM,QAAQ,CAAC;AACzG,QAAM,qBAAqB,IAAI;AAAA,IAC7B,mBAAmB,IAAI,CAAC,UAAU,CAAC,MAAM,SAAS,uBAAuB,KAAK,CAAC,CAAC;AAAA,EAClF;AACA,QAAM,0BAA0B,CAAC,GAAG,qBAAqB,KAAK,CAAC,EAC5D,OAAO,CAAC,YAAY,CAAC,mBAAmB,IAAI,OAAO,CAAC,EACpD,KAAK;AACR,QAAM,wBAAwB,CAAC,GAAG,mBAAmB,KAAK,CAAC,EACxD,OAAO,CAAC,YAAY,CAAC,qBAAqB,IAAI,OAAO,CAAC,EACtD,KAAK;AAER,QAAM,8BAA8B,IAAI;AAAA,IACtC,SAAS,wBAAwB,IAAI,CAAC,QAAQ;AAAA,MAC5C,GAAG,IAAI,QAAQ,KAAK,IAAI,SAAS,KAAK,IAAI,aAAa;AAAA,MACvD,0BAA0B,GAAG;AAAA,IAC/B,CAAC;AAAA,EACH;AACA,QAAM,gCAAgC,wBAAwB,KAAK,OAAO,CAAC,QAAQ,kBAAkB,IAAI,IAAI,QAAQ,CAAC;AACtH,QAAM,4BAA4B,IAAI;AAAA,IACpC,8BAA8B,IAAI,CAAC,QAAQ;AAAA,MACzC,GAAG,IAAI,QAAQ,KAAK,IAAI,SAAS,KAAK,IAAI,aAAa;AAAA,MACvD,0BAA0B,GAAG;AAAA,IAC/B,CAAC;AAAA,EACH;AACA,QAAM,2BAA2B,CAAC,GAAG,4BAA4B,KAAK,CAAC,EACpE,OAAO,CAAC,QAAQ,CAAC,0BAA0B,IAAI,GAAG,CAAC,EACnD,KAAK;AACR,QAAM,yBAAyB,CAAC,GAAG,0BAA0B,KAAK,CAAC,EAChE,OAAO,CAAC,QAAQ,CAAC,4BAA4B,IAAI,GAAG,CAAC,EACrD,KAAK;AACR,QAAM,8BAA8B,CAAC,GAAG,4BAA4B,KAAK,CAAC,EACvE;AAAA,IAAO,CAAC,QACP,0BAA0B,IAAI,GAAG,KAAK,0BAA0B,IAAI,GAAG,MAAM,4BAA4B,IAAI,GAAG;AAAA,EAClH,EACC,KAAK;AAER,QAAM,8BAA8B,IAAI;AAAA,IACtC,SAAS,oBAAoB,IAAI,CAAC,QAAQ,CAAC,IAAI,SAAS,4BAA4B,GAAG,CAAC,CAAC;AAAA,EAC3F;AACA,QAAM,4BAA4B,IAAI;AAAA,IACpC,yBAAyB,KAAK,IAAI,CAAC,QAAQ,CAAC,IAAI,SAAS,4BAA4B,GAAG,CAAC,CAAC;AAAA,EAC5F;AACA,QAAM,iCAAiC,CAAC,GAAG,4BAA4B,KAAK,CAAC,EAC1E,OAAO,CAAC,YAAY,CAAC,0BAA0B,IAAI,OAAO,CAAC,EAC3D,KAAK;AACR,QAAM,+BAA+B,CAAC,GAAG,0BAA0B,KAAK,CAAC,EACtE,OAAO,CAAC,YAAY,CAAC,4BAA4B,IAAI,OAAO,CAAC,EAC7D,KAAK;AACR,QAAM,oCAAoC,CAAC,GAAG,4BAA4B,KAAK,CAAC,EAC7E;AAAA,IAAO,CAAC,YACP,0BAA0B,IAAI,OAAO,KAAK,0BAA0B,IAAI,OAAO,MAAM,4BAA4B,IAAI,OAAO;AAAA,EAC9H,EACC,KAAK;AAER,QAAM,0BAA0B,IAAI;AAAA,KACjC,SAAS,YAAY,mBAAmB,CAAC,GAAG,IAAI,CAAC,QAAQ;AAAA,MACxD,GAAG,IAAI,KAAK,KAAK,IAAI,OAAO;AAAA,MAC5B,kCAAkC,GAAG;AAAA,IACvC,CAAC;AAAA,EACH;AACA,QAAM,wBAAwB,IAAI;AAAA,IAChC,oBAAoB,gBAAgB,IAAI,CAAC,QAAQ;AAAA,MAC/C,GAAG,IAAI,KAAK,KAAK,IAAI,OAAO;AAAA,MAC5B,kCAAkC,GAAG;AAAA,IACvC,CAAC;AAAA,EACH;AACA,QAAM,6BAA6B,CAAC,GAAG,wBAAwB,KAAK,CAAC,EAClE,OAAO,CAAC,YAAY,CAAC,sBAAsB,IAAI,OAAO,CAAC,EACvD,KAAK;AACR,QAAM,2BAA2B,CAAC,GAAG,sBAAsB,KAAK,CAAC,EAC9D,OAAO,CAAC,YAAY,CAAC,wBAAwB,IAAI,OAAO,CAAC,EACzD,KAAK;AACR,QAAM,gCAAgC,CAAC,GAAG,wBAAwB,KAAK,CAAC,EACrE;AAAA,IAAO,CAAC,YACP,sBAAsB,IAAI,OAAO,KAAK,sBAAsB,IAAI,OAAO,MAAM,wBAAwB,IAAI,OAAO;AAAA,EAClH,EACC,KAAK;AAER,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,IACE,oBACA,wBAAwB,WAAW,KACnC,sBAAsB,WAAW,KACjC,2BAA2B,WAAW,KACtC,wBAAwB,WAAW,KACnC,sBAAsB,WAAW,KACjC,yBAAyB,WAAW,KACpC,uBAAuB,WAAW,KAClC,4BAA4B,WAAW,KACvC,+BAA+B,WAAW,KAC1C,6BAA6B,WAAW,KACxC,kCAAkC,WAAW,KAC7C,2BAA2B,WAAW,KACtC,yBAAyB,WAAW,KACpC,8BAA8B,WAAW;AAAA,IAC3C,qBAAqB,SAAS,kBAAkB;AAAA,IAChD,mBAAmB,wBAAwB;AAAA,IAC3C,sBAAsB,SAAS,mBAAmB;AAAA,IAClD,oBAAoB,mBAAmB;AAAA,IACvC,2BAA2B,SAAS,wBAAwB;AAAA,IAC5D,yBAAyB,8BAA8B;AAAA,IACvD,6BAA6B,SAAS,oBAAoB;AAAA,IAC1D,2BAA2B,yBAAyB,KAAK;AAAA,IACzD,yBAAyB,SAAS,YAAY,gBAAgB,UAAU;AAAA,IACxE,uBAAuB,oBAAoB,gBAAgB;AAAA,IAC3D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,qBAAqB,SAAS;AAAA,IAC9B,OAAO,SAAS;AAAA,EAClB;AACF;AAEA,eAAsB,uBACpB,SACuC;AACvC,QAAM,SAAS,QAAQ,WAAW;AAClC,QAAM,SAAS,MAAM,uBAAuB,OAAO;AACnD,MAAI,OAAO,IAAI;AACb,WAAO;AAAA,MACL;AAAA,MACA,UAAU;AAAA,MACV;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ;AACV,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,UAAU;AAAA,MACV;AAAA,IACF;AAAA,EACF;AAEA,QAAM,UAAU,MAAM,wBAAwB;AAAA,IAC5C,GAAG;AAAA,IACH,QAAQ;AAAA,EACV,CAAC;AACD,QAAM,WAAW,MAAM,uBAAuB,OAAO;AACrD,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,UAAU,SAAS;AAAA,IACnB,QAAQ;AAAA,IACR;AAAA,EACF;AACF;","names":[]}