@remnic/core 1.1.0 → 1.1.2

package/dist/chunk-3WHVNEN7.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/types.ts"],"sourcesContent":["export type ReasoningEffort = \"none\" | \"low\" | \"medium\" | \"high\";\nexport type TriggerMode = \"smart\" | \"every_n\" | \"time_based\";\nexport type SignalLevel = \"none\" | \"low\" | \"medium\" | \"high\";\nexport type MemoryCategory = \"fact\" | \"preference\" | \"correction\" | \"entity\" | \"decision\" | \"relationship\" | \"principle\" | \"commitment\" | \"moment\" | \"skill\" | \"rule\" | \"procedure\";\nexport type ConsolidationAction = \"ADD\" | \"MERGE\" | \"UPDATE\" | \"INVALIDATE\" | \"SKIP\";\nexport type ConfidenceTier = \"explicit\" | \"implied\" | \"inferred\" | \"speculative\";\nexport type PrincipalFromSessionKeyMode = \"map\" | \"prefix\" | \"regex\";\nexport type RecallPlanMode = \"no_recall\" | \"minimal\" | \"full\" | \"graph_mode\";\nexport type CronRecallMode = \"all\" | \"none\" | \"allowlist\";\nexport type CronConversationRecallMode = \"auto\" | \"always\" | \"never\";\nexport type IdentityInjectionMode = \"recovery_only\" | \"minimal\" | \"full\";\nexport type CaptureMode = \"implicit\" | \"explicit\" | \"hybrid\";\nexport type MemoryOsPresetName = \"conservative\" | \"balanced\" | \"research-max\" | \"local-llm-heavy\";\nexport type ExtractionPassSource = \"base\" | \"proactive\";\nexport type SlotMismatchMode = \"error\" | \"warn\" | \"silent\";\nexport type CodexCompactionFlushMode = \"signal\" | \"heuristic\" | \"auto\";\nexport type DreamingNarrativePromptStyle = \"reflective\" | \"diary\" | \"analytical\";\nexport type HeartbeatDetectionMode = \"runtime-signal\" | \"heuristic\" | \"auto\";\nexport type ActiveRecallQueryMode = \"message\" | \"recent\" | \"full\";\nexport type ActiveRecallPromptStyle =\n  | \"balanced\"\n  | \"strict\"\n  | \"contextual\"\n  | \"recall-heavy\"\n  | \"precision-heavy\"\n  | \"preference-only\";\nexport type ActiveRecallThinking =\n  | \"off\"\n  | \"minimal\"\n  | \"low\"\n  | \"medium\"\n  | \"high\"\n  | \"xhigh\"\n  | \"adaptive\";\nexport type ActiveRecallChatType = \"direct\" | \"group\" | \"channel\";\nexport type ActiveRecallModelFallbackPolicy = \"default-remote\" | \"resolved-only\";\n\n/**\n * Retrieval tier ladder (issue #518).  Identifies which tier served a recall\n * result.  Ordered top-to-bottom by cost, but routing is not strictly\n * sequential — callers may jump straight to a lower tier when eligibility\n * does not hold.\n */\nexport type RetrievalTier =\n  | \"exact-cache\"\n  | \"fuzzy-cache\"\n  | \"direct-answer\"\n  | \"hybrid\"\n  | \"rerank-graph\"\n  | \"agentic\";\n\n/**\n * Per-recall annotation describing which retrieval tier served a result,\n * why that tier was chosen, and what was filtered along the way.  Added as\n * part of issue #518 (direct-answer tier + `query --explain`).\n *\n * Not to be confused with the existing `recallExplain` operation\n * (graph-path explanation) — that is a user-invoked RPC; this is a\n * per-result annotation that can be attached to any recall response.\n */\nexport interface RecallTierExplain {\n  tier: RetrievalTier;\n  tierReason: string;\n  filteredBy: string[];\n  candidatesConsidered: number;\n  latencyMs: number;\n  sourceAnchors?: Array<{ path: string; lineRange?: [number, number] }>;\n}\n\nexport interface RecallSectionConfig {\n  id: string;\n  enabled?: boolean;\n  maxChars?: number | null;\n  maxHints?: number;\n  maxSupportingFacts?: number;\n  maxRelatedEntities?: number;\n  consolidateTriggerLines?: number;\n  consolidateTargetLines?: number;\n  maxEntities?: number;\n  maxResults?: number;\n  recentTurns?: number;\n  maxTurns?: number;\n  maxTokens?: number;\n  lookbackHours?: number;\n  maxCount?: number;\n  topK?: number;\n  timeoutMs?: number;\n  maxPatterns?: number;\n  maxRubrics?: number;\n}\n\nexport interface RecallPipelineConfig {\n  recallBudgetChars: number;\n  pipeline: RecallSectionConfig[];\n}\n\nexport interface SessionObserverBandConfig {\n  maxBytes: number;\n  triggerDeltaBytes: number;\n  triggerDeltaTokens: number;\n}\n\nexport interface FileHygieneConfig {\n  enabled: boolean;\n  // Lint (warn before truncation risk)\n  lintEnabled: boolean;\n  lintBudgetBytes: number;\n  lintWarnRatio: number;\n  lintPaths: string[];\n  // Rotation/splitting\n  rotateEnabled: boolean;\n  rotateMaxBytes: number;\n  rotateKeepTailChars: number;\n  rotatePaths: string[];\n  archiveDir: string;\n  // Cadence\n  runMinIntervalMs: number;\n  // Optional warnings log (future-proofed)\n  warningsLogEnabled: boolean;\n  warningsLogPath: string;\n  // Optional index file (future-proofed)\n  indexEnabled: boolean;\n  indexPath: string;\n}\n\nexport interface NativeKnowledgeConfig {\n  enabled: boolean;\n  includeFiles: string[];\n  maxChunkChars: number;\n  maxResults: number;\n  maxChars: number;\n  stateDir: string;\n  obsidianVaults: NativeKnowledgeObsidianVaultConfig[];\n  openclawWorkspace?: NativeKnowledgeOpenClawWorkspaceConfig;\n}\n\nexport interface NativeKnowledgeFolderRuleConfig {\n  pathPrefix: string;\n  namespace?: string;\n  privacyClass?: string;\n}\n\nexport interface NativeKnowledgeObsidianVaultConfig {\n  id: string;\n  rootDir: string;\n  includeGlobs: string[];\n  excludeGlobs: string[];\n  namespace?: string;\n  privacyClass?: string;\n  folderRules: NativeKnowledgeFolderRuleConfig[];\n  dailyNotePatterns: string[];\n  materializeBacklinks: boolean;\n}\n\nexport interface NativeKnowledgeOpenClawWorkspaceConfig {\n  enabled: boolean;\n  bootstrapFiles: string[];\n  handoffGlobs: string[];\n  dailySummaryGlobs: string[];\n  automationNoteGlobs: string[];\n  workspaceDocGlobs: string[];\n  excludeGlobs: string[];\n  sharedSafeGlobs: string[];\n}\n\nexport interface AgentAccessHttpConfig {\n  enabled: boolean;\n  host: string;\n  port: number;\n  authToken?: string;\n  principal?: string;\n  maxBodyBytes: number;\n}\n\nexport interface DreamingConfig {\n  enabled: boolean;\n  journalPath: string;\n  maxEntries: number;\n  injectRecentCount: number;\n  minIntervalMinutes: number;\n  narrativeModel: string | null;\n  narrativePromptStyle: DreamingNarrativePromptStyle;\n  watchFile: boolean;\n}\n\n/** Procedural memory (issue #519): mining + recall gates. All sub-features default off. */\nexport interface ProceduralConfig {\n  enabled: boolean;\n  /** Minimum cluster size before emitting a candidate; `0` disables mining (`minOccurrences_zero`). */\n  minOccurrences: number;\n  /** Minimum success rate from trajectory outcomes in [0, 1]. */\n  successFloor: number;\n  /** When auto-promotion is enabled, promote pending_review → active after this many occurrences. */\n  autoPromoteOccurrences: number;\n  autoPromoteEnabled: boolean;\n  lookbackDays: number;\n  /** When true, installer may register the nightly procedural mining cron (default off). */\n  proceduralMiningCronAutoRegister: boolean;\n  /** Max procedure memories to inject on task-initiation recall (1–10). */\n  recallMaxProcedures: number;\n}\n\n/** Configuration for the nightly contradiction-scan cron (issue #520). */\nexport interface ContradictionScanConfig {\n  /** Master switch for the contradiction scan cron. Default true. */\n  enabled: boolean;\n  /** Embedding cosine similarity floor for candidate pair generation. Default 0.82. */\n  similarityFloor: number;\n  /** Minimum topic-token Jaccard overlap for unstructured pairs. Default 0.4. */\n  topicOverlapFloor: number;\n  /** Cap on candidate pairs evaluated per cron run. Default 500. */\n  maxPairsPerRun: number;\n  /** Cooldown in days before re-evaluating a pair judged independent/both-valid. Default 14. */\n  cooldownDays: number;\n  /** When true, pairs judged \"duplicates\" are auto-flagged for dedup (still need user approval). Default false. */\n  autoMergeDuplicates: boolean;\n}\n\nexport interface HeartbeatConfig {\n  enabled: boolean;\n  journalPath: string;\n  maxPreviousRuns: number;\n  watchFile: boolean;\n  detectionMode: HeartbeatDetectionMode;\n  gateExtractionDuringHeartbeat: boolean;\n}\n\nexport interface SlotBehaviorConfig {\n  requireExclusiveMemorySlot: boolean;\n  onSlotMismatch: SlotMismatchMode;\n}\n\nexport interface CodexCompatConfig {\n  enabled: boolean;\n  threadIdBufferKeying: boolean;\n  compactionFlushMode: CodexCompactionFlushMode;\n  fingerprintDedup: boolean;\n}\n\nexport function confidenceTier(score: number): ConfidenceTier {\n  if (score >= 0.95) return \"explicit\";\n  if (score >= 0.70) return \"implied\";\n  if (score >= 0.40) return \"inferred\";\n  return \"speculative\";\n}\n\n/** Default TTL in days for speculative memories (auto-expire if unconfirmed) */\nexport const SPECULATIVE_TTL_DAYS = 30;\n\n/**\n * Shape for semantic chunking config overrides stored in PluginConfig.\n * Mirrors SemanticChunkingConfig from semantic-chunking.ts without creating\n * a circular import (types.ts is imported by everything).\n */\nexport interface SemanticChunkingConfigShape {\n  targetTokens: number;\n  minTokens: number;\n  maxTokens: number;\n  smoothingWindowSize: number;\n  boundaryThresholdStdDevs: number;\n  embeddingBatchSize: number;\n  fallbackToRecursive: boolean;\n}\n\nexport interface PluginConfig {\n  openaiApiKey: string | undefined;\n  openaiBaseUrl: string | undefined;\n  model: string;\n  reasoningEffort: ReasoningEffort;\n  triggerMode: TriggerMode;\n  bufferMaxTurns: number;\n  bufferMaxMinutes: number;\n  consolidateEveryN: number;\n  highSignalPatterns: string[];\n  maxMemoryTokens: number;\n  memoryOsPreset?: MemoryOsPresetName;\n  qmdEnabled: boolean;\n  qmdCollection: string;\n  qmdMaxResults: number;\n  qmdColdTierEnabled?: boolean;\n  qmdColdCollection?: string;\n  qmdColdMaxResults?: number;\n  qmdTierMigrationEnabled: boolean;\n  qmdTierDemotionMinAgeDays: number;\n  qmdTierDemotionValueThreshold: number;\n  qmdTierPromotionValueThreshold: number;\n  qmdTierParityGraphEnabled: boolean;\n  qmdTierParityHiMemEnabled: boolean;\n  qmdTierAutoBackfillEnabled: boolean;\n  embeddingFallbackEnabled: boolean;\n  embeddingFallbackProvider: \"auto\" | \"openai\" | \"local\";\n  /** Optional absolute path to qmd binary. If unset, PATH/fallback discovery is used. */\n  qmdPath?: string;\n  memoryDir: string;\n  debug: boolean;\n  identityEnabled: boolean;\n  identityContinuityEnabled: boolean;\n  identityInjectionMode: IdentityInjectionMode;\n  identityMaxInjectChars: number;\n  continuityIncidentLoggingEnabled: boolean;\n  continuityAuditEnabled: boolean;\n  sessionObserverEnabled?: boolean;\n  sessionObserverDebounceMs?: number;\n  sessionObserverBands?: SessionObserverBandConfig[];\n  injectQuestions: boolean;\n  commitmentDecayDays: number;\n  workspaceDir: string;\n  captureMode: CaptureMode;\n  fileHygiene?: FileHygieneConfig;\n  nativeKnowledge?: NativeKnowledgeConfig;\n  agentAccessHttp: AgentAccessHttpConfig;\n  // Access tracking (Phase 1A)\n  accessTrackingEnabled: boolean;\n  accessTrackingBufferMaxSize: number;\n  // Retrieval options\n  recencyWeight: number;\n  boostAccessCount: boolean;\n  /** Record empty recall impressions (memoryIds: []) when no memories are injected. Disabled by default. */\n  recordEmptyRecallImpressions: boolean;\n  // v2.2 Advanced Retrieval\n  queryExpansionEnabled: boolean;\n  queryExpansionMaxQueries: number;\n  /** Minimum token length to consider for query expansion. */\n  queryExpansionMinTokenLen: number;\n  rerankEnabled: boolean;\n  /** Rerank provider. \"local\" uses Local LLM only; \"cloud\" uses gateway fallback chain. */\n  rerankProvider: \"local\" | \"cloud\";\n  rerankMaxCandidates: number;\n  rerankTimeoutMs: number;\n  rerankCacheEnabled: boolean;\n  rerankCacheTtlMs: number;\n  feedbackEnabled: boolean;\n  // v2.2 Negative Examples (safe defaults: off unless enabled)\n  /** If true, allow recording negative examples and apply a soft penalty during ranking. */\n  negativeExamplesEnabled: boolean;\n  /** Score penalty per \"not useful\" hit (typical QMD scores ~0-1). Keep small. */\n  negativeExamplesPenaltyPerHit: number;\n  /** Maximum penalty applied from negative examples. */\n  negativeExamplesPenaltyCap: number;\n  // Chunking (Phase 2A)\n  chunkingEnabled: boolean;\n  chunkingTargetTokens: number;\n  chunkingMinTokens: number;\n  chunkingOverlapSentences: number;\n  // Semantic Chunking (Issue #368)\n  /** Enable semantic chunking with embedding-based topic boundary detection. Default: false. */\n  semanticChunkingEnabled: boolean;\n  /** Optional overrides for the semantic chunking algorithm. */\n  semanticChunkingConfig: Partial<SemanticChunkingConfigShape>;\n  // Contradiction Detection (Phase 2B)\n  contradictionDetectionEnabled: boolean;\n  contradictionSimilarityThreshold: number;\n  contradictionMinConfidence: number;\n  contradictionAutoResolve: boolean;\n  /** Nightly contradiction-scan cron config (issue #520). */\n  contradictionScan: ContradictionScanConfig;\n  // Temporal Supersession (issue #375)\n  /**\n   * When enabled, writes that carry `structuredAttributes` mark any older\n   * fact with the same `entityRef + attribute_name` supersession key and a\n   * conflicting value as `status: \"superseded\"`.\n   */\n  temporalSupersessionEnabled: boolean;\n  /**\n   * When enabled, superseded memories are still returned by recall (useful\n   * for audit/history queries).  Default: false — superseded memories are\n   * filtered out.\n   */\n  temporalSupersessionIncludeInRecall: boolean;\n  // Direct-answer retrieval tier (issue #518)\n  /**\n   * When true, recall checks whether a single validated memory in a\n   * high-trust taxonomy bucket can answer the query before invoking QMD.\n   * Default false — enable explicitly after bench validation.\n   */\n  recallDirectAnswerEnabled: boolean;\n  /**\n   * Minimum token-overlap ratio (query tokens ∩ memory tokens / query tokens)\n   * required for direct-answer eligibility.  Set to 0 to disable the gate.\n   */\n  recallDirectAnswerTokenOverlapFloor: number;\n  /**\n   * Minimum calibrated importance score required for direct-answer\n   * eligibility.  Set to 0 to disable the gate.\n   */\n  recallDirectAnswerImportanceFloor: number;\n  /**\n   * Ambiguity margin: if the second-best candidate scores within this\n   * ratio of the top candidate, direct-answer defers to the hybrid tier.\n   */\n  recallDirectAnswerAmbiguityMargin: number;\n  /**\n   * Taxonomy category IDs eligible for direct-answer routing.  Memories\n   * whose resolved taxonomy category is not in this list never qualify.\n   */\n  recallDirectAnswerEligibleTaxonomyBuckets: string[];\n  // Memory Linking (Phase 3A)\n  memoryLinkingEnabled: boolean;\n  // Conversation Threading (Phase 3B)\n  threadingEnabled: boolean;\n  threadingGapMinutes: number;\n  // Memory Summarization (Phase 4A)\n  summarizationEnabled: boolean;\n  summarizationTriggerCount: number;\n  summarizationRecentToKeep: number;\n  summarizationImportanceThreshold: number;\n  summarizationProtectedTags: string[];\n  // Topic Extraction (Phase 4B)\n  topicExtractionEnabled: boolean;\n  topicExtractionTopN: number;\n  // Transcript & Context Preservation (v2.0)\n  // Transcript archive\n  transcriptEnabled: boolean;\n  transcriptRetentionDays: number;\n  /** Channel types to skip from transcript logging (e.g., [\"cron\"]) */\n  transcriptSkipChannelTypes: string[];\n  // Transcript injection\n  transcriptRecallHours: number;\n  maxTranscriptTurns: number;\n  maxTranscriptTokens: number;\n  // Checkpoint\n  checkpointEnabled: boolean;\n  checkpointTurns: number;\n  // Compaction reset: trigger session reset after compaction instead of continuing degraded.\n  // Requires OC fork with PR #29985 (api.resetSession).\n  compactionResetEnabled: boolean;\n  beforeResetTimeoutMs: number;\n  flushOnResetEnabled: boolean;\n  commandsListEnabled: boolean;\n  openclawToolsEnabled: boolean;\n  openclawToolSnippetMaxChars: number;\n  sessionTogglesEnabled: boolean;\n  verboseRecallVisibility: boolean;\n  recallTranscriptsEnabled: boolean;\n  recallTranscriptRetentionDays: number;\n  respectBundledActiveMemoryToggle: boolean;\n  activeRecallEnabled: boolean;\n  activeRecallAgents: string[] | null;\n  activeRecallAllowedChatTypes: ActiveRecallChatType[];\n  activeRecallQueryMode: ActiveRecallQueryMode;\n  activeRecallPromptStyle: ActiveRecallPromptStyle;\n  activeRecallPromptOverride: string | null;\n  activeRecallPromptAppend: string | null;\n  activeRecallMaxSummaryChars: number;\n  activeRecallRecentUserTurns: number;\n  activeRecallRecentAssistantTurns: number;\n  activeRecallRecentUserChars: number;\n  activeRecallRecentAssistantChars: number;\n  activeRecallThinking: ActiveRecallThinking;\n  activeRecallTimeoutMs: number;\n  activeRecallCacheTtlMs: number;\n  activeRecallModel: string | null;\n  activeRecallModelFallbackPolicy: ActiveRecallModelFallbackPolicy;\n  activeRecallPersistTranscripts: boolean;\n  activeRecallTranscriptDir: string;\n  activeRecallEntityGraphDepth: number;\n  activeRecallIncludeCausalTrajectories: boolean;\n  activeRecallIncludeDaySummary: boolean;\n  activeRecallAttachRecallExplain: boolean;\n  activeRecallAllowChainedActiveMemory: boolean;\n  dreaming: DreamingConfig;\n  procedural: ProceduralConfig;\n  heartbeat: HeartbeatConfig;\n  slotBehavior: SlotBehaviorConfig;\n  codexCompat: CodexCompatConfig;\n  // Extraction judge (issue #376)\n  /** Enable the LLM-as-judge fact-worthiness gate on extracted facts. Default false (opt-in). */\n  extractionJudgeEnabled: boolean;\n  /** Model override for the judge LLM. Empty string means use the local model. */\n  extractionJudgeModel: string;\n  /** Maximum number of candidate facts per judge LLM batch call. */\n  extractionJudgeBatchSize: number;\n  /** Shadow mode: log judge verdicts but do not filter facts. Default false. */\n  extractionJudgeShadow: boolean;\n  // Hourly summaries\n  hourlySummariesEnabled: boolean;\n  daySummaryEnabled: boolean;\n  /** If true, Engram may attempt to auto-register an hourly summary cron job (default off). */\n  hourlySummaryCronAutoRegister: boolean;\n  /** If true, Engram may attempt to auto-register the nightly governance cron job (default off). */\n  nightlyGovernanceCronAutoRegister: boolean;\n  summaryRecallHours: number;\n  maxSummaryCount: number;\n  summaryModel: string;\n  // v2.4 Extended hourly summaries\n  hourlySummariesExtendedEnabled: boolean;\n  hourlySummariesIncludeToolStats: boolean;\n  hourlySummariesIncludeSystemMessages: boolean;\n  hourlySummariesMaxTurnsPerRun: number;\n  // v2.4 Conversation index (optional)\n  conversationIndexEnabled: boolean;\n  conversationIndexBackend: \"qmd\" | \"faiss\";\n  conversationIndexQmdCollection: string;\n  conversationIndexRetentionDays: number;\n  conversationIndexMinUpdateIntervalMs: number;\n  conversationIndexEmbedOnUpdate: boolean;\n  conversationIndexFaissScriptPath?: string;\n  conversationIndexFaissPythonBin?: string;\n  conversationIndexFaissModelId: string;\n  conversationIndexFaissIndexDir: string;\n  conversationIndexFaissUpsertTimeoutMs: number;\n  conversationIndexFaissSearchTimeoutMs: number;\n  conversationIndexFaissHealthTimeoutMs: number;\n  conversationIndexFaissMaxBatchSize: number;\n  conversationIndexFaissMaxSearchK: number;\n  conversationRecallTopK: number;\n  conversationRecallMaxChars: number;\n  conversationRecallTimeoutMs: number;\n  // Evaluation harness foundation\n  evalHarnessEnabled: boolean;\n  evalShadowModeEnabled: boolean;\n  benchmarkBaselineSnapshotsEnabled: boolean;\n  benchmarkDeltaReporterEnabled: boolean;\n  benchmarkStoredBaselineEnabled: boolean;\n  evalStoreDir: string;\n  // Objective-state memory foundation\n  objectiveStateMemoryEnabled: boolean;\n  objectiveStateSnapshotWritesEnabled: boolean;\n  objectiveStateRecallEnabled: boolean;\n  objectiveStateStoreDir: string;\n  // Causal trajectory memory foundation\n  causalTrajectoryMemoryEnabled: boolean;\n  causalTrajectoryStoreDir: string;\n  causalTrajectoryRecallEnabled: boolean;\n  actionGraphRecallEnabled: boolean;\n  // Trust-zone memory foundation\n  trustZonesEnabled: boolean;\n  quarantinePromotionEnabled: boolean;\n  trustZoneStoreDir: string;\n  trustZoneRecallEnabled: boolean;\n  memoryPoisoningDefenseEnabled: boolean;\n  memoryRedTeamBenchEnabled: boolean;\n  // Harmonic retrieval foundation\n  harmonicRetrievalEnabled: boolean;\n  abstractionAnchorsEnabled: boolean;\n  abstractionNodeStoreDir: string;\n  // Episodic/semantic split foundation\n  verifiedRecallEnabled: boolean;\n  semanticRulePromotionEnabled: boolean;\n  semanticRuleVerificationEnabled: boolean;\n  semanticConsolidationEnabled: boolean;\n  semanticConsolidationModel: string;\n  semanticConsolidationThreshold: number;\n  semanticConsolidationMinClusterSize: number;\n  semanticConsolidationExcludeCategories: string[];\n  semanticConsolidationIntervalHours: number;\n  semanticConsolidationMaxPerRun: number;\n  // Creation-memory foundation\n  creationMemoryEnabled: boolean;\n  memoryUtilityLearningEnabled: boolean;\n  promotionByOutcomeEnabled: boolean;\n  commitmentLedgerEnabled: boolean;\n  commitmentLifecycleEnabled: boolean;\n  commitmentStaleDays: number;\n  commitmentLedgerDir: string;\n  resumeBundlesEnabled: boolean;\n  resumeBundleDir: string;\n  workProductRecallEnabled: boolean;\n  workProductLedgerDir: string;\n  workTasksEnabled: boolean;\n  workProjectsEnabled: boolean;\n  workTasksDir: string;\n  workProjectsDir: string;\n  workIndexEnabled: boolean;\n  workIndexDir: string;\n  workTaskIndexEnabled: boolean;\n  workProjectIndexEnabled: boolean;\n  workIndexAutoRebuildEnabled: boolean;\n  workIndexAutoRebuildDebounceMs: number;\n  // Local LLM Provider (v2.1)\n  localLlmEnabled: boolean;\n  localLlmUrl: string;\n  localLlmModel: string;\n  /** Optional API key for authenticated OpenAI-compatible endpoints. */\n  localLlmApiKey?: string;\n  /** Additional headers for local/compatible endpoint requests. */\n  localLlmHeaders?: Record<string, string>;\n  /** If false, do not send Authorization header even when localLlmApiKey is set. */\n  localLlmAuthHeader: boolean;\n  localLlmFallback: boolean;\n  /** Optional home directory override for local LLM helpers (LM Studio settings, CLI PATH). */\n  localLlmHomeDir?: string;\n  /** Optional absolute path to LMS CLI binary (preferred over auto-detection). */\n  localLmsCliPath?: string;\n  /** Optional bin directory prepended to PATH for LMS CLI execution. */\n  localLmsBinDir?: string;\n  /** Hard timeout for local LLM requests (ms). */\n  localLlmTimeoutMs: number;\n  /** Max context window for local LLM (override auto-detection). Set lower if your LLM server defaults to smaller contexts. */\n  localLlmMaxContext?: number;\n  // Observability\n  /** If true, log slow operations (local LLM + related I/O) with durations and metadata (no content). */\n  slowLogEnabled: boolean;\n  /**\n   * If true, include the full recalled memory text in `RecallTraceEvent.recalledContent`.\n   * Disabled by default — enable only when you want external trace subscribers (e.g. Langfuse)\n   * to see the exact memory context injected into each conversation turn.\n   * This adds payload to trace events but does not log to files or the gateway log.\n   */\n  traceRecallContent: boolean;\n  /** Threshold for slow operation logging (ms). */\n  slowLogThresholdMs: number;\n  // Performance profiling (opt-in)\n  /** If true, collect and persist timing traces for recall and extraction pipelines. */\n  profilingEnabled: boolean;\n  /** Directory for profiling trace JSONL files. Defaults to <memoryDir>/profiling. */\n  profilingStorageDir: string;\n  /** Maximum number of trace files to keep (rolling window). */\n  profilingMaxTraces: number;\n  // Extraction stability guards (P0/P1)\n  extractionDedupeEnabled: boolean;\n  extractionDedupeWindowMs: number;\n  extractionMinChars: number;\n  extractionMinUserTurns: number;\n  extractionMaxTurnChars: number;\n  extractionMaxFactsPerRun: number;\n  extractionMaxEntitiesPerRun: number;\n  extractionMaxQuestionsPerRun: number;\n  extractionMaxProfileUpdatesPerRun: number;\n  /**\n   * Minimum importance level required to persist an extracted fact. Facts\n   * whose locally-scored level falls below this threshold are dropped before\n   * write and counted toward the `importance_gated` metric. Defaults to\n   * \"low\" so trivial content (greetings, single-word replies, filler) is\n   * silently dropped while everything else still passes.\n   */\n  extractionMinImportanceLevel: ImportanceLevel;\n  /**\n   * Inline source attribution (issue #369).\n   * When enabled, extracted facts carry a compact provenance tag (agent,\n   * session, timestamp) inlined into the fact text — not just in YAML\n   * frontmatter — so the citation survives prompt injection, copy/paste,\n   * and LLM quoting. Off by default to preserve backwards compatibility\n   * with existing downstream consumers that expect raw fact text.\n   */\n  inlineSourceAttributionEnabled: boolean;\n  /**\n   * Template used when injecting inline citations. Supported placeholders:\n   * `{agent}`, `{session}`, `{sessionId}`, `{ts}`, `{date}`. Defaults to\n   * `[Source: agent={agent}, session={sessionId}, ts={ts}]`.\n   */\n  inlineSourceAttributionFormat: string;\n  consolidationRequireNonZeroExtraction: boolean;\n  consolidationMinIntervalMs: number;\n  // QMD maintenance (debounced singleflight)\n  qmdMaintenanceEnabled: boolean;\n  qmdMaintenanceDebounceMs: number;\n  qmdAutoEmbedEnabled: boolean;\n  qmdEmbedMinIntervalMs: number;\n  qmdUpdateTimeoutMs: number;\n  qmdUpdateMinIntervalMs: number;\n  // Local LLM resilience\n  localLlmRetry5xxCount: number;\n  localLlmRetryBackoffMs: number;\n  localLlm400TripThreshold: number;\n  localLlm400CooldownMs: number;\n  // Local LLM fast tier (v9.1) — smaller model for quick ops\n  localLlmFastEnabled: boolean;\n  localLlmFastModel: string;\n  localLlmFastUrl: string;\n  localLlmFastTimeoutMs: number;\n  /**\n   * Suppress chain-of-thought / thinking mode on the main local LLM\n   * (issue #548).  When true, Remnic injects\n   * `chat_template_kwargs: { enable_thinking: false }` on every\n   * request so thinking-capable models (Qwen 3.5, Gemma 4, DeepSeek,\n   * etc.) skip reasoning tokens that structured-output tasks like\n   * extraction and consolidation cannot benefit from.  Default: true\n   * — the dominant localLlm use case is JSON-shaped extraction where\n   * thinking is pure latency tax and a common cause of 60s timeouts.\n   * Set to false to restore thinking for narrative tasks.\n   *\n   * The fast-tier client (`fastLlm`) always disables thinking; that\n   * contract is baked into \"fast tier\" and is unaffected by this flag.\n   */\n  localLlmDisableThinking: boolean;\n  // Gateway config for fallback AI\n  gatewayConfig?: GatewayConfig;\n  // Gateway model source (v9.2) — route LLM calls through gateway agent model chain\n  modelSource: \"plugin\" | \"gateway\";\n  gatewayAgentId: string;\n  fastGatewayAgentId: string;\n\n  // v3.0 Multi-agent memory (namespaces)\n  namespacesEnabled: boolean;\n  defaultNamespace: string;\n  sharedNamespace: string;\n  principalFromSessionKeyMode: PrincipalFromSessionKeyMode;\n  principalFromSessionKeyRules: PrincipalRule[];\n  namespacePolicies: NamespacePolicy[];\n  defaultRecallNamespaces: Array<\"self\" | \"shared\">;\n  cronRecallMode: CronRecallMode;\n  cronRecallAllowlist: string[];\n  cronRecallPolicyEnabled: boolean;\n  cronRecallNormalizedQueryMaxChars: number;\n  cronRecallInstructionHeavyTokenCap: number;\n  cronConversationRecallMode: CronConversationRecallMode;\n  autoPromoteToSharedEnabled: boolean;\n  autoPromoteToSharedCategories: Array<\"fact\" | \"correction\" | \"decision\" | \"preference\">;\n  autoPromoteMinConfidenceTier: ConfidenceTier;\n  routingRulesEnabled: boolean;\n  routingRulesStateFile: string;\n\n  // v4.0 Shared-context (cross-agent shared intelligence)\n  sharedContextEnabled: boolean;\n  sharedContextDir?: string;\n  sharedContextMaxInjectChars: number;\n  crossSignalsSemanticEnabled: boolean;\n  crossSignalsSemanticTimeoutMs: number;\n  sharedCrossSignalSemanticEnabled?: boolean;\n  sharedCrossSignalSemanticTimeoutMs?: number;\n  sharedCrossSignalSemanticMaxCandidates?: number;\n\n  // v5.0 Compounding engine\n  compoundingEnabled: boolean;\n  compoundingWeeklyCronEnabled: boolean;\n  compoundingSemanticEnabled: boolean;\n  compoundingSynthesisTimeoutMs: number;\n  compoundingInjectEnabled: boolean;\n\n  // IRC (Inductive Rule Consolidation) — preference synthesis\n  ircEnabled: boolean;\n  ircMaxPreferences: number;\n  ircIncludeCorrections: boolean;\n  ircMinConfidence: number;\n\n  // CMC (Causal Memory Consolidation) — cross-session causal reasoning\n  cmcEnabled: boolean;\n  cmcStitchLookbackDays: number;\n  cmcStitchMinScore: number;\n  cmcStitchMaxEdgesPerTrajectory: number;\n  cmcConsolidationEnabled: boolean;\n  cmcConsolidationMinRecurrence: number;\n  cmcConsolidationMinSessions: number;\n  cmcConsolidationSuccessThreshold: number;\n  cmcRetrievalEnabled: boolean;\n  cmcRetrievalMaxDepth: number;\n  cmcRetrievalMaxChars: number;\n  cmcRetrievalCounterfactualBoost: number;\n  cmcBehaviorLearningEnabled: boolean;\n  cmcBehaviorMinFrequency: number;\n  cmcBehaviorMinSessions: number;\n  cmcBehaviorConfidenceThreshold: number;\n  cmcLifecycleCausalImpactWeight: number;\n\n  // PEDC (Prediction-Error-Driven Calibration) — model-user alignment\n  calibrationEnabled: boolean;\n  calibrationMaxRulesPerRecall: number;\n  calibrationMaxChars: number;\n\n  // Search backend abstraction\n  searchBackend?: \"qmd\" | \"remote\" | \"noop\" | \"lancedb\" | \"meilisearch\" | \"orama\";\n  remoteSearchBaseUrl?: string;\n  remoteSearchApiKey?: string;\n  remoteSearchTimeoutMs?: number;\n\n  // LanceDB backend\n  lancedbEnabled: boolean;\n  lanceDbPath?: string;\n  lanceEmbeddingDimension?: number;\n\n  // Meilisearch backend\n  meilisearchEnabled: boolean;\n  meilisearchHost?: string;\n  meilisearchApiKey?: string;\n  meilisearchTimeoutMs?: number;\n  meilisearchAutoIndex?: boolean;\n\n  // Orama backend\n  oramaEnabled: boolean;\n  oramaDbPath?: string;\n  oramaEmbeddingDimension?: number;\n\n  // QMD daemon mode\n  qmdDaemonEnabled: boolean;\n  qmdDaemonUrl: string;\n  qmdDaemonRecheckIntervalMs: number;\n  qmdIntentHintsEnabled: boolean;\n  qmdExplainEnabled: boolean;\n\n  // v7.0 Knowledge Graph Enhancement\n  knowledgeIndexEnabled: boolean;\n  knowledgeIndexMaxEntities: number;\n  knowledgeIndexMaxChars: number;\n  entityRetrievalEnabled: boolean;\n  entityRetrievalMaxChars: number;\n  entityRetrievalMaxHints: number;\n  entityRetrievalMaxSupportingFacts: number;\n  entityRetrievalMaxRelatedEntities: number;\n  entityRetrievalRecentTurns: number;\n  entitySchemas?: Record<string, EntitySchemaDefinition>;\n  // Recall assembly controls\n  recallBudgetChars: number;\n  recallOuterTimeoutMs: number;\n  recallCoreDeadlineMs: number;\n  recallEnrichmentDeadlineMs: number;\n  recallPipeline: RecallSectionConfig[];\n  /** Apply Maximal Marginal Relevance to the final recall selection per-section. */\n  recallMmrEnabled: boolean;\n  /** MMR λ parameter. 1.0 = pure relevance, 0.0 = pure diversity. Default 0.7. */\n  recallMmrLambda: number;\n  /** MMR is applied over the top N candidates per section. Default 40. */\n  recallMmrTopN: number;\n  qmdRecallCacheTtlMs: number;\n  qmdRecallCacheStaleTtlMs: number;\n  qmdRecallCacheMaxEntries: number;\n  entityRelationshipsEnabled: boolean;\n  entityActivityLogEnabled: boolean;\n  entityActivityLogMaxEntries: number;\n  entityAliasesEnabled: boolean;\n  entitySummaryEnabled: boolean;\n  entitySynthesisMaxTokens: number;\n\n  // v6.0 Fact deduplication & archival\n  /** Enable content-hash deduplication to prevent storing semantically identical facts. */\n  factDeduplicationEnabled: boolean;\n  /**\n   * Issue #373 — Write-time semantic similarity guard. When enabled (default),\n   * the orchestrator embeds each candidate fact and queries the existing\n   * embedding index for its top-K nearest neighbors. If the best cosine\n   * similarity is at or above `semanticDedupThreshold`, the fact is dropped\n   * as a near-duplicate. Fails open (keeps the fact) if the embedding backend\n   * is unavailable.\n   */\n  semanticDedupEnabled: boolean;\n  /** Cosine similarity threshold in [0, 1] above which a candidate fact is skipped. */\n  semanticDedupThreshold: number;\n  /** Number of nearest-neighbor candidates to consider during semantic dedup. */\n  semanticDedupCandidates: number;\n  /** Enable automatic archival of old, low-importance, rarely-accessed facts. */\n  factArchivalEnabled: boolean;\n  /** Minimum age in days before a fact is eligible for archival. */\n  factArchivalAgeDays: number;\n  /** Maximum importance score for archival eligibility (0-1). Only facts below this are archived. */\n  factArchivalMaxImportance: number;\n  /** Maximum access count for archival eligibility. Only rarely-accessed facts are archived. */\n  factArchivalMaxAccessCount: number;\n  /** Tags that protect a fact from archival regardless of other criteria. */\n  factArchivalProtectedCategories: string[];\n  // v8.3 Lifecycle policy engine\n  lifecyclePolicyEnabled: boolean;\n  lifecycleFilterStaleEnabled: boolean;\n  lifecyclePromoteHeatThreshold: number;\n  lifecycleStaleDecayThreshold: number;\n  lifecycleArchiveDecayThreshold: number;\n  lifecycleProtectedCategories: MemoryCategory[];\n  lifecycleMetricsEnabled: boolean;\n  // v8.3 proactive + policy learning\n  proactiveExtractionEnabled: boolean;\n  contextCompressionActionsEnabled: boolean;\n  compressionGuidelineLearningEnabled: boolean;\n  compressionGuidelineSemanticRefinementEnabled: boolean;\n  compressionGuidelineSemanticTimeoutMs: number;\n  maxProactiveQuestionsPerExtraction: number;\n  proactiveExtractionTimeoutMs: number;\n  proactiveExtractionMaxTokens: number;\n  extractionMaxOutputTokens: number;\n  proactiveExtractionCategoryAllowlist?: MemoryCategory[];\n  maxCompressionTokensPerHour: number;\n  behaviorLoopAutoTuneEnabled: boolean;\n  behaviorLoopLearningWindowDays: number;\n  behaviorLoopMinSignalCount: number;\n  behaviorLoopMaxDeltaPerCycle: number;\n  behaviorLoopProtectedParams: string[];\n  // v8.0 Phase 1: recall planner + intent routing + verbatim artifacts\n  recallPlannerEnabled: boolean;\n  recallPlannerModel: string;\n  recallPlannerTimeoutMs: number;\n  recallPlannerUseResponsesApi: boolean;\n  recallPlannerMaxPromptChars: number;\n  recallPlannerMaxMemoryHints: number;\n  recallPlannerShadowMode: boolean;\n  recallPlannerTelemetryEnabled: boolean;\n  recallPlannerMaxQmdResultsMinimal: number;\n  recallPlannerMaxQmdResultsFull: number;\n  intentRoutingEnabled: boolean;\n  intentRoutingBoost: number;\n  verbatimArtifactsEnabled: boolean;\n  verbatimArtifactsMinConfidence: number;\n  verbatimArtifactsMaxRecall: number;\n  verbatimArtifactCategories: MemoryCategory[];\n  // v8.0 Phase 2A: Memory Boxes + Trace Weaving\n  memoryBoxesEnabled: boolean;\n  /** Jaccard overlap threshold below which a topic shift triggers box sealing (0-1, default 0.35) */\n  boxTopicShiftThreshold: number;\n  /** Time gap in ms before an open box is sealed (default 30 min) */\n  boxTimeGapMs: number;\n  /** Max memories per box before forced seal */\n  boxMaxMemories: number;\n  traceWeaverEnabled: boolean;\n  /** Days back to search for trace links */\n  traceWeaverLookbackDays: number;\n  /** Minimum Jaccard overlap to assign the same traceId (0-1, default 0.4) */\n  traceWeaverOverlapThreshold: number;\n  /** Number of recent days of boxes to inject during recall */\n  boxRecallDays: number;\n  // v8.0 Phase 2B: Episode/Note dual store (HiMem)\n  /** Classify extracted memories as episode or note and tag with memoryKind */\n  episodeNoteModeEnabled: boolean;\n  // v8.1 Temporal + Tag Indexes (SwiftMem-inspired)\n  /** Build and maintain temporal (state/index_time.json) and tag (state/index_tags.json) indexes */\n  queryAwareIndexingEnabled: boolean;\n  /** Max candidate paths returned from index prefilter (0 = no cap) */\n  queryAwareIndexingMaxCandidates: number;\n  temporalIndexWindowDays: number;\n  temporalIndexMaxEntries: number;\n  temporalBoostRecentDays: number;\n  temporalBoostScore: number;\n  temporalDecayEnabled: boolean;\n  tagMemoryEnabled: boolean;\n  tagMaxPerMemory: number;\n  tagIndexMaxEntries: number;\n  tagRecallBoost: number;\n  tagRecallMaxMatches: number;\n  // v8.2 multi-graph memory (PR 18)\n  multiGraphMemoryEnabled: boolean;\n  // v8.2 PR 19A: graph recall planner gating\n  graphRecallEnabled: boolean;\n  graphRecallMaxExpansions: number;\n  graphRecallMaxPerSeed: number;\n  graphRecallMinEdgeWeight: number;\n  graphRecallShadowEnabled: boolean;\n  graphRecallSnapshotEnabled: boolean;\n  graphRecallShadowSampleRate: number;\n  graphRecallExplainToolEnabled: boolean;\n  graphRecallStoreColdMirror: boolean;\n  graphRecallColdMirrorCollection?: string;\n  graphRecallColdMirrorMinAgeDays: number;\n  graphRecallUseEntityPriors: boolean;\n  graphRecallEntityPriorBoost: number;\n  graphRecallPreferHubSeeds: boolean;\n  graphRecallHubBias: number;\n  graphRecallRecencyHalfLifeDays: number;\n  graphRecallDampingFactor: number;\n  graphRecallMaxSeedNodes: number;\n  graphRecallMaxExpandedNodes: number;\n  graphRecallMaxTrailPerNode: number;\n  graphRecallMinSeedScore: number;\n  graphRecallExpansionScoreThreshold: number;\n  graphRecallExplainMaxPaths: number;\n  graphRecallExplainMaxChars: number;\n  graphRecallExplainEdgeLimit: number;\n  graphRecallExplainEnabled: boolean;\n  graphRecallEntityHintsEnabled: boolean;\n  graphRecallEntityHintMax: number;\n  graphRecallEntityHintMaxChars: number;\n  graphRecallSnapshotDir: string;\n  graphRecallEnableTrace: boolean;\n  graphRecallEnableDebug: boolean;\n  /** Allow graph_mode escalation for broader causal/timeline phrasing beyond strict keywords. */\n  graphExpandedIntentEnabled?: boolean;\n  /** Run bounded graph expansion in full mode when enough recall seeds exist. */\n  graphAssistInFullModeEnabled?: boolean;\n  /** In full mode, compute graph assist for telemetry/snapshotting but do not inject merged results. */\n  graphAssistShadowEvalEnabled?: boolean;\n  /** Minimum seed results required before full-mode graph assist runs. */\n  graphAssistMinSeedResults?: number;\n  entityGraphEnabled: boolean;\n  timeGraphEnabled: boolean;\n  /** When true, write fallback temporal adjacency edges for consecutive extracted memories. */\n  graphWriteSessionAdjacencyEnabled?: boolean;\n  causalGraphEnabled: boolean;\n  maxGraphTraversalSteps: number;\n  graphActivationDecay: number;\n  /** Weight of graph activation score when blending with seed QMD score (0-1). */\n  graphExpansionActivationWeight: number;\n  /** Lower bound for blended graph-expanded recall scores (0-1). */\n  graphExpansionBlendMin: number;\n  /** Upper bound for blended graph-expanded recall scores (0-1). */\n  graphExpansionBlendMax: number;\n  maxEntityGraphEdgesPerMemory: number;\n  /** SimpleMem-inspired de-linearization: resolve pronouns and anchor relative dates after extraction. */\n  delinearizeEnabled: boolean;\n  /** Synapse-inspired confidence gate — skip memory injection when top score is below threshold. */\n  recallConfidenceGateEnabled: boolean;\n  recallConfidenceGateThreshold: number;\n  /** PlugMem-inspired causal rule extraction: mine IF→THEN rules during consolidation. */\n  causalRuleExtractionEnabled: boolean;\n  /** E-Mem-inspired memory reconstruction: targeted retrieval for missing entity context. */\n  memoryReconstructionEnabled: boolean;\n  /** Maximum number of entity expansions per recall. */\n  memoryReconstructionMaxExpansions: number;\n  /** Synapse-inspired lateral inhibition to suppress hub-node dominance. */\n  graphLateralInhibitionEnabled: boolean;\n  /** Inhibition strength (default 0.15). Higher = more suppression. */\n  graphLateralInhibitionBeta: number;\n  /** Number of top competing nodes considered for inhibition (default 7). */\n  graphLateralInhibitionTopM: number;\n  // v8.2: Temporal Memory Tree\n  temporalMemoryTreeEnabled: boolean;\n  tmtHourlyMinMemories: number;\n  tmtSummaryMaxTokens: number;\n  // Lossless Context Management (LCM)\n  lcmEnabled: boolean;\n  lcmLeafBatchSize: number;\n  lcmRollupFanIn: number;\n  lcmFreshTailTurns: number;\n  lcmMaxDepth: number;\n  lcmRecallBudgetShare: number;\n  lcmDeterministicMaxTokens: number;\n  lcmArchiveRetentionDays: number;\n\n  // v9.1 Parallel Specialized Retrieval (ASMR-inspired)\n  /** Enable three-agent parallel retrieval (DirectFact + Contextual + Temporal). Default false. */\n  parallelRetrievalEnabled: boolean;\n  /** Per-agent source weights for score blending during merge. */\n  parallelAgentWeights: { direct: number; contextual: number; temporal: number };\n  /** Max results fetched per agent before merge. */\n  parallelMaxResultsPerAgent: number;\n\n  // Daily Context Briefing (Issue #370)\n  /** Briefing configuration knobs — see BriefingConfig for field docs. */\n  briefing: BriefingConfig;\n\n  // Codex CLI connector settings (install-time)\n  codex: CodexConnectorConfig;\n\n  // MECE Taxonomy (#366)\n  /** Enable the MECE taxonomy knowledge directory. Default false. */\n  taxonomyEnabled: boolean;\n  /** Auto-regenerate RESOLVER.md when taxonomy changes. Default true. */\n  taxonomyAutoGenResolver: boolean;\n\n  // Codex CLI — native memory materialization (#378)\n  /** Materialize Remnic memories into Codex's expected ~/.codex/memories/ layout. Default true. */\n  codexMaterializeMemories: boolean;\n  /** Namespace to materialize; \"auto\" derives from the connector context. Default \"auto\". */\n  codexMaterializeNamespace: string;\n  /** Max whitespace-tokenized size of memory_summary.md. Default 4500. */\n  codexMaterializeMaxSummaryTokens: number;\n  /** Max age in days for rollout_summaries/*.md before pruning. Default 30. */\n  codexMaterializeRolloutRetentionDays: number;\n  /** Run materialization after semantic/causal consolidation completes. Default true. */\n  codexMaterializeOnConsolidation: boolean;\n  /** Run materialization at Codex session-end hook. Default true. */\n  codexMaterializeOnSessionEnd: boolean;\n  /** Enable Codex marketplace integration. Default true. */\n  codexMarketplaceEnabled: boolean;\n\n  // Page-level versioning (issue #371)\n  /** Enable page-level versioning with sidecar snapshots. Default false. */\n  versioningEnabled: boolean;\n  /** Maximum number of version snapshots to keep per page. Default 50. Set to 0 to disable pruning. */\n  versioningMaxPerPage: number;\n  /** Name of the sidecar directory inside memoryDir. Default \".versions\". */\n  versioningSidecarDir: string;\n\n  // Binary file lifecycle management (#367)\n  /** Enable binary file lifecycle management (mirror, redirect, clean). Default: false. */\n  binaryLifecycleEnabled: boolean;\n  /** Grace period in days before a mirrored binary is eligible for local cleanup. Default: 7. */\n  binaryLifecycleGracePeriodDays: number;\n  /** Storage backend type: \"filesystem\" copies to a local dir, \"none\" is no-op. Default: \"none\". */\n  binaryLifecycleBackendType: \"filesystem\" | \"s3\" | \"none\";\n  /** Base path for the filesystem backend. Required when backendType is \"filesystem\". */\n  binaryLifecycleBackendPath: string;\n\n  // Codex citation parity (issue #379)\n  /** Enable oai-mem-citation blocks in recall responses. Default false. */\n  citationsEnabled: boolean;\n  /** Auto-enable citations when the Codex adapter is detected. Default true. */\n  citationsAutoDetect: boolean;\n\n  // External enrichment pipeline (issue #365)\n  /** Enable the external enrichment pipeline. Default false. */\n  enrichmentEnabled: boolean;\n  /** Automatically enrich new entities on creation. Default false. */\n  enrichmentAutoOnCreate: boolean;\n  /** Max candidates accepted per entity per enrichment run. Default 20. */\n  enrichmentMaxCandidatesPerEntity: number;\n\n  // Memory extensions discovery (#382)\n  /** Whether third-party memory extensions are discovered and injected into consolidation. Default true. */\n  memoryExtensionsEnabled: boolean;\n  /**\n   * Root directory for memory extensions. Empty string means derive from\n   * memoryDir: go up to the Remnic home dir and append memory_extensions.\n   */\n  memoryExtensionsRoot: string;\n}\n\n/** Runtime configuration for the daily context briefing feature. */\nexport interface BriefingConfig {\n  /** Whether `remnic briefing` CLI and MCP tool are enabled. */\n  enabled: boolean;\n  /** Default lookback window token (e.g. \"yesterday\", \"3d\", \"1w\", \"24h\"). */\n  defaultWindow: string;\n  /** Default output format for the CLI. */\n  defaultFormat: \"markdown\" | \"json\";\n  /** Maximum number of LLM-generated suggested follow-ups. */\n  maxFollowups: number;\n  /** Optional path to an ICS or JSON calendar file. null disables the section. */\n  calendarSource: string | null;\n  /** If true, CLI writes a dated briefing file by default. */\n  saveByDefault: boolean;\n  /** Override directory for saved briefings. null → $REMNIC_HOME/briefings/. */\n  saveDir: string | null;\n  /** Whether to call the Responses API for follow-up suggestions. */\n  llmFollowups: boolean;\n}\n\n/** Parsed representation of a briefing lookback window. */\nexport type BriefingWindow = \"yesterday\" | \"today\" | string;\n\n/** Filter the briefing to a single entity / project / topic. */\nexport interface BriefingFocus {\n  type: \"person\" | \"project\" | \"topic\";\n  value: string;\n}\n\n/** Calendar event surfaced by a CalendarSource implementation. */\nexport interface CalendarEvent {\n  /** Stable identifier for dedupe / linking. */\n  id: string;\n  /** Event title (short). */\n  title: string;\n  /** ISO 8601 start timestamp. */\n  start: string;\n  /** Optional ISO 8601 end timestamp. */\n  end?: string;\n  /** Optional freeform location. */\n  location?: string;\n  /** Optional short notes. */\n  notes?: string;\n}\n\n/** Abstraction over any calendar backend. Concrete implementations: `FileCalendarSource`. */\nexport interface CalendarSource {\n  /** Return events that fall on the given UTC date (YYYY-MM-DD). */\n  eventsForDate(dateIso: string): Promise<CalendarEvent[]>;\n}\n\n/** A single \"active thread\" surfaced in a briefing. */\nexport interface BriefingActiveThread {\n  id: string;\n  title: string;\n  updatedAt: string;\n  reason: string;\n}\n\n/** A single \"recent entity\" entry. */\nexport interface BriefingRecentEntity {\n  name: string;\n  type: string;\n  updatedAt: string;\n  score: number;\n  summary?: string;\n}\n\n/** A single unresolved commitment or open question. */\nexport interface BriefingOpenCommitment {\n  id: string;\n  kind: \"question\" | \"commitment\" | \"pending_memory\";\n  text: string;\n  source?: string;\n  createdAt?: string;\n}\n\n/** An LLM-generated short follow-up suggestion. */\nexport interface BriefingFollowup {\n  text: string;\n  rationale?: string;\n}\n\n/** Structured sections of a briefing result. */\nexport interface BriefingSections {\n  activeThreads: BriefingActiveThread[];\n  recentEntities: BriefingRecentEntity[];\n  openCommitments: BriefingOpenCommitment[];\n  suggestedFollowups: BriefingFollowup[];\n  /** Only populated when a calendar source is configured and returns events. */\n  todayCalendar?: CalendarEvent[];\n}\n\n/** A calendar source failure recorded when a CalendarSource throws during briefing generation. */\nexport interface BriefingCalendarSourceError {\n  /** Human-readable description of the source (e.g. file path or source name). */\n  source: string;\n  /** Stringified error message from the failed source. */\n  error: string;\n}\n\n/** Result returned by `buildBriefing`. */\nexport interface BriefingResult {\n  markdown: string;\n  json: Record<string, unknown>;\n  sections: BriefingSections;\n  /** Reason why suggested follow-ups were omitted (e.g. missing API key, LLM error). */\n  followupsUnavailableReason?: string;\n  /** Effective lookback window (ISO date range) used for this briefing. */\n  window: { from: string; to: string };\n  /**\n   * Calendar sources that failed during this briefing run.\n   * Only present (non-empty) when at least one source threw.\n   * Allows callers to distinguish \"no events today\" from \"source unavailable\".\n   */\n  calendarSourceErrors?: BriefingCalendarSourceError[];\n}\n\n/**\n * Settings for the Codex CLI connector. These are consumed by\n * `remnic connectors install codex-cli` to decide where the phase-2 memory\n * extension is dropped and whether to install it at all.\n */\nexport interface CodexConnectorConfig {\n  /**\n   * Whether to install the Remnic memory extension into\n   * `<codex_home>/memories_extensions/remnic/` when the `codex-cli`\n   * connector is installed. Default `true`. Set to `false` for users who\n   * self-manage the Codex memory extensions folder.\n   */\n  installExtension: boolean;\n  /**\n   * Optional override for the Codex home directory. When `null`, the\n   * connector reads `$CODEX_HOME` and falls back to `~/.codex`. Setting\n   * this is useful for integration tests and non-default installs.\n   */\n  codexHome: string | null;\n}\n\nexport interface BootstrapOptions {\n  dryRun?: boolean;\n  sessionsDir?: string;\n  limit?: number;\n  since?: Date;\n}\n\nexport interface BootstrapResult {\n  sessionsScanned: number;\n  turnsProcessed: number;\n  highSignalTurns: number;\n  memoriesCreated: number;\n  skipped: number;\n}\n\nexport interface PrincipalRule {\n  match: string;\n  principal: string;\n}\n\nexport interface NamespacePolicy {\n  name: string;\n  readPrincipals: string[];\n  writePrincipals: string[];\n  includeInRecallByDefault?: boolean;\n}\n\nexport interface RelevanceFeedback {\n  up: number;\n  down: number;\n  lastUpdatedAt: string;\n  notes?: string[];\n}\n\nexport interface BufferTurn {\n  role: \"user\" | \"assistant\";\n  content: string;\n  timestamp: string;\n  sessionKey?: string;\n  logicalSessionKey?: string;\n  providerThreadId?: string | null;\n  turnFingerprint?: string;\n  persistProcessedFingerprint?: boolean;\n}\n\nexport interface BufferEntryState {\n  turns: BufferTurn[];\n  lastExtractionAt: string | null;\n  extractionCount: number;\n}\n\nexport interface BufferState {\n  turns: BufferTurn[];\n  lastExtractionAt: string | null;\n  extractionCount: number;\n  entries?: Record<string, BufferEntryState>;\n}\n\nexport interface BehaviorLoopAdjustment {\n  parameter: string;\n  previousValue: number;\n  nextValue: number;\n  delta: number;\n  evidenceCount: number;\n  confidence: number;\n  reason: string;\n  appliedAt: string;\n}\n\nexport interface BehaviorLoopPolicyState {\n  version: number;\n  windowDays: number;\n  minSignalCount: number;\n  maxDeltaPerCycle: number;\n  protectedParams: string[];\n  adjustments: BehaviorLoopAdjustment[];\n  updatedAt: string;\n}\n\nexport type BehaviorSignalType = \"correction_override\" | \"preference_affinity\" | \"topic_revisitation\" | \"action_pattern\" | \"outcome_preference\" | \"phrasing_style\";\nexport type BehaviorSignalDirection = \"positive\" | \"negative\";\n\nexport interface BehaviorSignalEvent {\n  timestamp: string;\n  namespace: string;\n  memoryId: string;\n  category: Extract<MemoryCategory, \"correction\" | \"preference\">;\n  signalType: BehaviorSignalType;\n  direction: BehaviorSignalDirection;\n  confidence: number;\n  signalHash: string;\n  source: \"extraction\" | \"correction\";\n}\n\n/** Memory status for lifecycle management */\nexport type MemoryStatus = \"active\" | \"pending_review\" | \"rejected\" | \"quarantined\" | \"superseded\" | \"archived\";\nexport type LifecycleState = \"candidate\" | \"validated\" | \"active\" | \"stale\" | \"archived\";\nexport type VerificationState = \"unverified\" | \"user_confirmed\" | \"system_inferred\" | \"disputed\";\nexport type PolicyClass = \"ephemeral\" | \"durable\" | \"protected\";\n\n/** Importance level tiers */\nexport type ImportanceLevel = \"critical\" | \"high\" | \"normal\" | \"low\" | \"trivial\";\n\n/** Importance scoring result */\nexport interface ImportanceScore {\n  /** Numeric score 0-1 */\n  score: number;\n  /** Tier level */\n  level: ImportanceLevel;\n  /** Reasons for this score */\n  reasons: string[];\n  /** Salient keywords extracted */\n  keywords: string[];\n}\n\nexport interface MemoryFrontmatter {\n  id: string;\n  category: MemoryCategory;\n  created: string;\n  updated: string;\n  source: string;\n  confidence: number;\n  confidenceTier: ConfidenceTier;\n  tags: string[];\n  entityRef?: string;\n  supersedes?: string;\n  /** ISO 8601 date — memory expires and gets cleaned up after this date */\n  expiresAt?: string;\n  /** IDs of parent memories this was derived from (lineage tracking) */\n  lineage?: string[];\n  /** Memory status: active (default), pending_review, rejected, quarantined, superseded, or archived */\n  status?: MemoryStatus;\n  /** ID of memory that superseded this one */\n  supersededBy?: string;\n  /** Timestamp when superseded */\n  supersededAt?: string;\n  /** Timestamp when archived */\n  archivedAt?: string;\n  /** Policy-driven lifecycle state used for retrieval eligibility/ranking. */\n  lifecycleState?: LifecycleState;\n  /** Verification provenance used by lifecycle policy. */\n  verificationState?: VerificationState;\n  /** Policy class used by lifecycle guardrails. */\n  policyClass?: PolicyClass;\n  /** Last lifecycle validation timestamp (ISO 8601). */\n  lastValidatedAt?: string;\n  /** Lifecycle decay score in [0,1]. */\n  decayScore?: number;\n  /** Lifecycle heat score in [0,1]. */\n  heatScore?: number;\n  // Access tracking (Phase 1A)\n  /** Number of times this memory has been retrieved */\n  accessCount?: number;\n  /** Last time this memory was accessed (ISO 8601) */\n  lastAccessed?: string;\n  // Importance scoring (Phase 1B)\n  /** Importance score with level, reasons, and keywords */\n  importance?: ImportanceScore;\n  // Chunking (Phase 2A)\n  /** Parent memory ID if this is a chunk */\n  parentId?: string;\n  /** Chunk index within parent (0-based) */\n  chunkIndex?: number;\n  /** Total number of chunks for this parent */\n  chunkTotal?: number;\n  // Memory Linking (Phase 3A)\n  /** Links to other memories */\n  links?: MemoryLink[];\n  // Intent-grounded memory routing (v8.0 phase 1)\n  intentGoal?: string;\n  intentActionType?: string;\n  intentEntityTypes?: string[];\n  // Verbatim artifact lineage (v8.0 phase 1)\n  artifactType?: \"decision\" | \"constraint\" | \"todo\" | \"definition\" | \"commitment\" | \"correction\" | \"fact\";\n  sourceMemoryId?: string;\n  sourceTurnId?: string;\n  // v8.0 Phase 2B: HiMem episode/note classification\n  /** episode = time-specific event; note = stable belief/preference/decision */\n  memoryKind?: \"episode\" | \"note\" | \"box\" | \"dream\" | \"procedural\";\n  /** Structured key-value attributes extracted from the content (e.g., product attributes, dates, quantities). */\n  structuredAttributes?: Record<string, string>;\n  /**\n   * SHA-256 (via ContentHashIndex.computeHash) of the raw content that was\n   * used as the dedup key at write time. Persists through archive and\n   * consolidation so the hash can be removed from the index even if the stored\n   * content has been transformed (e.g. an inline citation was appended).\n   *\n   * When present, archive/consolidation paths use this directly instead of\n   * calling stripCitation(memory.content), which only handles the default\n   * [Source: ...] format and silently fails for custom citation templates.\n   */\n  contentHash?: string;\n}\n\n/** Memory link relationship types */\nexport type MemoryLinkType = \"follows\" | \"references\" | \"contradicts\" | \"supports\" | \"related\";\n\n/** A link between memories */\nexport interface MemoryLink {\n  targetId: string;\n  linkType: MemoryLinkType;\n  strength: number;\n  reason?: string;\n}\n\n// Conversation Threading (Phase 3B)\nexport interface ConversationThread {\n  id: string;\n  title: string;\n  createdAt: string;\n  updatedAt: string;\n  sessionKey?: string;\n  episodeIds: string[];\n  linkedThreadIds: string[];\n}\n\n// Memory Summarization (Phase 4A)\nexport interface MemorySummary {\n  id: string;\n  createdAt: string;\n  timeRangeStart: string;\n  timeRangeEnd: string;\n  summaryText: string;\n  keyFacts: string[];\n  keyEntities: string[];\n  sourceEpisodeIds: string[];\n}\n\nexport interface DaySummaryResult {\n  summary: string;\n  bullets: string[];\n  next_actions: string[];\n  risks_or_open_loops: string[];\n}\n\n// Topic Extraction (Phase 4B)\nexport interface TopicScore {\n  term: string;\n  score: number;\n  count: number;\n}\n\nexport interface MemoryFile {\n  path: string;\n  frontmatter: MemoryFrontmatter;\n  content: string;\n}\n\n/** Ordered step for extracted procedure memories (issue #519). */\nexport interface ExtractedProcedureStep {\n  order: number;\n  intent: string;\n  toolCall?: { kind: string; signature: string };\n  expectedOutcome?: string;\n  optional?: boolean;\n}\n\nexport interface ExtractedFact {\n  category: MemoryCategory;\n  content: string;\n  confidence: number;\n  tags: string[];\n  entityRef?: string;\n  source?: ExtractionPassSource;\n  promptedByQuestion?: string;\n  /** Structured key-value attributes extracted from the content (e.g., product attributes, dates, quantities). */\n  structuredAttributes?: Record<string, string>;\n  /** When category is `procedure`, ordered steps with intents (persisted under procedures/). */\n  procedureSteps?: ExtractedProcedureStep[];\n}\n\nexport interface MemoryIntent {\n  goal: string;\n  actionType: string;\n  entityTypes: string[];\n  /** True when the prompt reads like starting a concrete task (ship/deploy/tests/PR, etc.). */\n  taskInitiation?: boolean;\n}\n\nexport interface ExtractedQuestion {\n  question: string;\n  context: string;\n  priority: number;\n}\n\nexport interface QuestionEntry {\n  id: string;\n  question: string;\n  context: string;\n  priority: number; // 0-1, higher = more important\n  created: string;\n  resolved: boolean;\n  resolvedAt?: string;\n}\n\nexport interface ExtractionResult {\n  facts: ExtractedFact[];\n  profileUpdates: string[];\n  entities: EntityMention[];\n  questions: ExtractedQuestion[];\n  identityReflection?: string;\n  relationships?: ExtractedRelationship[];\n}\n\nexport interface EntityMention {\n  name: string;\n  type: \"person\" | \"project\" | \"tool\" | \"company\" | \"place\" | \"other\";\n  facts: string[];\n  structuredSections?: EntityStructuredSection[];\n  source?: ExtractionPassSource;\n  promptedByQuestion?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Knowledge Graph Enhancement (Entity Relationships, Activity, Scoring)\n// ---------------------------------------------------------------------------\n\nexport interface EntityRelationship {\n  target: string;\n  label: string;\n}\n\nexport interface EntityActivityEntry {\n  date: string;\n  note: string;\n}\n\nexport interface EntityTimelineEntry {\n  timestamp: string;\n  text: string;\n  source?: string;\n  sessionKey?: string;\n  principal?: string;\n}\n\nexport interface EntityStructuredSection {\n  key: string;\n  title: string;\n  facts: string[];\n}\n\nexport interface EntitySchemaSectionDefinition {\n  key: string;\n  title: string;\n  description: string;\n  aliases?: string[];\n}\n\nexport interface EntitySchemaDefinition {\n  sections: EntitySchemaSectionDefinition[];\n}\n\nexport interface EntityFile {\n  name: string;\n  type: string;\n  created?: string;\n  updated: string;\n  extraFrontmatterLines?: string[];\n  preSectionLines?: string[];\n  facts: string[];\n  summary?: string;\n  synthesis?: string;\n  synthesisUpdatedAt?: string;\n  synthesisTimelineCount?: number;\n  synthesisStructuredFactCount?: number;\n  synthesisStructuredFactDigest?: string;\n  synthesisVersion?: number;\n  timeline: EntityTimelineEntry[];\n  structuredSections?: EntityStructuredSection[];\n  relationships: EntityRelationship[];\n  activity: EntityActivityEntry[];\n  aliases: string[];\n  extraSections?: Array<{\n    title: string;\n    lines: string[];\n  }>;\n}\n\nexport interface ScoredEntity {\n  name: string;\n  type: string;\n  score: number;\n  factCount: number;\n  summary?: string;\n  topRelationships: string[];\n}\n\nexport interface ExtractedRelationship {\n  source: string;\n  target: string;\n  label: string;\n  extractionSource?: ExtractionPassSource;\n  promptedByQuestion?: string;\n}\n\nexport interface ConsolidationItem {\n  existingId: string;\n  action: ConsolidationAction;\n  mergeWith?: string;\n  updatedContent?: string;\n  reason: string;\n}\n\nexport interface ConsolidationResult {\n  items: ConsolidationItem[];\n  profileUpdates: string[];\n  entityUpdates: EntityMention[];\n}\n\nexport interface ConsolidationObservation {\n  runAt: string;\n  recentMemories: MemoryFile[];\n  existingMemories: MemoryFile[];\n  profile: string;\n  result: ConsolidationResult;\n  merged: number;\n  invalidated: number;\n}\n\nexport interface QmdSearchResult {\n  docid: string;\n  path: string;\n  snippet: string;\n  score: number;\n  explain?: QmdSearchExplain;\n  transport?: \"daemon\" | \"subprocess\" | \"hybrid\" | \"scoped_prefilter\";\n}\n\nexport interface QmdSearchExplain {\n  ftsScores?: number[];\n  vectorScores?: number[];\n  rrf?: number;\n  rerankScore?: number;\n  blendedScore?: number;\n}\n\nexport interface MetaState {\n  extractionCount: number;\n  lastExtractionAt: string | null;\n  lastConsolidationAt: string | null;\n  totalMemories: number;\n  totalEntities: number;\n  processedExtractionFingerprints?: Array<{\n    fingerprint: string;\n    observedAt: string;\n  }>;\n}\n\nexport type MemoryActionType =\n  | \"store_episode\"\n  | \"store_note\"\n  | \"update_note\"\n  | \"create_artifact\"\n  | \"summarize_node\"\n  | \"discard\"\n  | \"link_graph\";\n\nexport type MemoryActionOutcome = \"applied\" | \"skipped\" | \"failed\";\n\nexport type MemoryActionPolicyDecision = \"allow\" | \"defer\" | \"deny\";\n\nexport type MemoryActionStatus = \"validated\" | \"applied\" | \"rejected\";\n\nexport type MemoryActionEligibilitySource =\n  | \"extraction\"\n  | \"consolidation\"\n  | \"replay\"\n  | \"manual\"\n  | \"unknown\";\n\nexport interface MemoryActionEligibilityContext {\n  confidence: number;\n  lifecycleState: LifecycleState;\n  importance: number;\n  source: MemoryActionEligibilitySource;\n}\n\nexport interface MemoryActionPolicyResult {\n  action: MemoryActionType;\n  decision: MemoryActionPolicyDecision;\n  rationale: string;\n  eligibility: MemoryActionEligibilityContext;\n}\n\nexport interface MemoryActionEvent {\n  schemaVersion?: number;\n  actionId?: string;\n  timestamp: string;\n  action: MemoryActionType;\n  outcome: MemoryActionOutcome;\n  status?: MemoryActionStatus;\n  actor?: string;\n  subsystem?: string;\n  reason?: string;\n  memoryId?: string;\n  namespace?: string;\n  sessionKey?: string;\n  sourceSessionKey?: string;\n  checkpointCapturedAt?: string;\n  checkpointTtl?: string;\n  checkpointTurnCount?: number;\n  inputSummary?: string;\n  outputMemoryIds?: string[];\n  dryRun?: boolean;\n  policyVersion?: string;\n  promptHash?: string;\n  policyDecision?: MemoryActionPolicyDecision;\n  policyRationale?: string;\n  policyEligibility?: MemoryActionEligibilityContext;\n}\n\nexport type MemoryLifecycleEventType =\n  | \"created\"\n  | \"updated\"\n  | \"superseded\"\n  | \"archived\"\n  | \"rejected\"\n  | \"restored\"\n  | \"merged\"\n  | \"imported\"\n  | \"promoted\"\n  | \"explicit_capture_accepted\"\n  | \"explicit_capture_queued\";\n\nexport interface MemoryLifecycleStateSummary {\n  category?: MemoryCategory;\n  path?: string;\n  status?: MemoryStatus;\n  lifecycleState?: LifecycleState;\n}\n\nexport interface MemoryLifecycleEvent {\n  eventId: string;\n  memoryId: string;\n  eventType: MemoryLifecycleEventType;\n  timestamp: string;\n  actor: string;\n  reasonCode?: string;\n  ruleVersion: string;\n  relatedMemoryIds?: string[];\n  before?: MemoryLifecycleStateSummary;\n  after?: MemoryLifecycleStateSummary;\n  correlationId?: string;\n}\n\nexport interface MemoryProjectionCurrentState {\n  memoryId: string;\n  category: MemoryCategory;\n  status: MemoryStatus;\n  lifecycleState?: LifecycleState;\n  path: string;\n  pathRel: string;\n  created: string;\n  updated: string;\n  archivedAt?: string;\n  supersededAt?: string;\n  entityRef?: string;\n  source: string;\n  confidence: number;\n  confidenceTier: ConfidenceTier;\n  memoryKind?: MemoryFrontmatter[\"memoryKind\"];\n  accessCount?: number;\n  lastAccessed?: string;\n  tags?: string[];\n  preview?: string;\n}\n\nexport interface CompressionGuidelineOptimizerSourceWindow {\n  from: string;\n  to: string;\n}\n\nexport interface CompressionGuidelineOptimizerEventCounts {\n  total: number;\n  applied: number;\n  skipped: number;\n  failed: number;\n}\n\nexport type CompressionGuidelineActivationState = \"draft\" | \"active\";\n\nexport interface CompressionGuidelineOptimizerActionSummary {\n  action: MemoryActionType;\n  total: number;\n  outcomes: Record<MemoryActionOutcome, number>;\n  quality: {\n    good: number;\n    poor: number;\n    unknown: number;\n  };\n}\n\nexport interface CompressionGuidelineOptimizerRuleUpdate {\n  action: MemoryActionType;\n  delta: number;\n  direction: \"increase\" | \"decrease\" | \"hold\";\n  confidence: \"low\" | \"medium\" | \"high\";\n  notes: string[];\n}\n\nexport interface CompressionGuidelineOptimizerState {\n  version: number;\n  updatedAt: string;\n  sourceWindow: CompressionGuidelineOptimizerSourceWindow;\n  eventCounts: CompressionGuidelineOptimizerEventCounts;\n  guidelineVersion: number;\n  contentHash?: string;\n  activationState?: CompressionGuidelineActivationState;\n  actionSummaries?: CompressionGuidelineOptimizerActionSummary[];\n  ruleUpdates?: CompressionGuidelineOptimizerRuleUpdate[];\n}\n\nexport type ContinuityIncidentState = \"open\" | \"closed\";\n\nexport interface ContinuityIncidentRecord {\n  id: string;\n  state: ContinuityIncidentState;\n  openedAt: string;\n  updatedAt: string;\n  triggerWindow?: string;\n  symptom: string;\n  suspectedCause?: string;\n  fixApplied?: string;\n  verificationResult?: string;\n  preventiveRule?: string;\n  closedAt?: string;\n  filePath?: string;\n}\n\nexport interface ContinuityIncidentOpenInput {\n  triggerWindow?: string;\n  symptom: string;\n  suspectedCause?: string;\n}\n\nexport interface ContinuityIncidentCloseInput {\n  fixApplied: string;\n  verificationResult: string;\n  preventiveRule?: string;\n}\n\nexport type ContinuityLoopCadence = \"daily\" | \"weekly\" | \"monthly\" | \"quarterly\";\nexport type ContinuityLoopStatus = \"active\" | \"paused\" | \"retired\";\n\nexport interface ContinuityImprovementLoop {\n  id: string;\n  cadence: ContinuityLoopCadence;\n  purpose: string;\n  status: ContinuityLoopStatus;\n  killCondition: string;\n  lastReviewed: string;\n  notes?: string;\n}\n\nexport interface ContinuityLoopUpsertInput {\n  id: string;\n  cadence: ContinuityLoopCadence;\n  purpose: string;\n  status: ContinuityLoopStatus;\n  killCondition: string;\n  lastReviewed?: string;\n  notes?: string;\n}\n\nexport interface ContinuityLoopReviewInput {\n  status?: ContinuityLoopStatus;\n  notes?: string;\n  reviewedAt?: string;\n}\n\n/** Entry in the access tracking buffer (batched updates) */\nexport interface AccessTrackingEntry {\n  memoryId: string;\n  newCount: number;\n  lastAccessed: string;\n}\n\nexport interface SignalScanResult {\n  level: SignalLevel;\n  patterns: string[];\n}\n\n// ============================================================================\n// LLM Trace Callback (for external observability plugins)\n// ============================================================================\n\nexport interface LlmTraceEvent {\n  kind: \"llm_start\" | \"llm_end\" | \"llm_error\";\n  traceId: string;\n  model: string;\n  operation: \"extraction\" | \"consolidation\" | \"profile_consolidation\" | \"identity_consolidation\" | \"day_summary\";\n  input?: string;\n  output?: string;\n  durationMs?: number;\n  error?: string;\n  tokenUsage?: { input?: number; output?: number; total?: number };\n}\n\nexport interface RecallTraceEvent {\n  kind: \"recall_summary\";\n  traceId: string;\n  operation: \"recall\";\n  sessionKey?: string;\n  promptHash: string;\n  promptLength: number;\n  retrievalQueryHash: string;\n  retrievalQueryLength: number;\n  recallMode: RecallPlanMode;\n  recallResultLimit: number;\n  qmdEnabled: boolean;\n  qmdAvailable: boolean;\n  recallNamespaces: string[];\n  source: \"none\" | \"hot_qmd\" | \"hot_embedding\" | \"cold_fallback\" | \"recent_scan\";\n  recalledMemoryCount: number;\n  injected: boolean;\n  contextChars: number;\n  policyVersion?: string;\n  identityInjectionMode?: IdentityInjectionMode | \"none\";\n  identityInjectedChars?: number;\n  identityInjectionTruncated?: boolean;\n  durationMs: number;\n  timings?: Record<string, string>;\n  /**\n   * The full recalled memory context injected into the system prompt.\n   * Only populated when `traceRecallContent` config option is `true`.\n   * Omitted by default to avoid sending potentially sensitive memory content\n   * to external trace collectors unless explicitly opted in.\n   */\n  recalledContent?: string;\n}\n\nexport type EngramTraceEvent = LlmTraceEvent | RecallTraceEvent;\nexport type LlmTraceCallback = (event: EngramTraceEvent) => void;\n\n// ============================================================================\n// Gateway Configuration Types (for fallback AI)\n// ============================================================================\n\nexport type ModelApi = \"openai-completions\" | \"anthropic-messages\" | \"google-generative\" | string;\n\nexport type ModelProviderAuthMode = \"bearer\" | \"header\" | \"query\";\n\nexport interface ModelDefinitionConfig {\n  id: string;\n  name?: string;\n  contextWindow?: number;\n  maxOutputTokens?: number;\n  costPer1MInput?: number;\n  costPer1MOutput?: number;\n  aliases?: string[];\n}\n\nexport interface ModelProviderConfig {\n  baseUrl: string;\n  apiKey?: string | Record<string, unknown>;\n  auth?: ModelProviderAuthMode;\n  api?: ModelApi;\n  headers?: Record<string, string>;\n  authHeader?: boolean;\n  models: ModelDefinitionConfig[];\n}\n\nexport interface AgentDefaultsConfig {\n  model?: {\n    primary?: string;\n    backup?: string;\n    fallbacks?: string[];\n  };\n  thinking?: {\n    mode?: \"off\" | \"on\" | \"adaptive\";\n    budget?: number;\n  };\n}\n\nexport interface AgentPersonaModelConfig {\n  primary?: string;\n  fallbacks?: string[];\n}\n\nexport interface AgentPersona {\n  id: string;\n  name?: string;\n  model?: AgentPersonaModelConfig;\n}\n\nexport interface GatewayConfig {\n  agents?: {\n    defaults?: AgentDefaultsConfig;\n    list?: AgentPersona[];\n  };\n  models?: {\n    providers?: Record<string, ModelProviderConfig>;\n  };\n}\n\n// ============================================================================\n// Transcript & Context Preservation (v2.0)\n// ============================================================================\n\nexport interface TranscriptEntry {\n  timestamp: string;\n  role: \"user\" | \"assistant\";\n  content: string;\n  sessionKey: string;\n  turnId: string;\n  metadata?: {\n    compactAfter?: boolean;\n    compactionId?: string | null;\n  };\n}\n\nexport interface Checkpoint {\n  sessionKey: string;\n  capturedAt: string;\n  turns: TranscriptEntry[];\n  ttl: string; // ISO timestamp when checkpoint expires\n}\n\nexport interface HourlySummary {\n  hour: string; // \"2026-02-08T14:00:00Z\"\n  sessionKey: string;\n  bullets: string[];\n  turnCount: number;\n  generatedAt: string;\n}\n"],"mappings":";AA+OO,SAAS,eAAe,OAA+B;AAC5D,MAAI,SAAS,KAAM,QAAO;AAC1B,MAAI,SAAS,IAAM,QAAO;AAC1B,MAAI,SAAS,IAAM,QAAO;AAC1B,SAAO;AACT;AAGO,IAAM,uBAAuB;","names":[]}

package/dist/chunk-47UU5PU2.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/recall-state.ts"],"sourcesContent":["import { appendFile, mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { createHash } from \"node:crypto\";\nimport { log } from \"./logger.js\";\nimport type {\n  IdentityInjectionMode,\n  RecallPlanMode,\n  RecallTierExplain,\n} from \"./types.js\";\n\nexport interface LastRecallBudgetSummary {\n  requestedTopK?: number;\n  appliedTopK: number;\n  recallBudgetChars: number;\n  maxMemoryTokens: number;\n  qmdFetchLimit?: number;\n  qmdHybridFetchLimit?: number;\n  finalContextChars?: number;\n  truncated?: boolean;\n  includedSections?: string[];\n  omittedSections?: string[];\n}\n\nexport interface LastRecallSnapshot {\n  sessionKey: string;\n  recordedAt: string;\n  queryHash: string;\n  queryLen: number;\n  memoryIds: string[];\n  namespace?: string;\n  traceId?: string;\n  plannerMode?: RecallPlanMode;\n  requestedMode?: RecallPlanMode;\n  source?: string;\n  fallbackUsed?: boolean;\n  sourcesUsed?: string[];\n  budgetsApplied?: LastRecallBudgetSummary;\n  latencyMs?: number;\n  resultPaths?: string[];\n  policyVersion?: string;\n  identityInjectionMode?: IdentityInjectionMode | \"none\";\n  identityInjectedChars?: number;\n  identityInjectionTruncated?: boolean;\n  /**\n   * Optional tier-level explanation of how recall was served\n   * (issue #518).  Populated by orchestrator call sites that can\n   * identify a concrete tier; surfaces expose the block via\n   * `engram query --explain`, the `?explain=1` HTTP flag, and the\n   * `remnic_recall_explain` MCP tool.  Orthogonal to the existing\n   * graph-path `recallExplain` operation.\n   */\n  tierExplain?: RecallTierExplain;\n}\n\nexport interface GraphRecallExpandedEntry {\n  path: string;\n  score: number;\n  namespace: string;\n  seed: string;\n  hopDepth: number;\n  decayedWeight: number;\n  graphType: \"entity\" | \"time\" | \"causal\";\n}\n\nexport function clampGraphRecallExpandedEntries(\n  entries: unknown,\n  maxEntries: number = 64,\n): GraphRecallExpandedEntry[] {\n  const limit = Math.max(1, Math.floor(maxEntries));\n  if (!Array.isArray(entries)) return [];\n  return entries\n    .filter((item): item is Record<string, unknown> => !!item && typeof item === \"object\")\n    .map((item) => {\n      const graphType: \"entity\" | \"time\" | \"causal\" =\n        item.graphType === \"entity\" || item.graphType === \"time\" || item.graphType === \"causal\"\n          ? item.graphType\n          : \"entity\";\n      return {\n        path: typeof item.path === \"string\" ? item.path : \"\",\n        score: typeof item.score === \"number\" && Number.isFinite(item.score) ? item.score : 0,\n        namespace: typeof item.namespace === \"string\" ? item.namespace : \"\",\n        seed: typeof item.seed === \"string\" ? item.seed : \"\",\n        hopDepth:\n          typeof item.hopDepth === \"number\" && Number.isFinite(item.hopDepth)\n            ? Math.max(0, Math.floor(item.hopDepth))\n            : 0,\n        decayedWeight:\n          typeof item.decayedWeight === \"number\" && Number.isFinite(item.decayedWeight)\n            ? Math.max(0, item.decayedWeight)\n            : 0,\n        graphType,\n      };\n    })\n    .filter((item) => item.path.length > 0 && item.namespace.length > 0)\n    .slice(0, limit);\n}\n\ntype LastRecallState = Record<string, LastRecallSnapshot>;\n\n/**\n * Deep-copy a RecallTierExplain block.  Used by both the write path\n * (so caller mutation after `record()` cannot tear the persisted\n * snapshot) and the read path (so caller mutation after `get()` /\n * `getMostRecent()` cannot tear the in-memory store).\n *\n * Uses structuredClone so future additions to RecallTierExplain do\n * not silently share references through hand-enumerated fields —\n * matching the pattern used elsewhere in the codebase (e.g.,\n * qmd-recall-cache.ts).  The payload is pure JSON-shaped data, so\n * structuredClone is both safe and complete here.\n */\nfunction cloneTierExplain(\n  tierExplain: RecallTierExplain | undefined,\n): RecallTierExplain | undefined {\n  if (!tierExplain) return undefined;\n  return structuredClone(tierExplain);\n}\n\n/**\n * Deep-copy a LastRecallSnapshot so callers that receive it cannot\n * mutate the store's internal state through mutable array/object\n * fields.  Same structuredClone rationale as cloneTierExplain above.\n */\nfunction cloneLastRecallSnapshot(\n  snapshot: LastRecallSnapshot | null,\n): LastRecallSnapshot | null {\n  if (!snapshot) return null;\n  return structuredClone(snapshot);\n}\n\nexport interface TierMigrationCycleSummary {\n  trigger: \"extraction\" | \"maintenance\" | \"manual\";\n  scanned: number;\n  migrated: number;\n  promoted: number;\n  demoted: number;\n  limit: number;\n  dryRun: boolean;\n  skipped?: string;\n  errorCount?: number;\n}\n\nexport interface TierMigrationStatusSnapshot {\n  updatedAt: string;\n  lastCycle: TierMigrationCycleSummary | null;\n  totals: {\n    cycles: number;\n    scanned: number;\n    migrated: number;\n    promoted: number;\n    demoted: number;\n    errors: number;\n  };\n}\n\nconst DEFAULT_TIER_MIGRATION_STATUS: TierMigrationStatusSnapshot = {\n  updatedAt: new Date(0).toISOString(),\n  lastCycle: null,\n  totals: {\n    cycles: 0,\n    scanned: 0,\n    migrated: 0,\n    promoted: 0,\n    demoted: 0,\n    errors: 0,\n  },\n};\n\nexport class LastRecallStore {\n  private readonly statePath: string;\n  private readonly impressionsPath: string;\n  private state: LastRecallState = {};\n\n  constructor(memoryDir: string) {\n    this.statePath = path.join(memoryDir, \"state\", \"last_recall.json\");\n    this.impressionsPath = path.join(memoryDir, \"state\", \"recall_impressions.jsonl\");\n  }\n\n  async load(): Promise<void> {\n    try {\n      const raw = await readFile(this.statePath, \"utf-8\");\n      const parsed = JSON.parse(raw) as LastRecallState;\n      if (parsed && typeof parsed === \"object\") this.state = parsed;\n    } catch {\n      this.state = {};\n    }\n  }\n\n  get(sessionKey: string): LastRecallSnapshot | null {\n    // Defensive copy: callers must not be able to mutate internal state\n    // by reaching into array/object fields on the returned snapshot.\n    return cloneLastRecallSnapshot(this.state[sessionKey] ?? null);\n  }\n\n  getMostRecent(): LastRecallSnapshot | null {\n    const snapshots = Object.values(this.state);\n    if (snapshots.length === 0) return null;\n    // Secondary key on sessionKey keeps the sort stable when two\n    // snapshots share a recordedAt timestamp (CLAUDE.md rule 19).\n    snapshots.sort((a, b) => {\n      const byTime = b.recordedAt.localeCompare(a.recordedAt);\n      if (byTime !== 0) return byTime;\n      return a.sessionKey.localeCompare(b.sessionKey);\n    });\n    return cloneLastRecallSnapshot(snapshots[0] ?? null);\n  }\n\n  /**\n   * Persist last-recall snapshot and append an impression log entry.\n   * Does not store raw query text; uses a stable hash for correlation.\n   */\n  async record(opts: {\n    sessionKey: string;\n    query: string;\n    memoryIds: string[];\n    namespace?: string;\n    traceId?: string;\n    plannerMode?: RecallPlanMode;\n    requestedMode?: RecallPlanMode;\n    source?: string;\n    fallbackUsed?: boolean;\n    sourcesUsed?: string[];\n    budgetsApplied?: LastRecallBudgetSummary;\n    latencyMs?: number;\n    resultPaths?: string[];\n    policyVersion?: string;\n    appendImpression?: boolean;\n    identityInjection?: {\n      mode: IdentityInjectionMode | \"none\";\n      injectedChars: number;\n      truncated: boolean;\n    };\n    /**\n     * Per-tier explain annotation (issue #518).  When supplied, the\n     * snapshot carries it so downstream surfaces (CLI / HTTP / MCP)\n     * can render which retrieval tier served the query.\n     */\n    tierExplain?: RecallTierExplain;\n  }): Promise<void> {\n    const now = new Date().toISOString();\n    const queryHash = createHash(\"sha256\").update(opts.query).digest(\"hex\");\n\n    // Build the snapshot from opts, then deep-copy it via\n    // cloneLastRecallSnapshot so caller arrays/objects passed in\n    // `opts` cannot retain a live reference to the persisted state\n    // and tear it after record() returns.\n    const liveSnapshot: LastRecallSnapshot = {\n      sessionKey: opts.sessionKey,\n      recordedAt: now,\n      queryHash,\n      queryLen: opts.query.length,\n      memoryIds: opts.memoryIds,\n      namespace: opts.namespace,\n      traceId: opts.traceId,\n      plannerMode: opts.plannerMode,\n      requestedMode: opts.requestedMode,\n      source: opts.source,\n      fallbackUsed: opts.fallbackUsed,\n      sourcesUsed: opts.sourcesUsed,\n      budgetsApplied: opts.budgetsApplied,\n      latencyMs: opts.latencyMs,\n      resultPaths: opts.resultPaths,\n      policyVersion: opts.policyVersion,\n      identityInjectionMode: opts.identityInjection?.mode,\n      identityInjectedChars: opts.identityInjection?.injectedChars,\n      identityInjectionTruncated: opts.identityInjection?.truncated,\n      tierExplain: opts.tierExplain,\n    };\n    // `cloneLastRecallSnapshot` handles `null` but that never applies\n    // at this call site — the non-null assertion keeps the type\n    // checker honest.\n    const snapshot = cloneLastRecallSnapshot(liveSnapshot)!;\n\n    this.state[opts.sessionKey] = snapshot;\n\n    // Keep the state bounded; the impression log is append-only.\n    const keys = Object.keys(this.state);\n    if (keys.length > 50) {\n      const ordered = keys\n        .map((k) => ({ k, at: this.state[k]?.recordedAt ?? \"\" }))\n        .sort((a, b) => b.at.localeCompare(a.at));\n      for (const doomed of ordered.slice(50)) {\n        delete this.state[doomed.k];\n      }\n    }\n\n    try {\n      await mkdir(path.dirname(this.statePath), { recursive: true });\n      await writeFile(this.statePath, JSON.stringify(this.state, null, 2), \"utf-8\");\n    } catch (err) {\n      log.debug(`last recall store write failed: ${err}`);\n    }\n\n    if (opts.appendImpression !== false) {\n      try {\n        await mkdir(path.dirname(this.impressionsPath), { recursive: true });\n        await appendFile(this.impressionsPath, JSON.stringify(snapshot) + \"\\n\", \"utf-8\");\n      } catch (err) {\n        log.debug(`recall impressions append failed: ${err}`);\n      }\n    }\n  }\n\n  /**\n   * Attach a RecallTierExplain block to the existing snapshot for a\n   * session without rewriting the entire snapshot.  Used by the\n   * post-recall direct-answer annotation path (issue #518 slice 3c):\n   * recallInternal records the snapshot first, then the orchestrator\n   * fires the direct-answer tier in observation mode and annotates\n   * the stored snapshot with whichever tier served the query.\n   *\n   * No-op when no snapshot exists for the given session; callers do\n   * not need to guard on existence.\n   */\n  async annotateTierExplain(\n    sessionKey: string,\n    tierExplain: RecallTierExplain,\n  ): Promise<void> {\n    const current = this.state[sessionKey];\n    if (!current) return;\n    this.state[sessionKey] = {\n      ...current,\n      tierExplain: cloneTierExplain(tierExplain),\n    };\n    try {\n      await mkdir(path.dirname(this.statePath), { recursive: true });\n      await writeFile(this.statePath, JSON.stringify(this.state, null, 2), \"utf-8\");\n    } catch (err) {\n      log.debug(`last recall tier-explain annotate failed: ${err}`);\n    }\n  }\n}\n\nexport class TierMigrationStatusStore {\n  private readonly statePath: string;\n  private state: TierMigrationStatusSnapshot = structuredClone(DEFAULT_TIER_MIGRATION_STATUS);\n\n  constructor(memoryDir: string) {\n    this.statePath = path.join(memoryDir, \"state\", \"tier-migration-status.json\");\n  }\n\n  async load(): Promise<void> {\n    try {\n      const raw = await readFile(this.statePath, \"utf-8\");\n      const parsed = JSON.parse(raw) as Partial<TierMigrationStatusSnapshot> | null;\n      if (!parsed || typeof parsed !== \"object\") {\n        this.state = structuredClone(DEFAULT_TIER_MIGRATION_STATUS);\n        return;\n      }\n      const totals = parsed.totals && typeof parsed.totals === \"object\"\n        ? parsed.totals\n        : DEFAULT_TIER_MIGRATION_STATUS.totals;\n      this.state = {\n        updatedAt:\n          typeof parsed.updatedAt === \"string\" && parsed.updatedAt.length > 0\n            ? parsed.updatedAt\n            : DEFAULT_TIER_MIGRATION_STATUS.updatedAt,\n        lastCycle:\n          parsed.lastCycle && typeof parsed.lastCycle === \"object\"\n            ? (parsed.lastCycle as TierMigrationCycleSummary)\n            : null,\n        totals: {\n          cycles: typeof totals.cycles === \"number\" && Number.isFinite(totals.cycles) ? totals.cycles : 0,\n          scanned: typeof totals.scanned === \"number\" && Number.isFinite(totals.scanned) ? totals.scanned : 0,\n          migrated: typeof totals.migrated === \"number\" && Number.isFinite(totals.migrated) ? totals.migrated : 0,\n          promoted: typeof totals.promoted === \"number\" && Number.isFinite(totals.promoted) ? totals.promoted : 0,\n          demoted: typeof totals.demoted === \"number\" && Number.isFinite(totals.demoted) ? totals.demoted : 0,\n          errors: typeof totals.errors === \"number\" && Number.isFinite(totals.errors) ? totals.errors : 0,\n        },\n      };\n    } catch {\n      this.state = structuredClone(DEFAULT_TIER_MIGRATION_STATUS);\n    }\n  }\n\n  get(): TierMigrationStatusSnapshot {\n    return {\n      updatedAt: this.state.updatedAt,\n      lastCycle: this.state.lastCycle ? { ...this.state.lastCycle } : null,\n      totals: { ...this.state.totals },\n    };\n  }\n\n  async recordCycle(summary: TierMigrationCycleSummary): Promise<void> {\n    const now = new Date().toISOString();\n    const migratedDelta = summary.dryRun ? 0 : Math.max(0, summary.migrated);\n    const promotedDelta = summary.dryRun ? 0 : Math.max(0, summary.promoted);\n    const demotedDelta = summary.dryRun ? 0 : Math.max(0, summary.demoted);\n    const next: TierMigrationStatusSnapshot = {\n      updatedAt: now,\n      lastCycle: { ...summary },\n      totals: {\n        cycles: this.state.totals.cycles + 1,\n        scanned: this.state.totals.scanned + Math.max(0, summary.scanned),\n        migrated: this.state.totals.migrated + migratedDelta,\n        promoted: this.state.totals.promoted + promotedDelta,\n        demoted: this.state.totals.demoted + demotedDelta,\n        errors: this.state.totals.errors + Math.max(0, summary.errorCount ?? 0),\n      },\n    };\n    this.state = next;\n    try {\n      await mkdir(path.dirname(this.statePath), { recursive: true });\n      await writeFile(this.statePath, JSON.stringify(next, null, 2), \"utf-8\");\n    } catch (err) {\n      log.debug(`tier migration status write failed: ${err}`);\n    }\n  }\n}\n"],"mappings":";;;;;AAAA,SAAS,YAAY,OAAO,UAAU,iBAAiB;AACvD,OAAO,UAAU;AACjB,SAAS,kBAAkB;AA8DpB,SAAS,gCACd,SACA,aAAqB,IACO;AAC5B,QAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,UAAU,CAAC;AAChD,MAAI,CAAC,MAAM,QAAQ,OAAO,EAAG,QAAO,CAAC;AACrC,SAAO,QACJ,OAAO,CAAC,SAA0C,CAAC,CAAC,QAAQ,OAAO,SAAS,QAAQ,EACpF,IAAI,CAAC,SAAS;AACb,UAAM,YACJ,KAAK,cAAc,YAAY,KAAK,cAAc,UAAU,KAAK,cAAc,WAC3E,KAAK,YACL;AACN,WAAO;AAAA,MACL,MAAM,OAAO,KAAK,SAAS,WAAW,KAAK,OAAO;AAAA,MAClD,OAAO,OAAO,KAAK,UAAU,YAAY,OAAO,SAAS,KAAK,KAAK,IAAI,KAAK,QAAQ;AAAA,MACpF,WAAW,OAAO,KAAK,cAAc,WAAW,KAAK,YAAY;AAAA,MACjE,MAAM,OAAO,KAAK,SAAS,WAAW,KAAK,OAAO;AAAA,MAClD,UACE,OAAO,KAAK,aAAa,YAAY,OAAO,SAAS,KAAK,QAAQ,IAC9D,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,QAAQ,CAAC,IACrC;AAAA,MACN,eACE,OAAO,KAAK,kBAAkB,YAAY,OAAO,SAAS,KAAK,aAAa,IACxE,KAAK,IAAI,GAAG,KAAK,aAAa,IAC9B;AAAA,MACN;AAAA,IACF;AAAA,EACF,CAAC,EACA,OAAO,CAAC,SAAS,KAAK,KAAK,SAAS,KAAK,KAAK,UAAU,SAAS,CAAC,EAClE,MAAM,GAAG,KAAK;AACnB;AAgBA,SAAS,iBACP,aAC+B;AAC/B,MAAI,CAAC,YAAa,QAAO;AACzB,SAAO,gBAAgB,WAAW;AACpC;AAOA,SAAS,wBACP,UAC2B;AAC3B,MAAI,CAAC,SAAU,QAAO;AACtB,SAAO,gBAAgB,QAAQ;AACjC;AA2BA,IAAM,gCAA6D;AAAA,EACjE,YAAW,oBAAI,KAAK,CAAC,GAAE,YAAY;AAAA,EACnC,WAAW;AAAA,EACX,QAAQ;AAAA,IACN,QAAQ;AAAA,IACR,SAAS;AAAA,IACT,UAAU;AAAA,IACV,UAAU;AAAA,IACV,SAAS;AAAA,IACT,QAAQ;AAAA,EACV;AACF;AAEO,IAAM,kBAAN,MAAsB;AAAA,EACV;AAAA,EACA;AAAA,EACT,QAAyB,CAAC;AAAA,EAElC,YAAY,WAAmB;AAC7B,SAAK,YAAY,KAAK,KAAK,WAAW,SAAS,kBAAkB;AACjE,SAAK,kBAAkB,KAAK,KAAK,WAAW,SAAS,0BAA0B;AAAA,EACjF;AAAA,EAEA,MAAM,OAAsB;AAC1B,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,WAAW,OAAO;AAClD,YAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,UAAI,UAAU,OAAO,WAAW,SAAU,MAAK,QAAQ;AAAA,IACzD,QAAQ;AACN,WAAK,QAAQ,CAAC;AAAA,IAChB;AAAA,EACF;AAAA,EAEA,IAAI,YAA+C;AAGjD,WAAO,wBAAwB,KAAK,MAAM,UAAU,KAAK,IAAI;AAAA,EAC/D;AAAA,EAEA,gBAA2C;AACzC,UAAM,YAAY,OAAO,OAAO,KAAK,KAAK;AAC1C,QAAI,UAAU,WAAW,EAAG,QAAO;AAGnC,cAAU,KAAK,CAAC,GAAG,MAAM;AACvB,YAAM,SAAS,EAAE,WAAW,cAAc,EAAE,UAAU;AACtD,UAAI,WAAW,EAAG,QAAO;AACzB,aAAO,EAAE,WAAW,cAAc,EAAE,UAAU;AAAA,IAChD,CAAC;AACD,WAAO,wBAAwB,UAAU,CAAC,KAAK,IAAI;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,OAAO,MA2BK;AAChB,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,UAAM,YAAY,WAAW,QAAQ,EAAE,OAAO,KAAK,KAAK,EAAE,OAAO,KAAK;AAMtE,UAAM,eAAmC;AAAA,MACvC,YAAY,KAAK;AAAA,MACjB,YAAY;AAAA,MACZ;AAAA,MACA,UAAU,KAAK,MAAM;AAAA,MACrB,WAAW,KAAK;AAAA,MAChB,WAAW,KAAK;AAAA,MAChB,SAAS,KAAK;AAAA,MACd,aAAa,KAAK;AAAA,MAClB,eAAe,KAAK;AAAA,MACpB,QAAQ,KAAK;AAAA,MACb,cAAc,KAAK;AAAA,MACnB,aAAa,KAAK;AAAA,MAClB,gBAAgB,KAAK;AAAA,MACrB,WAAW,KAAK;AAAA,MAChB,aAAa,KAAK;AAAA,MAClB,eAAe,KAAK;AAAA,MACpB,uBAAuB,KAAK,mBAAmB;AAAA,MAC/C,uBAAuB,KAAK,mBAAmB;AAAA,MAC/C,4BAA4B,KAAK,mBAAmB;AAAA,MACpD,aAAa,KAAK;AAAA,IACpB;AAIA,UAAM,WAAW,wBAAwB,YAAY;AAErD,SAAK,MAAM,KAAK,UAAU,IAAI;AAG9B,UAAM,OAAO,OAAO,KAAK,KAAK,KAAK;AACnC,QAAI,KAAK,SAAS,IAAI;AACpB,YAAM,UAAU,KACb,IAAI,CAAC,OAAO,EAAE,GAAG,IAAI,KAAK,MAAM,CAAC,GAAG,cAAc,GAAG,EAAE,EACvD,KAAK,CAAC,GAAG,MAAM,EAAE,GAAG,cAAc,EAAE,EAAE,CAAC;AAC1C,iBAAW,UAAU,QAAQ,MAAM,EAAE,GAAG;AACtC,eAAO,KAAK,MAAM,OAAO,CAAC;AAAA,MAC5B;AAAA,IACF;AAEA,QAAI;AACF,YAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAC7D,YAAM,UAAU,KAAK,WAAW,KAAK,UAAU,KAAK,OAAO,MAAM,CAAC,GAAG,OAAO;AAAA,IAC9E,SAAS,KAAK;AACZ,UAAI,MAAM,mCAAmC,GAAG,EAAE;AAAA,IACpD;AAEA,QAAI,KAAK,qBAAqB,OAAO;AACnC,UAAI;AACF,cAAM,MAAM,KAAK,QAAQ,KAAK,eAAe,GAAG,EAAE,WAAW,KAAK,CAAC;AACnE,cAAM,WAAW,KAAK,iBAAiB,KAAK,UAAU,QAAQ,IAAI,MAAM,OAAO;AAAA,MACjF,SAAS,KAAK;AACZ,YAAI,MAAM,qCAAqC,GAAG,EAAE;AAAA,MACtD;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAM,oBACJ,YACA,aACe;AACf,UAAM,UAAU,KAAK,MAAM,UAAU;AACrC,QAAI,CAAC,QAAS;AACd,SAAK,MAAM,UAAU,IAAI;AAAA,MACvB,GAAG;AAAA,MACH,aAAa,iBAAiB,WAAW;AAAA,IAC3C;AACA,QAAI;AACF,YAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAC7D,YAAM,UAAU,KAAK,WAAW,KAAK,UAAU,KAAK,OAAO,MAAM,CAAC,GAAG,OAAO;AAAA,IAC9E,SAAS,KAAK;AACZ,UAAI,MAAM,6CAA6C,GAAG,EAAE;AAAA,IAC9D;AAAA,EACF;AACF;AAEO,IAAM,2BAAN,MAA+B;AAAA,EACnB;AAAA,EACT,QAAqC,gBAAgB,6BAA6B;AAAA,EAE1F,YAAY,WAAmB;AAC7B,SAAK,YAAY,KAAK,KAAK,WAAW,SAAS,4BAA4B;AAAA,EAC7E;AAAA,EAEA,MAAM,OAAsB;AAC1B,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,WAAW,OAAO;AAClD,YAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,UAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,aAAK,QAAQ,gBAAgB,6BAA6B;AAC1D;AAAA,MACF;AACA,YAAM,SAAS,OAAO,UAAU,OAAO,OAAO,WAAW,WACrD,OAAO,SACP,8BAA8B;AAClC,WAAK,QAAQ;AAAA,QACX,WACE,OAAO,OAAO,cAAc,YAAY,OAAO,UAAU,SAAS,IAC9D,OAAO,YACP,8BAA8B;AAAA,QACpC,WACE,OAAO,aAAa,OAAO,OAAO,cAAc,WAC3C,OAAO,YACR;AAAA,QACN,QAAQ;AAAA,UACN,QAAQ,OAAO,OAAO,WAAW,YAAY,OAAO,SAAS,OAAO,MAAM,IAAI,OAAO,SAAS;AAAA,UAC9F,SAAS,OAAO,OAAO,YAAY,YAAY,OAAO,SAAS,OAAO,OAAO,IAAI,OAAO,UAAU;AAAA,UAClG,UAAU,OAAO,OAAO,aAAa,YAAY,OAAO,SAAS,OAAO,QAAQ,IAAI,OAAO,WAAW;AAAA,UACtG,UAAU,OAAO,OAAO,aAAa,YAAY,OAAO,SAAS,OAAO,QAAQ,IAAI,OAAO,WAAW;AAAA,UACtG,SAAS,OAAO,OAAO,YAAY,YAAY,OAAO,SAAS,OAAO,OAAO,IAAI,OAAO,UAAU;AAAA,UAClG,QAAQ,OAAO,OAAO,WAAW,YAAY,OAAO,SAAS,OAAO,MAAM,IAAI,OAAO,SAAS;AAAA,QAChG;AAAA,MACF;AAAA,IACF,QAAQ;AACN,WAAK,QAAQ,gBAAgB,6BAA6B;AAAA,IAC5D;AAAA,EACF;AAAA,EAEA,MAAmC;AACjC,WAAO;AAAA,MACL,WAAW,KAAK,MAAM;AAAA,MACtB,WAAW,KAAK,MAAM,YAAY,EAAE,GAAG,KAAK,MAAM,UAAU,IAAI;AAAA,MAChE,QAAQ,EAAE,GAAG,KAAK,MAAM,OAAO;AAAA,IACjC;AAAA,EACF;AAAA,EAEA,MAAM,YAAY,SAAmD;AACnE,UAAM,OAAM,oBAAI,KAAK,GAAE,YAAY;AACnC,UAAM,gBAAgB,QAAQ,SAAS,IAAI,KAAK,IAAI,GAAG,QAAQ,QAAQ;AACvE,UAAM,gBAAgB,QAAQ,SAAS,IAAI,KAAK,IAAI,GAAG,QAAQ,QAAQ;AACvE,UAAM,eAAe,QAAQ,SAAS,IAAI,KAAK,IAAI,GAAG,QAAQ,OAAO;AACrE,UAAM,OAAoC;AAAA,MACxC,WAAW;AAAA,MACX,WAAW,EAAE,GAAG,QAAQ;AAAA,MACxB,QAAQ;AAAA,QACN,QAAQ,KAAK,MAAM,OAAO,SAAS;AAAA,QACnC,SAAS,KAAK,MAAM,OAAO,UAAU,KAAK,IAAI,GAAG,QAAQ,OAAO;AAAA,QAChE,UAAU,KAAK,MAAM,OAAO,WAAW;AAAA,QACvC,UAAU,KAAK,MAAM,OAAO,WAAW;AAAA,QACvC,SAAS,KAAK,MAAM,OAAO,UAAU;AAAA,QACrC,QAAQ,KAAK,MAAM,OAAO,SAAS,KAAK,IAAI,GAAG,QAAQ,cAAc,CAAC;AAAA,MACxE;AAAA,IACF;AACA,SAAK,QAAQ;AACb,QAAI;AACF,YAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAC7D,YAAM,UAAU,KAAK,WAAW,KAAK,UAAU,MAAM,MAAM,CAAC,GAAG,OAAO;AAAA,IACxE,SAAS,KAAK;AACZ,UAAI,MAAM,uCAAuC,GAAG,EAAE;AAAA,IACxD;AAAA,EACF;AACF;","names":[]}

package/dist/chunk-4LACOVZX.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/briefing.ts"],"sourcesContent":["/**\n * Daily Context Briefing (Issue #370)\n *\n * Produces a focused \"here is what matters right now\" briefing by\n * cross-referencing active entities, recent facts, open commitments,\n * LLM-generated follow-ups, and an optional calendar source.\n *\n * The module exposes:\n *   - `parseBriefingWindow(token)` — CLI-friendly window parser.\n *   - `buildBriefing(options)` — core builder that returns markdown + JSON.\n *   - `FileCalendarSource` — stub CalendarSource implementation that reads\n *     a local ICS or JSON file.\n *\n * ALL OpenAI usage in this module goes through the Responses API. Chat\n * Completions is never used.\n */\n\nimport { readFile } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { log } from \"./logger.js\";\nimport { StorageManager } from \"./storage.js\";\nimport type {\n  BriefingActiveThread,\n  BriefingCalendarSourceError,\n  BriefingFocus,\n  BriefingFollowup,\n  BriefingOpenCommitment,\n  BriefingRecentEntity,\n  BriefingResult,\n  BriefingSections,\n  CalendarEvent,\n  CalendarSource,\n  EntityFile,\n  MemoryFile,\n} from \"./types.js\";\n\n// ──────────────────────────────────────────────────────────────────────────\n// Window parsing\n// ──────────────────────────────────────────────────────────────────────────\n\n/** Allowed values for the briefing format flag/field. */\nexport const BRIEFING_FORMAT_ALLOWED = [\"markdown\", \"json\"] as const;\n\n/**\n * Default model used for the Responses API follow-up generation call.\n * Mirrors the extraction engine default in config.ts — keep in sync.\n */\nexport const BRIEFING_FOLLOWUP_DEFAULT_MODEL = \"gpt-5.2\";\nexport type BriefingFormatValue = typeof BRIEFING_FORMAT_ALLOWED[number];\n\n/**\n * Validate a user-supplied `--format` flag value.\n * Returns `null` when the value is valid (or `undefined`, meaning the flag\n * was not supplied and the caller should fall back to the configured default).\n * Returns an error message string when the value is explicitly invalid.\n */\nexport function validateBriefingFormat(value: string | undefined): string | null {\n  if (value === undefined) return null;\n  if ((BRIEFING_FORMAT_ALLOWED as readonly string[]).includes(value)) return null;\n  return `Invalid --format value: \"${value}\". Accepted: ${BRIEFING_FORMAT_ALLOWED.join(\", \")}.`;\n}\n\n/** Parsed briefing lookback window. */\nexport interface ParsedBriefingWindow {\n  /** Start of the window (inclusive). */\n  from: Date;\n  /** End of the window (exclusive). */\n  to: Date;\n  /** Human-readable label. */\n  label: string;\n}\n\nconst DAY_MS = 24 * 60 * 60 * 1000;\n\n/**\n * Maximum allowed lookback offset in milliseconds (100 years).\n * Anything beyond this is almost certainly a typo or abuse — and would\n * overflow to `Invalid Date` for sufficiently large values anyway.\n */\nconst MAX_WINDOW_MS = 100 * 365 * DAY_MS;\n\n/**\n * Parse a CLI-friendly window token into a concrete date range.\n *\n * Accepted forms (case-insensitive):\n *   - `yesterday` — the previous UTC calendar day.\n *   - `today`    — the current UTC calendar day so far.\n *   - `NNh`      — last N hours (e.g. `24h`, `48h`).\n *   - `NNd`      — last N calendar days (e.g. `3d`, `7d`).\n *   - `NNw`      — last N weeks (e.g. `1w`, `2w`).\n *\n * Returns `null` for invalid tokens so callers can surface a clean error.\n */\nexport function parseBriefingWindow(\n  token: string,\n  now: Date = new Date(),\n): ParsedBriefingWindow | null {\n  const raw = typeof token === \"string\" ? token.trim().toLowerCase() : \"\";\n  if (raw.length === 0) return null;\n\n  if (raw === \"yesterday\") {\n    const startOfToday = startOfUtcDay(now);\n    const from = new Date(startOfToday.getTime() - DAY_MS);\n    return { from, to: startOfToday, label: \"yesterday\" };\n  }\n\n  if (raw === \"today\") {\n    return { from: startOfUtcDay(now), to: now, label: \"today\" };\n  }\n\n  const match = raw.match(/^(\\d+)\\s*(h|d|w)$/);\n  if (!match) return null;\n  const value = parseInt(match[1], 10);\n  if (!Number.isFinite(value) || value <= 0) return null;\n  const unit = match[2];\n  let ms = 0;\n  if (unit === \"h\") ms = value * 60 * 60 * 1000;\n  else if (unit === \"d\") ms = value * DAY_MS;\n  else if (unit === \"w\") ms = value * 7 * DAY_MS;\n  if (ms === 0) return null;\n  // Reject values that exceed the 100-year cap or would overflow to Invalid Date.\n  if (ms > MAX_WINDOW_MS || !Number.isFinite(ms)) return null;\n  const from = new Date(now.getTime() - ms);\n  if (!Number.isFinite(from.getTime())) return null;\n  return {\n    from,\n    to: now,\n    label: `last ${value}${unit}`,\n  };\n}\n\nfunction startOfUtcDay(date: Date): Date {\n  const d = new Date(date.getTime());\n  d.setUTCHours(0, 0, 0, 0);\n  return d;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Focus filter\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Parse a CLI `--focus` string into a structured focus filter.\n *\n * Accepted forms:\n *   - `person:Jane Doe`\n *   - `project:remnic-core`\n *   - `topic:retrieval`\n *\n * If no prefix is supplied, falls back to `topic:<value>`.\n */\nexport function parseBriefingFocus(token: string | undefined): BriefingFocus | null {\n  if (typeof token !== \"string\") return null;\n  const trimmed = token.trim();\n  if (trimmed.length === 0) return null;\n  const [maybeType, ...rest] = trimmed.split(\":\");\n  if (rest.length === 0) {\n    return { type: \"topic\", value: maybeType };\n  }\n  const rawType = maybeType.toLowerCase();\n  if (rawType === \"person\" || rawType === \"project\" || rawType === \"topic\") {\n    const value = rest.join(\":\").trim();\n    if (value.length === 0) return null;\n    return { type: rawType, value };\n  }\n  return { type: \"topic\", value: trimmed };\n}\n\n/**\n * Derive the slugged form of a typed focus value that mirrors how entityRefs\n * are constructed (lowercased, non-alphanumeric runs → hyphens, prefixed with\n * the focus type).  Example: `person:Jane Doe` → `\"person-jane-doe\"`.\n *\n * This lets `focusMatchesMemory` match against `entityRef` even when the\n * focus value was supplied with spaces/capitals that the slug normalised away.\n */\nfunction focusToEntityRefSlug(focus: BriefingFocus): string {\n  const sluggedValue = focus.value\n    .toLowerCase()\n    .replace(/[^a-z0-9]+/g, \"-\")\n    .replace(/-+/g, \"-\")\n    .replace(/^-|-$/g, \"\");\n  return `${focus.type}-${sluggedValue}`;\n}\n\n/**\n * Decide whether a memory/entity matches the given focus filter.\n * Purely deterministic — no LLM, case-insensitive substring match across\n * the most useful surfaces.\n *\n * For `entityRef` matching we also check the slugged form of the typed focus\n * (e.g. `person:Jane Doe` → `\"person-jane-doe\"`) because entityRefs are stored\n * in normalised slug form and a raw substring match on `\"Jane Doe\"` would never\n * hit `\"person-jane-doe\"`.\n */\nexport function focusMatchesMemory(memory: MemoryFile, focus: BriefingFocus): boolean {\n  const needle = focus.value.toLowerCase();\n  const entityRef = (memory.frontmatter.entityRef ?? \"\").toLowerCase();\n\n  // Raw substring match across content and tags (preserves existing behaviour).\n  const rawHaystack = [\n    memory.content,\n    entityRef,\n    ...(memory.frontmatter.tags ?? []),\n  ]\n    .join(\" \")\n    .toLowerCase();\n  if (rawHaystack.includes(needle)) return true;\n\n  // Slug match: check whether the entityRef contains the slugged focus value.\n  // This catches typed focus tokens like `person:Jane Doe` whose slug form\n  // `\"person-jane-doe\"` matches an entityRef but the raw value never would.\n  const slug = focusToEntityRefSlug(focus);\n  return entityRef.includes(slug);\n}\n\nexport function focusMatchesEntity(entity: EntityFile, focus: BriefingFocus): boolean {\n  const needle = focus.value.toLowerCase();\n  if (focus.type === \"person\" && entity.type.toLowerCase() !== \"person\") return false;\n  if (focus.type === \"project\" && entity.type.toLowerCase() !== \"project\") return false;\n  const haystack = [\n    entity.name,\n    entity.synthesis || entity.summary || \"\",\n    ...entity.facts,\n    ...(entity.aliases ?? []),\n    ...(entity.structuredSections ?? []).flatMap((section) => [section.title, ...section.facts]),\n  ]\n    .join(\" \")\n    .toLowerCase();\n  return haystack.includes(needle);\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Calendar source\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Stub `CalendarSource` backed by a single local file. Supports:\n *   - JSON files containing an array of `CalendarEvent` records, OR a wrapper\n *     `{ events: CalendarEvent[] }` object.\n *   - Minimal ICS (`.ics`) files — extracts `VEVENT` blocks with `SUMMARY`,\n *     `DTSTART`, `DTEND`, `LOCATION`, `DESCRIPTION`, `UID`.\n *\n * Real calendar integrations (Google, iCloud, Microsoft) can plug into the\n * same `CalendarSource` interface later.\n */\nexport class FileCalendarSource implements CalendarSource {\n  constructor(private readonly filePath: string) {}\n\n  async eventsForDate(dateIso: string): Promise<CalendarEvent[]> {\n    let raw: string;\n    try {\n      raw = await readFile(this.filePath, \"utf-8\");\n    } catch (err) {\n      log.warn(`briefing: calendar source unreadable at ${this.filePath}: ${err}`);\n      return [];\n    }\n\n    const events = this.filePath.toLowerCase().endsWith(\".ics\")\n      ? parseIcsEvents(raw)\n      : parseJsonEvents(raw);\n\n    return events.filter((event) => eventFallsOnDate(event, dateIso));\n  }\n}\n\nfunction parseJsonEvents(raw: string): CalendarEvent[] {\n  try {\n    const parsed = JSON.parse(raw) as unknown;\n    const arr = Array.isArray(parsed)\n      ? parsed\n      : parsed && typeof parsed === \"object\" && Array.isArray((parsed as { events?: unknown }).events)\n        ? ((parsed as { events: unknown[] }).events)\n        : [];\n    const events: CalendarEvent[] = [];\n    for (const entry of arr) {\n      if (!entry || typeof entry !== \"object\") continue;\n      const e = entry as Record<string, unknown>;\n      const id = typeof e.id === \"string\" ? e.id : typeof e.uid === \"string\" ? e.uid : cryptoRandomId();\n      const title = typeof e.title === \"string\" ? e.title : typeof e.summary === \"string\" ? e.summary : \"\";\n      const start = typeof e.start === \"string\" ? e.start : typeof e.dtstart === \"string\" ? e.dtstart : \"\";\n      if (!title || !start) continue;\n      events.push({\n        id,\n        title,\n        start,\n        end: typeof e.end === \"string\" ? e.end : typeof e.dtend === \"string\" ? e.dtend : undefined,\n        location: typeof e.location === \"string\" ? e.location : undefined,\n        notes: typeof e.notes === \"string\" ? e.notes : typeof e.description === \"string\" ? e.description : undefined,\n      });\n    }\n    return events;\n  } catch (err) {\n    log.warn(`briefing: calendar JSON parse failed: ${err}`);\n    return [];\n  }\n}\n\ninterface IcsParsedLine {\n  property: string;\n  params: Record<string, string>;\n  value: string;\n}\n\n/**\n * Parse a single ICS content line into its property, parameters, and value.\n * Returns null if the line is not a well-formed property line.\n *\n * Example:\n *   `DTSTART;TZID=America/New_York:20260411T233000`\n *   → { property: \"DTSTART\", params: { TZID: \"America/New_York\" }, value: \"20260411T233000\" }\n */\nfunction parseIcsLine(line: string): IcsParsedLine | null {\n  // Find the first `:` outside of any parameter value. Per RFC 5545 parameter\n  // values may be quoted, but the minimal-parser use case here only needs to\n  // handle unquoted TZID values.\n  const colonIdx = line.indexOf(\":\");\n  if (colonIdx <= 0) return null;\n  const head = line.slice(0, colonIdx);\n  const value = line.slice(colonIdx + 1).trim();\n  // Head is of the form `PROPERTY[;PARAM=val[;PARAM=val]]`.\n  const headParts = head.split(\";\");\n  const property = headParts[0]!.toUpperCase();\n  if (!/^[A-Z0-9-]+$/.test(property)) return null;\n  const params: Record<string, string> = {};\n  for (let i = 1; i < headParts.length; i++) {\n    const segment = headParts[i]!;\n    const eqIdx = segment.indexOf(\"=\");\n    if (eqIdx <= 0) continue;\n    const name = segment.slice(0, eqIdx).toUpperCase();\n    let val = segment.slice(eqIdx + 1);\n    // Strip surrounding quotes if present (RFC 5545 §3.1).\n    if (val.startsWith('\"') && val.endsWith('\"') && val.length >= 2) {\n      val = val.slice(1, -1);\n    }\n    params[name] = val;\n  }\n  return { property, params, value };\n}\n\ninterface IcsDateField {\n  raw: string;\n  params: Record<string, string>;\n}\n\n/** @internal — exported for testing only. */\nexport function parseIcsEvents(raw: string): CalendarEvent[] {\n  const events: CalendarEvent[] = [];\n  // RFC 5545 §3.1 line unfolding: a CRLF (now \\n) followed by a single\n  // whitespace character (space or tab) is a fold — remove both characters\n  // to join the continuation onto the preceding logical line.  This MUST\n  // happen after normalising CRLF → \\n and BEFORE splitting on \\n.\n  const normalized = raw.replace(/\\r\\n/g, \"\\n\").replace(/\\n[ \\t]/g, \"\");\n  const blocks = normalized.split(/BEGIN:VEVENT/i).slice(1);\n  for (const block of blocks) {\n    const endIdx = block.search(/END:VEVENT/i);\n    const body = endIdx === -1 ? block : block.slice(0, endIdx);\n    const simpleFields: Record<string, string> = {};\n    const dateFields: Record<string, IcsDateField> = {};\n    for (const line of body.split(\"\\n\")) {\n      const parsed = parseIcsLine(line);\n      if (!parsed) continue;\n      const { property, params, value } = parsed;\n      if (property === \"DTSTART\" || property === \"DTEND\") {\n        if (dateFields[property] === undefined) {\n          dateFields[property] = { raw: value, params };\n        }\n      } else if (simpleFields[property] === undefined) {\n        simpleFields[property] = value;\n      }\n    }\n    const title = simpleFields.SUMMARY;\n    const dtstart = dateFields.DTSTART;\n    if (!title || !dtstart) continue;\n    const dtend = dateFields.DTEND;\n    events.push({\n      id: simpleFields.UID ?? cryptoRandomId(),\n      title,\n      start: normalizeIcsDate(dtstart.raw, dtstart.params),\n      end: dtend ? normalizeIcsDate(dtend.raw, dtend.params) : undefined,\n      location: simpleFields.LOCATION,\n      notes: simpleFields.DESCRIPTION,\n    });\n  }\n  return events;\n}\n\n/**\n * Normalise an ICS date/datetime value (optionally with a `TZID` parameter)\n * into an ISO 8601 string that downstream code can compare unambiguously.\n *\n * Behaviour:\n *   - `20260411T150000Z` → `2026-04-11T15:00:00Z`\n *   - `20260411` → `2026-04-11T00:00:00Z` (date-only events are day-boundaries)\n *   - `20260411T150000` (floating, no Z, no TZID) → `2026-04-11T15:00:00` (floating)\n *   - `20260411T233000` with `TZID=America/New_York` → `2026-04-12T03:30:00Z`\n *     (applies the zone offset at that wallclock time; DST-aware via Intl)\n *   - Unknown TZID falls back to UTC with a logged warning (conservative:\n *     the event still appears, but on the UTC date).\n */\nfunction normalizeIcsDate(value: string, params: Record<string, string> = {}): string {\n  // Date-time with explicit Z suffix (UTC).\n  if (/^\\d{8}T\\d{6}Z$/.test(value)) {\n    const y = value.slice(0, 4);\n    const m = value.slice(4, 6);\n    const d = value.slice(6, 8);\n    const hh = value.slice(9, 11);\n    const mm = value.slice(11, 13);\n    const ss = value.slice(13, 15);\n    return `${y}-${m}-${d}T${hh}:${mm}:${ss}Z`;\n  }\n  // Date-time without Z: may be floating or zoned via TZID.\n  if (/^\\d{8}T\\d{6}$/.test(value)) {\n    const y = value.slice(0, 4);\n    const m = value.slice(4, 6);\n    const d = value.slice(6, 8);\n    const hh = value.slice(9, 11);\n    const mm = value.slice(11, 13);\n    const ss = value.slice(13, 15);\n    const local = `${y}-${m}-${d}T${hh}:${mm}:${ss}`;\n    const tzid = params.TZID;\n    if (tzid) {\n      const utcIso = icsWallclockToUtc(local, tzid);\n      if (utcIso) return utcIso;\n      log.warn(\n        `briefing: unsupported TZID \"${tzid}\" — treating as UTC for ${local}`,\n      );\n      return `${local}Z`;\n    }\n    // No TZID → floating. Downstream compares the date slice directly.\n    return local;\n  }\n  // Date-only (all-day event). Date-only values carry no TZID per RFC 5545.\n  if (/^\\d{8}$/.test(value)) {\n    return `${value.slice(0, 4)}-${value.slice(4, 6)}-${value.slice(6, 8)}T00:00:00Z`;\n  }\n  return value;\n}\n\n/**\n * Convert a wallclock local datetime in a named IANA timezone to a UTC ISO\n * string. Returns null if the timezone is unsupported by the runtime.\n *\n * Implementation note: this is the standard \"invert the formatter\" technique.\n * We treat the local wallclock as though it were UTC, ask the runtime what\n * time that instant shows in the target zone, and the delta is the zone's\n * offset at that wallclock moment (DST-aware).\n */\nfunction icsWallclockToUtc(local: string, tzid: string): string | null {\n  const match = local.match(/^(\\d{4})-(\\d{2})-(\\d{2})T(\\d{2}):(\\d{2}):(\\d{2})$/);\n  if (!match) return null;\n  const [, y, mo, d, hh, mm, ss] = match;\n  // Treat the wallclock as UTC for the first probe.\n  const naiveUtcMs = Date.UTC(\n    Number(y),\n    Number(mo) - 1,\n    Number(d),\n    Number(hh),\n    Number(mm),\n    Number(ss),\n  );\n  if (!Number.isFinite(naiveUtcMs)) return null;\n\n  let formatter: Intl.DateTimeFormat;\n  try {\n    formatter = new Intl.DateTimeFormat(\"en-US\", {\n      timeZone: tzid,\n      year: \"numeric\",\n      month: \"2-digit\",\n      day: \"2-digit\",\n      hour: \"2-digit\",\n      minute: \"2-digit\",\n      second: \"2-digit\",\n      hour12: false,\n    });\n  } catch {\n    return null;\n  }\n\n  const zonedMs = zonedFormatToMs(formatter, new Date(naiveUtcMs));\n  if (zonedMs === null) return null;\n  // Offset = naiveUtc − zonedAtNaiveUtc (positive for zones east of UTC).\n  const offsetMs = naiveUtcMs - zonedMs;\n  // Apply the offset once to land on the real UTC instant.\n  const realUtcMs = naiveUtcMs + offsetMs;\n  // Second pass: offsets can differ when the wallclock crosses a DST boundary.\n  const zonedMs2 = zonedFormatToMs(formatter, new Date(realUtcMs));\n  if (zonedMs2 !== null) {\n    const offsetMs2 = realUtcMs - zonedMs2;\n    if (offsetMs2 !== offsetMs) {\n      return new Date(naiveUtcMs + offsetMs2).toISOString();\n    }\n  }\n  return new Date(realUtcMs).toISOString();\n}\n\n/**\n * Format a Date in the given timezone and return the absolute ms timestamp\n * of that wallclock time interpreted as if it were UTC. Used only by\n * `icsWallclockToUtc` to compute zone offsets.\n */\nfunction zonedFormatToMs(formatter: Intl.DateTimeFormat, date: Date): number | null {\n  const parts = formatter.formatToParts(date);\n  const get = (type: string): string | undefined =>\n    parts.find((p) => p.type === type)?.value;\n  const y = get(\"year\");\n  const mo = get(\"month\");\n  const d = get(\"day\");\n  const hh = get(\"hour\");\n  const mm = get(\"minute\");\n  const ss = get(\"second\");\n  if (!y || !mo || !d || !hh || !mm || !ss) return null;\n  // RFC 5545 / Intl edge-case: some runtimes return `hour: \"24\"` for midnight\n  // while keeping the same calendar day (instead of returning hour=0 with the\n  // next day).  Passing 24 straight to Date.UTC would roll the date forward by\n  // one day, producing a 24-hour-skewed offset in icsWallclockToUtc and\n  // shifting TZID midnight events to the wrong briefing day.  Normalise to 0\n  // and leave the date component unchanged.\n  const normalizedHour = Number(hh) === 24 ? 0 : Number(hh);\n  const ms = Date.UTC(Number(y), Number(mo) - 1, Number(d), normalizedHour, Number(mm), Number(ss));\n  return Number.isFinite(ms) ? ms : null;\n}\n\n/**\n * Returns true when `isoStr` has an explicit UTC or numeric offset suffix\n * (Z, ±HH:MM, or ±HHMM).  Floating datetimes produced by `normalizeIcsDate`\n * have no such suffix.\n */\nfunction isoHasTimezone(isoStr: string): boolean {\n  return /(Z|[+-]\\d{2}:?\\d{2})$/.test(isoStr);\n}\n\n/**\n * Parse an ISO datetime string (UTC-aware or floating) to milliseconds since\n * epoch, or `null` if the string is not a valid datetime.\n *\n * - UTC / offset-aware strings are passed directly to `new Date()`.\n * - Floating strings (no timezone suffix) are interpreted as UTC so that\n *   interval arithmetic uses the same epoch base as UTC-aware strings.\n *   The caller is responsible for using the correct date-boundary constants.\n */\nfunction isoToMs(isoStr: string): number | null {\n  if (!isoStr) return null;\n  let src = isoStr;\n  if (!isoHasTimezone(src)) {\n    // Treat floating time as UTC for interval math (append Z).\n    src = src + \"Z\";\n  }\n  const ms = new Date(src).getTime();\n  return Number.isFinite(ms) ? ms : null;\n}\n\n/** @internal — exported for testing only. */\nexport function eventFallsOnDate(event: CalendarEvent, dateIso: string): boolean {\n  const target = dateIso.slice(0, 10);\n  const start = event.start;\n\n  // Floating ICS datetime (no Z, no offset): `normalizeIcsDate` produces\n  // \"YYYY-MM-DDTHH:MM:SS\" with no timezone. Passing this to `new Date()`\n  // causes ECMAScript to parse it as local time, which then round-trips\n  // through UTC via `toISOString()` and can shift the calendar date.\n  // For floating times we compare date portions directly (no epoch arithmetic).\n  const startIsFloating = !isoHasTimezone(start);\n\n  if (startIsFloating) {\n    // Validate the start timestamp with the same rigour applied to end:\n    //   1. Shape check — must match the ISO-8601 date or datetime pattern.\n    //   2. Real-date check — round-trip through UTC to reject impossible dates\n    //      like \"2026-02-30\" that JavaScript silently auto-corrects.\n    //   3. Time-component check — reject out-of-range hours/minutes/seconds\n    //      (e.g. \"2026-04-11T25:99:00\") that JavaScript rolls over to a\n    //      different day, which would cause the event to be matched against\n    //      unrelated calendar dates.\n    // If start fails any check we skip the event entirely — there is no usable\n    // start date to fall back on.\n    const startShapeOk =\n      typeof start === \"string\" &&\n      /^\\d{4}-\\d{2}-\\d{2}(T\\d{2}:\\d{2}(:\\d{2}(\\.\\d+)?)?)?$/.test(start);\n    if (!startShapeOk) {\n      log.debug(`briefing: skipping calendar event with invalid start value: ${JSON.stringify(start)}`);\n      return false;\n    }\n    const startDateStr = start.slice(0, 10);\n    const startDateProbe = new Date(startDateStr + \"T00:00:00Z\");\n    if (\n      Number.isNaN(startDateProbe.getTime()) ||\n      startDateProbe.toISOString().slice(0, 10) !== startDateStr\n    ) {\n      log.warn(\n        `briefing: skipping calendar event \"${event.title}\" with impossible start date ${JSON.stringify(startDateStr)}`,\n      );\n      return false;\n    }\n    const startRawTime = start.indexOf(\"T\") !== -1 ? start.slice(start.indexOf(\"T\") + 1) : \"\";\n    if (startRawTime !== \"\") {\n      const startTimeParts = startRawTime.split(\":\").map(Number);\n      const shh = startTimeParts[0] ?? 0;\n      const smm = startTimeParts[1] ?? 0;\n      const sss = Math.floor(startTimeParts[2] ?? 0);\n      if (shh > 23 || smm > 59 || sss > 59) {\n        log.warn(\n          `briefing: skipping calendar event \"${event.title}\" with out-of-range start time ${JSON.stringify(startRawTime)}`,\n        );\n        return false;\n      }\n    }\n\n    const startDate = startDateStr;\n    const end = event.end;\n\n    // Point event (no end) — simple date prefix comparison.\n    if (!end) return startDate === target;\n\n    // Validate that end is a recognisable ISO-8601 date/datetime string before\n    // slicing it for lexicographic comparison.  A malformed end (e.g. a JSON\n    // feed emitting \"end\": \"invalid\") would otherwise produce a non-date prefix\n    // from `end.slice(0, 10)` and cause the event to appear on unrelated days.\n    // Fallback: treat the event as a single-day event starting on startDate.\n    const endIsValid =\n      typeof end === \"string\" &&\n      /^\\d{4}-\\d{2}-\\d{2}(T\\d{2}:\\d{2}(:\\d{2}(\\.\\d+)?)?)?$/.test(end);\n    if (!endIsValid) {\n      log.warn(\n        `briefing: event \"${event.title}\" has malformed end timestamp ${JSON.stringify(end)}; treating as single-day event at ${startDate}`,\n      );\n      // Render the event but only on its start date.\n      return startDate === target;\n    }\n\n    // UhLh: Reject impossible calendar dates that pass the regex (e.g. \"2026-99-99\").\n    // The regex only validates the *shape* of the string — it accepts month 99 and\n    // day 99.  We must additionally verify the date is real by constructing a UTC\n    // Date and checking that the ISO round-trip matches the input prefix.  If the\n    // date is impossible, Date will auto-correct it (e.g. \"2026-01-99\" becomes some\n    // later date), so the round-trip will differ.  Fall back to single-day semantics.\n    const endDate = end.slice(0, 10);\n    const endDateProbe = new Date(endDate + \"T00:00:00Z\");\n    if (\n      Number.isNaN(endDateProbe.getTime()) ||\n      endDateProbe.toISOString().slice(0, 10) !== endDate\n    ) {\n      log.warn(\n        `briefing: event \"${event.title}\" has impossible end date ${JSON.stringify(endDate)}; treating as single-day event at ${startDate}`,\n      );\n      return startDate === target;\n    }\n\n    // Validate the time components of the end timestamp when present.\n    // The regex above only checks the shape (e.g. two digits for hour) but does\n    // not enforce numeric ranges.  A value like \"2026-04-11T25:99:99\" passes the\n    // regex and the date-round-trip check above yet carries an impossible time.\n    // JavaScript's Date constructor silently rolls such values over to a later\n    // date, which would make the event bleed into unrelated days.  Extract the\n    // individual time fields and reject anything outside the valid range.\n    const rawTime = end.indexOf(\"T\") !== -1 ? end.slice(end.indexOf(\"T\") + 1) : \"\";\n    if (rawTime !== \"\") {\n      const timeParts = rawTime.split(\":\").map(Number);\n      const hh = timeParts[0] ?? 0;\n      const mm = timeParts[1] ?? 0;\n      // Seconds may carry a fractional component; floor to get the integer part.\n      const ss = Math.floor(timeParts[2] ?? 0);\n      const timeIsValid = hh <= 23 && mm <= 59 && ss <= 59;\n      if (!timeIsValid) {\n        log.warn(\n          `briefing: event \"${event.title}\" has out-of-range end time ${JSON.stringify(rawTime)}; treating as single-day event at ${startDate}`,\n        );\n        return startDate === target;\n      }\n    }\n\n    // Span event: include if [start, end) overlaps the target calendar day.\n    //\n    // We can't use pure YYYY-MM-DD lexicographic comparison because a\n    // same-day event (`start=2026-04-11T14:30`, `end=2026-04-11T15:00`)\n    // has `startDate === endDate === \"2026-04-11\"`, and a `target < endDate`\n    // check would wrongly exclude it. A cross-day event ending at\n    // `2026-04-12T00:00:00` (exact midnight) also needs the end day to be\n    // treated as exclusive per half-open `[start, end)` semantics.\n    //\n    // Decide whether the end day is still active on the end date by looking\n    // at the time portion: if the end time is strictly after midnight, the\n    // event is still running at the start of the end day and should include\n    // it; if the end time is exactly midnight, the event ends precisely at\n    // the boundary and the end day is excluded. Within-day spans always\n    // have a non-zero end time and so correctly include their own date.\n    //\n    // UhLg: A date-only end value (no \"T\" separator) produces an empty\n    // endTime string.  The regex above does not match empty string, so\n    // endAtExactMidnight would be false and the event would incorrectly\n    // appear on the end date.  Date-only end values carry [start, end)\n    // semantics (the end date is exclusive), so we treat them as midnight.\n    const endTime = end.slice(11); // \"HH:MM\", \"HH:MM:SS\", \"HH:MM:SS.mmm\", or \"\" (date-only)\n    // Treat any end time that is exactly midnight — or absent (date-only) — as\n    // day-exclusive per [start, end) semantics.\n    // Cases covered:\n    //   \"\"                    — date-only end (UhLg fix: exclusive like midnight)\n    //   \"00:00\"               — HH:MM form (valid floating-time ISO value, no seconds)\n    //   \"00:00:00\"            — HH:MM:SS form\n    //   \"00:00:00.000...\"     — with fractional seconds (any number of trailing zeros)\n    // A bare `>` string comparison incorrectly treats \"00:00:00.000\" as > \"00:00:00\"\n    // because the fractional suffix makes the string lexicographically longer.\n    const endIsDateOnly = endTime === \"\";\n    const endAtExactMidnight = endIsDateOnly || /^00(:00){1,2}(\\.0+)?$/.test(endTime);\n    const endActiveOnEndDay = !endAtExactMidnight;\n    if (endActiveOnEndDay) {\n      return startDate <= target && target <= endDate;\n    }\n    return startDate <= target && target < endDate;\n  }\n\n  // UTC or offset-aware ISO string: parse and normalise to UTC milliseconds,\n  // then check whether the event's [start, end) interval overlaps the target\n  // UTC day [dayStart, dayEnd).\n  const startMs = isoToMs(start);\n  if (startMs === null) {\n    log.debug(`briefing: skipping calendar event with invalid start value: ${JSON.stringify(start)}`);\n    return false;\n  }\n\n  // Boundaries of the target UTC day (half-open: [dayStart, dayEnd)).\n  const dayStart = Date.UTC(\n    Number(target.slice(0, 4)),\n    Number(target.slice(5, 7)) - 1,\n    Number(target.slice(8, 10)),\n  );\n  const dayEnd = dayStart + 86_400_000; // +24 h\n\n  const end = event.end;\n  if (!end) {\n    // Point event: included iff start falls within [dayStart, dayEnd).\n    return startMs >= dayStart && startMs < dayEnd;\n  }\n\n  const endMs = isoToMs(end);\n  if (endMs === null) {\n    // Unparseable end — fall back to point-event semantics.\n    return startMs >= dayStart && startMs < dayEnd;\n  }\n\n  // Interval event: overlaps day iff start < dayEnd AND end > dayStart.\n  // Using strict > for end so that an event ending exactly at midnight\n  // (dayEnd of previous day) is NOT counted on the next day.\n  return startMs < dayEnd && endMs > dayStart;\n}\n\nfunction cryptoRandomId(): string {\n  // Keep dependency-free: Math.random is fine for synthetic fixture IDs.\n  return `evt-${Math.random().toString(36).slice(2, 10)}`;\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// buildBriefing\n// ──────────────────────────────────────────────────────────────────────────\n\n/** Dependency-injection hook for LLM follow-up generation (used in tests). */\nexport type BriefingFollowupGenerator = (\n  prompt: {\n    sections: BriefingSections;\n    windowLabel: string;\n    maxFollowups: number;\n  },\n) => Promise<BriefingFollowup[]>;\n\n/** Options accepted by `buildBriefing`. */\nexport interface BuildBriefingOptions {\n  /** Workspace-scoped storage. Tests pass a temp dir. */\n  storage: StorageManager;\n  /** Parsed window. If omitted, a default 1-day window is used. */\n  window?: ParsedBriefingWindow;\n  /** Optional focus filter. */\n  focus?: BriefingFocus | null;\n  /** Optional namespace hint for logging. */\n  namespace?: string;\n  /** Calendar source. Section omitted entirely when undefined. */\n  calendarSource?: CalendarSource;\n  /** Maximum LLM follow-ups (0 to disable the section). */\n  maxFollowups?: number;\n  /** Whether the module is allowed to invoke the Responses API. */\n  allowLlm?: boolean;\n  /** OpenAI API key. If absent the follow-up section is gracefully omitted. */\n  openaiApiKey?: string;\n  /** OpenAI-compatible base URL (for Azure or proxied endpoints). */\n  openaiBaseUrl?: string;\n  /** Model id for the Responses call. */\n  model?: string;\n  /** Injected follow-up generator. Overrides real LLM call (tests). */\n  followupGenerator?: BriefingFollowupGenerator;\n  /** Injected \"now\" — makes tests deterministic. */\n  now?: Date;\n}\n\nconst MAX_ACTIVE_THREADS = 8;\nconst MAX_RECENT_ENTITIES = 8;\nconst MAX_OPEN_COMMITMENTS = 8;\n\n/**\n * Build the daily context briefing.\n *\n * Never throws on LLM failures — the suggested follow-ups section is simply\n * omitted and `followupsUnavailableReason` is set.\n */\nexport async function buildBriefing(options: BuildBriefingOptions): Promise<BriefingResult> {\n  const now = options.now ?? new Date();\n  const window = options.window ?? defaultWindow(now);\n  const maxFollowups = clampFollowups(options.maxFollowups);\n  const focus = options.focus ?? null;\n\n  const [allMemories, allEntities] = await Promise.all([\n    safeReadMemories(options.storage),\n    safeReadEntities(options.storage),\n  ]);\n\n  const memoriesInWindow = filterMemoriesByWindow(allMemories, window);\n  const focusedMemories = focus\n    ? memoriesInWindow.filter((m) => focusMatchesMemory(m, focus))\n    : memoriesInWindow;\n\n  const activeThreads = buildActiveThreads(focusedMemories);\n  const recentEntities = buildRecentEntities(allEntities, window, focus);\n  // TODO(#370): openCommitments only covers memories inside the lookback window.\n  // Still-open commitments (pending tag, commitment category) that pre-date the\n  // window are silently omitted. A separate query over allMemories filtered to\n  // open-status entries would surface these. Deferred to avoid scope creep here.\n  const openCommitments = buildOpenCommitments(focusedMemories);\n\n  const calendarLoadResult = options.calendarSource\n    ? await loadTodayCalendar(options.calendarSource, now)\n    : undefined;\n\n  const calendarSourceErrors: BriefingCalendarSourceError[] =\n    calendarLoadResult?.error ? [calendarLoadResult.error] : [];\n\n  const sectionsBase: BriefingSections = {\n    activeThreads,\n    recentEntities,\n    openCommitments,\n    suggestedFollowups: [],\n    todayCalendar: calendarLoadResult?.events,\n  };\n\n  let followups: BriefingFollowup[] = [];\n  let followupsUnavailableReason: string | undefined;\n\n  if (maxFollowups === 0 || options.allowLlm === false) {\n    followupsUnavailableReason = \"LLM follow-ups disabled by configuration\";\n  } else if (!options.openaiApiKey && !options.followupGenerator) {\n    followupsUnavailableReason = \"OPENAI_API_KEY not configured\";\n  } else {\n    try {\n      const generator = options.followupGenerator ?? buildOpenAiFollowupGenerator({\n        apiKey: options.openaiApiKey!,\n        model: options.model ?? BRIEFING_FOLLOWUP_DEFAULT_MODEL,\n        baseURL: options.openaiBaseUrl,\n      });\n      const generated = await generator({\n        sections: sectionsBase,\n        windowLabel: window.label,\n        maxFollowups,\n      });\n      followups = generated.slice(0, maxFollowups);\n    } catch (err) {\n      const errMsg = stringifyError(err);\n      const modelName = options.model ?? BRIEFING_FOLLOWUP_DEFAULT_MODEL;\n      // Detect \"model not found / invalid\" errors from the Responses API and\n      // produce a user-friendly message that surfaces the problematic identifier.\n      if (\n        /model/i.test(errMsg) &&\n        (/not found/i.test(errMsg) || /does not exist/i.test(errMsg) || /invalid/i.test(errMsg))\n      ) {\n        followupsUnavailableReason =\n          `configured follow-up model '${modelName}' is not available in the Responses API`;\n      } else {\n        followupsUnavailableReason = `LLM follow-ups failed: ${errMsg}`;\n      }\n      log.warn(`briefing: ${followupsUnavailableReason}`);\n    }\n  }\n\n  const sections: BriefingSections = {\n    ...sectionsBase,\n    suggestedFollowups: followups,\n  };\n\n  const windowIso = { from: window.from.toISOString(), to: window.to.toISOString() };\n  const markdown = renderBriefingMarkdown({\n    sections,\n    windowLabel: window.label,\n    focus,\n    followupsUnavailableReason,\n    generatedAt: now,\n    namespace: options.namespace,\n  });\n\n  const json: Record<string, unknown> = {\n    generatedAt: now.toISOString(),\n    window: windowIso,\n    focus,\n    namespace: options.namespace ?? null,\n    sections,\n    followupsUnavailableReason: followupsUnavailableReason ?? null,\n    calendarSourceErrors: calendarSourceErrors.length > 0 ? calendarSourceErrors : null,\n  };\n\n  const result: BriefingResult = {\n    markdown,\n    json,\n    sections,\n    followupsUnavailableReason,\n    window: windowIso,\n  };\n\n  if (calendarSourceErrors.length > 0) {\n    result.calendarSourceErrors = calendarSourceErrors;\n  }\n\n  return result;\n}\n\nfunction clampFollowups(value: number | undefined): number {\n  if (typeof value !== \"number\" || !Number.isFinite(value)) return 5;\n  return Math.max(0, Math.min(10, Math.floor(value)));\n}\n\nfunction defaultWindow(now: Date): ParsedBriefingWindow {\n  const parsed = parseBriefingWindow(\"yesterday\", now);\n  if (parsed) return parsed;\n  return { from: new Date(now.getTime() - DAY_MS), to: now, label: \"yesterday\" };\n}\n\nasync function safeReadMemories(storage: StorageManager): Promise<MemoryFile[]> {\n  try {\n    return await storage.readAllMemories();\n  } catch (err) {\n    log.warn(`briefing: readAllMemories failed: ${err}`);\n    return [];\n  }\n}\n\nasync function safeReadEntities(storage: StorageManager): Promise<EntityFile[]> {\n  try {\n    return await storage.readAllEntityFiles();\n  } catch (err) {\n    log.warn(`briefing: readAllEntityFiles failed: ${err}`);\n    return [];\n  }\n}\n\nfunction memoryTimestamp(memory: MemoryFile): number {\n  const raw = memory.frontmatter.updated || memory.frontmatter.created;\n  if (!raw) return 0;\n  const t = Date.parse(raw);\n  return Number.isFinite(t) ? t : 0;\n}\n\n/** @internal — exported for testing only. */\nexport function filterMemoriesByWindow(memories: MemoryFile[], window: ParsedBriefingWindow): MemoryFile[] {\n  const fromMs = window.from.getTime();\n  const toMs = window.to.getTime();\n  return memories.filter((m) => {\n    // Exclude explicitly retired statuses so commitments overridden within the\n    // window don't appear as open. In addition to `superseded` / `archived`\n    // (temporal retirement), also exclude `rejected` and `quarantined`, which\n    // come from governance/disposition workflows: those memories have been\n    // explicitly marked unsafe or invalid and must NOT flow into active\n    // threads, open commitments, or follow-up generation, even if they\n    // fall within the briefing window. Surfacing them would reintroduce\n    // quarantined content into downstream automation as actionable context.\n    //\n    // `pending_review` memories are awaiting human review — not invalidated —\n    // and must be included so reviewers see them in the briefing.\n    const status = m.frontmatter.status;\n    if (\n      status === \"superseded\" ||\n      status === \"archived\" ||\n      status === \"rejected\" ||\n      status === \"quarantined\"\n    ) {\n      return false;\n    }\n    const ts = memoryTimestamp(m);\n    return ts >= fromMs && ts < toMs;\n  });\n}\n\n/** @internal — exported for testing only. */\nexport function buildActiveThreads(memories: MemoryFile[]): BriefingActiveThread[] {\n  const buckets = new Map<string, BriefingActiveThread>();\n  for (const memory of memories) {\n    const threadKey = extractThreadKey(memory);\n    const updatedAt = memory.frontmatter.updated || memory.frontmatter.created || \"\";\n    const existing = buckets.get(threadKey);\n    if (!existing || updatedAt > existing.updatedAt) {\n      buckets.set(threadKey, {\n        id: threadKey,\n        title: summarizeContentTitle(memory),\n        updatedAt,\n        // Always derive reason from the newest memory so the description\n        // reflects the most-recent activity type, not the first memory seen.\n        reason: describeReason(memory),\n      });\n    }\n  }\n  return Array.from(buckets.values())\n    .sort((a, b) => {\n      if (a.updatedAt > b.updatedAt) return -1;\n      if (a.updatedAt < b.updatedAt) return 1;\n      // Tiebreaker: lexicographic order by id ensures a deterministic, stable\n      // result when multiple threads share the same updatedAt timestamp (e.g.\n      // after a batch extraction run).\n      return a.id < b.id ? -1 : a.id > b.id ? 1 : 0;\n    })\n    .slice(0, MAX_ACTIVE_THREADS);\n}\n\nfunction extractThreadKey(memory: MemoryFile): string {\n  const entityRef = memory.frontmatter.entityRef?.trim();\n  if (entityRef) return `entity:${entityRef}`;\n  const tags = memory.frontmatter.tags ?? [];\n  const topicTag = tags.find((t) => t.startsWith(\"topic:\"));\n  if (topicTag) return topicTag;\n  if (tags.length > 0) return `tag:${tags[0]}`;\n  return `memory:${memory.frontmatter.id}`;\n}\n\nfunction summarizeContentTitle(memory: MemoryFile): string {\n  const firstLine = (memory.content || \"\").split(\"\\n\").find((line) => line.trim().length > 0) ?? \"\";\n  const trimmed = firstLine.trim();\n  if (trimmed.length === 0) return memory.frontmatter.id;\n  return trimmed.length > 120 ? `${trimmed.slice(0, 117)}...` : trimmed;\n}\n\nfunction describeReason(memory: MemoryFile): string {\n  const cat = memory.frontmatter.category;\n  if (cat === \"commitment\") return \"open commitment\";\n  if (cat === \"decision\") return \"recent decision\";\n  if (cat === \"correction\") return \"recent correction\";\n  return \"recent activity\";\n}\n\n/** @internal — exported for testing only. */\nexport function buildRecentEntities(\n  entities: EntityFile[],\n  window: ParsedBriefingWindow,\n  focus: BriefingFocus | null,\n): BriefingRecentEntity[] {\n  const fromMs = window.from.getTime();\n  const scored: BriefingRecentEntity[] = [];\n  const now = window.to;\n  for (const entity of entities) {\n    if (focus && !focusMatchesEntity(entity, focus)) continue;\n    const toMs = window.to.getTime();\n    const updatedMs = entity.updated ? Date.parse(entity.updated) : 0;\n    if (!Number.isFinite(updatedMs) || updatedMs < fromMs || updatedMs >= toMs) continue;\n    const score = StorageManager.scoreEntity(entity, now);\n    scored.push({\n      name: entity.name,\n      type: entity.type,\n      updatedAt: entity.updated,\n      score: Number(score.toFixed(4)),\n      summary: entity.synthesis || entity.summary,\n    });\n  }\n  return scored\n    .sort((a, b) => {\n      const scoreDiff = b.score - a.score;\n      if (scoreDiff !== 0) return scoreDiff;\n      if (a.updatedAt > b.updatedAt) return -1;\n      if (a.updatedAt < b.updatedAt) return 1;\n      return 0;\n    })\n    .slice(0, MAX_RECENT_ENTITIES);\n}\n\nfunction buildOpenCommitments(memories: MemoryFile[]): BriefingOpenCommitment[] {\n  const commitments: BriefingOpenCommitment[] = [];\n\n  for (const memory of memories) {\n    const tags = memory.frontmatter.tags ?? [];\n    const isPending = tags.some((t) => t.toLowerCase() === \"pending\");\n    const isCommitment = memory.frontmatter.category === \"commitment\";\n    const isUnresolvedQuestion = /(?:\\?$|\\bfollow[- ]up\\b|\\btodo\\b)/i.test(memory.content);\n\n    if (isPending || isCommitment || isUnresolvedQuestion) {\n      const kind: BriefingOpenCommitment[\"kind\"] = isCommitment\n        ? \"commitment\"\n        : isUnresolvedQuestion\n          ? \"question\"\n          : \"pending_memory\";\n      commitments.push({\n        id: memory.frontmatter.id,\n        kind,\n        text: summarizeContentTitle(memory),\n        source: memory.frontmatter.source,\n        createdAt: memory.frontmatter.created,\n      });\n    }\n  }\n\n  return commitments\n    .sort((a, b) => {\n      // Missing timestamps sort last (highest comparator value).\n      if (!a.createdAt && !b.createdAt) return 0;\n      if (!a.createdAt) return 1;\n      if (!b.createdAt) return -1;\n      if (a.createdAt > b.createdAt) return -1;\n      if (a.createdAt < b.createdAt) return 1;\n      return 0;\n    })\n    .slice(0, MAX_OPEN_COMMITMENTS);\n}\n\ninterface CalendarLoadResult {\n  events: CalendarEvent[] | undefined;\n  error: BriefingCalendarSourceError | undefined;\n}\n\nasync function loadTodayCalendar(\n  source: CalendarSource,\n  now: Date,\n): Promise<CalendarLoadResult> {\n  const sourceLabel = (source as { filePath?: string }).filePath ?? \"calendar\";\n  try {\n    const dateIso = now.toISOString().slice(0, 10);\n    const events = await source.eventsForDate(dateIso);\n    // Return the events array (possibly empty for a legitimately empty calendar).\n    // An empty array is distinct from `undefined`: empty means \"source responded\n    // with no events today\"; undefined means \"source failed\".\n    return { events, error: undefined };\n  } catch (err) {\n    const message = err instanceof Error ? err.message : String(err);\n    log.warn(`briefing: calendar source error (${sourceLabel}): ${message}`);\n    // Return undefined events (not []) to signal an error so callers can\n    // distinguish \"no events today\" from \"the calendar source threw\".\n    return {\n      events: undefined,\n      error: { source: sourceLabel, error: message },\n    };\n  }\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Follow-ups (Responses API)\n// ──────────────────────────────────────────────────────────────────────────\n\nfunction buildOpenAiFollowupGenerator(cfg: {\n  apiKey: string;\n  model: string;\n  baseURL?: string;\n}): BriefingFollowupGenerator {\n  return async ({ sections, windowLabel, maxFollowups }) => {\n    // Lazy import keeps the module dependency-free when LLM path is unused.\n    const { OpenAI } = (await import(\"openai\")) as {\n      OpenAI: new (opts: { apiKey: string; baseURL?: string }) => unknown;\n    };\n    const clientOpts: { apiKey: string; baseURL?: string } = { apiKey: cfg.apiKey };\n    if (cfg.baseURL) clientOpts.baseURL = cfg.baseURL;\n    const client = new OpenAI(clientOpts) as {\n      responses: {\n        create: (args: {\n          model: string;\n          instructions: string;\n          input: string;\n          max_output_tokens?: number;\n        }) => Promise<{ output_text?: string }>;\n      };\n    };\n\n    const prompt = buildFollowupPrompt(sections, windowLabel, maxFollowups);\n    const response = await client.responses.create({\n      model: cfg.model,\n      instructions: FOLLOWUP_INSTRUCTIONS,\n      input: prompt,\n      max_output_tokens: 512,\n    });\n\n    const text = typeof response.output_text === \"string\" ? response.output_text : \"\";\n    return parseFollowupResponse(text, maxFollowups);\n  };\n}\n\nconst FOLLOWUP_INSTRUCTIONS = `You suggest short follow-up prompts for a daily context briefing.\nReturn strict JSON of the form { \"followups\": [{ \"text\": \"...\", \"rationale\": \"...\" }] }.\nRules:\n- Never invent facts absent from the input.\n- Keep each \"text\" under 140 characters.\n- Prefer concrete, action-oriented phrasing.\n- Omit duplicates. Avoid filler.`;\n\nfunction buildFollowupPrompt(\n  sections: BriefingSections,\n  windowLabel: string,\n  maxFollowups: number,\n): string {\n  const lines: string[] = [];\n  lines.push(`Window: ${windowLabel}`);\n  lines.push(`Desired follow-ups: ${maxFollowups}`);\n  lines.push(\"\");\n  lines.push(\"Active threads:\");\n  for (const t of sections.activeThreads) lines.push(`- ${t.title} (${t.reason})`);\n  lines.push(\"\");\n  lines.push(\"Recent entities:\");\n  for (const e of sections.recentEntities) lines.push(`- ${e.name} [${e.type}]`);\n  lines.push(\"\");\n  lines.push(\"Open commitments:\");\n  for (const c of sections.openCommitments) lines.push(`- [${c.kind}] ${c.text}`);\n  return lines.join(\"\\n\");\n}\n\nfunction parseFollowupResponse(raw: string, max: number): BriefingFollowup[] {\n  // JSON.parse throws on invalid JSON — let the caller catch it so the outer\n  // try/catch in buildBriefing can set followupsUnavailableReason rather than\n  // silently returning an empty array that masks the parse failure.\n  const parsed = JSON.parse(raw) as unknown;\n  if (!parsed || typeof parsed !== \"object\") {\n    throw new Error(`LLM returned non-object JSON: ${typeof parsed}`);\n  }\n  const arr = (parsed as { followups?: unknown }).followups;\n  if (!Array.isArray(arr)) {\n    throw new Error(`LLM response missing \"followups\" array`);\n  }\n  const out: BriefingFollowup[] = [];\n  for (const entry of arr) {\n    if (!entry || typeof entry !== \"object\") continue;\n    const text = (entry as Record<string, unknown>).text;\n    if (typeof text !== \"string\" || text.trim().length === 0) continue;\n    const rationale = (entry as Record<string, unknown>).rationale;\n    out.push({\n      text: text.trim(),\n      rationale: typeof rationale === \"string\" ? rationale.trim() : undefined,\n    });\n    if (out.length >= max) break;\n  }\n  return out;\n}\n\nfunction stringifyError(err: unknown): string {\n  if (err instanceof Error) return err.message;\n  return String(err);\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Markdown rendering\n// ──────────────────────────────────────────────────────────────────────────\n\ninterface RenderContext {\n  sections: BriefingSections;\n  windowLabel: string;\n  focus: BriefingFocus | null;\n  followupsUnavailableReason?: string;\n  generatedAt: Date;\n  namespace?: string;\n}\n\nexport function renderBriefingMarkdown(ctx: RenderContext): string {\n  const lines: string[] = [];\n  lines.push(`# Daily Context Briefing`);\n  lines.push(\"\");\n  lines.push(`_Generated ${ctx.generatedAt.toISOString()} (window: ${ctx.windowLabel})_`);\n  if (ctx.focus) {\n    lines.push(`_Focus: ${ctx.focus.type}:${ctx.focus.value}_`);\n  }\n  if (ctx.namespace) {\n    lines.push(`_Namespace: ${ctx.namespace}_`);\n  }\n  lines.push(\"\");\n\n  lines.push(`## Active threads`);\n  if (ctx.sections.activeThreads.length === 0) {\n    lines.push(`_No active threads in window._`);\n  } else {\n    for (const t of ctx.sections.activeThreads) {\n      lines.push(`- **${t.title}** — ${t.reason} (updated ${t.updatedAt})`);\n    }\n  }\n  lines.push(\"\");\n\n  lines.push(`## Recent entities`);\n  if (ctx.sections.recentEntities.length === 0) {\n    lines.push(`_No entities updated in window._`);\n  } else {\n    for (const e of ctx.sections.recentEntities) {\n      const summary = e.summary ? ` — ${e.summary}` : \"\";\n      lines.push(`- **${e.name}** (${e.type}, score ${e.score})${summary}`);\n    }\n  }\n  lines.push(\"\");\n\n  lines.push(`## Open commitments`);\n  if (ctx.sections.openCommitments.length === 0) {\n    lines.push(`_No open commitments detected._`);\n  } else {\n    for (const c of ctx.sections.openCommitments) {\n      lines.push(`- [${c.kind}] ${c.text}`);\n    }\n  }\n  lines.push(\"\");\n\n  lines.push(`## Suggested follow-ups`);\n  if (ctx.followupsUnavailableReason) {\n    lines.push(`_Unavailable: ${ctx.followupsUnavailableReason}_`);\n  } else if (ctx.sections.suggestedFollowups.length === 0) {\n    lines.push(`_No follow-ups suggested._`);\n  } else {\n    for (const f of ctx.sections.suggestedFollowups) {\n      const rationale = f.rationale ? ` _(${f.rationale})_` : \"\";\n      lines.push(`- ${f.text}${rationale}`);\n    }\n  }\n  lines.push(\"\");\n\n  if (ctx.sections.todayCalendar !== undefined) {\n    lines.push(`## Today's calendar`);\n    if (ctx.sections.todayCalendar.length === 0) {\n      lines.push(`_No events on the calendar today._`);\n    } else {\n      for (const ev of ctx.sections.todayCalendar) {\n        const end = ev.end ? ` → ${ev.end}` : \"\";\n        const loc = ev.location ? ` @ ${ev.location}` : \"\";\n        lines.push(`- **${ev.title}** (${ev.start}${end})${loc}`);\n      }\n    }\n    lines.push(\"\");\n  }\n\n  return lines.join(\"\\n\").trimEnd() + \"\\n\";\n}\n\n// ──────────────────────────────────────────────────────────────────────────\n// Save helpers\n// ──────────────────────────────────────────────────────────────────────────\n\n/**\n * Resolve the directory where `--save` writes dated briefings.\n * Respects the following precedence:\n *   1. explicit `configOverride` argument\n *   2. `$REMNIC_HOME/briefings/`\n *   3. `$HOME/.remnic/briefings/`\n */\nexport function resolveBriefingSaveDir(\n  configOverride: string | null | undefined,\n  env: NodeJS.ProcessEnv = process.env,\n): string {\n  if (typeof configOverride === \"string\" && configOverride.trim().length > 0) {\n    return path.resolve(configOverride.trim());\n  }\n  const remnicHome = env.REMNIC_HOME?.trim();\n  if (remnicHome && remnicHome.length > 0) {\n    return path.join(remnicHome, \"briefings\");\n  }\n  const home = env.HOME ?? env.USERPROFILE ?? \".\";\n  return path.join(home, \".remnic\", \"briefings\");\n}\n\n/** Format the dated filename for a given briefing. */\nexport function briefingFilename(date: Date, format: \"markdown\" | \"json\" = \"markdown\"): string {\n  const day = date.toISOString().slice(0, 10);\n  return format === \"json\" ? `${day}.json` : `${day}.md`;\n}\n"],"mappings":";;;;;;;;AAiBA,SAAS,gBAAgB;AACzB,OAAO,UAAU;AAuBV,IAAM,0BAA0B,CAAC,YAAY,MAAM;AAMnD,IAAM,kCAAkC;AASxC,SAAS,uBAAuB,OAA0C;AAC/E,MAAI,UAAU,OAAW,QAAO;AAChC,MAAK,wBAA8C,SAAS,KAAK,EAAG,QAAO;AAC3E,SAAO,4BAA4B,KAAK,gBAAgB,wBAAwB,KAAK,IAAI,CAAC;AAC5F;AAYA,IAAM,SAAS,KAAK,KAAK,KAAK;AAO9B,IAAM,gBAAgB,MAAM,MAAM;AAc3B,SAAS,oBACd,OACA,MAAY,oBAAI,KAAK,GACQ;AAC7B,QAAM,MAAM,OAAO,UAAU,WAAW,MAAM,KAAK,EAAE,YAAY,IAAI;AACrE,MAAI,IAAI,WAAW,EAAG,QAAO;AAE7B,MAAI,QAAQ,aAAa;AACvB,UAAM,eAAe,cAAc,GAAG;AACtC,UAAMA,QAAO,IAAI,KAAK,aAAa,QAAQ,IAAI,MAAM;AACrD,WAAO,EAAE,MAAAA,OAAM,IAAI,cAAc,OAAO,YAAY;AAAA,EACtD;AAEA,MAAI,QAAQ,SAAS;AACnB,WAAO,EAAE,MAAM,cAAc,GAAG,GAAG,IAAI,KAAK,OAAO,QAAQ;AAAA,EAC7D;AAEA,QAAM,QAAQ,IAAI,MAAM,mBAAmB;AAC3C,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,QAAQ,SAAS,MAAM,CAAC,GAAG,EAAE;AACnC,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,SAAS,EAAG,QAAO;AAClD,QAAM,OAAO,MAAM,CAAC;AACpB,MAAI,KAAK;AACT,MAAI,SAAS,IAAK,MAAK,QAAQ,KAAK,KAAK;AAAA,WAChC,SAAS,IAAK,MAAK,QAAQ;AAAA,WAC3B,SAAS,IAAK,MAAK,QAAQ,IAAI;AACxC,MAAI,OAAO,EAAG,QAAO;AAErB,MAAI,KAAK,iBAAiB,CAAC,OAAO,SAAS,EAAE,EAAG,QAAO;AACvD,QAAM,OAAO,IAAI,KAAK,IAAI,QAAQ,IAAI,EAAE;AACxC,MAAI,CAAC,OAAO,SAAS,KAAK,QAAQ,CAAC,EAAG,QAAO;AAC7C,SAAO;AAAA,IACL;AAAA,IACA,IAAI;AAAA,IACJ,OAAO,QAAQ,KAAK,GAAG,IAAI;AAAA,EAC7B;AACF;AAEA,SAAS,cAAc,MAAkB;AACvC,QAAM,IAAI,IAAI,KAAK,KAAK,QAAQ,CAAC;AACjC,IAAE,YAAY,GAAG,GAAG,GAAG,CAAC;AACxB,SAAO;AACT;AAgBO,SAAS,mBAAmB,OAAiD;AAClF,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAM,UAAU,MAAM,KAAK;AAC3B,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,QAAM,CAAC,WAAW,GAAG,IAAI,IAAI,QAAQ,MAAM,GAAG;AAC9C,MAAI,KAAK,WAAW,GAAG;AACrB,WAAO,EAAE,MAAM,SAAS,OAAO,UAAU;AAAA,EAC3C;AACA,QAAM,UAAU,UAAU,YAAY;AACtC,MAAI,YAAY,YAAY,YAAY,aAAa,YAAY,SAAS;AACxE,UAAM,QAAQ,KAAK,KAAK,GAAG,EAAE,KAAK;AAClC,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,WAAO,EAAE,MAAM,SAAS,MAAM;AAAA,EAChC;AACA,SAAO,EAAE,MAAM,SAAS,OAAO,QAAQ;AACzC;AAUA,SAAS,qBAAqB,OAA8B;AAC1D,QAAM,eAAe,MAAM,MACxB,YAAY,EACZ,QAAQ,eAAe,GAAG,EAC1B,QAAQ,OAAO,GAAG,EAClB,QAAQ,UAAU,EAAE;AACvB,SAAO,GAAG,MAAM,IAAI,IAAI,YAAY;AACtC;AAYO,SAAS,mBAAmB,QAAoB,OAA+B;AACpF,QAAM,SAAS,MAAM,MAAM,YAAY;AACvC,QAAM,aAAa,OAAO,YAAY,aAAa,IAAI,YAAY;AAGnE,QAAM,cAAc;AAAA,IAClB,OAAO;AAAA,IACP;AAAA,IACA,GAAI,OAAO,YAAY,QAAQ,CAAC;AAAA,EAClC,EACG,KAAK,GAAG,EACR,YAAY;AACf,MAAI,YAAY,SAAS,MAAM,EAAG,QAAO;AAKzC,QAAM,OAAO,qBAAqB,KAAK;AACvC,SAAO,UAAU,SAAS,IAAI;AAChC;AAEO,SAAS,mBAAmB,QAAoB,OAA+B;AACpF,QAAM,SAAS,MAAM,MAAM,YAAY;AACvC,MAAI,MAAM,SAAS,YAAY,OAAO,KAAK,YAAY,MAAM,SAAU,QAAO;AAC9E,MAAI,MAAM,SAAS,aAAa,OAAO,KAAK,YAAY,MAAM,UAAW,QAAO;AAChF,QAAM,WAAW;AAAA,IACf,OAAO;AAAA,IACP,OAAO,aAAa,OAAO,WAAW;AAAA,IACtC,GAAG,OAAO;AAAA,IACV,GAAI,OAAO,WAAW,CAAC;AAAA,IACvB,IAAI,OAAO,sBAAsB,CAAC,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,OAAO,GAAG,QAAQ,KAAK,CAAC;AAAA,EAC7F,EACG,KAAK,GAAG,EACR,YAAY;AACf,SAAO,SAAS,SAAS,MAAM;AACjC;AAgBO,IAAM,qBAAN,MAAmD;AAAA,EACxD,YAA6B,UAAkB;AAAlB;AAAA,EAAmB;AAAA,EAAnB;AAAA,EAE7B,MAAM,cAAc,SAA2C;AAC7D,QAAI;AACJ,QAAI;AACF,YAAM,MAAM,SAAS,KAAK,UAAU,OAAO;AAAA,IAC7C,SAAS,KAAK;AACZ,UAAI,KAAK,2CAA2C,KAAK,QAAQ,KAAK,GAAG,EAAE;AAC3E,aAAO,CAAC;AAAA,IACV;AAEA,UAAM,SAAS,KAAK,SAAS,YAAY,EAAE,SAAS,MAAM,IACtD,eAAe,GAAG,IAClB,gBAAgB,GAAG;AAEvB,WAAO,OAAO,OAAO,CAAC,UAAU,iBAAiB,OAAO,OAAO,CAAC;AAAA,EAClE;AACF;AAEA,SAAS,gBAAgB,KAA8B;AACrD,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,UAAM,MAAM,MAAM,QAAQ,MAAM,IAC5B,SACA,UAAU,OAAO,WAAW,YAAY,MAAM,QAAS,OAAgC,MAAM,IACzF,OAAiC,SACnC,CAAC;AACP,UAAM,SAA0B,CAAC;AACjC,eAAW,SAAS,KAAK;AACvB,UAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,YAAM,IAAI;AACV,YAAM,KAAK,OAAO,EAAE,OAAO,WAAW,EAAE,KAAK,OAAO,EAAE,QAAQ,WAAW,EAAE,MAAM,eAAe;AAChG,YAAM,QAAQ,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ,OAAO,EAAE,YAAY,WAAW,EAAE,UAAU;AAClG,YAAM,QAAQ,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ,OAAO,EAAE,YAAY,WAAW,EAAE,UAAU;AAClG,UAAI,CAAC,SAAS,CAAC,MAAO;AACtB,aAAO,KAAK;AAAA,QACV;AAAA,QACA;AAAA,QACA;AAAA,QACA,KAAK,OAAO,EAAE,QAAQ,WAAW,EAAE,MAAM,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ;AAAA,QACjF,UAAU,OAAO,EAAE,aAAa,WAAW,EAAE,WAAW;AAAA,QACxD,OAAO,OAAO,EAAE,UAAU,WAAW,EAAE,QAAQ,OAAO,EAAE,gBAAgB,WAAW,EAAE,cAAc;AAAA,MACrG,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT,SAAS,KAAK;AACZ,QAAI,KAAK,yCAAyC,GAAG,EAAE;AACvD,WAAO,CAAC;AAAA,EACV;AACF;AAgBA,SAAS,aAAa,MAAoC;AAIxD,QAAM,WAAW,KAAK,QAAQ,GAAG;AACjC,MAAI,YAAY,EAAG,QAAO;AAC1B,QAAM,OAAO,KAAK,MAAM,GAAG,QAAQ;AACnC,QAAM,QAAQ,KAAK,MAAM,WAAW,CAAC,EAAE,KAAK;AAE5C,QAAM,YAAY,KAAK,MAAM,GAAG;AAChC,QAAM,WAAW,UAAU,CAAC,EAAG,YAAY;AAC3C,MAAI,CAAC,eAAe,KAAK,QAAQ,EAAG,QAAO;AAC3C,QAAM,SAAiC,CAAC;AACxC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAM,UAAU,UAAU,CAAC;AAC3B,UAAM,QAAQ,QAAQ,QAAQ,GAAG;AACjC,QAAI,SAAS,EAAG;AAChB,UAAM,OAAO,QAAQ,MAAM,GAAG,KAAK,EAAE,YAAY;AACjD,QAAI,MAAM,QAAQ,MAAM,QAAQ,CAAC;AAEjC,QAAI,IAAI,WAAW,GAAG,KAAK,IAAI,SAAS,GAAG,KAAK,IAAI,UAAU,GAAG;AAC/D,YAAM,IAAI,MAAM,GAAG,EAAE;AAAA,IACvB;AACA,WAAO,IAAI,IAAI;AAAA,EACjB;AACA,SAAO,EAAE,UAAU,QAAQ,MAAM;AACnC;AAQO,SAAS,eAAe,KAA8B;AAC3D,QAAM,SAA0B,CAAC;AAKjC,QAAM,aAAa,IAAI,QAAQ,SAAS,IAAI,EAAE,QAAQ,YAAY,EAAE;AACpE,QAAM,SAAS,WAAW,MAAM,eAAe,EAAE,MAAM,CAAC;AACxD,aAAW,SAAS,QAAQ;AAC1B,UAAM,SAAS,MAAM,OAAO,aAAa;AACzC,UAAM,OAAO,WAAW,KAAK,QAAQ,MAAM,MAAM,GAAG,MAAM;AAC1D,UAAM,eAAuC,CAAC;AAC9C,UAAM,aAA2C,CAAC;AAClD,eAAW,QAAQ,KAAK,MAAM,IAAI,GAAG;AACnC,YAAM,SAAS,aAAa,IAAI;AAChC,UAAI,CAAC,OAAQ;AACb,YAAM,EAAE,UAAU,QAAQ,MAAM,IAAI;AACpC,UAAI,aAAa,aAAa,aAAa,SAAS;AAClD,YAAI,WAAW,QAAQ,MAAM,QAAW;AACtC,qBAAW,QAAQ,IAAI,EAAE,KAAK,OAAO,OAAO;AAAA,QAC9C;AAAA,MACF,WAAW,aAAa,QAAQ,MAAM,QAAW;AAC/C,qBAAa,QAAQ,IAAI;AAAA,MAC3B;AAAA,IACF;AACA,UAAM,QAAQ,aAAa;AAC3B,UAAM,UAAU,WAAW;AAC3B,QAAI,CAAC,SAAS,CAAC,QAAS;AACxB,UAAM,QAAQ,WAAW;AACzB,WAAO,KAAK;AAAA,MACV,IAAI,aAAa,OAAO,eAAe;AAAA,MACvC;AAAA,MACA,OAAO,iBAAiB,QAAQ,KAAK,QAAQ,MAAM;AAAA,MACnD,KAAK,QAAQ,iBAAiB,MAAM,KAAK,MAAM,MAAM,IAAI;AAAA,MACzD,UAAU,aAAa;AAAA,MACvB,OAAO,aAAa;AAAA,IACtB,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAeA,SAAS,iBAAiB,OAAe,SAAiC,CAAC,GAAW;AAEpF,MAAI,iBAAiB,KAAK,KAAK,GAAG;AAChC,UAAM,IAAI,MAAM,MAAM,GAAG,CAAC;AAC1B,UAAM,IAAI,MAAM,MAAM,GAAG,CAAC;AAC1B,UAAM,IAAI,MAAM,MAAM,GAAG,CAAC;AAC1B,UAAM,KAAK,MAAM,MAAM,GAAG,EAAE;AAC5B,UAAM,KAAK,MAAM,MAAM,IAAI,EAAE;AAC7B,UAAM,KAAK,MAAM,MAAM,IAAI,EAAE;AAC7B,WAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AAAA,EACzC;AAEA,MAAI,gBAAgB,KAAK,KAAK,GAAG;AAC/B,UAAM,IAAI,MAAM,MAAM,GAAG,CAAC;AAC1B,UAAM,IAAI,MAAM,MAAM,GAAG,CAAC;AAC1B,UAAM,IAAI,MAAM,MAAM,GAAG,CAAC;AAC1B,UAAM,KAAK,MAAM,MAAM,GAAG,EAAE;AAC5B,UAAM,KAAK,MAAM,MAAM,IAAI,EAAE;AAC7B,UAAM,KAAK,MAAM,MAAM,IAAI,EAAE;AAC7B,UAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AAC9C,UAAM,OAAO,OAAO;AACpB,QAAI,MAAM;AACR,YAAM,SAAS,kBAAkB,OAAO,IAAI;AAC5C,UAAI,OAAQ,QAAO;AACnB,UAAI;AAAA,QACF,+BAA+B,IAAI,gCAA2B,KAAK;AAAA,MACrE;AACA,aAAO,GAAG,KAAK;AAAA,IACjB;AAEA,WAAO;AAAA,EACT;AAEA,MAAI,UAAU,KAAK,KAAK,GAAG;AACzB,WAAO,GAAG,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,MAAM,MAAM,GAAG,CAAC,CAAC;AAAA,EACvE;AACA,SAAO;AACT;AAWA,SAAS,kBAAkB,OAAe,MAA6B;AACrE,QAAM,QAAQ,MAAM,MAAM,mDAAmD;AAC7E,MAAI,CAAC,MAAO,QAAO;AACnB,QAAM,CAAC,EAAE,GAAG,IAAI,GAAG,IAAI,IAAI,EAAE,IAAI;AAEjC,QAAM,aAAa,KAAK;AAAA,IACtB,OAAO,CAAC;AAAA,IACR,OAAO,EAAE,IAAI;AAAA,IACb,OAAO,CAAC;AAAA,IACR,OAAO,EAAE;AAAA,IACT,OAAO,EAAE;AAAA,IACT,OAAO,EAAE;AAAA,EACX;AACA,MAAI,CAAC,OAAO,SAAS,UAAU,EAAG,QAAO;AAEzC,MAAI;AACJ,MAAI;AACF,gBAAY,IAAI,KAAK,eAAe,SAAS;AAAA,MAC3C,UAAU;AAAA,MACV,MAAM;AAAA,MACN,OAAO;AAAA,MACP,KAAK;AAAA,MACL,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,QAAQ;AAAA,IACV,CAAC;AAAA,EACH,QAAQ;AACN,WAAO;AAAA,EACT;AAEA,QAAM,UAAU,gBAAgB,WAAW,IAAI,KAAK,UAAU,CAAC;AAC/D,MAAI,YAAY,KAAM,QAAO;AAE7B,QAAM,WAAW,aAAa;AAE9B,QAAM,YAAY,aAAa;AAE/B,QAAM,WAAW,gBAAgB,WAAW,IAAI,KAAK,SAAS,CAAC;AAC/D,MAAI,aAAa,MAAM;AACrB,UAAM,YAAY,YAAY;AAC9B,QAAI,cAAc,UAAU;AAC1B,aAAO,IAAI,KAAK,aAAa,SAAS,EAAE,YAAY;AAAA,IACtD;AAAA,EACF;AACA,SAAO,IAAI,KAAK,SAAS,EAAE,YAAY;AACzC;AAOA,SAAS,gBAAgB,WAAgC,MAA2B;AAClF,QAAM,QAAQ,UAAU,cAAc,IAAI;AAC1C,QAAM,MAAM,CAAC,SACX,MAAM,KAAK,CAAC,MAAM,EAAE,SAAS,IAAI,GAAG;AACtC,QAAM,IAAI,IAAI,MAAM;AACpB,QAAM,KAAK,IAAI,OAAO;AACtB,QAAM,IAAI,IAAI,KAAK;AACnB,QAAM,KAAK,IAAI,MAAM;AACrB,QAAM,KAAK,IAAI,QAAQ;AACvB,QAAM,KAAK,IAAI,QAAQ;AACvB,MAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAI,QAAO;AAOjD,QAAM,iBAAiB,OAAO,EAAE,MAAM,KAAK,IAAI,OAAO,EAAE;AACxD,QAAM,KAAK,KAAK,IAAI,OAAO,CAAC,GAAG,OAAO,EAAE,IAAI,GAAG,OAAO,CAAC,GAAG,gBAAgB,OAAO,EAAE,GAAG,OAAO,EAAE,CAAC;AAChG,SAAO,OAAO,SAAS,EAAE,IAAI,KAAK;AACpC;AAOA,SAAS,eAAe,QAAyB;AAC/C,SAAO,wBAAwB,KAAK,MAAM;AAC5C;AAWA,SAAS,QAAQ,QAA+B;AAC9C,MAAI,CAAC,OAAQ,QAAO;AACpB,MAAI,MAAM;AACV,MAAI,CAAC,eAAe,GAAG,GAAG;AAExB,UAAM,MAAM;AAAA,EACd;AACA,QAAM,KAAK,IAAI,KAAK,GAAG,EAAE,QAAQ;AACjC,SAAO,OAAO,SAAS,EAAE,IAAI,KAAK;AACpC;AAGO,SAAS,iBAAiB,OAAsB,SAA0B;AAC/E,QAAM,SAAS,QAAQ,MAAM,GAAG,EAAE;AAClC,QAAM,QAAQ,MAAM;AAOpB,QAAM,kBAAkB,CAAC,eAAe,KAAK;AAE7C,MAAI,iBAAiB;AAWnB,UAAM,eACJ,OAAO,UAAU,YACjB,sDAAsD,KAAK,KAAK;AAClE,QAAI,CAAC,cAAc;AACjB,UAAI,MAAM,+DAA+D,KAAK,UAAU,KAAK,CAAC,EAAE;AAChG,aAAO;AAAA,IACT;AACA,UAAM,eAAe,MAAM,MAAM,GAAG,EAAE;AACtC,UAAM,iBAAiB,oBAAI,KAAK,eAAe,YAAY;AAC3D,QACE,OAAO,MAAM,eAAe,QAAQ,CAAC,KACrC,eAAe,YAAY,EAAE,MAAM,GAAG,EAAE,MAAM,cAC9C;AACA,UAAI;AAAA,QACF,sCAAsC,MAAM,KAAK,gCAAgC,KAAK,UAAU,YAAY,CAAC;AAAA,MAC/G;AACA,aAAO;AAAA,IACT;AACA,UAAM,eAAe,MAAM,QAAQ,GAAG,MAAM,KAAK,MAAM,MAAM,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI;AACvF,QAAI,iBAAiB,IAAI;AACvB,YAAM,iBAAiB,aAAa,MAAM,GAAG,EAAE,IAAI,MAAM;AACzD,YAAM,MAAM,eAAe,CAAC,KAAK;AACjC,YAAM,MAAM,eAAe,CAAC,KAAK;AACjC,YAAM,MAAM,KAAK,MAAM,eAAe,CAAC,KAAK,CAAC;AAC7C,UAAI,MAAM,MAAM,MAAM,MAAM,MAAM,IAAI;AACpC,YAAI;AAAA,UACF,sCAAsC,MAAM,KAAK,kCAAkC,KAAK,UAAU,YAAY,CAAC;AAAA,QACjH;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAEA,UAAM,YAAY;AAClB,UAAMC,OAAM,MAAM;AAGlB,QAAI,CAACA,KAAK,QAAO,cAAc;AAO/B,UAAM,aACJ,OAAOA,SAAQ,YACf,sDAAsD,KAAKA,IAAG;AAChE,QAAI,CAAC,YAAY;AACf,UAAI;AAAA,QACF,oBAAoB,MAAM,KAAK,iCAAiC,KAAK,UAAUA,IAAG,CAAC,qCAAqC,SAAS;AAAA,MACnI;AAEA,aAAO,cAAc;AAAA,IACvB;AAQA,UAAM,UAAUA,KAAI,MAAM,GAAG,EAAE;AAC/B,UAAM,eAAe,oBAAI,KAAK,UAAU,YAAY;AACpD,QACE,OAAO,MAAM,aAAa,QAAQ,CAAC,KACnC,aAAa,YAAY,EAAE,MAAM,GAAG,EAAE,MAAM,SAC5C;AACA,UAAI;AAAA,QACF,oBAAoB,MAAM,KAAK,6BAA6B,KAAK,UAAU,OAAO,CAAC,qCAAqC,SAAS;AAAA,MACnI;AACA,aAAO,cAAc;AAAA,IACvB;AASA,UAAM,UAAUA,KAAI,QAAQ,GAAG,MAAM,KAAKA,KAAI,MAAMA,KAAI,QAAQ,GAAG,IAAI,CAAC,IAAI;AAC5E,QAAI,YAAY,IAAI;AAClB,YAAM,YAAY,QAAQ,MAAM,GAAG,EAAE,IAAI,MAAM;AAC/C,YAAM,KAAK,UAAU,CAAC,KAAK;AAC3B,YAAM,KAAK,UAAU,CAAC,KAAK;AAE3B,YAAM,KAAK,KAAK,MAAM,UAAU,CAAC,KAAK,CAAC;AACvC,YAAM,cAAc,MAAM,MAAM,MAAM,MAAM,MAAM;AAClD,UAAI,CAAC,aAAa;AAChB,YAAI;AAAA,UACF,oBAAoB,MAAM,KAAK,+BAA+B,KAAK,UAAU,OAAO,CAAC,qCAAqC,SAAS;AAAA,QACrI;AACA,eAAO,cAAc;AAAA,MACvB;AAAA,IACF;AAuBA,UAAM,UAAUA,KAAI,MAAM,EAAE;AAU5B,UAAM,gBAAgB,YAAY;AAClC,UAAM,qBAAqB,iBAAiB,wBAAwB,KAAK,OAAO;AAChF,UAAM,oBAAoB,CAAC;AAC3B,QAAI,mBAAmB;AACrB,aAAO,aAAa,UAAU,UAAU;AAAA,IAC1C;AACA,WAAO,aAAa,UAAU,SAAS;AAAA,EACzC;AAKA,QAAM,UAAU,QAAQ,KAAK;AAC7B,MAAI,YAAY,MAAM;AACpB,QAAI,MAAM,+DAA+D,KAAK,UAAU,KAAK,CAAC,EAAE;AAChG,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,KAAK;AAAA,IACpB,OAAO,OAAO,MAAM,GAAG,CAAC,CAAC;AAAA,IACzB,OAAO,OAAO,MAAM,GAAG,CAAC,CAAC,IAAI;AAAA,IAC7B,OAAO,OAAO,MAAM,GAAG,EAAE,CAAC;AAAA,EAC5B;AACA,QAAM,SAAS,WAAW;AAE1B,QAAM,MAAM,MAAM;AAClB,MAAI,CAAC,KAAK;AAER,WAAO,WAAW,YAAY,UAAU;AAAA,EAC1C;AAEA,QAAM,QAAQ,QAAQ,GAAG;AACzB,MAAI,UAAU,MAAM;AAElB,WAAO,WAAW,YAAY,UAAU;AAAA,EAC1C;AAKA,SAAO,UAAU,UAAU,QAAQ;AACrC;AAEA,SAAS,iBAAyB;AAEhC,SAAO,OAAO,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AACvD;AA2CA,IAAM,qBAAqB;AAC3B,IAAM,sBAAsB;AAC5B,IAAM,uBAAuB;AAQ7B,eAAsB,cAAc,SAAwD;AAC1F,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AACpC,QAAM,SAAS,QAAQ,UAAU,cAAc,GAAG;AAClD,QAAM,eAAe,eAAe,QAAQ,YAAY;AACxD,QAAM,QAAQ,QAAQ,SAAS;AAE/B,QAAM,CAAC,aAAa,WAAW,IAAI,MAAM,QAAQ,IAAI;AAAA,IACnD,iBAAiB,QAAQ,OAAO;AAAA,IAChC,iBAAiB,QAAQ,OAAO;AAAA,EAClC,CAAC;AAED,QAAM,mBAAmB,uBAAuB,aAAa,MAAM;AACnE,QAAM,kBAAkB,QACpB,iBAAiB,OAAO,CAAC,MAAM,mBAAmB,GAAG,KAAK,CAAC,IAC3D;AAEJ,QAAM,gBAAgB,mBAAmB,eAAe;AACxD,QAAM,iBAAiB,oBAAoB,aAAa,QAAQ,KAAK;AAKrE,QAAM,kBAAkB,qBAAqB,eAAe;AAE5D,QAAM,qBAAqB,QAAQ,iBAC/B,MAAM,kBAAkB,QAAQ,gBAAgB,GAAG,IACnD;AAEJ,QAAM,uBACJ,oBAAoB,QAAQ,CAAC,mBAAmB,KAAK,IAAI,CAAC;AAE5D,QAAM,eAAiC;AAAA,IACrC;AAAA,IACA;AAAA,IACA;AAAA,IACA,oBAAoB,CAAC;AAAA,IACrB,eAAe,oBAAoB;AAAA,EACrC;AAEA,MAAI,YAAgC,CAAC;AACrC,MAAI;AAEJ,MAAI,iBAAiB,KAAK,QAAQ,aAAa,OAAO;AACpD,iCAA6B;AAAA,EAC/B,WAAW,CAAC,QAAQ,gBAAgB,CAAC,QAAQ,mBAAmB;AAC9D,iCAA6B;AAAA,EAC/B,OAAO;AACL,QAAI;AACF,YAAM,YAAY,QAAQ,qBAAqB,6BAA6B;AAAA,QAC1E,QAAQ,QAAQ;AAAA,QAChB,OAAO,QAAQ,SAAS;AAAA,QACxB,SAAS,QAAQ;AAAA,MACnB,CAAC;AACD,YAAM,YAAY,MAAM,UAAU;AAAA,QAChC,UAAU;AAAA,QACV,aAAa,OAAO;AAAA,QACpB;AAAA,MACF,CAAC;AACD,kBAAY,UAAU,MAAM,GAAG,YAAY;AAAA,IAC7C,SAAS,KAAK;AACZ,YAAM,SAAS,eAAe,GAAG;AACjC,YAAM,YAAY,QAAQ,SAAS;AAGnC,UACE,SAAS,KAAK,MAAM,MACnB,aAAa,KAAK,MAAM,KAAK,kBAAkB,KAAK,MAAM,KAAK,WAAW,KAAK,MAAM,IACtF;AACA,qCACE,+BAA+B,SAAS;AAAA,MAC5C,OAAO;AACL,qCAA6B,0BAA0B,MAAM;AAAA,MAC/D;AACA,UAAI,KAAK,aAAa,0BAA0B,EAAE;AAAA,IACpD;AAAA,EACF;AAEA,QAAM,WAA6B;AAAA,IACjC,GAAG;AAAA,IACH,oBAAoB;AAAA,EACtB;AAEA,QAAM,YAAY,EAAE,MAAM,OAAO,KAAK,YAAY,GAAG,IAAI,OAAO,GAAG,YAAY,EAAE;AACjF,QAAM,WAAW,uBAAuB;AAAA,IACtC;AAAA,IACA,aAAa,OAAO;AAAA,IACpB;AAAA,IACA;AAAA,IACA,aAAa;AAAA,IACb,WAAW,QAAQ;AAAA,EACrB,CAAC;AAED,QAAM,OAAgC;AAAA,IACpC,aAAa,IAAI,YAAY;AAAA,IAC7B,QAAQ;AAAA,IACR;AAAA,IACA,WAAW,QAAQ,aAAa;AAAA,IAChC;AAAA,IACA,4BAA4B,8BAA8B;AAAA,IAC1D,sBAAsB,qBAAqB,SAAS,IAAI,uBAAuB;AAAA,EACjF;AAEA,QAAM,SAAyB;AAAA,IAC7B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,QAAQ;AAAA,EACV;AAEA,MAAI,qBAAqB,SAAS,GAAG;AACnC,WAAO,uBAAuB;AAAA,EAChC;AAEA,SAAO;AACT;AAEA,SAAS,eAAe,OAAmC;AACzD,MAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,EAAG,QAAO;AACjE,SAAO,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,CAAC,CAAC;AACpD;AAEA,SAAS,cAAc,KAAiC;AACtD,QAAM,SAAS,oBAAoB,aAAa,GAAG;AACnD,MAAI,OAAQ,QAAO;AACnB,SAAO,EAAE,MAAM,IAAI,KAAK,IAAI,QAAQ,IAAI,MAAM,GAAG,IAAI,KAAK,OAAO,YAAY;AAC/E;AAEA,eAAe,iBAAiB,SAAgD;AAC9E,MAAI;AACF,WAAO,MAAM,QAAQ,gBAAgB;AAAA,EACvC,SAAS,KAAK;AACZ,QAAI,KAAK,qCAAqC,GAAG,EAAE;AACnD,WAAO,CAAC;AAAA,EACV;AACF;AAEA,eAAe,iBAAiB,SAAgD;AAC9E,MAAI;AACF,WAAO,MAAM,QAAQ,mBAAmB;AAAA,EAC1C,SAAS,KAAK;AACZ,QAAI,KAAK,wCAAwC,GAAG,EAAE;AACtD,WAAO,CAAC;AAAA,EACV;AACF;AAEA,SAAS,gBAAgB,QAA4B;AACnD,QAAM,MAAM,OAAO,YAAY,WAAW,OAAO,YAAY;AAC7D,MAAI,CAAC,IAAK,QAAO;AACjB,QAAM,IAAI,KAAK,MAAM,GAAG;AACxB,SAAO,OAAO,SAAS,CAAC,IAAI,IAAI;AAClC;AAGO,SAAS,uBAAuB,UAAwB,QAA4C;AACzG,QAAM,SAAS,OAAO,KAAK,QAAQ;AACnC,QAAM,OAAO,OAAO,GAAG,QAAQ;AAC/B,SAAO,SAAS,OAAO,CAAC,MAAM;AAY5B,UAAM,SAAS,EAAE,YAAY;AAC7B,QACE,WAAW,gBACX,WAAW,cACX,WAAW,cACX,WAAW,eACX;AACA,aAAO;AAAA,IACT;AACA,UAAM,KAAK,gBAAgB,CAAC;AAC5B,WAAO,MAAM,UAAU,KAAK;AAAA,EAC9B,CAAC;AACH;AAGO,SAAS,mBAAmB,UAAgD;AACjF,QAAM,UAAU,oBAAI,IAAkC;AACtD,aAAW,UAAU,UAAU;AAC7B,UAAM,YAAY,iBAAiB,MAAM;AACzC,UAAM,YAAY,OAAO,YAAY,WAAW,OAAO,YAAY,WAAW;AAC9E,UAAM,WAAW,QAAQ,IAAI,SAAS;AACtC,QAAI,CAAC,YAAY,YAAY,SAAS,WAAW;AAC/C,cAAQ,IAAI,WAAW;AAAA,QACrB,IAAI;AAAA,QACJ,OAAO,sBAAsB,MAAM;AAAA,QACnC;AAAA;AAAA;AAAA,QAGA,QAAQ,eAAe,MAAM;AAAA,MAC/B,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,MAAM,KAAK,QAAQ,OAAO,CAAC,EAC/B,KAAK,CAAC,GAAG,MAAM;AACd,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AACtC,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AAItC,WAAO,EAAE,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,KAAK,IAAI;AAAA,EAC9C,CAAC,EACA,MAAM,GAAG,kBAAkB;AAChC;AAEA,SAAS,iBAAiB,QAA4B;AACpD,QAAM,YAAY,OAAO,YAAY,WAAW,KAAK;AACrD,MAAI,UAAW,QAAO,UAAU,SAAS;AACzC,QAAM,OAAO,OAAO,YAAY,QAAQ,CAAC;AACzC,QAAM,WAAW,KAAK,KAAK,CAAC,MAAM,EAAE,WAAW,QAAQ,CAAC;AACxD,MAAI,SAAU,QAAO;AACrB,MAAI,KAAK,SAAS,EAAG,QAAO,OAAO,KAAK,CAAC,CAAC;AAC1C,SAAO,UAAU,OAAO,YAAY,EAAE;AACxC;AAEA,SAAS,sBAAsB,QAA4B;AACzD,QAAM,aAAa,OAAO,WAAW,IAAI,MAAM,IAAI,EAAE,KAAK,CAAC,SAAS,KAAK,KAAK,EAAE,SAAS,CAAC,KAAK;AAC/F,QAAM,UAAU,UAAU,KAAK;AAC/B,MAAI,QAAQ,WAAW,EAAG,QAAO,OAAO,YAAY;AACpD,SAAO,QAAQ,SAAS,MAAM,GAAG,QAAQ,MAAM,GAAG,GAAG,CAAC,QAAQ;AAChE;AAEA,SAAS,eAAe,QAA4B;AAClD,QAAM,MAAM,OAAO,YAAY;AAC/B,MAAI,QAAQ,aAAc,QAAO;AACjC,MAAI,QAAQ,WAAY,QAAO;AAC/B,MAAI,QAAQ,aAAc,QAAO;AACjC,SAAO;AACT;AAGO,SAAS,oBACd,UACA,QACA,OACwB;AACxB,QAAM,SAAS,OAAO,KAAK,QAAQ;AACnC,QAAM,SAAiC,CAAC;AACxC,QAAM,MAAM,OAAO;AACnB,aAAW,UAAU,UAAU;AAC7B,QAAI,SAAS,CAAC,mBAAmB,QAAQ,KAAK,EAAG;AACjD,UAAM,OAAO,OAAO,GAAG,QAAQ;AAC/B,UAAM,YAAY,OAAO,UAAU,KAAK,MAAM,OAAO,OAAO,IAAI;AAChE,QAAI,CAAC,OAAO,SAAS,SAAS,KAAK,YAAY,UAAU,aAAa,KAAM;AAC5E,UAAM,QAAQ,eAAe,YAAY,QAAQ,GAAG;AACpD,WAAO,KAAK;AAAA,MACV,MAAM,OAAO;AAAA,MACb,MAAM,OAAO;AAAA,MACb,WAAW,OAAO;AAAA,MAClB,OAAO,OAAO,MAAM,QAAQ,CAAC,CAAC;AAAA,MAC9B,SAAS,OAAO,aAAa,OAAO;AAAA,IACtC,CAAC;AAAA,EACH;AACA,SAAO,OACJ,KAAK,CAAC,GAAG,MAAM;AACd,UAAM,YAAY,EAAE,QAAQ,EAAE;AAC9B,QAAI,cAAc,EAAG,QAAO;AAC5B,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AACtC,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AACtC,WAAO;AAAA,EACT,CAAC,EACA,MAAM,GAAG,mBAAmB;AACjC;AAEA,SAAS,qBAAqB,UAAkD;AAC9E,QAAM,cAAwC,CAAC;AAE/C,aAAW,UAAU,UAAU;AAC7B,UAAM,OAAO,OAAO,YAAY,QAAQ,CAAC;AACzC,UAAM,YAAY,KAAK,KAAK,CAAC,MAAM,EAAE,YAAY,MAAM,SAAS;AAChE,UAAM,eAAe,OAAO,YAAY,aAAa;AACrD,UAAM,uBAAuB,qCAAqC,KAAK,OAAO,OAAO;AAErF,QAAI,aAAa,gBAAgB,sBAAsB;AACrD,YAAM,OAAuC,eACzC,eACA,uBACE,aACA;AACN,kBAAY,KAAK;AAAA,QACf,IAAI,OAAO,YAAY;AAAA,QACvB;AAAA,QACA,MAAM,sBAAsB,MAAM;AAAA,QAClC,QAAQ,OAAO,YAAY;AAAA,QAC3B,WAAW,OAAO,YAAY;AAAA,MAChC,CAAC;AAAA,IACH;AAAA,EACF;AAEA,SAAO,YACJ,KAAK,CAAC,GAAG,MAAM;AAEd,QAAI,CAAC,EAAE,aAAa,CAAC,EAAE,UAAW,QAAO;AACzC,QAAI,CAAC,EAAE,UAAW,QAAO;AACzB,QAAI,CAAC,EAAE,UAAW,QAAO;AACzB,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AACtC,QAAI,EAAE,YAAY,EAAE,UAAW,QAAO;AACtC,WAAO;AAAA,EACT,CAAC,EACA,MAAM,GAAG,oBAAoB;AAClC;AAOA,eAAe,kBACb,QACA,KAC6B;AAC7B,QAAM,cAAe,OAAiC,YAAY;AAClE,MAAI;AACF,UAAM,UAAU,IAAI,YAAY,EAAE,MAAM,GAAG,EAAE;AAC7C,UAAM,SAAS,MAAM,OAAO,cAAc,OAAO;AAIjD,WAAO,EAAE,QAAQ,OAAO,OAAU;AAAA,EACpC,SAAS,KAAK;AACZ,UAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,QAAI,KAAK,oCAAoC,WAAW,MAAM,OAAO,EAAE;AAGvE,WAAO;AAAA,MACL,QAAQ;AAAA,MACR,OAAO,EAAE,QAAQ,aAAa,OAAO,QAAQ;AAAA,IAC/C;AAAA,EACF;AACF;AAMA,SAAS,6BAA6B,KAIR;AAC5B,SAAO,OAAO,EAAE,UAAU,aAAa,aAAa,MAAM;AAExD,UAAM,EAAE,OAAO,IAAK,MAAM,OAAO,QAAQ;AAGzC,UAAM,aAAmD,EAAE,QAAQ,IAAI,OAAO;AAC9E,QAAI,IAAI,QAAS,YAAW,UAAU,IAAI;AAC1C,UAAM,SAAS,IAAI,OAAO,UAAU;AAWpC,UAAM,SAAS,oBAAoB,UAAU,aAAa,YAAY;AACtE,UAAM,WAAW,MAAM,OAAO,UAAU,OAAO;AAAA,MAC7C,OAAO,IAAI;AAAA,MACX,cAAc;AAAA,MACd,OAAO;AAAA,MACP,mBAAmB;AAAA,IACrB,CAAC;AAED,UAAM,OAAO,OAAO,SAAS,gBAAgB,WAAW,SAAS,cAAc;AAC/E,WAAO,sBAAsB,MAAM,YAAY;AAAA,EACjD;AACF;AAEA,IAAM,wBAAwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQ9B,SAAS,oBACP,UACA,aACA,cACQ;AACR,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,WAAW,WAAW,EAAE;AACnC,QAAM,KAAK,uBAAuB,YAAY,EAAE;AAChD,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,iBAAiB;AAC5B,aAAW,KAAK,SAAS,cAAe,OAAM,KAAK,KAAK,EAAE,KAAK,KAAK,EAAE,MAAM,GAAG;AAC/E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,kBAAkB;AAC7B,aAAW,KAAK,SAAS,eAAgB,OAAM,KAAK,KAAK,EAAE,IAAI,KAAK,EAAE,IAAI,GAAG;AAC7E,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,mBAAmB;AAC9B,aAAW,KAAK,SAAS,gBAAiB,OAAM,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAC9E,SAAO,MAAM,KAAK,IAAI;AACxB;AAEA,SAAS,sBAAsB,KAAa,KAAiC;AAI3E,QAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,MAAI,CAAC,UAAU,OAAO,WAAW,UAAU;AACzC,UAAM,IAAI,MAAM,iCAAiC,OAAO,MAAM,EAAE;AAAA,EAClE;AACA,QAAM,MAAO,OAAmC;AAChD,MAAI,CAAC,MAAM,QAAQ,GAAG,GAAG;AACvB,UAAM,IAAI,MAAM,wCAAwC;AAAA,EAC1D;AACA,QAAM,MAA0B,CAAC;AACjC,aAAW,SAAS,KAAK;AACvB,QAAI,CAAC,SAAS,OAAO,UAAU,SAAU;AACzC,UAAM,OAAQ,MAAkC;AAChD,QAAI,OAAO,SAAS,YAAY,KAAK,KAAK,EAAE,WAAW,EAAG;AAC1D,UAAM,YAAa,MAAkC;AACrD,QAAI,KAAK;AAAA,MACP,MAAM,KAAK,KAAK;AAAA,MAChB,WAAW,OAAO,cAAc,WAAW,UAAU,KAAK,IAAI;AAAA,IAChE,CAAC;AACD,QAAI,IAAI,UAAU,IAAK;AAAA,EACzB;AACA,SAAO;AACT;AAEA,SAAS,eAAe,KAAsB;AAC5C,MAAI,eAAe,MAAO,QAAO,IAAI;AACrC,SAAO,OAAO,GAAG;AACnB;AAeO,SAAS,uBAAuB,KAA4B;AACjE,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,0BAA0B;AACrC,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,cAAc,IAAI,YAAY,YAAY,CAAC,aAAa,IAAI,WAAW,IAAI;AACtF,MAAI,IAAI,OAAO;AACb,UAAM,KAAK,WAAW,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,KAAK,GAAG;AAAA,EAC5D;AACA,MAAI,IAAI,WAAW;AACjB,UAAM,KAAK,eAAe,IAAI,SAAS,GAAG;AAAA,EAC5C;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,mBAAmB;AAC9B,MAAI,IAAI,SAAS,cAAc,WAAW,GAAG;AAC3C,UAAM,KAAK,gCAAgC;AAAA,EAC7C,OAAO;AACL,eAAW,KAAK,IAAI,SAAS,eAAe;AAC1C,YAAM,KAAK,OAAO,EAAE,KAAK,aAAQ,EAAE,MAAM,aAAa,EAAE,SAAS,GAAG;AAAA,IACtE;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,oBAAoB;AAC/B,MAAI,IAAI,SAAS,eAAe,WAAW,GAAG;AAC5C,UAAM,KAAK,kCAAkC;AAAA,EAC/C,OAAO;AACL,eAAW,KAAK,IAAI,SAAS,gBAAgB;AAC3C,YAAM,UAAU,EAAE,UAAU,WAAM,EAAE,OAAO,KAAK;AAChD,YAAM,KAAK,OAAO,EAAE,IAAI,OAAO,EAAE,IAAI,WAAW,EAAE,KAAK,IAAI,OAAO,EAAE;AAAA,IACtE;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,qBAAqB;AAChC,MAAI,IAAI,SAAS,gBAAgB,WAAW,GAAG;AAC7C,UAAM,KAAK,iCAAiC;AAAA,EAC9C,OAAO;AACL,eAAW,KAAK,IAAI,SAAS,iBAAiB;AAC5C,YAAM,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,IAAI,EAAE;AAAA,IACtC;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,yBAAyB;AACpC,MAAI,IAAI,4BAA4B;AAClC,UAAM,KAAK,iBAAiB,IAAI,0BAA0B,GAAG;AAAA,EAC/D,WAAW,IAAI,SAAS,mBAAmB,WAAW,GAAG;AACvD,UAAM,KAAK,4BAA4B;AAAA,EACzC,OAAO;AACL,eAAW,KAAK,IAAI,SAAS,oBAAoB;AAC/C,YAAM,YAAY,EAAE,YAAY,MAAM,EAAE,SAAS,OAAO;AACxD,YAAM,KAAK,KAAK,EAAE,IAAI,GAAG,SAAS,EAAE;AAAA,IACtC;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AAEb,MAAI,IAAI,SAAS,kBAAkB,QAAW;AAC5C,UAAM,KAAK,qBAAqB;AAChC,QAAI,IAAI,SAAS,cAAc,WAAW,GAAG;AAC3C,YAAM,KAAK,oCAAoC;AAAA,IACjD,OAAO;AACL,iBAAW,MAAM,IAAI,SAAS,eAAe;AAC3C,cAAM,MAAM,GAAG,MAAM,WAAM,GAAG,GAAG,KAAK;AACtC,cAAM,MAAM,GAAG,WAAW,MAAM,GAAG,QAAQ,KAAK;AAChD,cAAM,KAAK,OAAO,GAAG,KAAK,OAAO,GAAG,KAAK,GAAG,GAAG,IAAI,GAAG,EAAE;AAAA,MAC1D;AAAA,IACF;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,SAAO,MAAM,KAAK,IAAI,EAAE,QAAQ,IAAI;AACtC;AAaO,SAAS,uBACd,gBACA,MAAyB,QAAQ,KACzB;AACR,MAAI,OAAO,mBAAmB,YAAY,eAAe,KAAK,EAAE,SAAS,GAAG;AAC1E,WAAO,KAAK,QAAQ,eAAe,KAAK,CAAC;AAAA,EAC3C;AACA,QAAM,aAAa,IAAI,aAAa,KAAK;AACzC,MAAI,cAAc,WAAW,SAAS,GAAG;AACvC,WAAO,KAAK,KAAK,YAAY,WAAW;AAAA,EAC1C;AACA,QAAM,OAAO,IAAI,QAAQ,IAAI,eAAe;AAC5C,SAAO,KAAK,KAAK,MAAM,WAAW,WAAW;AAC/C;AAGO,SAAS,iBAAiB,MAAY,SAA8B,YAAoB;AAC7F,QAAM,MAAM,KAAK,YAAY,EAAE,MAAM,GAAG,EAAE;AAC1C,SAAO,WAAW,SAAS,GAAG,GAAG,UAAU,GAAG,GAAG;AACnD;","names":["from","end"]}

package/dist/chunk-6ZH4TU6I.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/page-versioning.ts"],"sourcesContent":["/**\n * Page-level versioning with history and revert (issue #371).\n *\n * Provides snapshot-based versioning for memory files using a sidecar\n * directory layout.  Each memory page gets a `.versions/<pageName>/`\n * subdirectory containing numbered snapshots and a `manifest.json` that\n * records the version history.\n *\n * Storage layout:\n *   memoryDir/\n *     facts/preferences.md              <- current file\n *     .versions/\n *       facts__preferences/\n *         manifest.json                  <- VersionHistory\n *         1.md                           <- version 1 snapshot\n *         2.md                           <- version 2 snapshot\n */\n\nimport { createHash } from \"node:crypto\";\nimport path from \"node:path\";\nimport {\n  access,\n  mkdir,\n  readFile,\n  writeFile,\n  unlink,\n} from \"node:fs/promises\";\n\n// ---------------------------------------------------------------------------\n// Public interfaces\n// ---------------------------------------------------------------------------\n\nexport interface PageVersion {\n  versionId: string;\n  timestamp: string;\n  contentHash: string;\n  sizeBytes: number;\n  trigger: VersionTrigger;\n  note?: string;\n}\n\nexport type VersionTrigger = \"write\" | \"consolidation\" | \"revert\" | \"manual\";\n\nexport interface VersionHistory {\n  pagePath: string;\n  versions: PageVersion[];\n  currentVersion: string;\n}\n\nexport interface VersioningConfig {\n  enabled: boolean;\n  maxVersionsPerPage: number;\n  sidecarDir: string;\n}\n\n// ---------------------------------------------------------------------------\n// Logger interface (minimal, avoids coupling to the host logger)\n// ---------------------------------------------------------------------------\n\nexport interface VersioningLogger {\n  debug(msg: string): void;\n  warn(msg: string): void;\n}\n\nconst NOOP_LOGGER: VersioningLogger = {\n  debug: () => {},\n  warn: () => {},\n};\n\n// ---------------------------------------------------------------------------\n// Per-page write lock (promise-chain pattern, see gotcha #40)\n// ---------------------------------------------------------------------------\n\nconst writeLocks = new Map<string, Promise<void>>();\n\nfunction withPageLock<T>(pageKey: string, fn: () => Promise<T>): Promise<T> {\n  const prev = writeLocks.get(pageKey) ?? Promise.resolve();\n  const next = prev.then(fn, fn); // run fn after previous completes, even if previous failed\n  writeLocks.set(pageKey, next.then(() => {}, () => {})); // recover chain per gotcha #40\n  return next;\n}\n\n// ---------------------------------------------------------------------------\n// Internal helpers\n// ---------------------------------------------------------------------------\n\nfunction contentHash(content: string): string {\n  return createHash(\"sha256\").update(content, \"utf-8\").digest(\"hex\");\n}\n\n/**\n * Derive a filesystem-safe sidecar key from a page path relative to memoryDir.\n *\n * `facts/2026-01-15/pref-001.md` -> `facts__2026-01-15__pref-001`\n */\nfunction sidecarKey(pagePath: string): string {\n  const withoutExt = pagePath.replace(/\\.md$/i, \"\");\n  return withoutExt.replace(/[\\\\/]/g, \"__\");\n}\n\nfunction sidecarDir(memoryDir: string, sidecar: string, pagePath: string): string {\n  return path.join(memoryDir, sidecar, sidecarKey(pagePath));\n}\n\nfunction manifestPath(memoryDir: string, sidecar: string, pagePath: string): string {\n  return path.join(sidecarDir(memoryDir, sidecar, pagePath), \"manifest.json\");\n}\n\nasync function fileExists(p: string): Promise<boolean> {\n  try {\n    await access(p);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\nasync function readManifest(\n  memoryDir: string,\n  sidecar: string,\n  pagePath: string,\n): Promise<VersionHistory> {\n  const mp = manifestPath(memoryDir, sidecar, pagePath);\n  try {\n    const raw = await readFile(mp, \"utf-8\");\n    const parsed: unknown = JSON.parse(raw);\n    if (typeof parsed !== \"object\" || parsed === null) {\n      return { pagePath, versions: [], currentVersion: \"0\" };\n    }\n    const obj = parsed as Record<string, unknown>;\n    const versions = Array.isArray(obj.versions) ? (obj.versions as PageVersion[]) : [];\n    const currentVersion = typeof obj.currentVersion === \"string\" ? obj.currentVersion : \"0\";\n    return { pagePath: typeof obj.pagePath === \"string\" ? obj.pagePath : pagePath, versions, currentVersion };\n  } catch {\n    return { pagePath, versions: [], currentVersion: \"0\" };\n  }\n}\n\nasync function writeManifest(\n  memoryDir: string,\n  sidecar: string,\n  pagePath: string,\n  history: VersionHistory,\n): Promise<void> {\n  const dir = sidecarDir(memoryDir, sidecar, pagePath);\n  await mkdir(dir, { recursive: true });\n  const mp = manifestPath(memoryDir, sidecar, pagePath);\n  await writeFile(mp, JSON.stringify(history, null, 2) + \"\\n\", \"utf-8\");\n}\n\n// ---------------------------------------------------------------------------\n// Public API\n// ---------------------------------------------------------------------------\n\n/**\n * Create a new version snapshot for a page.\n *\n * Call this BEFORE overwriting the current file so the previous content is\n * preserved. If the file does not exist yet (first write), the provided\n * `content` is snapshotted as version 1.\n *\n * Pruning: when the number of versions exceeds `config.maxVersionsPerPage`,\n * the oldest snapshots (and their files) are removed.\n */\nexport async function createVersion(\n  pagePath: string,\n  content: string,\n  trigger: VersionTrigger,\n  config: VersioningConfig,\n  log: VersioningLogger = NOOP_LOGGER,\n  note?: string,\n  memoryDir?: string,\n): Promise<PageVersion> {\n  const { sidecarDir: sidecar, maxVersionsPerPage } = config;\n  const resolvedMemoryDir = memoryDir ?? resolveMemoryDir(pagePath);\n  const mPath = manifestPath(resolvedMemoryDir, sidecar, relPath(pagePath, resolvedMemoryDir));\n\n  return withPageLock(mPath, async () => {\n    const history = await readManifest(resolvedMemoryDir, sidecar, relPath(pagePath, resolvedMemoryDir));\n    const nextId = String(history.versions.length > 0\n      ? Math.max(...history.versions.map((v) => Number(v.versionId))) + 1\n      : 1);\n\n    const hash = contentHash(content);\n    const version: PageVersion = {\n      versionId: nextId,\n      timestamp: new Date().toISOString(),\n      contentHash: hash,\n      sizeBytes: Buffer.byteLength(content, \"utf-8\"),\n      trigger,\n      ...(note !== undefined ? { note } : {}),\n    };\n\n    // Write snapshot file\n    const dir = sidecarDir(resolvedMemoryDir, sidecar, relPath(pagePath, resolvedMemoryDir));\n    await mkdir(dir, { recursive: true });\n    const ext = path.extname(pagePath) || \".md\";\n    const snapshotPath = path.join(dir, `${nextId}${ext}`);\n    await writeFile(snapshotPath, content, \"utf-8\");\n\n    history.versions.push(version);\n    history.currentVersion = nextId;\n\n    // Prune old versions if exceeding max\n    if (maxVersionsPerPage > 0 && history.versions.length > maxVersionsPerPage) {\n      const toRemove = history.versions.splice(0, history.versions.length - maxVersionsPerPage);\n      for (const old of toRemove) {\n        const oldPath = path.join(dir, `${old.versionId}${ext}`);\n        try {\n          await unlink(oldPath);\n        } catch {\n          log.debug(`page-versioning: could not remove old snapshot ${oldPath}`);\n        }\n      }\n    }\n\n    await writeManifest(resolvedMemoryDir, sidecar, relPath(pagePath, resolvedMemoryDir), history);\n    log.debug(`page-versioning: created version ${nextId} for ${pagePath} (trigger=${trigger})`);\n\n    return version;\n  });\n}\n\n/**\n * List all versions for a page.\n */\nexport async function listVersions(\n  pagePath: string,\n  config: VersioningConfig,\n  memoryDir?: string,\n): Promise<VersionHistory> {\n  const resolvedMemoryDir = memoryDir ?? resolveMemoryDir(pagePath);\n  const rel = relPath(pagePath, resolvedMemoryDir);\n  const history = await readManifest(resolvedMemoryDir, config.sidecarDir, rel);\n  // Sort ascending by versionId (numeric)\n  history.versions.sort((a, b) => Number(a.versionId) - Number(b.versionId));\n  return history;\n}\n\n/**\n * Read the content of a specific version.\n */\nexport async function getVersion(\n  pagePath: string,\n  versionId: string,\n  config: VersioningConfig,\n  memoryDir?: string,\n): Promise<string> {\n  const resolvedMemoryDir = memoryDir ?? resolveMemoryDir(pagePath);\n  const rel = relPath(pagePath, resolvedMemoryDir);\n  const ext = path.extname(pagePath) || \".md\";\n  const dir = sidecarDir(resolvedMemoryDir, config.sidecarDir, rel);\n  const snapshotPath = path.join(dir, `${versionId}${ext}`);\n\n  if (!(await fileExists(snapshotPath))) {\n    throw new Error(`Version ${versionId} not found for ${pagePath}`);\n  }\n\n  return readFile(snapshotPath, \"utf-8\");\n}\n\n/**\n * Revert a page to a previous version.\n *\n * 1. Reads the target version's content.\n * 2. Snapshots the CURRENT content as a new version (trigger: \"revert\").\n * 3. Writes the reverted content to the page file.\n *\n * Returns the newly created version entry for the revert snapshot.\n */\nexport async function revertToVersion(\n  pagePath: string,\n  versionId: string,\n  config: VersioningConfig,\n  log: VersioningLogger = NOOP_LOGGER,\n  memoryDir?: string,\n): Promise<PageVersion> {\n  const resolvedMemoryDir = memoryDir ?? resolveMemoryDir(pagePath);\n\n  // Read target version content\n  const targetContent = await getVersion(pagePath, versionId, config, resolvedMemoryDir);\n\n  // Snapshot current content before overwriting\n  let currentContent = \"\";\n  try {\n    currentContent = await readFile(pagePath, \"utf-8\");\n  } catch {\n    // File may not exist; that's okay\n  }\n\n  const version = await createVersion(\n    pagePath,\n    currentContent,\n    \"revert\",\n    config,\n    log,\n    `reverted to version ${versionId}`,\n    resolvedMemoryDir,\n  );\n\n  // Write the reverted content to the actual page\n  await writeFile(pagePath, targetContent, \"utf-8\");\n  log.debug(`page-versioning: reverted ${pagePath} to version ${versionId}`);\n\n  return version;\n}\n\n/**\n * Simple line-based diff between two versions.\n *\n * Returns a unified-style diff string showing added (+) and removed (-) lines.\n */\nexport async function diffVersions(\n  pagePath: string,\n  v1: string,\n  v2: string,\n  config: VersioningConfig,\n  memoryDir?: string,\n): Promise<string> {\n  const resolvedMemoryDir = memoryDir ?? resolveMemoryDir(pagePath);\n  const content1 = await getVersion(pagePath, v1, config, resolvedMemoryDir);\n  const content2 = await getVersion(pagePath, v2, config, resolvedMemoryDir);\n\n  const lines1 = content1.split(\"\\n\");\n  const lines2 = content2.split(\"\\n\");\n\n  const result: string[] = [];\n  result.push(`--- version ${v1}`);\n  result.push(`+++ version ${v2}`);\n\n  // Simple LCS-based diff\n  const lcs = computeLCS(lines1, lines2);\n  let i = 0;\n  let j = 0;\n  let k = 0;\n\n  while (k < lcs.length) {\n    // Emit removed lines before the next common line\n    while (i < lines1.length && lines1[i] !== lcs[k]) {\n      result.push(`-${lines1[i]}`);\n      i++;\n    }\n    // Emit added lines before the next common line\n    while (j < lines2.length && lines2[j] !== lcs[k]) {\n      result.push(`+${lines2[j]}`);\n      j++;\n    }\n    // Common line\n    result.push(` ${lcs[k]}`);\n    i++;\n    j++;\n    k++;\n  }\n  // Remaining removed lines\n  while (i < lines1.length) {\n    result.push(`-${lines1[i]}`);\n    i++;\n  }\n  // Remaining added lines\n  while (j < lines2.length) {\n    result.push(`+${lines2[j]}`);\n    j++;\n  }\n\n  return result.join(\"\\n\");\n}\n\n// ---------------------------------------------------------------------------\n// LCS helper for diffVersions\n// ---------------------------------------------------------------------------\n\nfunction computeLCS(a: string[], b: string[]): string[] {\n  const m = a.length;\n  const n = b.length;\n  // Build DP table\n  const dp: number[][] = Array.from({ length: m + 1 }, () => new Array<number>(n + 1).fill(0));\n  for (let i = 1; i <= m; i++) {\n    for (let j = 1; j <= n; j++) {\n      if (a[i - 1] === b[j - 1]) {\n        dp[i][j] = dp[i - 1][j - 1] + 1;\n      } else {\n        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);\n      }\n    }\n  }\n  // Backtrack to build LCS\n  const result: string[] = [];\n  let i = m;\n  let j = n;\n  while (i > 0 && j > 0) {\n    if (a[i - 1] === b[j - 1]) {\n      result.unshift(a[i - 1]);\n      i--;\n      j--;\n    } else if (dp[i - 1][j] > dp[i][j - 1]) {\n      i--;\n    } else {\n      j--;\n    }\n  }\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Path helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Legacy fallback: given an absolute page path, heuristically resolve the\n * memory directory by walking up past known subdirectory names.\n *\n * Callers should always pass an explicit `memoryDir` instead of relying on\n * this heuristic.  It is retained only for backward compatibility when the\n * optional `memoryDir` parameter is omitted.\n */\nfunction resolveMemoryDir(pagePath: string): string {\n  const knownSubdirs = new Set([\n    \"facts\",\n    \"corrections\",\n    \"entities\",\n    \"state\",\n    \"artifacts\",\n    \"questions\",\n    \"profiles\",\n  ]);\n\n  let dir = path.dirname(pagePath);\n  // Walk up past date directories (YYYY-MM-DD) and known subdirs\n  for (let depth = 0; depth < 5; depth++) {\n    const base = path.basename(dir);\n    if (knownSubdirs.has(base) || /^\\d{4}-\\d{2}-\\d{2}$/.test(base)) {\n      dir = path.dirname(dir);\n    } else {\n      break;\n    }\n  }\n  return dir;\n}\n\n/**\n * Compute relative path of a page within its memory directory.\n */\nfunction relPath(pagePath: string, memoryDir: string): string {\n  return path.relative(memoryDir, pagePath);\n}\n"],"mappings":";AAkBA,SAAS,kBAAkB;AAC3B,OAAO,UAAU;AACjB;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AAsCP,IAAM,cAAgC;AAAA,EACpC,OAAO,MAAM;AAAA,EAAC;AAAA,EACd,MAAM,MAAM;AAAA,EAAC;AACf;AAMA,IAAM,aAAa,oBAAI,IAA2B;AAElD,SAAS,aAAgB,SAAiB,IAAkC;AAC1E,QAAM,OAAO,WAAW,IAAI,OAAO,KAAK,QAAQ,QAAQ;AACxD,QAAM,OAAO,KAAK,KAAK,IAAI,EAAE;AAC7B,aAAW,IAAI,SAAS,KAAK,KAAK,MAAM;AAAA,EAAC,GAAG,MAAM;AAAA,EAAC,CAAC,CAAC;AACrD,SAAO;AACT;AAMA,SAAS,YAAY,SAAyB;AAC5C,SAAO,WAAW,QAAQ,EAAE,OAAO,SAAS,OAAO,EAAE,OAAO,KAAK;AACnE;AAOA,SAAS,WAAW,UAA0B;AAC5C,QAAM,aAAa,SAAS,QAAQ,UAAU,EAAE;AAChD,SAAO,WAAW,QAAQ,UAAU,IAAI;AAC1C;AAEA,SAAS,WAAW,WAAmB,SAAiB,UAA0B;AAChF,SAAO,KAAK,KAAK,WAAW,SAAS,WAAW,QAAQ,CAAC;AAC3D;AAEA,SAAS,aAAa,WAAmB,SAAiB,UAA0B;AAClF,SAAO,KAAK,KAAK,WAAW,WAAW,SAAS,QAAQ,GAAG,eAAe;AAC5E;AAEA,eAAe,WAAW,GAA6B;AACrD,MAAI;AACF,UAAM,OAAO,CAAC;AACd,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,eAAe,aACb,WACA,SACA,UACyB;AACzB,QAAM,KAAK,aAAa,WAAW,SAAS,QAAQ;AACpD,MAAI;AACF,UAAM,MAAM,MAAM,SAAS,IAAI,OAAO;AACtC,UAAM,SAAkB,KAAK,MAAM,GAAG;AACtC,QAAI,OAAO,WAAW,YAAY,WAAW,MAAM;AACjD,aAAO,EAAE,UAAU,UAAU,CAAC,GAAG,gBAAgB,IAAI;AAAA,IACvD;AACA,UAAM,MAAM;AACZ,UAAM,WAAW,MAAM,QAAQ,IAAI,QAAQ,IAAK,IAAI,WAA6B,CAAC;AAClF,UAAM,iBAAiB,OAAO,IAAI,mBAAmB,WAAW,IAAI,iBAAiB;AACrF,WAAO,EAAE,UAAU,OAAO,IAAI,aAAa,WAAW,IAAI,WAAW,UAAU,UAAU,eAAe;AAAA,EAC1G,QAAQ;AACN,WAAO,EAAE,UAAU,UAAU,CAAC,GAAG,gBAAgB,IAAI;AAAA,EACvD;AACF;AAEA,eAAe,cACb,WACA,SACA,UACA,SACe;AACf,QAAM,MAAM,WAAW,WAAW,SAAS,QAAQ;AACnD,QAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AACpC,QAAM,KAAK,aAAa,WAAW,SAAS,QAAQ;AACpD,QAAM,UAAU,IAAI,KAAK,UAAU,SAAS,MAAM,CAAC,IAAI,MAAM,OAAO;AACtE;AAgBA,eAAsB,cACpB,UACA,SACA,SACA,QACA,MAAwB,aACxB,MACA,WACsB;AACtB,QAAM,EAAE,YAAY,SAAS,mBAAmB,IAAI;AACpD,QAAM,oBAAoB,aAAa,iBAAiB,QAAQ;AAChE,QAAM,QAAQ,aAAa,mBAAmB,SAAS,QAAQ,UAAU,iBAAiB,CAAC;AAE3F,SAAO,aAAa,OAAO,YAAY;AACrC,UAAM,UAAU,MAAM,aAAa,mBAAmB,SAAS,QAAQ,UAAU,iBAAiB,CAAC;AACnG,UAAM,SAAS,OAAO,QAAQ,SAAS,SAAS,IAC5C,KAAK,IAAI,GAAG,QAAQ,SAAS,IAAI,CAAC,MAAM,OAAO,EAAE,SAAS,CAAC,CAAC,IAAI,IAChE,CAAC;AAEL,UAAM,OAAO,YAAY,OAAO;AAChC,UAAM,UAAuB;AAAA,MAC3B,WAAW;AAAA,MACX,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA,MAClC,aAAa;AAAA,MACb,WAAW,OAAO,WAAW,SAAS,OAAO;AAAA,MAC7C;AAAA,MACA,GAAI,SAAS,SAAY,EAAE,KAAK,IAAI,CAAC;AAAA,IACvC;AAGA,UAAM,MAAM,WAAW,mBAAmB,SAAS,QAAQ,UAAU,iBAAiB,CAAC;AACvF,UAAM,MAAM,KAAK,EAAE,WAAW,KAAK,CAAC;AACpC,UAAM,MAAM,KAAK,QAAQ,QAAQ,KAAK;AACtC,UAAM,eAAe,KAAK,KAAK,KAAK,GAAG,MAAM,GAAG,GAAG,EAAE;AACrD,UAAM,UAAU,cAAc,SAAS,OAAO;AAE9C,YAAQ,SAAS,KAAK,OAAO;AAC7B,YAAQ,iBAAiB;AAGzB,QAAI,qBAAqB,KAAK,QAAQ,SAAS,SAAS,oBAAoB;AAC1E,YAAM,WAAW,QAAQ,SAAS,OAAO,GAAG,QAAQ,SAAS,SAAS,kBAAkB;AACxF,iBAAW,OAAO,UAAU;AAC1B,cAAM,UAAU,KAAK,KAAK,KAAK,GAAG,IAAI,SAAS,GAAG,GAAG,EAAE;AACvD,YAAI;AACF,gBAAM,OAAO,OAAO;AAAA,QACtB,QAAQ;AACN,cAAI,MAAM,kDAAkD,OAAO,EAAE;AAAA,QACvE;AAAA,MACF;AAAA,IACF;AAEA,UAAM,cAAc,mBAAmB,SAAS,QAAQ,UAAU,iBAAiB,GAAG,OAAO;AAC7F,QAAI,MAAM,oCAAoC,MAAM,QAAQ,QAAQ,aAAa,OAAO,GAAG;AAE3F,WAAO;AAAA,EACT,CAAC;AACH;AAKA,eAAsB,aACpB,UACA,QACA,WACyB;AACzB,QAAM,oBAAoB,aAAa,iBAAiB,QAAQ;AAChE,QAAM,MAAM,QAAQ,UAAU,iBAAiB;AAC/C,QAAM,UAAU,MAAM,aAAa,mBAAmB,OAAO,YAAY,GAAG;AAE5E,UAAQ,SAAS,KAAK,CAAC,GAAG,MAAM,OAAO,EAAE,SAAS,IAAI,OAAO,EAAE,SAAS,CAAC;AACzE,SAAO;AACT;AAKA,eAAsB,WACpB,UACA,WACA,QACA,WACiB;AACjB,QAAM,oBAAoB,aAAa,iBAAiB,QAAQ;AAChE,QAAM,MAAM,QAAQ,UAAU,iBAAiB;AAC/C,QAAM,MAAM,KAAK,QAAQ,QAAQ,KAAK;AACtC,QAAM,MAAM,WAAW,mBAAmB,OAAO,YAAY,GAAG;AAChE,QAAM,eAAe,KAAK,KAAK,KAAK,GAAG,SAAS,GAAG,GAAG,EAAE;AAExD,MAAI,CAAE,MAAM,WAAW,YAAY,GAAI;AACrC,UAAM,IAAI,MAAM,WAAW,SAAS,kBAAkB,QAAQ,EAAE;AAAA,EAClE;AAEA,SAAO,SAAS,cAAc,OAAO;AACvC;AAWA,eAAsB,gBACpB,UACA,WACA,QACA,MAAwB,aACxB,WACsB;AACtB,QAAM,oBAAoB,aAAa,iBAAiB,QAAQ;AAGhE,QAAM,gBAAgB,MAAM,WAAW,UAAU,WAAW,QAAQ,iBAAiB;AAGrF,MAAI,iBAAiB;AACrB,MAAI;AACF,qBAAiB,MAAM,SAAS,UAAU,OAAO;AAAA,EACnD,QAAQ;AAAA,EAER;AAEA,QAAM,UAAU,MAAM;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,uBAAuB,SAAS;AAAA,IAChC;AAAA,EACF;AAGA,QAAM,UAAU,UAAU,eAAe,OAAO;AAChD,MAAI,MAAM,6BAA6B,QAAQ,eAAe,SAAS,EAAE;AAEzE,SAAO;AACT;AAOA,eAAsB,aACpB,UACA,IACA,IACA,QACA,WACiB;AACjB,QAAM,oBAAoB,aAAa,iBAAiB,QAAQ;AAChE,QAAM,WAAW,MAAM,WAAW,UAAU,IAAI,QAAQ,iBAAiB;AACzE,QAAM,WAAW,MAAM,WAAW,UAAU,IAAI,QAAQ,iBAAiB;AAEzE,QAAM,SAAS,SAAS,MAAM,IAAI;AAClC,QAAM,SAAS,SAAS,MAAM,IAAI;AAElC,QAAM,SAAmB,CAAC;AAC1B,SAAO,KAAK,eAAe,EAAE,EAAE;AAC/B,SAAO,KAAK,eAAe,EAAE,EAAE;AAG/B,QAAM,MAAM,WAAW,QAAQ,MAAM;AACrC,MAAI,IAAI;AACR,MAAI,IAAI;AACR,MAAI,IAAI;AAER,SAAO,IAAI,IAAI,QAAQ;AAErB,WAAO,IAAI,OAAO,UAAU,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG;AAChD,aAAO,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE;AAC3B;AAAA,IACF;AAEA,WAAO,IAAI,OAAO,UAAU,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG;AAChD,aAAO,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE;AAC3B;AAAA,IACF;AAEA,WAAO,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE;AACxB;AACA;AACA;AAAA,EACF;AAEA,SAAO,IAAI,OAAO,QAAQ;AACxB,WAAO,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE;AAC3B;AAAA,EACF;AAEA,SAAO,IAAI,OAAO,QAAQ;AACxB,WAAO,KAAK,IAAI,OAAO,CAAC,CAAC,EAAE;AAC3B;AAAA,EACF;AAEA,SAAO,OAAO,KAAK,IAAI;AACzB;AAMA,SAAS,WAAW,GAAa,GAAuB;AACtD,QAAM,IAAI,EAAE;AACZ,QAAM,IAAI,EAAE;AAEZ,QAAM,KAAiB,MAAM,KAAK,EAAE,QAAQ,IAAI,EAAE,GAAG,MAAM,IAAI,MAAc,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;AAC3F,WAASA,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC3B,aAASC,KAAI,GAAGA,MAAK,GAAGA,MAAK;AAC3B,UAAI,EAAED,KAAI,CAAC,MAAM,EAAEC,KAAI,CAAC,GAAG;AACzB,WAAGD,EAAC,EAAEC,EAAC,IAAI,GAAGD,KAAI,CAAC,EAAEC,KAAI,CAAC,IAAI;AAAA,MAChC,OAAO;AACL,WAAGD,EAAC,EAAEC,EAAC,IAAI,KAAK,IAAI,GAAGD,KAAI,CAAC,EAAEC,EAAC,GAAG,GAAGD,EAAC,EAAEC,KAAI,CAAC,CAAC;AAAA,MAChD;AAAA,IACF;AAAA,EACF;AAEA,QAAM,SAAmB,CAAC;AAC1B,MAAI,IAAI;AACR,MAAI,IAAI;AACR,SAAO,IAAI,KAAK,IAAI,GAAG;AACrB,QAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG;AACzB,aAAO,QAAQ,EAAE,IAAI,CAAC,CAAC;AACvB;AACA;AAAA,IACF,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG;AACtC;AAAA,IACF,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAcA,SAAS,iBAAiB,UAA0B;AAClD,QAAM,eAAe,oBAAI,IAAI;AAAA,IAC3B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,MAAI,MAAM,KAAK,QAAQ,QAAQ;AAE/B,WAAS,QAAQ,GAAG,QAAQ,GAAG,SAAS;AACtC,UAAM,OAAO,KAAK,SAAS,GAAG;AAC9B,QAAI,aAAa,IAAI,IAAI,KAAK,sBAAsB,KAAK,IAAI,GAAG;AAC9D,YAAM,KAAK,QAAQ,GAAG;AAAA,IACxB,OAAO;AACL;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAKA,SAAS,QAAQ,UAAkB,WAA2B;AAC5D,SAAO,KAAK,SAAS,WAAW,QAAQ;AAC1C;","names":["i","j"]}

package/dist/chunk-ALXMCZEU.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/embedding-fallback.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, readFile, writeFile } from \"node:fs/promises\";\nimport { log } from \"./logger.js\";\nimport type { PluginConfig } from \"./types.js\";\n\ntype EmbeddingProviderType = \"openai\" | \"local\";\n\ntype ProviderConfig = {\n  type: EmbeddingProviderType;\n  model: string;\n  endpoint: string;\n  headers: Record<string, string>;\n};\n\ntype EmbeddingIndexEntry = {\n  vector: number[];\n  path: string;\n};\n\ntype EmbeddingIndexFile = {\n  version: 1;\n  provider: EmbeddingProviderType;\n  model: string;\n  entries: Record<string, EmbeddingIndexEntry>;\n};\n\nconst DEFAULT_OPENAI_MODEL = \"text-embedding-3-small\";\n\n/**\n * Thrown by `EmbeddingFallback.search()` (via `embed()`) when the embedding\n * backend is effectively unavailable on the lookup path — either because the\n * HTTP fetch exceeded its deadline OR because the endpoint returned a non-2xx\n * status code. Callers that need to distinguish a backend outage from \"no\n * candidates\" can `instanceof`-check against this class.\n *\n * Round 9 fix (Finding UZqB): previously a timeout returned null from embed(),\n * which caused search() to return [] silently. decideSemanticDedup then\n * classified the result as no_candidates instead of backend_unavailable, so\n * the per-batch batchBackendUnavailable short-circuit never activated and\n * batches of N facts each paid a full timeout roundtrip.\n *\n * Round 10 fix (Findings Ui1J + Ui1L): search() now only re-throws this error\n * when the caller explicitly passes `{ throwOnTimeout: true }`. Without that\n * flag search() catches it and returns [] instead, preserving fail-open\n * semantics for recall-path callers (searchEmbeddingFallback) that have no\n * try/catch. Only the semantic-dedup path (semanticDedupLookup) passes the\n * flag so it can still reach decideSemanticDedup's backend_unavailable branch.\n *\n * Round 11 fix (Finding Ur_J): `embed()` now also throws this error from the\n * lookup path when the HTTP response is non-2xx (e.g. 429, 500, 503). Without\n * this, repeated 5xx outages would each return null → [] → no_candidates and\n * subsequent facts in the same batch would all pay full roundtrips instead of\n * tripping the per-batch backend_unavailable short-circuit.\n *\n * The class name is kept for backward compatibility — `EmbeddingTimeoutError`\n * now signals \"lookup backend unavailable\" rather than strictly \"timed out\".\n */\nexport class EmbeddingTimeoutError extends Error {\n  override readonly name = \"EmbeddingTimeoutError\" as const;\n  constructor(message: string) {\n    super(message);\n  }\n}\n\n/**\n * Maximum time to wait for an embedding HTTP request on the LOOKUP/query\n * path before giving up.\n *\n * The write-time semantic dedup guard in orchestrator.persistExtraction()\n * blocks each candidate fact on an embedding lookup. If the embedding\n * endpoint hangs (degraded OpenAI, stalled local gateway, DNS timeout),\n * extraction would otherwise stall indefinitely — a single bad backend\n * could freeze the entire persist loop. Bounding the fetch here ensures\n * the decision path fails open (returns null) within a predictable window\n * and writes proceed as non-duplicates.\n *\n * Tests can override via REMNIC_EMBEDDING_FETCH_TIMEOUT_MS so they don't\n * have to wait the full default on hung-fetch assertions.\n *\n * Related: joshuaswarren/remnic#373, PR #399 P1/P2 review.\n */\nconst DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS = 5000;\n\n/**\n * Maximum time to wait for an embedding HTTP request on the INDEX path.\n *\n * Indexing runs asynchronously after a memory has already been persisted\n * to disk. It does not block extraction or writes — it only updates the\n * embedding index used by later semantic dedup lookups. A slow local\n * CPU-backed embedding model can legitimately take tens of seconds per\n * call, so applying the short lookup timeout here silently dropped index\n * updates and caused later dedup lookups to miss recently persisted\n * memories. Use a much larger budget on this path.\n *\n * Tests can override via REMNIC_EMBEDDING_INDEX_TIMEOUT_MS.\n */\nconst DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS = 120_000;\n\nfunction resolveEmbeddingLookupTimeoutMs(): number {\n  const raw = process.env.REMNIC_EMBEDDING_FETCH_TIMEOUT_MS;\n  if (raw) {\n    const parsed = Number(raw);\n    if (Number.isFinite(parsed) && parsed > 0) {\n      return Math.floor(parsed);\n    }\n  }\n  return DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS;\n}\n\nfunction resolveEmbeddingIndexTimeoutMs(): number {\n  const raw = process.env.REMNIC_EMBEDDING_INDEX_TIMEOUT_MS;\n  if (raw) {\n    const parsed = Number(raw);\n    if (Number.isFinite(parsed) && parsed > 0) {\n      return Math.floor(parsed);\n    }\n  }\n  return DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS;\n}\n\n/**\n * Options for the low-level embed() call.\n *\n * `mode` selects the timeout profile:\n *   - \"lookup\" (default): bounded by the short lookup budget; fails open fast.\n *   - \"index\": bounded by a much longer budget so slow backends can still\n *     index newly persisted memories.\n */\nexport type EmbedMode = \"lookup\" | \"index\";\n\nexport class EmbeddingFallback {\n  private readonly indexPath: string;\n  private loaded: EmbeddingIndexFile | null = null;\n\n  constructor(private readonly config: PluginConfig) {\n    this.indexPath = path.join(config.memoryDir, \"state\", \"embeddings.json\");\n  }\n\n  async isAvailable(): Promise<boolean> {\n    return (await this.resolveProvider()) !== null;\n  }\n\n  /**\n   * Embed an array of texts and return their embedding vectors.\n   *\n   * This is the public batch-embed interface used by semantic chunking\n   * (Finding 1, PR #420 post-merge). Texts are grouped into batches of\n   * `embeddingBatchSize` (from `semanticChunkingConfig`, default 32) and\n   * each batch is dispatched concurrently via `Promise.all()`. This\n   * preserves the semantic intent of `embeddingBatchSize` — without batching,\n   * every text incurred a sequential HTTP round-trip, making the batch size\n   * config ineffective. (PR #439 post-merge Finding 2.)\n   *\n   * If the provider is unavailable or any single embedding fails, the method\n   * throws so the caller can fall back to recursive chunking.\n   */\n  async embedTexts(texts: string[]): Promise<number[][]> {\n    const provider = await this.resolveProvider();\n    if (!provider) {\n      throw new Error(\"Embedding provider is not available\");\n    }\n\n    const batchSize = Math.max(\n      1,\n      this.config.semanticChunkingConfig?.embeddingBatchSize ?? 32,\n    );\n\n    const vectors: number[][] = [];\n    for (let i = 0; i < texts.length; i += batchSize) {\n      const batch = texts.slice(i, i + batchSize);\n      const batchResults = await Promise.all(\n        batch.map((text) => this.embed(text, provider, { mode: \"lookup\" })),\n      );\n      for (const vec of batchResults) {\n        if (!vec) {\n          throw new Error(\"Embedding returned null for input text\");\n        }\n        vectors.push(vec);\n      }\n    }\n    return vectors;\n  }\n\n  /**\n   * Nearest-neighbor search against the embedding index.\n   *\n   * @param query         The query string to embed and search for.\n   * @param limit         Max number of hits to return.\n   * @param options       Optional filters.\n   *   - `pathPrefix`   Restrict candidates to entries whose indexed `path`\n   *                    starts with this prefix (relative to `memoryDir`).\n   *                    Used by the semantic dedup guard to scope lookups\n   *                    to the target namespace so a high-similarity hit\n   *                    from a different namespace can't suppress a write\n   *                    in the target namespace. Default: no filter.\n   *   - `pathExcludePrefixes`\n   *                    Exclude any entry whose indexed `path` starts with\n   *                    any of these prefixes. Used for the default\n   *                    namespace case: when the default namespace lives at\n   *                    `memoryDir` root (legacy layout) we still want to\n   *                    exclude `namespaces/<other>/…` entries.\n   */\n  async search(\n    query: string,\n    limit: number,\n    options: {\n      pathPrefix?: string;\n      pathExcludePrefixes?: readonly string[];\n      /**\n       * When true, an `EmbeddingTimeoutError` from the embedding backend is\n       * re-thrown to the caller. Use this on the semantic-dedup path so\n       * `decideSemanticDedup`'s catch block can classify the result as\n       * `reason=\"backend_unavailable\"` and activate the per-batch\n       * short-circuit.\n       *\n       * When false (the default), a timeout is caught here and search()\n       * returns [] instead — preserving fail-open semantics for the recall\n       * path (`searchEmbeddingFallback`) which has no surrounding try/catch.\n       * Without this gate a timed-out embedding request on the recall path\n       * would propagate as an unhandled rejection and abort recall entirely.\n       * (Round 10 fix, Findings Ui1J + Ui1L.)\n       */\n      throwOnTimeout?: boolean;\n    } = {},\n  ): Promise<Array<{ id: string; score: number; path: string }>> {\n    const provider = await this.resolveProvider();\n    if (!provider) return [];\n\n    const index = await this.loadIndex(provider);\n    const ids = Object.keys(index.entries);\n    if (ids.length === 0) return [];\n\n    let queryVector: number[] | null;\n    try {\n      queryVector = await this.embed(query, provider, { mode: \"lookup\" });\n    } catch (err) {\n      if (err instanceof EmbeddingTimeoutError) {\n        if (options.throwOnTimeout) {\n          throw err;\n        }\n        // Fail-open: recall-path callers get an empty result rather than an\n        // unhandled rejection that would abort recall entirely.\n        log.debug(\"embedding fallback search: timeout on lookup, returning [] (throwOnTimeout=false)\");\n        return [];\n      }\n      throw err;\n    }\n    if (!queryVector) return [];\n\n    const includePrefix = normalizePathPrefix(options.pathPrefix);\n    const excludePrefixes = (options.pathExcludePrefixes ?? [])\n      .map((p) => normalizePathPrefix(p))\n      .filter((p): p is string => typeof p === \"string\");\n\n    const scored = ids\n      .map((id) => {\n        const entry = index.entries[id];\n        return {\n          id,\n          path: entry.path,\n          score: cosineSimilarity(queryVector, entry.vector),\n        };\n      })\n      .filter((r) => {\n        if (!Number.isFinite(r.score)) return false;\n        const normalized = normalizeEntryPath(r.path);\n        if (includePrefix !== undefined && !normalized.startsWith(includePrefix)) {\n          return false;\n        }\n        for (const excl of excludePrefixes) {\n          if (normalized.startsWith(excl)) return false;\n        }\n        return true;\n      })\n      .sort((a, b) => b.score - a.score)\n      .slice(0, Math.max(1, limit));\n\n    return scored;\n  }\n\n  async indexFile(memoryId: string, content: string, filePath: string): Promise<void> {\n    const provider = await this.resolveProvider();\n    if (!provider) return;\n    // Indexing is not on the write-critical path: a newly persisted memory\n    // has already been written to disk by the time we reach this call. Use\n    // the long \"index\" timeout so slow local embedding backends can still\n    // add the entry to the index. Previously this used the short lookup\n    // budget and silently dropped updates, leaving later dedup lookups\n    // blind to the memory. Related: PR #399 P2.\n    const vector = await this.embed(content, provider, { mode: \"index\" });\n    if (!vector) return;\n\n    const index = await this.loadIndex(provider);\n    const relPath = toMemoryRelativePath(this.config.memoryDir, filePath);\n    index.entries[memoryId] = {\n      vector,\n      path: relPath,\n    };\n    await this.saveIndex(index);\n  }\n\n  async removeFromIndex(memoryId: string): Promise<void> {\n    const provider = await this.resolveProvider();\n    if (!provider) return;\n\n    const index = await this.loadIndex(provider);\n    if (!index.entries[memoryId]) return;\n    delete index.entries[memoryId];\n    await this.saveIndex(index);\n  }\n\n  private async resolveProvider(): Promise<ProviderConfig | null> {\n    if (!this.config.embeddingFallbackEnabled) return null;\n\n    const preferred = this.config.embeddingFallbackProvider;\n    const providers = preferred === \"auto\" ? [\"openai\", \"local\"] : [preferred];\n\n    for (const p of providers) {\n      if (p === \"openai\" && this.config.openaiApiKey) {\n        const baseUrl = this.config.openaiBaseUrl ?? \"https://api.openai.com/v1\";\n        return {\n          type: \"openai\",\n          model: DEFAULT_OPENAI_MODEL,\n          endpoint: `${baseUrl.replace(/\\/$/, \"\")}/embeddings`,\n          headers: {\n            \"Content-Type\": \"application/json\",\n            Authorization: `Bearer ${this.config.openaiApiKey}`,\n          },\n        };\n      }\n\n      if (p === \"local\" && this.config.localLlmEnabled && this.config.localLlmUrl) {\n        const base = this.config.localLlmUrl.replace(/\\/$/, \"\");\n        const endpoint = /\\/v1$/i.test(base) ? `${base}/embeddings` : `${base}/v1/embeddings`;\n        const headers: Record<string, string> = {\n          \"Content-Type\": \"application/json\",\n          ...(this.config.localLlmHeaders ?? {}),\n        };\n        if (this.config.localLlmApiKey && this.config.localLlmAuthHeader !== false) {\n          headers.Authorization = `Bearer ${this.config.localLlmApiKey}`;\n        }\n        return {\n          type: \"local\",\n          model: this.config.localLlmModel || DEFAULT_OPENAI_MODEL,\n          endpoint,\n          headers,\n        };\n      }\n    }\n\n    return null;\n  }\n\n  private async embed(\n    input: string,\n    provider: ProviderConfig,\n    options: { mode?: EmbedMode } = {},\n  ): Promise<number[] | null> {\n    // Bound the fetch so a hung embedding endpoint cannot stall callers.\n    // The lookup path uses a short budget (see DEFAULT_EMBEDDING_LOOKUP_TIMEOUT_MS\n    // docblock) so semantic dedup fails open fast. The index path uses a\n    // much longer budget because slow local backends (CPU embedding models)\n    // otherwise drop index updates and blind later dedup lookups. See\n    // DEFAULT_EMBEDDING_INDEX_TIMEOUT_MS docblock and PR #399 P2 review.\n    const mode: EmbedMode = options.mode ?? \"lookup\";\n    const timeoutMs =\n      mode === \"index\"\n        ? resolveEmbeddingIndexTimeoutMs()\n        : resolveEmbeddingLookupTimeoutMs();\n    try {\n      const res = await fetch(provider.endpoint, {\n        method: \"POST\",\n        headers: provider.headers,\n        body: JSON.stringify({\n          model: provider.model,\n          input: input.slice(0, 8000),\n          encoding_format: \"float\",\n        }),\n        signal: AbortSignal.timeout(timeoutMs),\n      });\n      if (!res.ok) {\n        log.debug(`embedding fallback request failed: ${provider.type} ${res.status}`);\n        // Round 11 fix (Finding Ur_J): on the LOOKUP path, a non-2xx response\n        // means the embedding backend is effectively unavailable. Throw the\n        // tagged error so search() (when called with throwOnTimeout) propagates\n        // to decideSemanticDedup's backend_unavailable branch, activating the\n        // per-batch short-circuit. Without this, repeated 429/5xx responses\n        // would silently return [] for every fact in the batch.\n        //\n        // On the INDEX path a non-2xx is non-fatal (the memory is already\n        // persisted; index update can be skipped) — return null there.\n        if (mode === \"lookup\") {\n          throw new EmbeddingTimeoutError(\n            `embedding backend returned ${res.status} (${provider.type})`,\n          );\n        }\n        return null;\n      }\n      const payload = (await res.json()) as any;\n      const vector = payload?.data?.[0]?.embedding;\n      if (!Array.isArray(vector)) return null;\n      return vector.map((n: unknown) => Number(n)).filter((n: number) => Number.isFinite(n));\n    } catch (err) {\n      // Round 11 (Finding Ur_J): the !res.ok branch above throws\n      // EmbeddingTimeoutError directly. Re-throw it here so the catch does\n      // not swallow our own intentional signal back into a null return.\n      if (err instanceof EmbeddingTimeoutError) {\n        throw err;\n      }\n      // AbortSignal.timeout throws a DOMException with name \"TimeoutError\";\n      // surface at warn level so operators can distinguish slow backends from\n      // generic errors.\n      const isTimeout =\n        err instanceof Error &&\n        (err.name === \"TimeoutError\" || err.name === \"AbortError\");\n      if (isTimeout) {\n        log.warn(\n          `embedding fallback fetch timed out after ${timeoutMs}ms (${provider.type}, mode=${mode})`,\n        );\n        // Round 9 fix (Finding UZqB): on the LOOKUP path a timeout means the\n        // embedding backend is effectively unavailable — re-throw so that\n        // search() propagates the error to semanticDedupLookup, which lets it\n        // reach decideSemanticDedup's catch block and return\n        // reason=\"backend_unavailable\". Without this, search() would silently\n        // return [] and the per-batch batchBackendUnavailable flag would never\n        // flip, causing subsequent facts in the same batch to each pay a full\n        // timeout roundtrip (N × timeout instead of 1 × timeout).\n        //\n        // On the INDEX path a timeout is not fatal (the memory is already\n        // persisted; index update can be skipped) — return null there so\n        // indexFile() stays non-blocking.\n        if (mode === \"lookup\") {\n          throw new EmbeddingTimeoutError(\n            `embedding backend timed out after ${timeoutMs}ms (${provider.type})`,\n          );\n        }\n      } else {\n        // Round 12 fix (PR #399 thread PRRT_kwDORJXyws56U6Gi): non-timeout\n        // transport failures (ECONNREFUSED, DNS errors, TLS failures) are just\n        // as fatal as timeouts on the LOOKUP path — the embedding backend is\n        // effectively unreachable. Throw EmbeddingTimeoutError so that\n        // search() (when called with throwOnTimeout:true) propagates the error\n        // to decideSemanticDedup's backend_unavailable branch, activating the\n        // per-batch short-circuit. Without this, each fact in the batch would\n        // pay a full ECONNREFUSED roundtrip and return null → [] → no_candidates,\n        // preventing batchBackendUnavailable from ever being set.\n        //\n        // On the INDEX path a transport failure is non-fatal — the memory is\n        // already persisted; index update can be safely skipped.\n        if (mode === \"lookup\") {\n          log.warn(\n            `embedding fallback transport error on lookup path (${provider.type}): ${err}`,\n          );\n          throw new EmbeddingTimeoutError(\n            `embedding backend transport failure (${provider.type}): ${err instanceof Error ? err.message : String(err)}`,\n          );\n        }\n        log.debug(`embedding fallback error: ${err}`);\n      }\n      return null;\n    }\n  }\n\n  private async loadIndex(provider: ProviderConfig): Promise<EmbeddingIndexFile> {\n    if (this.loaded && this.loaded.provider === provider.type && this.loaded.model === provider.model) {\n      return this.loaded;\n    }\n\n    try {\n      const raw = await readFile(this.indexPath, \"utf-8\");\n      const parsed = JSON.parse(raw) as EmbeddingIndexFile;\n      if (parsed && parsed.version === 1 && parsed.entries && typeof parsed.entries === \"object\") {\n        this.loaded = {\n          version: 1,\n          provider: provider.type,\n          model: provider.model,\n          entries: parsed.entries,\n        };\n        return this.loaded;\n      }\n    } catch {\n      // ignore and create a new index\n    }\n\n    this.loaded = {\n      version: 1,\n      provider: provider.type,\n      model: provider.model,\n      entries: {},\n    };\n    return this.loaded;\n  }\n\n  private async saveIndex(index: EmbeddingIndexFile): Promise<void> {\n    await mkdir(path.dirname(this.indexPath), { recursive: true });\n    await writeFile(this.indexPath, JSON.stringify(index), \"utf-8\");\n    this.loaded = index;\n  }\n}\n\nfunction toMemoryRelativePath(memoryDir: string, filePath: string): string {\n  if (!path.isAbsolute(filePath)) return filePath;\n  const rel = path.relative(memoryDir, filePath);\n  return rel.startsWith(\"..\") ? filePath : rel;\n}\n\n/**\n * Normalize an index entry path to forward-slashes for stable prefix\n * comparison. Entries are stored as `path.relative(memoryDir, …)` output,\n * which on Windows uses back-slashes. Normalize both sides so prefix\n * matching is OS-independent.\n *\n * Also strip a leading `./` so this helper's output is symmetric with\n * `normalizePathPrefix` below. `toMemoryRelativePath` is a pass-through for\n * non-absolute filePath inputs, so an index entry could legitimately carry a\n * stored path like `\"./namespaces/alpha/facts/f.md\"`. Without this strip, a\n * caller-supplied prefix `\"./namespaces/alpha\"` (which `normalizePathPrefix`\n * rewrites to `\"namespaces/alpha/\"`) would silently miss that entry and\n * namespace-scoped dedup would either let a near-duplicate through or fail\n * to exclude a cross-namespace hit.\n */\nfunction normalizeEntryPath(p: string): string {\n  let out = p.replace(/\\\\/g, \"/\");\n  if (out.startsWith(\"./\")) out = out.slice(2);\n  return out;\n}\n\n/**\n * Normalize a caller-supplied path prefix:\n *   - Return `undefined` for nullish/empty input (no filter).\n *   - Replace back-slashes with forward-slashes.\n *   - Strip a leading `./`.\n *   - Ensure a trailing `/` so `\"namespaces/a\"` doesn't accidentally match\n *     `\"namespaces/another/…\"`.\n */\nfunction normalizePathPrefix(prefix: string | undefined): string | undefined {\n  if (prefix === undefined || prefix === null) return undefined;\n  let p = String(prefix).replace(/\\\\/g, \"/\");\n  if (p.startsWith(\"./\")) p = p.slice(2);\n  if (p.length === 0) return undefined;\n  if (!p.endsWith(\"/\")) p = `${p}/`;\n  return p;\n}\n\nfunction cosineSimilarity(a: number[], b: number[]): number {\n  const n = Math.min(a.length, b.length);\n  if (n === 0) return 0;\n  let dot = 0;\n  let normA = 0;\n  let normB = 0;\n  for (let i = 0; i < n; i++) {\n    const av = a[i] ?? 0;\n    const bv = b[i] ?? 0;\n    dot += av * bv;\n    normA += av * av;\n    normB += bv * bv;\n  }\n  const denom = Math.sqrt(normA) * Math.sqrt(normB);\n  if (denom === 0) return 0;\n  return dot / denom;\n}\n\n"],"mappings":";;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,UAAU,iBAAiB;AAyB3C,IAAM,uBAAuB;AA+BtB,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAC7B,OAAO;AAAA,EACzB,YAAY,SAAiB;AAC3B,UAAM,OAAO;AAAA,EACf;AACF;AAmBA,IAAM,sCAAsC;AAe5C,IAAM,qCAAqC;AAE3C,SAAS,kCAA0C;AACjD,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,KAAK;AACP,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AACzC,aAAO,KAAK,MAAM,MAAM;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iCAAyC;AAChD,QAAM,MAAM,QAAQ,IAAI;AACxB,MAAI,KAAK;AACP,UAAM,SAAS,OAAO,GAAG;AACzB,QAAI,OAAO,SAAS,MAAM,KAAK,SAAS,GAAG;AACzC,aAAO,KAAK,MAAM,MAAM;AAAA,IAC1B;AAAA,EACF;AACA,SAAO;AACT;AAYO,IAAM,oBAAN,MAAwB;AAAA,EAI7B,YAA6B,QAAsB;AAAtB;AAC3B,SAAK,YAAY,KAAK,KAAK,OAAO,WAAW,SAAS,iBAAiB;AAAA,EACzE;AAAA,EAF6B;AAAA,EAHZ;AAAA,EACT,SAAoC;AAAA,EAM5C,MAAM,cAAgC;AACpC,WAAQ,MAAM,KAAK,gBAAgB,MAAO;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,WAAW,OAAsC;AACrD,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,UAAU;AACb,YAAM,IAAI,MAAM,qCAAqC;AAAA,IACvD;AAEA,UAAM,YAAY,KAAK;AAAA,MACrB;AAAA,MACA,KAAK,OAAO,wBAAwB,sBAAsB;AAAA,IAC5D;AAEA,UAAM,UAAsB,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,WAAW;AAChD,YAAM,QAAQ,MAAM,MAAM,GAAG,IAAI,SAAS;AAC1C,YAAM,eAAe,MAAM,QAAQ;AAAA,QACjC,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM,MAAM,UAAU,EAAE,MAAM,SAAS,CAAC,CAAC;AAAA,MACpE;AACA,iBAAW,OAAO,cAAc;AAC9B,YAAI,CAAC,KAAK;AACR,gBAAM,IAAI,MAAM,wCAAwC;AAAA,QAC1D;AACA,gBAAQ,KAAK,GAAG;AAAA,MAClB;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,MAAM,OACJ,OACA,OACA,UAkBI,CAAC,GACwD;AAC7D,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU,QAAO,CAAC;AAEvB,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,UAAM,MAAM,OAAO,KAAK,MAAM,OAAO;AACrC,QAAI,IAAI,WAAW,EAAG,QAAO,CAAC;AAE9B,QAAI;AACJ,QAAI;AACF,oBAAc,MAAM,KAAK,MAAM,OAAO,UAAU,EAAE,MAAM,SAAS,CAAC;AAAA,IACpE,SAAS,KAAK;AACZ,UAAI,eAAe,uBAAuB;AACxC,YAAI,QAAQ,gBAAgB;AAC1B,gBAAM;AAAA,QACR;AAGA,YAAI,MAAM,mFAAmF;AAC7F,eAAO,CAAC;AAAA,MACV;AACA,YAAM;AAAA,IACR;AACA,QAAI,CAAC,YAAa,QAAO,CAAC;AAE1B,UAAM,gBAAgB,oBAAoB,QAAQ,UAAU;AAC5D,UAAM,mBAAmB,QAAQ,uBAAuB,CAAC,GACtD,IAAI,CAAC,MAAM,oBAAoB,CAAC,CAAC,EACjC,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ;AAEnD,UAAM,SAAS,IACZ,IAAI,CAAC,OAAO;AACX,YAAM,QAAQ,MAAM,QAAQ,EAAE;AAC9B,aAAO;AAAA,QACL;AAAA,QACA,MAAM,MAAM;AAAA,QACZ,OAAO,iBAAiB,aAAa,MAAM,MAAM;AAAA,MACnD;AAAA,IACF,CAAC,EACA,OAAO,CAAC,MAAM;AACb,UAAI,CAAC,OAAO,SAAS,EAAE,KAAK,EAAG,QAAO;AACtC,YAAM,aAAa,mBAAmB,EAAE,IAAI;AAC5C,UAAI,kBAAkB,UAAa,CAAC,WAAW,WAAW,aAAa,GAAG;AACxE,eAAO;AAAA,MACT;AACA,iBAAW,QAAQ,iBAAiB;AAClC,YAAI,WAAW,WAAW,IAAI,EAAG,QAAO;AAAA,MAC1C;AACA,aAAO;AAAA,IACT,CAAC,EACA,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,EAChC,MAAM,GAAG,KAAK,IAAI,GAAG,KAAK,CAAC;AAE9B,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,UAAU,UAAkB,SAAiB,UAAiC;AAClF,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU;AAOf,UAAM,SAAS,MAAM,KAAK,MAAM,SAAS,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpE,QAAI,CAAC,OAAQ;AAEb,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,UAAM,UAAU,qBAAqB,KAAK,OAAO,WAAW,QAAQ;AACpE,UAAM,QAAQ,QAAQ,IAAI;AAAA,MACxB;AAAA,MACA,MAAM;AAAA,IACR;AACA,UAAM,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EAEA,MAAM,gBAAgB,UAAiC;AACrD,UAAM,WAAW,MAAM,KAAK,gBAAgB;AAC5C,QAAI,CAAC,SAAU;AAEf,UAAM,QAAQ,MAAM,KAAK,UAAU,QAAQ;AAC3C,QAAI,CAAC,MAAM,QAAQ,QAAQ,EAAG;AAC9B,WAAO,MAAM,QAAQ,QAAQ;AAC7B,UAAM,KAAK,UAAU,KAAK;AAAA,EAC5B;AAAA,EAEA,MAAc,kBAAkD;AAC9D,QAAI,CAAC,KAAK,OAAO,yBAA0B,QAAO;AAElD,UAAM,YAAY,KAAK,OAAO;AAC9B,UAAM,YAAY,cAAc,SAAS,CAAC,UAAU,OAAO,IAAI,CAAC,SAAS;AAEzE,eAAW,KAAK,WAAW;AACzB,UAAI,MAAM,YAAY,KAAK,OAAO,cAAc;AAC9C,cAAM,UAAU,KAAK,OAAO,iBAAiB;AAC7C,eAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO;AAAA,UACP,UAAU,GAAG,QAAQ,QAAQ,OAAO,EAAE,CAAC;AAAA,UACvC,SAAS;AAAA,YACP,gBAAgB;AAAA,YAChB,eAAe,UAAU,KAAK,OAAO,YAAY;AAAA,UACnD;AAAA,QACF;AAAA,MACF;AAEA,UAAI,MAAM,WAAW,KAAK,OAAO,mBAAmB,KAAK,OAAO,aAAa;AAC3E,cAAM,OAAO,KAAK,OAAO,YAAY,QAAQ,OAAO,EAAE;AACtD,cAAM,WAAW,SAAS,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,GAAG,IAAI;AACrE,cAAM,UAAkC;AAAA,UACtC,gBAAgB;AAAA,UAChB,GAAI,KAAK,OAAO,mBAAmB,CAAC;AAAA,QACtC;AACA,YAAI,KAAK,OAAO,kBAAkB,KAAK,OAAO,uBAAuB,OAAO;AAC1E,kBAAQ,gBAAgB,UAAU,KAAK,OAAO,cAAc;AAAA,QAC9D;AACA,eAAO;AAAA,UACL,MAAM;AAAA,UACN,OAAO,KAAK,OAAO,iBAAiB;AAAA,UACpC;AAAA,UACA;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,MACZ,OACA,UACA,UAAgC,CAAC,GACP;AAO1B,UAAM,OAAkB,QAAQ,QAAQ;AACxC,UAAM,YACJ,SAAS,UACL,+BAA+B,IAC/B,gCAAgC;AACtC,QAAI;AACF,YAAM,MAAM,MAAM,MAAM,SAAS,UAAU;AAAA,QACzC,QAAQ;AAAA,QACR,SAAS,SAAS;AAAA,QAClB,MAAM,KAAK,UAAU;AAAA,UACnB,OAAO,SAAS;AAAA,UAChB,OAAO,MAAM,MAAM,GAAG,GAAI;AAAA,UAC1B,iBAAiB;AAAA,QACnB,CAAC;AAAA,QACD,QAAQ,YAAY,QAAQ,SAAS;AAAA,MACvC,CAAC;AACD,UAAI,CAAC,IAAI,IAAI;AACX,YAAI,MAAM,sCAAsC,SAAS,IAAI,IAAI,IAAI,MAAM,EAAE;AAU7E,YAAI,SAAS,UAAU;AACrB,gBAAM,IAAI;AAAA,YACR,8BAA8B,IAAI,MAAM,KAAK,SAAS,IAAI;AAAA,UAC5D;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,YAAM,UAAW,MAAM,IAAI,KAAK;AAChC,YAAM,SAAS,SAAS,OAAO,CAAC,GAAG;AACnC,UAAI,CAAC,MAAM,QAAQ,MAAM,EAAG,QAAO;AACnC,aAAO,OAAO,IAAI,CAAC,MAAe,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,MAAc,OAAO,SAAS,CAAC,CAAC;AAAA,IACvF,SAAS,KAAK;AAIZ,UAAI,eAAe,uBAAuB;AACxC,cAAM;AAAA,MACR;AAIA,YAAM,YACJ,eAAe,UACd,IAAI,SAAS,kBAAkB,IAAI,SAAS;AAC/C,UAAI,WAAW;AACb,YAAI;AAAA,UACF,4CAA4C,SAAS,OAAO,SAAS,IAAI,UAAU,IAAI;AAAA,QACzF;AAaA,YAAI,SAAS,UAAU;AACrB,gBAAM,IAAI;AAAA,YACR,qCAAqC,SAAS,OAAO,SAAS,IAAI;AAAA,UACpE;AAAA,QACF;AAAA,MACF,OAAO;AAaL,YAAI,SAAS,UAAU;AACrB,cAAI;AAAA,YACF,sDAAsD,SAAS,IAAI,MAAM,GAAG;AAAA,UAC9E;AACA,gBAAM,IAAI;AAAA,YACR,wCAAwC,SAAS,IAAI,MAAM,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,UAC7G;AAAA,QACF;AACA,YAAI,MAAM,6BAA6B,GAAG,EAAE;AAAA,MAC9C;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAc,UAAU,UAAuD;AAC7E,QAAI,KAAK,UAAU,KAAK,OAAO,aAAa,SAAS,QAAQ,KAAK,OAAO,UAAU,SAAS,OAAO;AACjG,aAAO,KAAK;AAAA,IACd;AAEA,QAAI;AACF,YAAM,MAAM,MAAM,SAAS,KAAK,WAAW,OAAO;AAClD,YAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,UAAI,UAAU,OAAO,YAAY,KAAK,OAAO,WAAW,OAAO,OAAO,YAAY,UAAU;AAC1F,aAAK,SAAS;AAAA,UACZ,SAAS;AAAA,UACT,UAAU,SAAS;AAAA,UACnB,OAAO,SAAS;AAAA,UAChB,SAAS,OAAO;AAAA,QAClB;AACA,eAAO,KAAK;AAAA,MACd;AAAA,IACF,QAAQ;AAAA,IAER;AAEA,SAAK,SAAS;AAAA,MACZ,SAAS;AAAA,MACT,UAAU,SAAS;AAAA,MACnB,OAAO,SAAS;AAAA,MAChB,SAAS,CAAC;AAAA,IACZ;AACA,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,MAAc,UAAU,OAA0C;AAChE,UAAM,MAAM,KAAK,QAAQ,KAAK,SAAS,GAAG,EAAE,WAAW,KAAK,CAAC;AAC7D,UAAM,UAAU,KAAK,WAAW,KAAK,UAAU,KAAK,GAAG,OAAO;AAC9D,SAAK,SAAS;AAAA,EAChB;AACF;AAEA,SAAS,qBAAqB,WAAmB,UAA0B;AACzE,MAAI,CAAC,KAAK,WAAW,QAAQ,EAAG,QAAO;AACvC,QAAM,MAAM,KAAK,SAAS,WAAW,QAAQ;AAC7C,SAAO,IAAI,WAAW,IAAI,IAAI,WAAW;AAC3C;AAiBA,SAAS,mBAAmB,GAAmB;AAC7C,MAAI,MAAM,EAAE,QAAQ,OAAO,GAAG;AAC9B,MAAI,IAAI,WAAW,IAAI,EAAG,OAAM,IAAI,MAAM,CAAC;AAC3C,SAAO;AACT;AAUA,SAAS,oBAAoB,QAAgD;AAC3E,MAAI,WAAW,UAAa,WAAW,KAAM,QAAO;AACpD,MAAI,IAAI,OAAO,MAAM,EAAE,QAAQ,OAAO,GAAG;AACzC,MAAI,EAAE,WAAW,IAAI,EAAG,KAAI,EAAE,MAAM,CAAC;AACrC,MAAI,EAAE,WAAW,EAAG,QAAO;AAC3B,MAAI,CAAC,EAAE,SAAS,GAAG,EAAG,KAAI,GAAG,CAAC;AAC9B,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAa,GAAqB;AAC1D,QAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;AACrC,MAAI,MAAM,EAAG,QAAO;AACpB,MAAI,MAAM;AACV,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,KAAK,EAAE,CAAC,KAAK;AACnB,UAAM,KAAK,EAAE,CAAC,KAAK;AACnB,WAAO,KAAK;AACZ,aAAS,KAAK;AACd,aAAS,KAAK;AAAA,EAChB;AACA,QAAM,QAAQ,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK;AAChD,MAAI,UAAU,EAAG,QAAO;AACxB,SAAO,MAAM;AACf;","names":[]}