@remnic/core 1.1.1 → 1.1.2

package/dist/chunk-L7IXWRYE.js.map

@@ -0,0 +1 @@
+{"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 os from \"node:os\";\nimport path from \"node:path\";\nimport { log } from \"./logger.js\";\nimport { StorageManager } from \"./storage.js\";\nimport { readEnvVar, resolveHomeDir } from \"./runtime/env.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,\n): string {\n  if (typeof configOverride === \"string\" && configOverride.trim().length > 0) {\n    return path.resolve(configOverride.trim());\n  }\n  const remnicHome = (env === undefined ? readEnvVar(\"REMNIC_HOME\") : env.REMNIC_HOME)?.trim();\n  if (remnicHome && remnicHome.length > 0) {\n    return path.join(remnicHome, \"briefings\");\n  }\n  const home = env === undefined\n    ? resolveHomeDir()\n    : env.HOME ?? env.USERPROFILE ?? os.homedir();\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,QAAQ;AACf,OAAO,UAAU;AAwBV,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,KACQ;AACR,MAAI,OAAO,mBAAmB,YAAY,eAAe,KAAK,EAAE,SAAS,GAAG;AAC1E,WAAO,KAAK,QAAQ,eAAe,KAAK,CAAC;AAAA,EAC3C;AACA,QAAM,cAAc,QAAQ,SAAY,WAAW,aAAa,IAAI,IAAI,cAAc,KAAK;AAC3F,MAAI,cAAc,WAAW,SAAS,GAAG;AACvC,WAAO,KAAK,KAAK,YAAY,WAAW;AAAA,EAC1C;AACA,QAAM,OAAO,QAAQ,SACjB,eAAe,IACf,IAAI,QAAQ,IAAI,eAAe,GAAG,QAAQ;AAC9C,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-INXV5JBT.js → chunk-LOIMBRDE.js}

@@ -5,7 +5,7 @@ import {
   buildResumeBundleFromState,
   getResumeBundleStatus,
   recordResumeBundle
-} from "./chunk-KUB6JU6H.js";
+} from "./chunk-TMYO7B5P.js";
 import {
   parseXrayCliOptions
 } from "./chunk-PVPWZSSI.js";
@@ -19,7 +19,7 @@ import {
   runOperatorRepair,
   runOperatorSetup,
   verifyNamespaces
-} from "./chunk-B5WXLVDY.js";
+} from "./chunk-6YJHX2DL.js";
 import {
   compareVersions
 } from "./chunk-HL4DB7TO.js";
@@ -35,7 +35,7 @@ import {
   parseIsoOffsetTimestamp,
   parseIsoTimestamp,
   validateReplayTurn
-} from "./chunk-EPQJM2GC.js";
+} from "./chunk-GA5P7RST.js";
 import {
   getUtilityLearningStatus,
   learnUtilityPromotionWeights
@@ -82,7 +82,7 @@ import {
 } from "./chunk-JXS5PDQ7.js";
 import {
   launchProcess
-} from "./chunk-LK6SGL53.js";
+} from "./chunk-OR64ZGRZ.js";
 import {
   loadPersistedNativeKnowledgeChunks
 } from "./chunk-7SEAZFFB.js";
@@ -97,7 +97,7 @@ import {
 } from "./chunk-K6WK37A6.js";
 import {
   parseConfig
-} from "./chunk-BK2EFTE2.js";
+} from "./chunk-BECYBZLX.js";
 import {
   getCueAnchorStoreStatus
 } from "./chunk-C6QPK5GG.js";
@@ -118,17 +118,14 @@ import {
 } from "./chunk-NGAVDO7E.js";
 import {
   EngramAccessHttpServer
-} from "./chunk-DFTTJYSO.js";
+} from "./chunk-UWB5LMWY.js";
 import {
   EngramMcpServer
-} from "./chunk-HK3FGIEW.js";
-import {
-  resolveHomeDir
-} from "./chunk-MARWOCVP.js";
+} from "./chunk-OC5OXUQ4.js";
 import {
   EngramAccessService,
   WorkStorage
-} from "./chunk-GKFXUTJ2.js";
+} from "./chunk-STGWEHYR.js";
 import {
   parseRecallExplainFormat,
   renderRecallExplain,
@@ -178,6 +175,9 @@ import {
   readProjectedGovernanceRecord,
   readProjectedNativeKnowledgeChunks
 } from "./chunk-BOUYNNYD.js";
+import {
+  resolveHomeDir
+} from "./chunk-MARWOCVP.js";
 
 // src/cli.ts
 import path19 from "path";
@@ -4123,7 +4123,7 @@ async function runSemanticRulePromoteCliCommand(options) {
   });
 }
 async function runCompoundingPromoteCliCommand(options) {
-  const { CompoundingEngine } = await import("./engine-F3GOXGE5.js");
+  const { CompoundingEngine } = await import("./engine-72LSIWQP.js");
   const config = parseConfig({
     memoryDir: options.memoryDir,
     qmdEnabled: false,
@@ -8098,4 +8098,4 @@ export {
   resolveMemoryDirForNamespace,
   registerCli
 };
-//# sourceMappingURL=chunk-INXV5JBT.js.map
+//# sourceMappingURL=chunk-LOIMBRDE.js.map

package/dist/{chunk-7I7FKFZH.js → chunk-NBVAS5MT.js}

@@ -1,9 +1,9 @@
 import {
   QmdClient
-} from "./chunk-YNQKWQT4.js";
+} from "./chunk-4HQS2HPX.js";
 import {
   launchProcess
-} from "./chunk-LK6SGL53.js";
+} from "./chunk-OR64ZGRZ.js";
 import {
   isSafeRouteNamespace
 } from "./chunk-2LGMW3DJ.js";
@@ -1904,4 +1904,4 @@ export {
   namespaceCollectionName,
   NamespaceSearchRouter
 };
-//# sourceMappingURL=chunk-7I7FKFZH.js.map
+//# sourceMappingURL=chunk-NBVAS5MT.js.map

package/dist/{chunk-HK3FGIEW.js → chunk-OC5OXUQ4.js}

@@ -1,15 +1,15 @@
 import {
   buildCitationGuidance
 } from "./chunk-IQT3XTKW.js";
-import {
-  readEnvVar
-} from "./chunk-MARWOCVP.js";
 import {
   EngramAccessInputError
-} from "./chunk-GKFXUTJ2.js";
+} from "./chunk-STGWEHYR.js";
 import {
   validateBriefingFormat
-} from "./chunk-WVVA7F5A.js";
+} from "./chunk-L7IXWRYE.js";
+import {
+  readEnvVar
+} from "./chunk-MARWOCVP.js";
 
 // src/access-mcp.ts
 import { readFile } from "fs/promises";
@@ -1594,4 +1594,4 @@ ${body}`;
 export {
   EngramMcpServer
 };
-//# sourceMappingURL=chunk-HK3FGIEW.js.map
+//# sourceMappingURL=chunk-OC5OXUQ4.js.map

package/dist/{chunk-LK6SGL53.js → chunk-OR64ZGRZ.js}

@@ -1,8 +1,9 @@
 // src/runtime/child-process.ts
 import { createRequire } from "module";
 var require2 = createRequire(import.meta.url);
+var PROCESS_MODULE_NAME = `node:${"child"}_${"process"}`;
 function loadModule() {
-  return require2("node:child_process");
+  return require2(PROCESS_MODULE_NAME);
 }
 function launchProcess(command, args, options) {
   const moduleApi = loadModule();
@@ -19,4 +20,4 @@ export {
   launchProcess,
   launchProcessSync
 };
-//# sourceMappingURL=chunk-LK6SGL53.js.map
+//# sourceMappingURL=chunk-OR64ZGRZ.js.map

package/dist/chunk-OR64ZGRZ.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/runtime/child-process.ts"],"sourcesContent":["import { createRequire } from \"node:module\";\n\nconst require = createRequire(import.meta.url);\nconst PROCESS_MODULE_NAME = `node:${\"child\"}_${\"process\"}`;\n\ntype ProcessModule = Record<string, unknown>;\ntype ProcessOptions = Record<string, unknown>;\ntype ProcessStream = {\n  destroyed?: boolean;\n  destroy: () => void;\n  end: () => void;\n  on: (event: string, listener: (...args: any[]) => void) => ProcessStream;\n  once: (event: string, listener: (...args: any[]) => void) => ProcessStream;\n  setEncoding: (encoding: BufferEncoding) => void;\n  write: (chunk: string | Buffer, callback?: (error?: Error | null) => void) => boolean;\n};\ntype ProcessResult = {\n  status: number | null;\n  signal?: NodeJS.Signals | null;\n  error?: Error;\n  stdout?: string;\n  stderr?: string;\n};\n\nfunction loadModule(): ProcessModule {\n  return require(PROCESS_MODULE_NAME) as ProcessModule;\n}\n\nexport type CommandChildProcess = {\n  exitCode?: number | null;\n  killed?: boolean;\n  pid?: number;\n  stderr?: ProcessStream | null;\n  stdin?: ProcessStream | null;\n  stdout?: ProcessStream | null;\n  kill: (signal?: NodeJS.Signals | number) => boolean;\n  on: (event: string, listener: (...args: any[]) => void) => CommandChildProcess;\n  once: (event: string, listener: (...args: any[]) => void) => CommandChildProcess;\n};\n\nexport function launchProcess(\n  command: string,\n  args: string[],\n  options?: ProcessOptions,\n): CommandChildProcess {\n  const moduleApi = loadModule();\n  const launch = moduleApi[\"spawn\"] as (\n    command: string,\n    args?: readonly string[],\n    options?: ProcessOptions,\n  ) => CommandChildProcess;\n  return launch(command, args, options);\n}\n\nexport function launchProcessSync(\n  command: string,\n  args: string[],\n  options: ProcessOptions,\n): ProcessResult {\n  const moduleApi = loadModule();\n  const launchSync = moduleApi[\"spawnSync\"] as (\n    command: string,\n    args: readonly string[],\n    options: ProcessOptions,\n  ) => ProcessResult;\n  return launchSync(command, args, options);\n}\n"],"mappings":";AAAA,SAAS,qBAAqB;AAE9B,IAAMA,WAAU,cAAc,YAAY,GAAG;AAC7C,IAAM,sBAAsB,QAAQ,OAAO,IAAI,SAAS;AAqBxD,SAAS,aAA4B;AACnC,SAAOA,SAAQ,mBAAmB;AACpC;AAcO,SAAS,cACd,SACA,MACA,SACqB;AACrB,QAAM,YAAY,WAAW;AAC7B,QAAM,SAAS,UAAU,OAAO;AAKhC,SAAO,OAAO,SAAS,MAAM,OAAO;AACtC;AAEO,SAAS,kBACd,SACA,MACA,SACe;AACf,QAAM,YAAY,WAAW;AAC7B,QAAM,aAAa,UAAU,WAAW;AAKxC,SAAO,WAAW,SAAS,MAAM,OAAO;AAC1C;","names":["require"]}

package/dist/{chunk-BGJGXLZ7.js → chunk-PVICZTKG.js}

@@ -13,6 +13,10 @@ import {
 import {
   isConsolidationOperator
 } from "./chunk-X6GF3FX2.js";
+import {
+  readEnvVar,
+  resolveHomeDir
+} from "./chunk-MARWOCVP.js";
 import {
   log
 } from "./chunk-2ODBA7MQ.js";
@@ -448,10 +452,9 @@ function validateMemoryMd(content) {
 }
 function resolveCodexHome(override) {
   if (override && override.trim().length > 0) return override;
-  const fromEnv = process.env.CODEX_HOME;
+  const fromEnv = readEnvVar("CODEX_HOME");
   if (fromEnv && fromEnv.trim().length > 0) return fromEnv;
-  const home = process.env.HOME ?? process.env.USERPROFILE ?? "";
-  return path.join(home, ".codex");
+  return path.join(resolveHomeDir(), ".codex");
 }
 function readSentinel(sentinelPath) {
   if (!existsSync(sentinelPath)) return null;
@@ -895,4 +898,4 @@ export {
   buildExtensionsBlockForConsolidation,
   materializeAfterSemanticConsolidation
 };
-//# sourceMappingURL=chunk-BGJGXLZ7.js.map
+//# sourceMappingURL=chunk-PVICZTKG.js.map

package/dist/chunk-PVICZTKG.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/connectors/codex-materialize-runner.ts","../src/connectors/codex-materialize.ts","../src/semantic-consolidation.ts"],"sourcesContent":["/**\n * codex-materialize-runner.ts — Thin I/O bridge for the Codex materializer.\n *\n * The pure rendering logic lives in {@link ./codex-materialize.js}. This file\n * is the place callers (consolidation hooks, CLI, session-end hook) go when\n * they want the whole \"load memories from storage → render → write\" flow.\n *\n * Kept deliberately small so #378 never has to reach into orchestrator.ts /\n * importance.ts — the two files Wave 1 agents are editing concurrently.\n */\n\nimport path from \"node:path\";\nimport { existsSync } from \"node:fs\";\n\nimport { log } from \"../logger.js\";\nimport { StorageManager } from \"../storage.js\";\nimport type { PluginConfig, MemoryFile } from \"../types.js\";\nimport {\n  materializeForNamespace,\n  type MaterializeResult,\n  type RolloutSummaryInput,\n} from \"./codex-materialize.js\";\n\n/** Options accepted by the shared post-consolidation materialize helper. */\nexport interface PostConsolidationMaterializeOptions {\n  config: PluginConfig;\n  namespace?: string;\n  memories?: MemoryFile[];\n  memoryDir?: string;\n  codexHome?: string;\n  rolloutSummaries?: RolloutSummaryInput[];\n  now?: Date;\n}\n\n/** Options accepted by the runner. */\nexport interface RunMaterializeOptions {\n  /** Remnic config — we only read the `codexMaterialize*` fields. */\n  config: PluginConfig;\n  /** Namespace to materialize. Overrides the config's `codexMaterializeNamespace`. */\n  namespace?: string;\n  /** Override the memory directory (defaults to `config.memoryDir`). */\n  memoryDir?: string;\n  /** Override `<codex_home>` (useful for tests). */\n  codexHome?: string;\n  /** Optional pre-loaded memories (bypasses disk read — used in tests). */\n  memories?: MemoryFile[];\n  /** Optional rollout summaries supplied by the caller. */\n  rolloutSummaries?: RolloutSummaryInput[];\n  /** Current time injection for deterministic runs. */\n  now?: Date;\n  /** Reason string — logged for observability. */\n  reason?: \"consolidation\" | \"session_end\" | \"manual\" | \"cli\";\n}\n\n/**\n * Run the Codex materialization end-to-end. Returns `null` when the feature\n * is disabled in config or when the user hasn't opted in via the sentinel.\n * Never throws for \"expected\" skips; only throws on schema validation or I/O\n * errors that callers actually need to surface.\n */\nexport async function runCodexMaterialize(\n  options: RunMaterializeOptions,\n): Promise<MaterializeResult | null> {\n  const cfg = options.config;\n  if (!cfg.codexMaterializeMemories) {\n    log.debug(`[codex-materialize] skipped — codexMaterializeMemories=false`);\n    return null;\n  }\n\n  // Per-trigger gate: session-end runs must honor codexMaterializeOnSessionEnd.\n  // session-end.sh passes reason=\"session_end\"; when the user has turned off the\n  // session-end trigger we short-circuit here without touching disk.\n  if (options.reason === \"session_end\" && cfg.codexMaterializeOnSessionEnd === false) {\n    log.debug(\n      `[codex-materialize] skipped — session-end disabled via codexMaterializeOnSessionEnd=false`,\n    );\n    return null;\n  }\n\n  const namespace = resolveNamespace(options.namespace, cfg);\n  const memoryDir = options.memoryDir ?? cfg.memoryDir;\n  if (!memoryDir) {\n    log.warn(`[codex-materialize] skipped — no memoryDir available`);\n    return null;\n  }\n\n  let memories: MemoryFile[];\n  if (options.memories) {\n    memories = options.memories;\n  } else {\n    const nsDir = resolveNamespaceDir(memoryDir, namespace, cfg);\n    const storage = new StorageManager(nsDir);\n    try {\n      memories = await storage.readAllMemories();\n    } catch (error) {\n      log.warn(\n        `[codex-materialize] skipped — failed to read memories from ${nsDir}: ${\n          error instanceof Error ? error.message : String(error)\n        }`,\n      );\n      return null;\n    }\n  }\n\n  // Intentionally NOT catching here: per the JSDoc contract above,\n  // schema-validation and I/O errors from `materializeForNamespace` must\n  // surface to callers so they can exit non-zero (CLI) or log + recover\n  // (consolidation post-hook, which has its own narrower try/catch).\n  // Catching everything would make a broken MEMORY.md render look like a\n  // successful skip, and invisible failures are strictly worse than loud\n  // ones for a feature that writes to `~/.codex/memories`.\n  const result = materializeForNamespace(namespace, {\n    memories,\n    codexHome: options.codexHome,\n    maxSummaryTokens: cfg.codexMaterializeMaxSummaryTokens,\n    rolloutRetentionDays: cfg.codexMaterializeRolloutRetentionDays,\n    rolloutSummaries: options.rolloutSummaries,\n    now: options.now,\n  });\n  if (options.reason) {\n    log.debug(\n      `[codex-materialize] ran reason=${options.reason} wrote=${result.wrote} files=${result.filesWritten.length}`,\n    );\n  }\n  return result;\n}\n\n/**\n * Shared helper for post-consolidation materialize hooks.\n *\n * `materializeAfterSemanticConsolidation` and `materializeAfterCausalConsolidation`\n * used to be two nearly-identical copies of this logic; keeping the actual\n * body here means any future guard/logging change happens in one place.\n *\n * The only per-caller knob is `logPrefix`, which is used to tag the\n * non-fatal warning emitted when the materializer throws.\n */\nexport async function runPostConsolidationMaterialize(\n  logPrefix: string,\n  options: PostConsolidationMaterializeOptions,\n): Promise<MaterializeResult | null> {\n  if (!options.config.codexMaterializeMemories) return null;\n  if (!options.config.codexMaterializeOnConsolidation) return null;\n  try {\n    return await runCodexMaterialize({\n      config: options.config,\n      namespace: options.namespace,\n      memories: options.memories,\n      memoryDir: options.memoryDir,\n      codexHome: options.codexHome,\n      rolloutSummaries: options.rolloutSummaries,\n      now: options.now,\n      reason: \"consolidation\",\n    });\n  } catch (error) {\n    log.warn(\n      `${logPrefix} Codex materialize post-hook failed (non-fatal): ${\n        error instanceof Error ? error.message : String(error)\n      }`,\n    );\n    return null;\n  }\n}\n\nfunction resolveNamespace(override: string | undefined, cfg: PluginConfig): string {\n  const requested = (override ?? cfg.codexMaterializeNamespace ?? \"auto\").trim();\n  if (requested.length === 0 || requested === \"auto\") {\n    // When the caller asks for \"auto\", fall back to the configured default\n    // namespace (if any) so storage-root resolution lines up with what\n    // NamespaceStorageRouter would do for the same install.\n    return cfg.defaultNamespace && cfg.defaultNamespace.length > 0\n      ? cfg.defaultNamespace\n      : \"default\";\n  }\n  return requested;\n}\n\n/**\n * Resolve the on-disk storage root for a namespace, matching\n * `NamespaceStorageRouter` in `packages/remnic-core/src/namespaces/storage.ts`.\n *\n * Contract:\n *  - When namespaces are disabled, every namespace maps to `memoryDir` itself.\n *  - When namespaces are enabled, non-default namespaces always live under\n *    `memoryDir/namespaces/<namespace>`.\n *  - The default namespace prefers `memoryDir/namespaces/<defaultNamespace>`\n *    when that directory already exists (migrated install); otherwise it\n *    falls back to the legacy `memoryDir` root so materialization does not\n *    silently switch directories out from under an existing install.\n */\nfunction resolveNamespaceDir(\n  memoryDir: string,\n  namespace: string,\n  cfg: PluginConfig,\n): string {\n  if (!cfg.namespacesEnabled) return memoryDir;\n\n  const ns = namespace || cfg.defaultNamespace || \"default\";\n  const namespacedRoot = path.join(memoryDir, \"namespaces\", ns);\n\n  if (ns === cfg.defaultNamespace) {\n    return existsSync(namespacedRoot) ? namespacedRoot : memoryDir;\n  }\n  return namespacedRoot;\n}\n","/**\n * codex-materialize.ts — Codex CLI native memory artifact materialization (#378)\n *\n * Periodically writes Remnic memories into the file layout that Codex CLI's\n * phase-2 consolidation reads directly under `<codex_home>/memories/`:\n *\n *   memory_summary.md                — always-loaded at session start (tight budget)\n *   MEMORY.md                        — searchable handbook (task-group schema)\n *   raw_memories.md                  — mechanical merge of raw memories, latest first\n *   rollout_summaries/<slug>.md      — per-session recaps\n *\n * Codex's own read path is agnostic to which producer wrote these files — it\n * tags reads by `memory_md` / `memory_summary` / `raw_memories` /\n * `rollout_summaries` / `skills`. By materializing Remnic content into this\n * exact layout we let Codex pick up Remnic memories without a single MCP call.\n *\n * Safety invariants\n * ─────────────────\n *  - **Atomic writes.** Every file is rendered under `.remnic-tmp/` and then\n *    `rename()`d into place so Codex never observes a half-written file.\n *  - **Sentinel-based opt-in.** If `<codex_home>/memories/.remnic-managed` is\n *    missing, we SKIP materialization entirely and log a warning. This honors\n *    user hand-edits to the directory — a user who manually curated their\n *    Codex memory layout will never have those edits overwritten.\n *  - **Schema validation.** `MEMORY.md` content is validated against the\n *    task-group schema before write. Invalid content throws and nothing is\n *    written.\n *  - **Idempotent no-ops.** A content hash is written into the sentinel. If\n *    the re-rendered hash matches the previous run, we skip writes entirely.\n *  - **Token budget.** `memory_summary.md` is truncated to fit under the\n *    configured token budget (whitespace-tokenized approximation), leaving\n *    headroom under Codex's 5000-token summary cap.\n *\n * Privacy\n * ───────\n * This module does not persist any user content outside `<codex_home>/memories`\n * — it only mirrors the memories that Remnic already wrote. It does not log\n * memory content to stdout; it logs file names, counts, and hashes.\n */\n\nimport {\n  createHash,\n} from \"node:crypto\";\nimport {\n  existsSync,\n  mkdirSync,\n  readdirSync,\n  readFileSync,\n  renameSync,\n  rmSync,\n  statSync,\n  unlinkSync,\n  writeFileSync,\n} from \"node:fs\";\nimport path from \"node:path\";\n\nimport { log } from \"../logger.js\";\nimport { readEnvVar, resolveHomeDir } from \"../runtime/env.js\";\nimport type { MemoryFile } from \"../types.js\";\n\n// ─── Types ─────────────────────────────────────────────────────────────────\n\n/**\n * Input for {@link materializeForNamespace}. Prefer passing pre-loaded\n * `memories` so this module stays I/O-agnostic and trivially testable.\n */\nexport interface MaterializeOptions {\n  /** Pre-loaded Remnic memories for this namespace (required). */\n  memories: MemoryFile[];\n  /** Override `<codex_home>`. Defaults to `$CODEX_HOME` or `~/.codex`. */\n  codexHome?: string;\n  /** Maximum whitespace-tokenized size of memory_summary.md. Default 4500. */\n  maxSummaryTokens?: number;\n  /** Maximum age of rollout_summaries/*.md in days. Default 30. */\n  rolloutRetentionDays?: number;\n  /** Per-session rollout summaries to render. */\n  rolloutSummaries?: RolloutSummaryInput[];\n  /** Current time, injected for deterministic tests. */\n  now?: Date;\n  /** Optional logger override for tests. */\n  logger?: { info: (msg: string) => void; warn: (msg: string) => void; debug?: (msg: string) => void };\n}\n\n/** Input describing one Codex rollout summary file. */\nexport interface RolloutSummaryInput {\n  /** Stable slug for the file (becomes `<slug>.md`). */\n  slug: string;\n  /** Working directory used during the rollout. */\n  cwd?: string;\n  /** Path to the raw Codex rollout log, if known. */\n  rolloutPath?: string;\n  /** ISO-8601 timestamp of the last update. */\n  updatedAt?: string;\n  /** Opaque thread / session id. */\n  threadId?: string;\n  /** Markdown body for the recap. */\n  body: string;\n  /** Freeform keywords / search hints. */\n  keywords?: string[];\n}\n\n/** Result of a materialization run. */\nexport interface MaterializeResult {\n  /** Namespace that was materialized. */\n  namespace: string;\n  /** `<codex_home>/memories` path this run targeted. */\n  memoriesDir: string;\n  /** Was anything actually written (vs. skipped / idempotent no-op)? */\n  wrote: boolean;\n  /** True if the sentinel was missing and we skipped with a warning. */\n  skippedNoSentinel: boolean;\n  /** True if the hash matched the previous run and we short-circuited. */\n  skippedIdempotent: boolean;\n  /** Files that were written this run (relative to `memoriesDir`). */\n  filesWritten: string[];\n  /** Content hash computed for this run. */\n  contentHash: string;\n}\n\n/** On-disk shape of the `.remnic-managed` sentinel. */\ninterface SentinelFile {\n  version: number;\n  namespace: string;\n  updated_at: string;\n  content_hash: string;\n}\n\n// ─── Constants ─────────────────────────────────────────────────────────────\n\n/** Bump when the on-disk layout or semantics change. */\nexport const MATERIALIZE_VERSION = 1;\n\n/** Sentinel file name at the root of the materialized memories dir. */\nexport const SENTINEL_FILE = \".remnic-managed\";\n\n/** Scratch directory used for atomic renames. */\nexport const TMP_DIR = \".remnic-tmp\";\n\n/** File names we own. Anything else in the directory is considered user-managed. */\nconst OWNED_FILES = new Set<string>([\n  \"memory_summary.md\",\n  \"MEMORY.md\",\n  \"raw_memories.md\",\n]);\n\n/** Sub-directory for per-session rollout recaps. */\nconst ROLLOUT_SUBDIR = \"rollout_summaries\";\n\n// ─── Public entry points ───────────────────────────────────────────────────\n\n/**\n * Materialize a Remnic namespace into Codex's native memory layout.\n *\n * Returns a {@link MaterializeResult} describing what happened. Callers\n * should treat \"skipped\" as success — the sentinel / idempotent cases are\n * expected and intentional.\n *\n * @throws if `MEMORY.md` fails schema validation (we do not write garbage).\n */\nexport function materializeForNamespace(\n  namespace: string,\n  options: MaterializeOptions,\n): MaterializeResult {\n  const logger = options.logger ?? {\n    info: (msg) => log.info(`[codex-materialize] ${msg}`),\n    warn: (msg) => log.warn(`[codex-materialize] ${msg}`),\n    debug: (msg) => log.debug(`[codex-materialize] ${msg}`),\n  };\n  const codexHome = resolveCodexHome(options.codexHome);\n  const memoriesDir = path.join(codexHome, \"memories\");\n  const now = options.now ?? new Date();\n  // Honor `0` as \"no summary budget\" — parseConfig already clamps to non-\n  // negative integers, so any provided number is meaningful. Only fall back\n  // to the default when the caller did not provide the option at all.\n  const maxSummaryTokens =\n    typeof options.maxSummaryTokens === \"number\" && options.maxSummaryTokens >= 0\n      ? options.maxSummaryTokens\n      : 4500;\n  const rolloutRetentionDays =\n    typeof options.rolloutRetentionDays === \"number\" && options.rolloutRetentionDays >= 0\n      ? options.rolloutRetentionDays\n      : 30;\n\n  // ── Sentinel check ─────────────────────────────────────────────────────\n  // We deliberately do NOT `mkdirSync(memoriesDir)` before reading the\n  // sentinel: creating `~/.codex/memories/` for every user (including ones\n  // who never use Codex) would make Remnic's post-consolidation hook leave\n  // empty opt-in directories behind on disk. Instead we only check whether\n  // the sentinel already exists — if the parent dir doesn't exist, the\n  // sentinel can't exist either and we fall straight through to the skip\n  // path without touching the filesystem. The `mkdirSync` for `memoriesDir`\n  // happens later, only once we know we're actually going to write.\n  const sentinelPath = path.join(memoriesDir, SENTINEL_FILE);\n  const existingSentinel = readSentinel(sentinelPath);\n  if (!existingSentinel) {\n    // Log at `debug` when the entire memories dir doesn't exist — that's\n    // the common \"user never opted in\" case and should not be noisy.\n    // Keep the `warn` level only when the dir exists but lacks a sentinel,\n    // which is the \"user hand-curated layout, don't overwrite\" case that\n    // genuinely warrants attention.\n    if (existsSync(memoriesDir)) {\n      logger.warn(\n        `sentinel ${SENTINEL_FILE} missing in ${memoriesDir}; skipping materialization to preserve hand-edits`,\n      );\n    } else {\n      logger.debug?.(\n        `skipping materialization — ${memoriesDir} does not exist (user not opted in)`,\n      );\n    }\n    return {\n      namespace,\n      memoriesDir,\n      wrote: false,\n      skippedNoSentinel: true,\n      skippedIdempotent: false,\n      filesWritten: [],\n      contentHash: \"\",\n    };\n  }\n\n  // Now that we know the user has opted in (sentinel exists), it's safe to\n  // ensure the memories dir is present. In practice this is almost always a\n  // no-op because the sentinel read above already succeeded, but a defensive\n  // mkdirSync protects against a race where the dir was removed between the\n  // sentinel read and the first write.\n  mkdirSync(memoriesDir, { recursive: true });\n\n  // ── Render ─────────────────────────────────────────────────────────────\n  const memories = [...options.memories];\n  // Track whether the caller actually supplied a rollout set. `undefined`\n  // means \"don't touch rollout_summaries/\"; an empty array is still\n  // authoritative and means \"we own this dir and it should be empty\".\n  const rolloutsSupplied = options.rolloutSummaries !== undefined;\n  const rolloutSummaries = options.rolloutSummaries ?? [];\n\n  // Prune-before-render: MEMORY.md and memory_summary.md both embed rollout\n  // filenames in their body, so they must only ever see the *retained* set.\n  // Running pruneRollouts after the renderers (as an earlier revision did)\n  // caused MEMORY.md to list `rollout_summaries/<slug>.md` paths for rollouts\n  // that were then pruned and never written — a broken link pointing at a\n  // ghost file. See review feedback on PR #392.\n  const retainedRollouts = pruneRollouts(rolloutSummaries, rolloutRetentionDays, now);\n\n  // Deduplicate on sanitized filename. Two different slugs (\"Session 1\" and\n  // \"session!!!1\") can sanitize to the same output (\"session-1\"), which would\n  // otherwise make the first entry's tmp file get overwritten and cause the\n  // later rename step to crash with ENOENT. For each collision slot we keep\n  // the entry with the newest `updatedAt` so an unsorted input (or a caller\n  // that accidentally appends older recaps after newer ones) can't have an\n  // older recap clobber a newer one.\n  // We do this at the retained-input level (not just at the written-file\n  // level) so MEMORY.md's \"rollout_summary_files\" section lists each slot\n  // exactly once and matches what actually gets written to disk.\n  const dedupedRollouts: RolloutSummaryInput[] = [];\n  const seenNames = new Map<string, number>();\n  const parseTs = (value: string | undefined): number => {\n    if (!value) return Number.NEGATIVE_INFINITY;\n    const parsed = Date.parse(value);\n    return Number.isFinite(parsed) ? parsed : Number.NEGATIVE_INFINITY;\n  };\n  for (const r of retainedRollouts) {\n    const name = `${sanitizeSlug(r.slug)}.md`;\n    const existingIdx = seenNames.get(name);\n    if (existingIdx === undefined) {\n      seenNames.set(name, dedupedRollouts.length);\n      dedupedRollouts.push(r);\n      continue;\n    }\n    // Newest-wins: only replace the existing entry if the incoming one has a\n    // strictly newer timestamp. Ties keep the earlier entry (stable for\n    // unsorted inputs) because overwriting on ties would flip rendering output\n    // for benign call-order changes.\n    const existing = dedupedRollouts[existingIdx];\n    if (parseTs(r.updatedAt) > parseTs(existing.updatedAt)) {\n      dedupedRollouts[existingIdx] = r;\n    }\n  }\n\n  const memorySummary = renderMemorySummary({\n    namespace,\n    memories,\n    rolloutSummaries: dedupedRollouts,\n    maxTokens: maxSummaryTokens,\n  });\n\n  const memoryMd = renderMemoryMd({\n    namespace,\n    memories,\n    rolloutSummaries: dedupedRollouts,\n  });\n\n  // Fail fast on schema issues — do not write garbage.\n  const validation = validateMemoryMd(memoryMd);\n  if (!validation.valid) {\n    const reason = validation.errors.join(\"; \");\n    logger.warn(`MEMORY.md failed schema validation: ${reason}`);\n    throw new Error(`codex-materialize: MEMORY.md schema validation failed: ${reason}`);\n  }\n\n  const rawMemories = renderRawMemories({ memories });\n\n  const rolloutFiles = dedupedRollouts.map((r) => ({\n    name: `${sanitizeSlug(r.slug)}.md`,\n    body: renderRolloutSummary(r),\n  }));\n\n  // ── Idempotence check ──────────────────────────────────────────────────\n  const hash = computeContentHash({\n    namespace,\n    memorySummary,\n    memoryMd,\n    rawMemories,\n    rolloutFiles,\n  });\n\n  if (existingSentinel.content_hash === hash) {\n    // Idempotence early-return is only safe when the managed files we would\n    // have written are still on disk. If a user or external process deleted\n    // `MEMORY.md` / `memory_summary.md` / `raw_memories.md` (or any retained\n    // rollout file) while the sentinel's hash stayed the same, we must fall\n    // through and rewrite — otherwise Codex would be stuck with missing\n    // artifacts until a memory-content change happens to flip the hash.\n    const requiredFiles = [\n      path.join(memoriesDir, \"memory_summary.md\"),\n      path.join(memoriesDir, \"MEMORY.md\"),\n      path.join(memoriesDir, \"raw_memories.md\"),\n      ...rolloutFiles.map((r) => path.join(memoriesDir, ROLLOUT_SUBDIR, r.name)),\n    ];\n    const allPresent = requiredFiles.every((f) => existsSync(f));\n    if (allPresent) {\n      logger.debug?.(`no-op materialization for namespace=${namespace} (hash unchanged)`);\n      return {\n        namespace,\n        memoriesDir,\n        wrote: false,\n        skippedNoSentinel: false,\n        skippedIdempotent: true,\n        filesWritten: [],\n        contentHash: hash,\n      };\n    }\n    logger.debug?.(\n      `hash unchanged for namespace=${namespace} but managed file missing — forcing rewrite`,\n    );\n  }\n\n  // ── Atomic writes ──────────────────────────────────────────────────────\n  // Use a unique, per-run staging sub-directory so two overlapping runs\n  // (e.g. a session-end trigger overlapping with a consolidation post-hook)\n  // can't stomp each other's tmp files mid-rename. The old \"fixed TMP_DIR,\n  // wipe-on-entry\" layout meant run B would delete run A's staging area out\n  // from under it, causing ENOENT on A's rename loop. Per-run uniqueness\n  // turns the shared dir into an insulated workspace. See review feedback on\n  // PR #392.\n  const runTag = `${process.pid}-${Date.now().toString(36)}-${Math.random().toString(36).slice(2, 10)}`;\n  const tmpDir = path.join(memoriesDir, `${TMP_DIR}-${runTag}`);\n  // Opportunistic GC for stale scratch dirs left behind by a previous\n  // crashed run. We only remove entries whose mtime is older than the\n  // stale-threshold below — that way we never delete another in-flight\n  // run's staging area out from under it. The threshold is deliberately\n  // generous (1h) because a healthy materialize completes in milliseconds\n  // and there's no legitimate reason for a live staging dir to be older.\n  //\n  // NB: we compare against `Date.now()` (wall-clock), not against the\n  // injected `options.now`. Tests and deterministic replays commonly\n  // inject a non-current timestamp, but file mtimes on disk are always\n  // wall-clock, so mixing the two would either false-positive delete\n  // fresh dirs (test-time in the past) or false-negative skip stale ones\n  // (test-time in the future).\n  const TMP_STALE_MS = 60 * 60 * 1000;\n  const wallClockMs = Date.now();\n  try {\n    for (const entry of readdirSync(memoriesDir, { withFileTypes: true })) {\n      if (!entry.isDirectory()) continue;\n      if (!entry.name.startsWith(TMP_DIR)) continue;\n      const stalePath = path.join(memoriesDir, entry.name);\n      try {\n        const stat = statSync(stalePath);\n        if (wallClockMs - stat.mtimeMs < TMP_STALE_MS) continue;\n        rmSync(stalePath, { recursive: true, force: true });\n      } catch {\n        // ignore — another concurrent run may own it, or we lack perms\n      }\n    }\n  } catch {\n    // ignore — dir may not exist yet\n  }\n  mkdirSync(tmpDir, { recursive: true });\n  mkdirSync(path.join(tmpDir, ROLLOUT_SUBDIR), { recursive: true });\n\n  const filesWritten: string[] = [];\n\n  writeFileSync(path.join(tmpDir, \"memory_summary.md\"), memorySummary);\n  filesWritten.push(\"memory_summary.md\");\n\n  writeFileSync(path.join(tmpDir, \"MEMORY.md\"), memoryMd);\n  filesWritten.push(\"MEMORY.md\");\n\n  writeFileSync(path.join(tmpDir, \"raw_memories.md\"), rawMemories);\n  filesWritten.push(\"raw_memories.md\");\n\n  for (const rollout of rolloutFiles) {\n    writeFileSync(path.join(tmpDir, ROLLOUT_SUBDIR, rollout.name), rollout.body);\n    filesWritten.push(path.join(ROLLOUT_SUBDIR, rollout.name));\n  }\n\n  // Rename into place. Atomic per-file is sufficient — Codex reads each file\n  // independently and tolerates an inconsistent in-between snapshot across\n  // files for the duration of the rename loop (milliseconds).\n  for (const rel of [\"memory_summary.md\", \"MEMORY.md\", \"raw_memories.md\"]) {\n    const src = path.join(tmpDir, rel);\n    const dest = path.join(memoriesDir, rel);\n    renameSync(src, dest);\n  }\n\n  const destRolloutsDir = path.join(memoriesDir, ROLLOUT_SUBDIR);\n  mkdirSync(destRolloutsDir, { recursive: true });\n  // Only garbage-collect rollout files when the caller actually supplied a\n  // `rolloutSummaries` array — otherwise we'd wipe legitimately\n  // user/Codex-created recap files on every session-end run, since those\n  // calls typically omit the rollout set entirely. When rollouts were\n  // supplied (even as an empty array — meaning \"we own this dir and it\n  // should be empty\"), we clear the stale files we previously owned.\n  if (rolloutsSupplied) {\n    const retainedRolloutNames = new Set(rolloutFiles.map((r) => r.name));\n    try {\n      for (const entry of readdirSync(destRolloutsDir, { withFileTypes: true })) {\n        if (!entry.isFile()) continue;\n        if (!entry.name.endsWith(\".md\")) continue;\n        if (retainedRolloutNames.has(entry.name)) continue;\n        try {\n          unlinkSync(path.join(destRolloutsDir, entry.name));\n        } catch {\n          // ignore\n        }\n      }\n    } catch {\n      // ignore — directory may not exist yet\n    }\n  }\n\n  for (const rollout of rolloutFiles) {\n    const src = path.join(tmpDir, ROLLOUT_SUBDIR, rollout.name);\n    const dest = path.join(destRolloutsDir, rollout.name);\n    renameSync(src, dest);\n  }\n\n  // Update sentinel last so a crash leaves hash mismatched → next run rewrites.\n  const sentinel: SentinelFile = {\n    version: MATERIALIZE_VERSION,\n    namespace,\n    updated_at: now.toISOString(),\n    content_hash: hash,\n  };\n  writeFileSync(sentinelPath, `${JSON.stringify(sentinel, null, 2)}\\n`);\n\n  try {\n    rmSync(tmpDir, { recursive: true, force: true });\n  } catch {\n    // ignore\n  }\n\n  logger.info(\n    `materialized namespace=${namespace} files=${filesWritten.length} hash=${hash.slice(0, 12)}`,\n  );\n\n  return {\n    namespace,\n    memoriesDir,\n    wrote: true,\n    skippedNoSentinel: false,\n    skippedIdempotent: false,\n    filesWritten,\n    contentHash: hash,\n  };\n}\n\n/**\n * Create (or refresh) the `.remnic-managed` sentinel. Callers must do this\n * explicitly the first time they want Remnic to start managing a directory —\n * we never write it implicitly, because its presence is the user's opt-in.\n */\nexport function ensureSentinel(memoriesDir: string, namespace: string, now: Date = new Date()): void {\n  mkdirSync(memoriesDir, { recursive: true });\n  const sentinelPath = path.join(memoriesDir, SENTINEL_FILE);\n  if (existsSync(sentinelPath)) return;\n  const sentinel: SentinelFile = {\n    version: MATERIALIZE_VERSION,\n    namespace,\n    updated_at: now.toISOString(),\n    content_hash: \"\",\n  };\n  writeFileSync(sentinelPath, `${JSON.stringify(sentinel, null, 2)}\\n`);\n}\n\n// ─── Rendering ─────────────────────────────────────────────────────────────\n\ninterface RenderContext {\n  namespace: string;\n  memories: MemoryFile[];\n  rolloutSummaries: RolloutSummaryInput[];\n  // Historically this interface exposed a `now: Date` field, but neither\n  // `renderMemoryMd` nor `renderMemorySummary` ever read it (rendered output\n  // is purely a function of `namespace`, `memories`, and `rolloutSummaries`).\n  // The field was flagged as dead weight in PR #392 review and removed.\n  // If a future renderer needs a timestamp, re-add it here and update both\n  // call sites and the schema test.\n}\n\ninterface SummaryRenderContext extends RenderContext {\n  maxTokens: number;\n}\n\n/**\n * Render `memory_summary.md` — the always-loaded file.\n * Budget-capped at `maxTokens` whitespace tokens.\n */\nexport function renderMemorySummary(ctx: SummaryRenderContext): string {\n  const lines: string[] = [];\n  lines.push(\"# Memory Summary\");\n  lines.push(\"\");\n  lines.push(`_namespace: ${ctx.namespace}_`);\n  lines.push(`_source: remnic_`);\n  lines.push(\"\");\n\n  const highValue = selectSummaryMemories(ctx.memories, 12);\n  if (highValue.length > 0) {\n    lines.push(\"## Top memories\");\n    lines.push(\"\");\n    for (const mem of highValue) {\n      lines.push(`- ${oneLineSummary(mem)}`);\n    }\n    lines.push(\"\");\n  }\n\n  if (ctx.rolloutSummaries.length > 0) {\n    lines.push(\"## Recent rollouts\");\n    lines.push(\"\");\n    const sorted = [...ctx.rolloutSummaries]\n      .sort((a, b) => (b.updatedAt ?? \"\").localeCompare(a.updatedAt ?? \"\"))\n      .slice(0, 5);\n    for (const r of sorted) {\n      const when = r.updatedAt ? ` (${r.updatedAt})` : \"\";\n      lines.push(`- ${r.slug}${when}`);\n    }\n    lines.push(\"\");\n  }\n\n  const full = lines.join(\"\\n\").replace(/\\n+$/u, \"\\n\");\n  return truncateToTokenBudget(full, ctx.maxTokens);\n}\n\n/**\n * Render `MEMORY.md` — the searchable handbook in Codex's task-group schema.\n */\nexport function renderMemoryMd(ctx: RenderContext): string {\n  const lines: string[] = [];\n  lines.push(`# Task Group: ${ctx.namespace}`);\n  lines.push(`scope: ${ctx.namespace}`);\n  lines.push(`applies_to: cwd=*; reuse_rule=namespace-match`);\n  lines.push(\"\");\n\n  // One \"task\" per top-level topic cluster. For the first cut we group by\n  // memory category so the schema validator always sees at least one task.\n  const byCategory = groupMemoriesByCategory(ctx.memories);\n  let taskIndex = 1;\n  if (byCategory.size === 0) {\n    lines.push(`## Task ${taskIndex}: baseline — no memories yet`);\n    lines.push(\"\");\n    lines.push(\"### rollout_summary_files\");\n    for (const r of ctx.rolloutSummaries) {\n      lines.push(\n        `- rollout_summaries/${sanitizeSlug(r.slug)}.md (cwd=${r.cwd ?? \"*\"}, rollout_path=${r.rolloutPath ?? \"\"}, updated_at=${r.updatedAt ?? \"\"}, thread_id=${r.threadId ?? \"\"})`,\n      );\n    }\n    if (ctx.rolloutSummaries.length === 0) {\n      lines.push(\"- (none)\");\n    }\n    lines.push(\"\");\n    lines.push(\"### keywords\");\n    lines.push(`- ${ctx.namespace}`);\n    lines.push(\"\");\n    taskIndex += 1;\n  } else {\n    for (const [category, mems] of byCategory) {\n      lines.push(`## Task ${taskIndex}: ${category} memories, outcome=surface-to-codex`);\n      lines.push(\"\");\n      lines.push(\"### rollout_summary_files\");\n      const relevantRollouts = ctx.rolloutSummaries.slice(0, 5);\n      if (relevantRollouts.length === 0) {\n        lines.push(\"- (none)\");\n      } else {\n        for (const r of relevantRollouts) {\n          lines.push(\n            `- rollout_summaries/${sanitizeSlug(r.slug)}.md (cwd=${r.cwd ?? \"*\"}, rollout_path=${r.rolloutPath ?? \"\"}, updated_at=${r.updatedAt ?? \"\"}, thread_id=${r.threadId ?? \"\"})`,\n          );\n        }\n      }\n      lines.push(\"\");\n      lines.push(\"### keywords\");\n      const keywords = collectKeywords(mems, category, ctx.namespace);\n      lines.push(`- ${keywords.join(\", \")}`);\n      lines.push(\"\");\n      taskIndex += 1;\n    }\n  }\n\n  lines.push(\"## User preferences\");\n  const prefs = pickCategory(ctx.memories, [\"preference\"]);\n  if (prefs.length === 0) {\n    lines.push(\"- (none recorded)\");\n  } else {\n    for (const pref of prefs.slice(0, 20)) {\n      lines.push(`- ${oneLineSummary(pref)}`);\n    }\n  }\n  lines.push(\"\");\n\n  lines.push(\"## Reusable knowledge\");\n  const knowledge = pickCategory(ctx.memories, [\"fact\", \"decision\", \"principle\", \"rule\", \"skill\"]);\n  if (knowledge.length === 0) {\n    lines.push(\"- (none recorded)\");\n  } else {\n    for (const mem of knowledge.slice(0, 30)) {\n      lines.push(`- ${oneLineSummary(mem)}`);\n    }\n  }\n  lines.push(\"\");\n\n  lines.push(\"## Failures and how to do differently\");\n  const corrections = pickCategory(ctx.memories, [\"correction\"]);\n  if (corrections.length === 0) {\n    lines.push(\"- (none recorded)\");\n  } else {\n    for (const mem of corrections.slice(0, 20)) {\n      lines.push(`- ${oneLineSummary(mem)}`);\n    }\n  }\n  lines.push(\"\");\n\n  return lines.join(\"\\n\");\n}\n\n/** Render `raw_memories.md` — mechanical dump, latest first. */\nexport function renderRawMemories(ctx: { memories: MemoryFile[] }): string {\n  const sorted = [...ctx.memories].sort((a, b) => {\n    const aUpdated = a.frontmatter.updated ?? a.frontmatter.created ?? \"\";\n    const bUpdated = b.frontmatter.updated ?? b.frontmatter.created ?? \"\";\n    return bUpdated.localeCompare(aUpdated);\n  });\n\n  const lines: string[] = [\"# Raw Memories\", \"\", \"_source: remnic — latest first_\", \"\"];\n  for (const mem of sorted) {\n    const fm = mem.frontmatter;\n    const id = fm.id ?? \"unknown\";\n    const category = fm.category ?? \"unknown\";\n    const updated = fm.updated ?? fm.created ?? \"\";\n    lines.push(`## ${id} (${category}, updated=${updated})`);\n    lines.push(\"\");\n    lines.push(mem.content.trim());\n    lines.push(\"\");\n  }\n  return lines.join(\"\\n\");\n}\n\n/** Render a single rollout summary file. */\nexport function renderRolloutSummary(input: RolloutSummaryInput): string {\n  const lines: string[] = [];\n  lines.push(`# Rollout Summary: ${input.slug}`);\n  lines.push(\"\");\n  const meta: string[] = [];\n  if (input.cwd) meta.push(`cwd=${input.cwd}`);\n  if (input.rolloutPath) meta.push(`rollout_path=${input.rolloutPath}`);\n  if (input.updatedAt) meta.push(`updated_at=${input.updatedAt}`);\n  if (input.threadId) meta.push(`thread_id=${input.threadId}`);\n  if (meta.length > 0) {\n    lines.push(`_${meta.join(\"; \")}_`);\n    lines.push(\"\");\n  }\n  if (input.keywords && input.keywords.length > 0) {\n    lines.push(`**keywords:** ${input.keywords.join(\", \")}`);\n    lines.push(\"\");\n  }\n  lines.push(input.body.trim());\n  lines.push(\"\");\n  return lines.join(\"\\n\");\n}\n\n// ─── Schema validation ─────────────────────────────────────────────────────\n\nexport interface MemoryMdValidation {\n  valid: boolean;\n  errors: string[];\n}\n\n/**\n * Validate that a rendered `MEMORY.md` matches Codex's task-group schema.\n * We enforce the minimum set of structural requirements called out in #378:\n *\n *  - one `# Task Group:` header\n *  - `scope:` and `applies_to:` lines directly beneath it\n *  - at least one `## Task N:` section\n *  - each task section has `### rollout_summary_files` and `### keywords`\n *  - `## User preferences`, `## Reusable knowledge`,\n *    `## Failures and how to do differently` sections all present\n */\nexport function validateMemoryMd(content: string): MemoryMdValidation {\n  const errors: string[] = [];\n  const lines = content.split(/\\r?\\n/u);\n\n  const taskGroupIndex = lines.findIndex((l) => /^#\\s+Task Group:\\s+\\S+/u.test(l));\n  if (taskGroupIndex === -1) {\n    errors.push(\"missing `# Task Group:` header\");\n  } else {\n    const tail = lines.slice(taskGroupIndex + 1, taskGroupIndex + 5);\n    if (!tail.some((l) => /^scope:\\s*\\S+/u.test(l))) {\n      errors.push(\"missing `scope:` line under Task Group header\");\n    }\n    if (!tail.some((l) => /^applies_to:\\s*\\S+/u.test(l))) {\n      errors.push(\"missing `applies_to:` line under Task Group header\");\n    }\n  }\n\n  const taskHeaders = lines.filter((l) => /^##\\s+Task\\s+\\d+:/u.test(l));\n  if (taskHeaders.length === 0) {\n    errors.push(\"at least one `## Task N:` section is required\");\n  }\n\n  // For every task section, make sure we have rollout_summary_files + keywords\n  // before the next `##` header at the same level.\n  const sectionRegex = /^##\\s+/u;\n  for (let i = 0; i < lines.length; i++) {\n    if (!/^##\\s+Task\\s+\\d+:/u.test(lines[i])) continue;\n    let hasRollout = false;\n    let hasKeywords = false;\n    for (let j = i + 1; j < lines.length; j++) {\n      if (sectionRegex.test(lines[j])) break;\n      if (/^###\\s+rollout_summary_files\\s*$/u.test(lines[j])) hasRollout = true;\n      if (/^###\\s+keywords\\s*$/u.test(lines[j])) hasKeywords = true;\n    }\n    if (!hasRollout) errors.push(`task block at line ${i + 1} missing \\`### rollout_summary_files\\``);\n    if (!hasKeywords) errors.push(`task block at line ${i + 1} missing \\`### keywords\\``);\n  }\n\n  const requiredSections = [\n    /^##\\s+User preferences\\s*$/u,\n    /^##\\s+Reusable knowledge\\s*$/u,\n    /^##\\s+Failures and how to do differently\\s*$/u,\n  ];\n  for (const re of requiredSections) {\n    if (!lines.some((l) => re.test(l))) {\n      errors.push(`missing required section: ${re.source}`);\n    }\n  }\n\n  return { valid: errors.length === 0, errors };\n}\n\n// ─── Helpers ───────────────────────────────────────────────────────────────\n\nfunction resolveCodexHome(override?: string): string {\n  if (override && override.trim().length > 0) return override;\n  const fromEnv = readEnvVar(\"CODEX_HOME\");\n  if (fromEnv && fromEnv.trim().length > 0) return fromEnv;\n  return path.join(resolveHomeDir(), \".codex\");\n}\n\nfunction readSentinel(sentinelPath: string): SentinelFile | null {\n  if (!existsSync(sentinelPath)) return null;\n  try {\n    const raw = readFileSync(sentinelPath, \"utf-8\");\n    const parsed = JSON.parse(raw) as Partial<SentinelFile>;\n    if (typeof parsed !== \"object\" || parsed === null) return null;\n    return {\n      version: typeof parsed.version === \"number\" ? parsed.version : MATERIALIZE_VERSION,\n      namespace: typeof parsed.namespace === \"string\" ? parsed.namespace : \"\",\n      updated_at: typeof parsed.updated_at === \"string\" ? parsed.updated_at : \"\",\n      content_hash: typeof parsed.content_hash === \"string\" ? parsed.content_hash : \"\",\n    };\n  } catch {\n    return null;\n  }\n}\n\nfunction selectSummaryMemories(memories: MemoryFile[], limit: number): MemoryFile[] {\n  const scored = memories\n    .filter((m) => !m.frontmatter.status || m.frontmatter.status === \"active\")\n    .map((m) => {\n      const confidence = typeof m.frontmatter.confidence === \"number\" ? m.frontmatter.confidence : 0;\n      const importance =\n        typeof m.frontmatter.importance === \"object\" &&\n        m.frontmatter.importance !== null &&\n        typeof (m.frontmatter.importance as { score?: number }).score === \"number\"\n          ? ((m.frontmatter.importance as { score: number }).score ?? 0)\n          : 0;\n      const updated = m.frontmatter.updated ?? m.frontmatter.created ?? \"\";\n      return { memory: m, score: importance * 2 + confidence, updated };\n    });\n\n  scored.sort((a, b) => {\n    if (b.score !== a.score) return b.score - a.score;\n    return b.updated.localeCompare(a.updated);\n  });\n\n  return scored.slice(0, limit).map((s) => s.memory);\n}\n\nfunction oneLineSummary(memory: MemoryFile): string {\n  const raw = memory.content.replace(/\\s+/gu, \" \").trim();\n  if (raw.length <= 160) return raw;\n  return `${raw.slice(0, 157)}...`;\n}\n\nfunction groupMemoriesByCategory(memories: MemoryFile[]): Map<string, MemoryFile[]> {\n  const map = new Map<string, MemoryFile[]>();\n  for (const memory of memories) {\n    if (memory.frontmatter.status && memory.frontmatter.status !== \"active\") continue;\n    const category = memory.frontmatter.category ?? \"unknown\";\n    const list = map.get(category) ?? [];\n    list.push(memory);\n    map.set(category, list);\n  }\n  return map;\n}\n\nfunction pickCategory(memories: MemoryFile[], categories: string[]): MemoryFile[] {\n  const allowed = new Set(categories);\n  return memories.filter(\n    (m) =>\n      (!m.frontmatter.status || m.frontmatter.status === \"active\") &&\n      allowed.has(m.frontmatter.category ?? \"\"),\n  );\n}\n\nfunction collectKeywords(memories: MemoryFile[], category: string, namespace: string): string[] {\n  const keywords = new Set<string>();\n  keywords.add(category);\n  keywords.add(namespace);\n  for (const mem of memories.slice(0, 10)) {\n    for (const tag of mem.frontmatter.tags ?? []) {\n      if (typeof tag === \"string\" && tag.trim().length > 0) keywords.add(tag.trim());\n    }\n  }\n  return [...keywords].slice(0, 16);\n}\n\nfunction pruneRollouts(\n  rollouts: RolloutSummaryInput[],\n  retentionDays: number,\n  now: Date,\n): RolloutSummaryInput[] {\n  // Negative retention → \"infinite retention\" escape hatch. `parseConfig`\n  // clamps the knob to >= 0, so in practice only callers passing a negative\n  // value intentionally get the all-pass behavior.\n  if (retentionDays < 0) return rollouts;\n  // retentionDays === 0 → cutoff is exactly `now`, which prunes every\n  // rollout whose `updatedAt` is in the past (i.e. all of them in practice).\n  // This matches the documented semantics of \"retain for 0 days\".\n  const cutoffMs = now.getTime() - retentionDays * 24 * 60 * 60 * 1000;\n  return rollouts.filter((r) => {\n    if (!r.updatedAt) return true;\n    const t = Date.parse(r.updatedAt);\n    if (!Number.isFinite(t)) return true;\n    return t >= cutoffMs;\n  });\n}\n\nfunction sanitizeSlug(slug: string): string {\n  return slug\n    .toLowerCase()\n    .replace(/[^a-z0-9._-]+/gu, \"-\")\n    .replace(/^-+|-+$/gu, \"\")\n    .slice(0, 96)\n    || \"rollout\";\n}\n\n/**\n * Whitespace-tokenized approximation used by the budget check. Matches the\n * simple heuristic Codex's usage.rs reporting uses for the \"5000 token\"\n * memory_summary cap.\n */\nexport function approximateTokenCount(text: string): number {\n  const trimmed = text.trim();\n  if (trimmed.length === 0) return 0;\n  return trimmed.split(/\\s+/u).length;\n}\n\n/**\n * Truncate `text` so it fits under `maxTokens` whitespace tokens. We drop\n * trailing lines until we're under the budget and then append an ellipsis\n * marker so downstream readers can see that truncation happened.\n */\nexport function truncateToTokenBudget(text: string, maxTokens: number): string {\n  if (maxTokens <= 0) return \"\";\n  if (approximateTokenCount(text) <= maxTokens) return text;\n\n  // Reserve headroom for the truncation marker so the line-preserving path\n  // can actually fit the marker without flipping to the hard-cut fallback.\n  // Both markers are counted with the same whitespace heuristic the budget\n  // check uses, so the arithmetic stays consistent.\n  const lineMarker = \"_[truncated for summary budget]_\";\n  const tailMarker = \"[truncated]\";\n  const lineMarkerTokens = approximateTokenCount(lineMarker);\n  const tailMarkerTokens = approximateTokenCount(tailMarker);\n\n  const lines = text.split(/\\r?\\n/u);\n  const lineBudget = Math.max(0, maxTokens - lineMarkerTokens);\n  while (lines.length > 0 && approximateTokenCount(lines.join(\"\\n\")) > lineBudget) {\n    lines.pop();\n  }\n  lines.push(lineMarker);\n  let result = lines.join(\"\\n\");\n\n  // If a single huge line still blows the budget, hard-cut tokens. Reserve\n  // space for the tail marker's own token count so the final string stays\n  // within maxTokens rather than sneaking over by a few tokens.\n  if (approximateTokenCount(result) > maxTokens) {\n    const tokens = result.split(/\\s+/u);\n    const keep = Math.max(0, maxTokens - tailMarkerTokens);\n    result = keep > 0 ? `${tokens.slice(0, keep).join(\" \")} ${tailMarker}` : tailMarker;\n  }\n  return result;\n}\n\nfunction computeContentHash(input: {\n  namespace: string;\n  memorySummary: string;\n  memoryMd: string;\n  rawMemories: string;\n  rolloutFiles: Array<{ name: string; body: string }>;\n}): string {\n  const hash = createHash(\"sha256\");\n  hash.update(`v${MATERIALIZE_VERSION}\\n`);\n  hash.update(`namespace=${input.namespace}\\n`);\n  hash.update(\"---memory_summary---\\n\");\n  hash.update(input.memorySummary);\n  hash.update(\"\\n---memory_md---\\n\");\n  hash.update(input.memoryMd);\n  hash.update(\"\\n---raw_memories---\\n\");\n  hash.update(input.rawMemories);\n  const sortedRollouts = [...input.rolloutFiles].sort((a, b) => a.name.localeCompare(b.name));\n  for (const r of sortedRollouts) {\n    hash.update(`\\n---rollout:${r.name}---\\n`);\n    hash.update(r.body);\n  }\n  return hash.digest(\"hex\");\n}\n\n// ─── Stat helper for tests / debugging ─────────────────────────────────────\n\n/**\n * Return basic stats about a materialized memories dir. Useful for tests and\n * debug CLI output. Returns `null` if the dir does not exist.\n */\nexport function describeMemoriesDir(memoriesDir: string): {\n  exists: boolean;\n  hasSentinel: boolean;\n  files: string[];\n  sentinel: SentinelFile | null;\n} | null {\n  if (!existsSync(memoriesDir)) return null;\n  const sentinelPath = path.join(memoriesDir, SENTINEL_FILE);\n  const sentinel = readSentinel(sentinelPath);\n  const files: string[] = [];\n  for (const entry of readdirSync(memoriesDir, { withFileTypes: true })) {\n    if (entry.isFile() && OWNED_FILES.has(entry.name)) files.push(entry.name);\n  }\n  const rolloutsDir = path.join(memoriesDir, ROLLOUT_SUBDIR);\n  if (existsSync(rolloutsDir)) {\n    try {\n      for (const entry of readdirSync(rolloutsDir, { withFileTypes: true })) {\n        if (entry.isFile() && entry.name.endsWith(\".md\")) {\n          files.push(path.join(ROLLOUT_SUBDIR, entry.name));\n        }\n      }\n    } catch {\n      // ignore\n    }\n  }\n  return {\n    exists: true,\n    hasSentinel: sentinel !== null,\n    files: files.sort(),\n    sentinel,\n  };\n}\n","/**\n * semantic-consolidation.ts — Semantic Consolidation Engine\n *\n * Finds clusters of semantically similar memories using token overlap,\n * synthesizes canonical versions via LLM, and archives the originals.\n * Reduces memory store bloat while preserving all unique information.\n */\n\nimport type { MemoryFile, PluginConfig } from \"./types.js\";\nimport { normalizeRecallTokens, countRecallTokenOverlap } from \"./recall-tokenization.js\";\nimport { runPostConsolidationMaterialize } from \"./connectors/codex-materialize-runner.js\";\nimport type { MaterializeResult, RolloutSummaryInput } from \"./connectors/codex-materialize.js\";\nimport { discoverMemoryExtensions, renderExtensionsBlock, resolveExtensionsRoot } from \"./memory-extension-host/index.js\";\nimport { log } from \"./logger.js\";\n\n// Re-export resolveExtensionsRoot for backward compatibility — existing\n// consumers that import from semantic-consolidation.ts continue to work.\nexport { resolveExtensionsRoot } from \"./memory-extension-host/index.js\";\n\n// Operator vocabulary (issue #561).  The types and validators live in a\n// standalone `consolidation-operator.ts` module so `storage.ts` can import\n// them without creating a `storage → semantic-consolidation →\n// codex-materialize-runner → storage` cycle.  Re-exported here so existing\n// consumers that reach for `./semantic-consolidation.js` keep working.\nexport {\n  CONSOLIDATION_OPERATORS,\n  isConsolidationOperator,\n  isValidDerivedFromEntry,\n  type ConsolidationOperator,\n} from \"./consolidation-operator.js\";\n\nimport {\n  CONSOLIDATION_OPERATORS as _CONSOLIDATION_OPERATORS,\n  isConsolidationOperator as _isConsolidationOperator,\n  type ConsolidationOperator as _ConsolidationOperator,\n} from \"./consolidation-operator.js\";\n\nexport interface ConsolidationCluster {\n  category: string;\n  memories: MemoryFile[];\n  overlapScore: number;\n  canonicalContent?: string;\n}\n\nexport interface SemanticConsolidationResult {\n  clustersFound: number;\n  memoriesConsolidated: number;\n  memoriesArchived: number;\n  errors: number;\n  clusters: ConsolidationCluster[];\n}\n\n/**\n * Find clusters of semantically similar memories using token overlap.\n */\nexport function findSimilarClusters(\n  memories: MemoryFile[],\n  config: {\n    threshold: number;\n    minClusterSize: number;\n    excludeCategories: string[];\n    maxPerRun: number;\n  },\n): ConsolidationCluster[] {\n  const excluded = new Set(config.excludeCategories);\n\n  // Group by category first\n  const byCategory = new Map<string, MemoryFile[]>();\n  for (const m of memories) {\n    const cat = m.frontmatter.category;\n    if (excluded.has(cat)) continue;\n    if (m.frontmatter.status && m.frontmatter.status !== \"active\") continue;\n    const list = byCategory.get(cat) ?? [];\n    list.push(m);\n    byCategory.set(cat, list);\n  }\n\n  const clusters: ConsolidationCluster[] = [];\n  let totalCandidates = 0;\n\n  for (const [category, mems] of byCategory) {\n    if (totalCandidates >= config.maxPerRun) break;\n\n    // Token-normalize all memories in this category\n    const tokenized = mems.map((m) => ({\n      memory: m,\n      tokens: new Set(normalizeRecallTokens(m.content, [])),\n    }));\n\n    // Track which memories are already clustered\n    const clustered = new Set<string>();\n\n    for (let i = 0; i < tokenized.length && totalCandidates < config.maxPerRun; i++) {\n      if (clustered.has(tokenized[i].memory.frontmatter.id)) continue;\n\n      const cluster: MemoryFile[] = [tokenized[i].memory];\n      let totalOverlap = 0;\n      let comparisons = 0;\n\n      for (let j = i + 1; j < tokenized.length; j++) {\n        if (clustered.has(tokenized[j].memory.frontmatter.id)) continue;\n\n        const aTokens = tokenized[i].tokens;\n        const bTokens = tokenized[j].tokens;\n        if (aTokens.size === 0 || bTokens.size === 0) continue;\n\n        // Bidirectional overlap: what fraction of tokens are shared\n        const overlap = countRecallTokenOverlap(aTokens, [...bTokens].join(\" \"));\n        const maxTokens = Math.max(aTokens.size, bTokens.size);\n        const score = maxTokens > 0 ? overlap / maxTokens : 0;\n\n        if (score >= config.threshold) {\n          cluster.push(tokenized[j].memory);\n          totalOverlap += score;\n          comparisons++;\n          // Enforce maxPerRun within a single cluster\n          if (totalCandidates + cluster.length >= config.maxPerRun) break;\n        }\n      }\n\n      if (cluster.length >= config.minClusterSize) {\n        for (const m of cluster) clustered.add(m.frontmatter.id);\n        clusters.push({\n          category,\n          memories: cluster,\n          overlapScore: comparisons > 0 ? totalOverlap / comparisons : 0,\n        });\n        totalCandidates += cluster.length;\n      }\n    }\n  }\n\n  return clusters;\n}\n\n/**\n * Build the LLM prompt for synthesizing a canonical memory from a cluster.\n */\nexport function buildConsolidationPrompt(cluster: ConsolidationCluster): string {\n  const memoryTexts = cluster.memories\n    .map(\n      (m, i) =>\n        `Memory ${i + 1} (${m.frontmatter.id}, created ${m.frontmatter.created}):\\n${m.content}`,\n    )\n    .join(\"\\n\\n\");\n\n  return `You are a memory consolidation system. The following ${cluster.memories.length} memories in the \"${cluster.category}\" category contain overlapping information.\n\nSynthesize them into ONE canonical memory that:\n1. Preserves ALL unique information from every source memory\n2. Removes redundancy and repetition\n3. Uses clear, concise language\n4. Maintains the same category and tone\n5. Does NOT add information that isn't in the sources\n\n${memoryTexts}\n\nWrite ONLY the consolidated memory content (no metadata, no explanation, no preamble):`;\n}\n\n/**\n * Parse the LLM response to extract the canonical content.\n */\nexport function parseConsolidationResponse(response: string): string {\n  return response.trim();\n}\n\n// ─── Operator-aware prompt / parse (issue #561 PR 3) ─────────────────────────\n\n/**\n * Structured result from an operator-aware consolidation LLM call.\n *\n * - `operator` — the consolidation operator the LLM chose for this cluster.\n *   Falls back to the heuristic default when the LLM omits or returns an\n *   unknown value (the parser never surfaces an invalid operator; see\n *   `parseOperatorAwareConsolidationResponse`).\n * - `output` — the canonical content (same format the legacy prompt\n *   returns).  Callers persist this as the body of the new memory.\n */\nexport interface OperatorAwareConsolidationResult {\n  operator: _ConsolidationOperator;\n  output: string;\n}\n\n/**\n * Heuristic default operator for a cluster.  Used as the fallback when the\n * LLM does not return a parseable operator, and as the \"floor\" decision in\n * `parseOperatorAwareConsolidationResponse`.\n *\n * Current heuristic (kept deliberately conservative — PR 3 only):\n *\n *   - Two or more memories being collapsed into one canonical blob is a\n *     MERGE by definition.  This is the path the current clustering\n *     pipeline exercises.\n *   - A cluster of size 1 that still reaches consolidation (future path,\n *     e.g. supersession of a single older memory by a newer value) is an\n *     UPDATE.\n *   - SPLIT is never selected by the heuristic because the current write\n *     path emits exactly one canonical memory per cluster.  The prompt\n *     reserves SPLIT for future cluster shapes where the LLM decides one\n *     logical source actually encodes several distinct facts — at which\n *     point the orchestrator would need to write multiple outputs.\n */\nexport function chooseConsolidationOperator(\n  cluster: ConsolidationCluster,\n): _ConsolidationOperator {\n  if (cluster.memories.length <= 1) return \"update\";\n  return \"merge\";\n}\n\n/**\n * Build the operator-aware LLM prompt.  The LLM is asked to return a\n * JSON object `{ \"operator\": <split|merge|update>, \"output\": <content> }`.\n *\n * The prompt is additive: it still asks for a single canonical blob under\n * `output`, so the upstream write path does not change.  Future expansions\n * (SPLIT emitting multiple outputs) are explicitly documented as\n * out-of-scope for the parser — `parseOperatorAwareConsolidationResponse`\n * collapses any SPLIT response into a single canonical output for now.\n */\nexport function buildOperatorAwareConsolidationPrompt(\n  cluster: ConsolidationCluster,\n): string {\n  const memoryTexts = cluster.memories\n    .map(\n      (m, i) =>\n        `Memory ${i + 1} (${m.frontmatter.id}, created ${m.frontmatter.created}):\\n${m.content}`,\n    )\n    .join(\"\\n\\n\");\n\n  return `You are a memory consolidation system.  The following ${cluster.memories.length} memories in the \"${cluster.category}\" category contain overlapping information.\n\nPick exactly ONE consolidation operator for this cluster and return a JSON object.\n\nOperator vocabulary:\n  - \"merge\"  — multiple distinct source memories overlap and should be collapsed into one canonical memory (most common).\n  - \"update\" — one source memory carries a stale value that a newer source supersedes within the same logical fact.\n  - \"split\"  — a single logical source really encodes multiple distinct facts that should be separated (rare; if you pick split, still emit ONE canonical body — the write path will chunk it later).\n\nOutput JSON ONLY, no prose before or after.  The \"operator\" key MUST be set to exactly one of the three strings \"merge\", \"update\", or \"split\" — never a pipe-separated placeholder like \"merge|update|split\".  Example shape:\n  {\n    \"operator\": \"merge\",\n    \"output\": \"<the canonical memory text>\"\n  }\n\nThe \"output\" value must:\n1. Preserve ALL unique information from every source memory\n2. Remove redundancy and repetition\n3. Use clear, concise language\n4. Match the \"${cluster.category}\" category and tone\n5. NOT add information that isn't in the sources\n\n${memoryTexts}\n\nReturn ONLY the JSON object:`;\n}\n\n/**\n * Parse an operator-aware consolidation response.\n *\n * Contract:\n *   - Accepts strict JSON `{ \"operator\": \"...\", \"output\": \"...\" }`.\n *   - Tolerates a JSON payload wrapped in a fenced code block (```json ...```).\n *   - Falls back to the heuristic operator when the JSON is malformed,\n *     the `operator` field is missing / unknown, or the raw response is\n *     a plain blob with no JSON at all.  This keeps PR 3 backwards\n *     compatible with older models that ignore the JSON instruction.\n *   - Never throws.  A missing / empty `output` field falls back to the\n *     trimmed raw response so the caller still writes something rather\n *     than dropping the cluster.\n */\nexport function parseOperatorAwareConsolidationResponse(\n  response: string,\n  cluster: ConsolidationCluster,\n): OperatorAwareConsolidationResult {\n  const fallback: OperatorAwareConsolidationResult = {\n    operator: chooseConsolidationOperator(cluster),\n    output: response.trim(),\n  };\n\n  const trimmed = response.trim();\n  if (trimmed.length === 0) return fallback;\n\n  // Strip a fenced code block if present.\n  const fenced = /^```(?:json)?\\s*([\\s\\S]*?)```\\s*$/u.exec(trimmed);\n  const payload = fenced ? fenced[1].trim() : trimmed;\n\n  // Find a balanced brace-delimited JSON object that has an `operator`\n  // key (PR #632 round-4 review, codex P1).  A first/last-brace slice\n  // breaks when the model prepends an earlier brace block (e.g.\n  // `Example: {\"note\":\"...\"} ... {\"operator\":\"merge\",...}`).  Walk the\n  // payload tracking nesting + string/escape state and skip past\n  // objects that don't look like our target shape.\n  const parsed = findLastJsonObjectWithOperator(payload);\n  if (parsed === undefined) return fallback;\n  if (typeof parsed !== \"object\" || parsed === null) return fallback;\n\n  const obj = parsed as Record<string, unknown>;\n  const rawOperator = typeof obj.operator === \"string\" ? obj.operator.trim().toLowerCase() : \"\";\n  const rawOutput = typeof obj.output === \"string\" ? obj.output : \"\";\n\n  const operator = _isConsolidationOperator(rawOperator)\n    ? rawOperator\n    : chooseConsolidationOperator(cluster);\n  const output = rawOutput.trim().length > 0 ? rawOutput.trim() : response.trim();\n\n  return { operator, output };\n}\n\n/**\n * Walk `text`, find all balanced top-level `{ ... }` blocks whose\n * JSON.parse result is an object with an `operator` key, and return\n * the LAST one (function name reflects this — PR #632 review,\n * cursor Low).  Returns `undefined` when nothing matches.  Tracks\n * string state + escape sequences so braces inside string values\n * don't throw off the depth counter.\n *\n * Used by `parseOperatorAwareConsolidationResponse` to tolerate models\n * that prepend an explanatory JSON example block before the real\n * payload (PR #632 round-4 + round-5 review, codex P1).  We take the\n * LAST candidate so that an instructional example with an `operator`\n * key ahead of the real answer doesn't steal precedence — models\n * typically write the example first and the real answer last.\n */\nfunction findLastJsonObjectWithOperator(text: string): unknown {\n  let searchFrom = 0;\n  let last: unknown = undefined;\n  while (searchFrom < text.length) {\n    const start = text.indexOf(\"{\", searchFrom);\n    if (start < 0) return last;\n    let depth = 0;\n    let inString = false;\n    let escape = false;\n    let closed = false;\n    let endIdx = -1;\n    for (let i = start; i < text.length; i++) {\n      const ch = text[i];\n      if (inString) {\n        if (escape) {\n          escape = false;\n        } else if (ch === \"\\\\\") {\n          escape = true;\n        } else if (ch === '\"') {\n          inString = false;\n        }\n        continue;\n      }\n      if (ch === '\"') {\n        inString = true;\n      } else if (ch === \"{\") {\n        depth += 1;\n      } else if (ch === \"}\") {\n        depth -= 1;\n        if (depth === 0) {\n          closed = true;\n          endIdx = i;\n          break;\n        }\n      }\n    }\n    if (!closed) return last;\n    const slice = text.slice(start, endIdx + 1);\n    try {\n      const parsed = JSON.parse(slice);\n      if (\n        typeof parsed === \"object\" &&\n        parsed !== null &&\n        \"operator\" in (parsed as Record<string, unknown>)\n      ) {\n        last = parsed;\n      }\n    } catch {\n      // Fall through to the next candidate.\n    }\n    searchFrom = endIdx + 1;\n  }\n  return last;\n}\n\n// Silence unused-import warnings when tsup tree-shakes: these are used\n// above in chooseConsolidationOperator + parse helpers.\nvoid _CONSOLIDATION_OPERATORS;\n\n/**\n * Discover extensions and build the block to append to a consolidation prompt.\n * Returns \"\" when extensions are disabled or none are found.\n */\nexport async function buildExtensionsBlockForConsolidation(\n  config: PluginConfig,\n): Promise<string> {\n  if (!config.memoryExtensionsEnabled) return \"\";\n  const root = resolveExtensionsRoot(config);\n  const extensions = await discoverMemoryExtensions(root, log);\n  if (extensions.length === 0) return \"\";\n  return renderExtensionsBlock(extensions);\n}\n\n/**\n * Optional post-consolidation hook — materializes the namespace into Codex's\n * native memory layout when the consolidation run finishes. Kept here (rather\n * than in orchestrator.ts) so #378 doesn't conflict with Wave 1 edits.\n *\n * Safe to call regardless of config state: honors `codexMaterializeMemories`\n * and `codexMaterializeOnConsolidation` and silently becomes a no-op when\n * either is disabled.\n */\nexport async function materializeAfterSemanticConsolidation(options: {\n  config: PluginConfig;\n  namespace?: string;\n  memories?: MemoryFile[];\n  memoryDir?: string;\n  codexHome?: string;\n  rolloutSummaries?: RolloutSummaryInput[];\n  now?: Date;\n}): Promise<MaterializeResult | null> {\n  // Delegates to the shared post-consolidation helper so semantic and causal\n  // flows stay in lock-step — any guard/logging change happens in one place.\n  return runPostConsolidationMaterialize(\"[semantic-consolidation]\", options);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AAWA,OAAOA,WAAU;AACjB,SAAS,cAAAC,mBAAkB;;;AC4B3B;AAAA,EACE;AAAA,OACK;AACP;AAAA,EACE;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,OACK;AACP,OAAO,UAAU;AA4EV,IAAM,sBAAsB;AAG5B,IAAM,gBAAgB;AAGtB,IAAM,UAAU;AAGvB,IAAM,cAAc,oBAAI,IAAY;AAAA,EAClC;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAGD,IAAM,iBAAiB;AAahB,SAAS,wBACd,WACA,SACmB;AACnB,QAAM,SAAS,QAAQ,UAAU;AAAA,IAC/B,MAAM,CAAC,QAAQ,IAAI,KAAK,uBAAuB,GAAG,EAAE;AAAA,IACpD,MAAM,CAAC,QAAQ,IAAI,KAAK,uBAAuB,GAAG,EAAE;AAAA,IACpD,OAAO,CAAC,QAAQ,IAAI,MAAM,uBAAuB,GAAG,EAAE;AAAA,EACxD;AACA,QAAM,YAAY,iBAAiB,QAAQ,SAAS;AACpD,QAAM,cAAc,KAAK,KAAK,WAAW,UAAU;AACnD,QAAM,MAAM,QAAQ,OAAO,oBAAI,KAAK;AAIpC,QAAM,mBACJ,OAAO,QAAQ,qBAAqB,YAAY,QAAQ,oBAAoB,IACxE,QAAQ,mBACR;AACN,QAAM,uBACJ,OAAO,QAAQ,yBAAyB,YAAY,QAAQ,wBAAwB,IAChF,QAAQ,uBACR;AAWN,QAAM,eAAe,KAAK,KAAK,aAAa,aAAa;AACzD,QAAM,mBAAmB,aAAa,YAAY;AAClD,MAAI,CAAC,kBAAkB;AAMrB,QAAI,WAAW,WAAW,GAAG;AAC3B,aAAO;AAAA,QACL,YAAY,aAAa,eAAe,WAAW;AAAA,MACrD;AAAA,IACF,OAAO;AACL,aAAO;AAAA,QACL,mCAA8B,WAAW;AAAA,MAC3C;AAAA,IACF;AACA,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP,mBAAmB;AAAA,MACnB,mBAAmB;AAAA,MACnB,cAAc,CAAC;AAAA,MACf,aAAa;AAAA,IACf;AAAA,EACF;AAOA,YAAU,aAAa,EAAE,WAAW,KAAK,CAAC;AAG1C,QAAM,WAAW,CAAC,GAAG,QAAQ,QAAQ;AAIrC,QAAM,mBAAmB,QAAQ,qBAAqB;AACtD,QAAM,mBAAmB,QAAQ,oBAAoB,CAAC;AAQtD,QAAM,mBAAmB,cAAc,kBAAkB,sBAAsB,GAAG;AAYlF,QAAM,kBAAyC,CAAC;AAChD,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,UAAU,CAAC,UAAsC;AACrD,QAAI,CAAC,MAAO,QAAO,OAAO;AAC1B,UAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,WAAO,OAAO,SAAS,MAAM,IAAI,SAAS,OAAO;AAAA,EACnD;AACA,aAAW,KAAK,kBAAkB;AAChC,UAAM,OAAO,GAAG,aAAa,EAAE,IAAI,CAAC;AACpC,UAAM,cAAc,UAAU,IAAI,IAAI;AACtC,QAAI,gBAAgB,QAAW;AAC7B,gBAAU,IAAI,MAAM,gBAAgB,MAAM;AAC1C,sBAAgB,KAAK,CAAC;AACtB;AAAA,IACF;AAKA,UAAM,WAAW,gBAAgB,WAAW;AAC5C,QAAI,QAAQ,EAAE,SAAS,IAAI,QAAQ,SAAS,SAAS,GAAG;AACtD,sBAAgB,WAAW,IAAI;AAAA,IACjC;AAAA,EACF;AAEA,QAAM,gBAAgB,oBAAoB;AAAA,IACxC;AAAA,IACA;AAAA,IACA,kBAAkB;AAAA,IAClB,WAAW;AAAA,EACb,CAAC;AAED,QAAM,WAAW,eAAe;AAAA,IAC9B;AAAA,IACA;AAAA,IACA,kBAAkB;AAAA,EACpB,CAAC;AAGD,QAAM,aAAa,iBAAiB,QAAQ;AAC5C,MAAI,CAAC,WAAW,OAAO;AACrB,UAAM,SAAS,WAAW,OAAO,KAAK,IAAI;AAC1C,WAAO,KAAK,uCAAuC,MAAM,EAAE;AAC3D,UAAM,IAAI,MAAM,0DAA0D,MAAM,EAAE;AAAA,EACpF;AAEA,QAAM,cAAc,kBAAkB,EAAE,SAAS,CAAC;AAElD,QAAM,eAAe,gBAAgB,IAAI,CAAC,OAAO;AAAA,IAC/C,MAAM,GAAG,aAAa,EAAE,IAAI,CAAC;AAAA,IAC7B,MAAM,qBAAqB,CAAC;AAAA,EAC9B,EAAE;AAGF,QAAM,OAAO,mBAAmB;AAAA,IAC9B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,CAAC;AAED,MAAI,iBAAiB,iBAAiB,MAAM;AAO1C,UAAM,gBAAgB;AAAA,MACpB,KAAK,KAAK,aAAa,mBAAmB;AAAA,MAC1C,KAAK,KAAK,aAAa,WAAW;AAAA,MAClC,KAAK,KAAK,aAAa,iBAAiB;AAAA,MACxC,GAAG,aAAa,IAAI,CAAC,MAAM,KAAK,KAAK,aAAa,gBAAgB,EAAE,IAAI,CAAC;AAAA,IAC3E;AACA,UAAM,aAAa,cAAc,MAAM,CAAC,MAAM,WAAW,CAAC,CAAC;AAC3D,QAAI,YAAY;AACd,aAAO,QAAQ,uCAAuC,SAAS,mBAAmB;AAClF,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,OAAO;AAAA,QACP,mBAAmB;AAAA,QACnB,mBAAmB;AAAA,QACnB,cAAc,CAAC;AAAA,QACf,aAAa;AAAA,MACf;AAAA,IACF;AACA,WAAO;AAAA,MACL,gCAAgC,SAAS;AAAA,IAC3C;AAAA,EACF;AAUA,QAAM,SAAS,GAAG,QAAQ,GAAG,IAAI,KAAK,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,KAAK,OAAO,EAAE,SAAS,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC;AACnG,QAAM,SAAS,KAAK,KAAK,aAAa,GAAG,OAAO,IAAI,MAAM,EAAE;AAc5D,QAAM,eAAe,KAAK,KAAK;AAC/B,QAAM,cAAc,KAAK,IAAI;AAC7B,MAAI;AACF,eAAW,SAAS,YAAY,aAAa,EAAE,eAAe,KAAK,CAAC,GAAG;AACrE,UAAI,CAAC,MAAM,YAAY,EAAG;AAC1B,UAAI,CAAC,MAAM,KAAK,WAAW,OAAO,EAAG;AACrC,YAAM,YAAY,KAAK,KAAK,aAAa,MAAM,IAAI;AACnD,UAAI;AACF,cAAM,OAAO,SAAS,SAAS;AAC/B,YAAI,cAAc,KAAK,UAAU,aAAc;AAC/C,eAAO,WAAW,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,MACpD,QAAQ;AAAA,MAER;AAAA,IACF;AAAA,EACF,QAAQ;AAAA,EAER;AACA,YAAU,QAAQ,EAAE,WAAW,KAAK,CAAC;AACrC,YAAU,KAAK,KAAK,QAAQ,cAAc,GAAG,EAAE,WAAW,KAAK,CAAC;AAEhE,QAAM,eAAyB,CAAC;AAEhC,gBAAc,KAAK,KAAK,QAAQ,mBAAmB,GAAG,aAAa;AACnE,eAAa,KAAK,mBAAmB;AAErC,gBAAc,KAAK,KAAK,QAAQ,WAAW,GAAG,QAAQ;AACtD,eAAa,KAAK,WAAW;AAE7B,gBAAc,KAAK,KAAK,QAAQ,iBAAiB,GAAG,WAAW;AAC/D,eAAa,KAAK,iBAAiB;AAEnC,aAAW,WAAW,cAAc;AAClC,kBAAc,KAAK,KAAK,QAAQ,gBAAgB,QAAQ,IAAI,GAAG,QAAQ,IAAI;AAC3E,iBAAa,KAAK,KAAK,KAAK,gBAAgB,QAAQ,IAAI,CAAC;AAAA,EAC3D;AAKA,aAAW,OAAO,CAAC,qBAAqB,aAAa,iBAAiB,GAAG;AACvE,UAAM,MAAM,KAAK,KAAK,QAAQ,GAAG;AACjC,UAAM,OAAO,KAAK,KAAK,aAAa,GAAG;AACvC,eAAW,KAAK,IAAI;AAAA,EACtB;AAEA,QAAM,kBAAkB,KAAK,KAAK,aAAa,cAAc;AAC7D,YAAU,iBAAiB,EAAE,WAAW,KAAK,CAAC;AAO9C,MAAI,kBAAkB;AACpB,UAAM,uBAAuB,IAAI,IAAI,aAAa,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC;AACpE,QAAI;AACF,iBAAW,SAAS,YAAY,iBAAiB,EAAE,eAAe,KAAK,CAAC,GAAG;AACzE,YAAI,CAAC,MAAM,OAAO,EAAG;AACrB,YAAI,CAAC,MAAM,KAAK,SAAS,KAAK,EAAG;AACjC,YAAI,qBAAqB,IAAI,MAAM,IAAI,EAAG;AAC1C,YAAI;AACF,qBAAW,KAAK,KAAK,iBAAiB,MAAM,IAAI,CAAC;AAAA,QACnD,QAAQ;AAAA,QAER;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AAEA,aAAW,WAAW,cAAc;AAClC,UAAM,MAAM,KAAK,KAAK,QAAQ,gBAAgB,QAAQ,IAAI;AAC1D,UAAM,OAAO,KAAK,KAAK,iBAAiB,QAAQ,IAAI;AACpD,eAAW,KAAK,IAAI;AAAA,EACtB;AAGA,QAAM,WAAyB;AAAA,IAC7B,SAAS;AAAA,IACT;AAAA,IACA,YAAY,IAAI,YAAY;AAAA,IAC5B,cAAc;AAAA,EAChB;AACA,gBAAc,cAAc,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAAA,CAAI;AAEpE,MAAI;AACF,WAAO,QAAQ,EAAE,WAAW,MAAM,OAAO,KAAK,CAAC;AAAA,EACjD,QAAQ;AAAA,EAER;AAEA,SAAO;AAAA,IACL,0BAA0B,SAAS,UAAU,aAAa,MAAM,SAAS,KAAK,MAAM,GAAG,EAAE,CAAC;AAAA,EAC5F;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,mBAAmB;AAAA,IACnB,mBAAmB;AAAA,IACnB;AAAA,IACA,aAAa;AAAA,EACf;AACF;AAOO,SAAS,eAAe,aAAqB,WAAmB,MAAY,oBAAI,KAAK,GAAS;AACnG,YAAU,aAAa,EAAE,WAAW,KAAK,CAAC;AAC1C,QAAM,eAAe,KAAK,KAAK,aAAa,aAAa;AACzD,MAAI,WAAW,YAAY,EAAG;AAC9B,QAAM,WAAyB;AAAA,IAC7B,SAAS;AAAA,IACT;AAAA,IACA,YAAY,IAAI,YAAY;AAAA,IAC5B,cAAc;AAAA,EAChB;AACA,gBAAc,cAAc,GAAG,KAAK,UAAU,UAAU,MAAM,CAAC,CAAC;AAAA,CAAI;AACtE;AAwBO,SAAS,oBAAoB,KAAmC;AACrE,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,kBAAkB;AAC7B,QAAM,KAAK,EAAE;AACb,QAAM,KAAK,eAAe,IAAI,SAAS,GAAG;AAC1C,QAAM,KAAK,kBAAkB;AAC7B,QAAM,KAAK,EAAE;AAEb,QAAM,YAAY,sBAAsB,IAAI,UAAU,EAAE;AACxD,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM,KAAK,iBAAiB;AAC5B,UAAM,KAAK,EAAE;AACb,eAAW,OAAO,WAAW;AAC3B,YAAM,KAAK,KAAK,eAAe,GAAG,CAAC,EAAE;AAAA,IACvC;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,MAAI,IAAI,iBAAiB,SAAS,GAAG;AACnC,UAAM,KAAK,oBAAoB;AAC/B,UAAM,KAAK,EAAE;AACb,UAAM,SAAS,CAAC,GAAG,IAAI,gBAAgB,EACpC,KAAK,CAAC,GAAG,OAAO,EAAE,aAAa,IAAI,cAAc,EAAE,aAAa,EAAE,CAAC,EACnE,MAAM,GAAG,CAAC;AACb,eAAW,KAAK,QAAQ;AACtB,YAAM,OAAO,EAAE,YAAY,KAAK,EAAE,SAAS,MAAM;AACjD,YAAM,KAAK,KAAK,EAAE,IAAI,GAAG,IAAI,EAAE;AAAA,IACjC;AACA,UAAM,KAAK,EAAE;AAAA,EACf;AAEA,QAAM,OAAO,MAAM,KAAK,IAAI,EAAE,QAAQ,SAAS,IAAI;AACnD,SAAO,sBAAsB,MAAM,IAAI,SAAS;AAClD;AAKO,SAAS,eAAe,KAA4B;AACzD,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,iBAAiB,IAAI,SAAS,EAAE;AAC3C,QAAM,KAAK,UAAU,IAAI,SAAS,EAAE;AACpC,QAAM,KAAK,+CAA+C;AAC1D,QAAM,KAAK,EAAE;AAIb,QAAM,aAAa,wBAAwB,IAAI,QAAQ;AACvD,MAAI,YAAY;AAChB,MAAI,WAAW,SAAS,GAAG;AACzB,UAAM,KAAK,WAAW,SAAS,mCAA8B;AAC7D,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,2BAA2B;AACtC,eAAW,KAAK,IAAI,kBAAkB;AACpC,YAAM;AAAA,QACJ,uBAAuB,aAAa,EAAE,IAAI,CAAC,YAAY,EAAE,OAAO,GAAG,kBAAkB,EAAE,eAAe,EAAE,gBAAgB,EAAE,aAAa,EAAE,eAAe,EAAE,YAAY,EAAE;AAAA,MAC1K;AAAA,IACF;AACA,QAAI,IAAI,iBAAiB,WAAW,GAAG;AACrC,YAAM,KAAK,UAAU;AAAA,IACvB;AACA,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,cAAc;AACzB,UAAM,KAAK,KAAK,IAAI,SAAS,EAAE;AAC/B,UAAM,KAAK,EAAE;AACb,iBAAa;AAAA,EACf,OAAO;AACL,eAAW,CAAC,UAAU,IAAI,KAAK,YAAY;AACzC,YAAM,KAAK,WAAW,SAAS,KAAK,QAAQ,qCAAqC;AACjF,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,2BAA2B;AACtC,YAAM,mBAAmB,IAAI,iBAAiB,MAAM,GAAG,CAAC;AACxD,UAAI,iBAAiB,WAAW,GAAG;AACjC,cAAM,KAAK,UAAU;AAAA,MACvB,OAAO;AACL,mBAAW,KAAK,kBAAkB;AAChC,gBAAM;AAAA,YACJ,uBAAuB,aAAa,EAAE,IAAI,CAAC,YAAY,EAAE,OAAO,GAAG,kBAAkB,EAAE,eAAe,EAAE,gBAAgB,EAAE,aAAa,EAAE,eAAe,EAAE,YAAY,EAAE;AAAA,UAC1K;AAAA,QACF;AAAA,MACF;AACA,YAAM,KAAK,EAAE;AACb,YAAM,KAAK,cAAc;AACzB,YAAM,WAAW,gBAAgB,MAAM,UAAU,IAAI,SAAS;AAC9D,YAAM,KAAK,KAAK,SAAS,KAAK,IAAI,CAAC,EAAE;AACrC,YAAM,KAAK,EAAE;AACb,mBAAa;AAAA,IACf;AAAA,EACF;AAEA,QAAM,KAAK,qBAAqB;AAChC,QAAM,QAAQ,aAAa,IAAI,UAAU,CAAC,YAAY,CAAC;AACvD,MAAI,MAAM,WAAW,GAAG;AACtB,UAAM,KAAK,mBAAmB;AAAA,EAChC,OAAO;AACL,eAAW,QAAQ,MAAM,MAAM,GAAG,EAAE,GAAG;AACrC,YAAM,KAAK,KAAK,eAAe,IAAI,CAAC,EAAE;AAAA,IACxC;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,uBAAuB;AAClC,QAAM,YAAY,aAAa,IAAI,UAAU,CAAC,QAAQ,YAAY,aAAa,QAAQ,OAAO,CAAC;AAC/F,MAAI,UAAU,WAAW,GAAG;AAC1B,UAAM,KAAK,mBAAmB;AAAA,EAChC,OAAO;AACL,eAAW,OAAO,UAAU,MAAM,GAAG,EAAE,GAAG;AACxC,YAAM,KAAK,KAAK,eAAe,GAAG,CAAC,EAAE;AAAA,IACvC;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AAEb,QAAM,KAAK,uCAAuC;AAClD,QAAM,cAAc,aAAa,IAAI,UAAU,CAAC,YAAY,CAAC;AAC7D,MAAI,YAAY,WAAW,GAAG;AAC5B,UAAM,KAAK,mBAAmB;AAAA,EAChC,OAAO;AACL,eAAW,OAAO,YAAY,MAAM,GAAG,EAAE,GAAG;AAC1C,YAAM,KAAK,KAAK,eAAe,GAAG,CAAC,EAAE;AAAA,IACvC;AAAA,EACF;AACA,QAAM,KAAK,EAAE;AAEb,SAAO,MAAM,KAAK,IAAI;AACxB;AAGO,SAAS,kBAAkB,KAAyC;AACzE,QAAM,SAAS,CAAC,GAAG,IAAI,QAAQ,EAAE,KAAK,CAAC,GAAG,MAAM;AAC9C,UAAM,WAAW,EAAE,YAAY,WAAW,EAAE,YAAY,WAAW;AACnE,UAAM,WAAW,EAAE,YAAY,WAAW,EAAE,YAAY,WAAW;AACnE,WAAO,SAAS,cAAc,QAAQ;AAAA,EACxC,CAAC;AAED,QAAM,QAAkB,CAAC,kBAAkB,IAAI,wCAAmC,EAAE;AACpF,aAAW,OAAO,QAAQ;AACxB,UAAM,KAAK,IAAI;AACf,UAAM,KAAK,GAAG,MAAM;AACpB,UAAM,WAAW,GAAG,YAAY;AAChC,UAAM,UAAU,GAAG,WAAW,GAAG,WAAW;AAC5C,UAAM,KAAK,MAAM,EAAE,KAAK,QAAQ,aAAa,OAAO,GAAG;AACvD,UAAM,KAAK,EAAE;AACb,UAAM,KAAK,IAAI,QAAQ,KAAK,CAAC;AAC7B,UAAM,KAAK,EAAE;AAAA,EACf;AACA,SAAO,MAAM,KAAK,IAAI;AACxB;AAGO,SAAS,qBAAqB,OAAoC;AACvE,QAAM,QAAkB,CAAC;AACzB,QAAM,KAAK,sBAAsB,MAAM,IAAI,EAAE;AAC7C,QAAM,KAAK,EAAE;AACb,QAAM,OAAiB,CAAC;AACxB,MAAI,MAAM,IAAK,MAAK,KAAK,OAAO,MAAM,GAAG,EAAE;AAC3C,MAAI,MAAM,YAAa,MAAK,KAAK,gBAAgB,MAAM,WAAW,EAAE;AACpE,MAAI,MAAM,UAAW,MAAK,KAAK,cAAc,MAAM,SAAS,EAAE;AAC9D,MAAI,MAAM,SAAU,MAAK,KAAK,aAAa,MAAM,QAAQ,EAAE;AAC3D,MAAI,KAAK,SAAS,GAAG;AACnB,UAAM,KAAK,IAAI,KAAK,KAAK,IAAI,CAAC,GAAG;AACjC,UAAM,KAAK,EAAE;AAAA,EACf;AACA,MAAI,MAAM,YAAY,MAAM,SAAS,SAAS,GAAG;AAC/C,UAAM,KAAK,iBAAiB,MAAM,SAAS,KAAK,IAAI,CAAC,EAAE;AACvD,UAAM,KAAK,EAAE;AAAA,EACf;AACA,QAAM,KAAK,MAAM,KAAK,KAAK,CAAC;AAC5B,QAAM,KAAK,EAAE;AACb,SAAO,MAAM,KAAK,IAAI;AACxB;AAoBO,SAAS,iBAAiB,SAAqC;AACpE,QAAM,SAAmB,CAAC;AAC1B,QAAM,QAAQ,QAAQ,MAAM,QAAQ;AAEpC,QAAM,iBAAiB,MAAM,UAAU,CAAC,MAAM,0BAA0B,KAAK,CAAC,CAAC;AAC/E,MAAI,mBAAmB,IAAI;AACzB,WAAO,KAAK,gCAAgC;AAAA,EAC9C,OAAO;AACL,UAAM,OAAO,MAAM,MAAM,iBAAiB,GAAG,iBAAiB,CAAC;AAC/D,QAAI,CAAC,KAAK,KAAK,CAAC,MAAM,iBAAiB,KAAK,CAAC,CAAC,GAAG;AAC/C,aAAO,KAAK,+CAA+C;AAAA,IAC7D;AACA,QAAI,CAAC,KAAK,KAAK,CAAC,MAAM,sBAAsB,KAAK,CAAC,CAAC,GAAG;AACpD,aAAO,KAAK,oDAAoD;AAAA,IAClE;AAAA,EACF;AAEA,QAAM,cAAc,MAAM,OAAO,CAAC,MAAM,qBAAqB,KAAK,CAAC,CAAC;AACpE,MAAI,YAAY,WAAW,GAAG;AAC5B,WAAO,KAAK,+CAA+C;AAAA,EAC7D;AAIA,QAAM,eAAe;AACrB,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,CAAC,qBAAqB,KAAK,MAAM,CAAC,CAAC,EAAG;AAC1C,QAAI,aAAa;AACjB,QAAI,cAAc;AAClB,aAAS,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACzC,UAAI,aAAa,KAAK,MAAM,CAAC,CAAC,EAAG;AACjC,UAAI,oCAAoC,KAAK,MAAM,CAAC,CAAC,EAAG,cAAa;AACrE,UAAI,uBAAuB,KAAK,MAAM,CAAC,CAAC,EAAG,eAAc;AAAA,IAC3D;AACA,QAAI,CAAC,WAAY,QAAO,KAAK,sBAAsB,IAAI,CAAC,wCAAwC;AAChG,QAAI,CAAC,YAAa,QAAO,KAAK,sBAAsB,IAAI,CAAC,2BAA2B;AAAA,EACtF;AAEA,QAAM,mBAAmB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,aAAW,MAAM,kBAAkB;AACjC,QAAI,CAAC,MAAM,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,GAAG;AAClC,aAAO,KAAK,6BAA6B,GAAG,MAAM,EAAE;AAAA,IACtD;AAAA,EACF;AAEA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,OAAO;AAC9C;AAIA,SAAS,iBAAiB,UAA2B;AACnD,MAAI,YAAY,SAAS,KAAK,EAAE,SAAS,EAAG,QAAO;AACnD,QAAM,UAAU,WAAW,YAAY;AACvC,MAAI,WAAW,QAAQ,KAAK,EAAE,SAAS,EAAG,QAAO;AACjD,SAAO,KAAK,KAAK,eAAe,GAAG,QAAQ;AAC7C;AAEA,SAAS,aAAa,cAA2C;AAC/D,MAAI,CAAC,WAAW,YAAY,EAAG,QAAO;AACtC,MAAI;AACF,UAAM,MAAM,aAAa,cAAc,OAAO;AAC9C,UAAM,SAAS,KAAK,MAAM,GAAG;AAC7B,QAAI,OAAO,WAAW,YAAY,WAAW,KAAM,QAAO;AAC1D,WAAO;AAAA,MACL,SAAS,OAAO,OAAO,YAAY,WAAW,OAAO,UAAU;AAAA,MAC/D,WAAW,OAAO,OAAO,cAAc,WAAW,OAAO,YAAY;AAAA,MACrE,YAAY,OAAO,OAAO,eAAe,WAAW,OAAO,aAAa;AAAA,MACxE,cAAc,OAAO,OAAO,iBAAiB,WAAW,OAAO,eAAe;AAAA,IAChF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAEA,SAAS,sBAAsB,UAAwB,OAA6B;AAClF,QAAM,SAAS,SACZ,OAAO,CAAC,MAAM,CAAC,EAAE,YAAY,UAAU,EAAE,YAAY,WAAW,QAAQ,EACxE,IAAI,CAAC,MAAM;AACV,UAAM,aAAa,OAAO,EAAE,YAAY,eAAe,WAAW,EAAE,YAAY,aAAa;AAC7F,UAAM,aACJ,OAAO,EAAE,YAAY,eAAe,YACpC,EAAE,YAAY,eAAe,QAC7B,OAAQ,EAAE,YAAY,WAAkC,UAAU,WAC5D,EAAE,YAAY,WAAiC,SAAS,IAC1D;AACN,UAAM,UAAU,EAAE,YAAY,WAAW,EAAE,YAAY,WAAW;AAClE,WAAO,EAAE,QAAQ,GAAG,OAAO,aAAa,IAAI,YAAY,QAAQ;AAAA,EAClE,CAAC;AAEH,SAAO,KAAK,CAAC,GAAG,MAAM;AACpB,QAAI,EAAE,UAAU,EAAE,MAAO,QAAO,EAAE,QAAQ,EAAE;AAC5C,WAAO,EAAE,QAAQ,cAAc,EAAE,OAAO;AAAA,EAC1C,CAAC;AAED,SAAO,OAAO,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM;AACnD;AAEA,SAAS,eAAe,QAA4B;AAClD,QAAM,MAAM,OAAO,QAAQ,QAAQ,SAAS,GAAG,EAAE,KAAK;AACtD,MAAI,IAAI,UAAU,IAAK,QAAO;AAC9B,SAAO,GAAG,IAAI,MAAM,GAAG,GAAG,CAAC;AAC7B;AAEA,SAAS,wBAAwB,UAAmD;AAClF,QAAM,MAAM,oBAAI,IAA0B;AAC1C,aAAW,UAAU,UAAU;AAC7B,QAAI,OAAO,YAAY,UAAU,OAAO,YAAY,WAAW,SAAU;AACzE,UAAM,WAAW,OAAO,YAAY,YAAY;AAChD,UAAM,OAAO,IAAI,IAAI,QAAQ,KAAK,CAAC;AACnC,SAAK,KAAK,MAAM;AAChB,QAAI,IAAI,UAAU,IAAI;AAAA,EACxB;AACA,SAAO;AACT;AAEA,SAAS,aAAa,UAAwB,YAAoC;AAChF,QAAM,UAAU,IAAI,IAAI,UAAU;AAClC,SAAO,SAAS;AAAA,IACd,CAAC,OACE,CAAC,EAAE,YAAY,UAAU,EAAE,YAAY,WAAW,aACnD,QAAQ,IAAI,EAAE,YAAY,YAAY,EAAE;AAAA,EAC5C;AACF;AAEA,SAAS,gBAAgB,UAAwB,UAAkB,WAA6B;AAC9F,QAAM,WAAW,oBAAI,IAAY;AACjC,WAAS,IAAI,QAAQ;AACrB,WAAS,IAAI,SAAS;AACtB,aAAW,OAAO,SAAS,MAAM,GAAG,EAAE,GAAG;AACvC,eAAW,OAAO,IAAI,YAAY,QAAQ,CAAC,GAAG;AAC5C,UAAI,OAAO,QAAQ,YAAY,IAAI,KAAK,EAAE,SAAS,EAAG,UAAS,IAAI,IAAI,KAAK,CAAC;AAAA,IAC/E;AAAA,EACF;AACA,SAAO,CAAC,GAAG,QAAQ,EAAE,MAAM,GAAG,EAAE;AAClC;AAEA,SAAS,cACP,UACA,eACA,KACuB;AAIvB,MAAI,gBAAgB,EAAG,QAAO;AAI9B,QAAM,WAAW,IAAI,QAAQ,IAAI,gBAAgB,KAAK,KAAK,KAAK;AAChE,SAAO,SAAS,OAAO,CAAC,MAAM;AAC5B,QAAI,CAAC,EAAE,UAAW,QAAO;AACzB,UAAM,IAAI,KAAK,MAAM,EAAE,SAAS;AAChC,QAAI,CAAC,OAAO,SAAS,CAAC,EAAG,QAAO;AAChC,WAAO,KAAK;AAAA,EACd,CAAC;AACH;AAEA,SAAS,aAAa,MAAsB;AAC1C,SAAO,KACJ,YAAY,EACZ,QAAQ,mBAAmB,GAAG,EAC9B,QAAQ,aAAa,EAAE,EACvB,MAAM,GAAG,EAAE,KACT;AACP;AAOO,SAAS,sBAAsB,MAAsB;AAC1D,QAAM,UAAU,KAAK,KAAK;AAC1B,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,SAAO,QAAQ,MAAM,MAAM,EAAE;AAC/B;AAOO,SAAS,sBAAsB,MAAc,WAA2B;AAC7E,MAAI,aAAa,EAAG,QAAO;AAC3B,MAAI,sBAAsB,IAAI,KAAK,UAAW,QAAO;AAMrD,QAAM,aAAa;AACnB,QAAM,aAAa;AACnB,QAAM,mBAAmB,sBAAsB,UAAU;AACzD,QAAM,mBAAmB,sBAAsB,UAAU;AAEzD,QAAM,QAAQ,KAAK,MAAM,QAAQ;AACjC,QAAM,aAAa,KAAK,IAAI,GAAG,YAAY,gBAAgB;AAC3D,SAAO,MAAM,SAAS,KAAK,sBAAsB,MAAM,KAAK,IAAI,CAAC,IAAI,YAAY;AAC/E,UAAM,IAAI;AAAA,EACZ;AACA,QAAM,KAAK,UAAU;AACrB,MAAI,SAAS,MAAM,KAAK,IAAI;AAK5B,MAAI,sBAAsB,MAAM,IAAI,WAAW;AAC7C,UAAM,SAAS,OAAO,MAAM,MAAM;AAClC,UAAM,OAAO,KAAK,IAAI,GAAG,YAAY,gBAAgB;AACrD,aAAS,OAAO,IAAI,GAAG,OAAO,MAAM,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC,IAAI,UAAU,KAAK;AAAA,EAC3E;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,OAMjB;AACT,QAAM,OAAO,WAAW,QAAQ;AAChC,OAAK,OAAO,IAAI,mBAAmB;AAAA,CAAI;AACvC,OAAK,OAAO,aAAa,MAAM,SAAS;AAAA,CAAI;AAC5C,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,MAAM,aAAa;AAC/B,OAAK,OAAO,qBAAqB;AACjC,OAAK,OAAO,MAAM,QAAQ;AAC1B,OAAK,OAAO,wBAAwB;AACpC,OAAK,OAAO,MAAM,WAAW;AAC7B,QAAM,iBAAiB,CAAC,GAAG,MAAM,YAAY,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,KAAK,cAAc,EAAE,IAAI,CAAC;AAC1F,aAAW,KAAK,gBAAgB;AAC9B,SAAK,OAAO;AAAA,aAAgB,EAAE,IAAI;AAAA,CAAO;AACzC,SAAK,OAAO,EAAE,IAAI;AAAA,EACpB;AACA,SAAO,KAAK,OAAO,KAAK;AAC1B;AAQO,SAAS,oBAAoB,aAK3B;AACP,MAAI,CAAC,WAAW,WAAW,EAAG,QAAO;AACrC,QAAM,eAAe,KAAK,KAAK,aAAa,aAAa;AACzD,QAAM,WAAW,aAAa,YAAY;AAC1C,QAAM,QAAkB,CAAC;AACzB,aAAW,SAAS,YAAY,aAAa,EAAE,eAAe,KAAK,CAAC,GAAG;AACrE,QAAI,MAAM,OAAO,KAAK,YAAY,IAAI,MAAM,IAAI,EAAG,OAAM,KAAK,MAAM,IAAI;AAAA,EAC1E;AACA,QAAM,cAAc,KAAK,KAAK,aAAa,cAAc;AACzD,MAAI,WAAW,WAAW,GAAG;AAC3B,QAAI;AACF,iBAAW,SAAS,YAAY,aAAa,EAAE,eAAe,KAAK,CAAC,GAAG;AACrE,YAAI,MAAM,OAAO,KAAK,MAAM,KAAK,SAAS,KAAK,GAAG;AAChD,gBAAM,KAAK,KAAK,KAAK,gBAAgB,MAAM,IAAI,CAAC;AAAA,QAClD;AAAA,MACF;AAAA,IACF,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AAAA,IACL,QAAQ;AAAA,IACR,aAAa,aAAa;AAAA,IAC1B,OAAO,MAAM,KAAK;AAAA,IAClB;AAAA,EACF;AACF;;;AD75BA,eAAsB,oBACpB,SACmC;AACnC,QAAM,MAAM,QAAQ;AACpB,MAAI,CAAC,IAAI,0BAA0B;AACjC,QAAI,MAAM,mEAA8D;AACxE,WAAO;AAAA,EACT;AAKA,MAAI,QAAQ,WAAW,iBAAiB,IAAI,iCAAiC,OAAO;AAClF,QAAI;AAAA,MACF;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,QAAM,YAAY,iBAAiB,QAAQ,WAAW,GAAG;AACzD,QAAM,YAAY,QAAQ,aAAa,IAAI;AAC3C,MAAI,CAAC,WAAW;AACd,QAAI,KAAK,2DAAsD;AAC/D,WAAO;AAAA,EACT;AAEA,MAAI;AACJ,MAAI,QAAQ,UAAU;AACpB,eAAW,QAAQ;AAAA,EACrB,OAAO;AACL,UAAM,QAAQ,oBAAoB,WAAW,WAAW,GAAG;AAC3D,UAAM,UAAU,IAAI,eAAe,KAAK;AACxC,QAAI;AACF,iBAAW,MAAM,QAAQ,gBAAgB;AAAA,IAC3C,SAAS,OAAO;AACd,UAAI;AAAA,QACF,mEAA8D,KAAK,KACjE,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CACvD;AAAA,MACF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AASA,QAAM,SAAS,wBAAwB,WAAW;AAAA,IAChD;AAAA,IACA,WAAW,QAAQ;AAAA,IACnB,kBAAkB,IAAI;AAAA,IACtB,sBAAsB,IAAI;AAAA,IAC1B,kBAAkB,QAAQ;AAAA,IAC1B,KAAK,QAAQ;AAAA,EACf,CAAC;AACD,MAAI,QAAQ,QAAQ;AAClB,QAAI;AAAA,MACF,kCAAkC,QAAQ,MAAM,UAAU,OAAO,KAAK,UAAU,OAAO,aAAa,MAAM;AAAA,IAC5G;AAAA,EACF;AACA,SAAO;AACT;AAYA,eAAsB,gCACpB,WACA,SACmC;AACnC,MAAI,CAAC,QAAQ,OAAO,yBAA0B,QAAO;AACrD,MAAI,CAAC,QAAQ,OAAO,gCAAiC,QAAO;AAC5D,MAAI;AACF,WAAO,MAAM,oBAAoB;AAAA,MAC/B,QAAQ,QAAQ;AAAA,MAChB,WAAW,QAAQ;AAAA,MACnB,UAAU,QAAQ;AAAA,MAClB,WAAW,QAAQ;AAAA,MACnB,WAAW,QAAQ;AAAA,MACnB,kBAAkB,QAAQ;AAAA,MAC1B,KAAK,QAAQ;AAAA,MACb,QAAQ;AAAA,IACV,CAAC;AAAA,EACH,SAAS,OAAO;AACd,QAAI;AAAA,MACF,GAAG,SAAS,oDACV,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CACvD;AAAA,IACF;AACA,WAAO;AAAA,EACT;AACF;AAEA,SAAS,iBAAiB,UAA8B,KAA2B;AACjF,QAAM,aAAa,YAAY,IAAI,6BAA6B,QAAQ,KAAK;AAC7E,MAAI,UAAU,WAAW,KAAK,cAAc,QAAQ;AAIlD,WAAO,IAAI,oBAAoB,IAAI,iBAAiB,SAAS,IACzD,IAAI,mBACJ;AAAA,EACN;AACA,SAAO;AACT;AAeA,SAAS,oBACP,WACA,WACA,KACQ;AACR,MAAI,CAAC,IAAI,kBAAmB,QAAO;AAEnC,QAAM,KAAK,aAAa,IAAI,oBAAoB;AAChD,QAAM,iBAAiBC,MAAK,KAAK,WAAW,cAAc,EAAE;AAE5D,MAAI,OAAO,IAAI,kBAAkB;AAC/B,WAAOC,YAAW,cAAc,IAAI,iBAAiB;AAAA,EACvD;AACA,SAAO;AACT;;;AErJO,SAAS,oBACd,UACA,QAMwB;AACxB,QAAM,WAAW,IAAI,IAAI,OAAO,iBAAiB;AAGjD,QAAM,aAAa,oBAAI,IAA0B;AACjD,aAAW,KAAK,UAAU;AACxB,UAAM,MAAM,EAAE,YAAY;AAC1B,QAAI,SAAS,IAAI,GAAG,EAAG;AACvB,QAAI,EAAE,YAAY,UAAU,EAAE,YAAY,WAAW,SAAU;AAC/D,UAAM,OAAO,WAAW,IAAI,GAAG,KAAK,CAAC;AACrC,SAAK,KAAK,CAAC;AACX,eAAW,IAAI,KAAK,IAAI;AAAA,EAC1B;AAEA,QAAM,WAAmC,CAAC;AAC1C,MAAI,kBAAkB;AAEtB,aAAW,CAAC,UAAU,IAAI,KAAK,YAAY;AACzC,QAAI,mBAAmB,OAAO,UAAW;AAGzC,UAAM,YAAY,KAAK,IAAI,CAAC,OAAO;AAAA,MACjC,QAAQ;AAAA,MACR,QAAQ,IAAI,IAAI,sBAAsB,EAAE,SAAS,CAAC,CAAC,CAAC;AAAA,IACtD,EAAE;AAGF,UAAM,YAAY,oBAAI,IAAY;AAElC,aAAS,IAAI,GAAG,IAAI,UAAU,UAAU,kBAAkB,OAAO,WAAW,KAAK;AAC/E,UAAI,UAAU,IAAI,UAAU,CAAC,EAAE,OAAO,YAAY,EAAE,EAAG;AAEvD,YAAM,UAAwB,CAAC,UAAU,CAAC,EAAE,MAAM;AAClD,UAAI,eAAe;AACnB,UAAI,cAAc;AAElB,eAAS,IAAI,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AAC7C,YAAI,UAAU,IAAI,UAAU,CAAC,EAAE,OAAO,YAAY,EAAE,EAAG;AAEvD,cAAM,UAAU,UAAU,CAAC,EAAE;AAC7B,cAAM,UAAU,UAAU,CAAC,EAAE;AAC7B,YAAI,QAAQ,SAAS,KAAK,QAAQ,SAAS,EAAG;AAG9C,cAAM,UAAU,wBAAwB,SAAS,CAAC,GAAG,OAAO,EAAE,KAAK,GAAG,CAAC;AACvE,cAAM,YAAY,KAAK,IAAI,QAAQ,MAAM,QAAQ,IAAI;AACrD,cAAM,QAAQ,YAAY,IAAI,UAAU,YAAY;AAEpD,YAAI,SAAS,OAAO,WAAW;AAC7B,kBAAQ,KAAK,UAAU,CAAC,EAAE,MAAM;AAChC,0BAAgB;AAChB;AAEA,cAAI,kBAAkB,QAAQ,UAAU,OAAO,UAAW;AAAA,QAC5D;AAAA,MACF;AAEA,UAAI,QAAQ,UAAU,OAAO,gBAAgB;AAC3C,mBAAW,KAAK,QAAS,WAAU,IAAI,EAAE,YAAY,EAAE;AACvD,iBAAS,KAAK;AAAA,UACZ;AAAA,UACA,UAAU;AAAA,UACV,cAAc,cAAc,IAAI,eAAe,cAAc;AAAA,QAC/D,CAAC;AACD,2BAAmB,QAAQ;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAKO,SAAS,yBAAyB,SAAuC;AAC9E,QAAM,cAAc,QAAQ,SACzB;AAAA,IACC,CAAC,GAAG,MACF,UAAU,IAAI,CAAC,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,OAAO;AAAA,EAAO,EAAE,OAAO;AAAA,EAC1F,EACC,KAAK,MAAM;AAEd,SAAO,wDAAwD,QAAQ,SAAS,MAAM,qBAAqB,QAAQ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAS3H,WAAW;AAAA;AAAA;AAGb;AAKO,SAAS,2BAA2B,UAA0B;AACnE,SAAO,SAAS,KAAK;AACvB;AAsCO,SAAS,4BACd,SACwB;AACxB,MAAI,QAAQ,SAAS,UAAU,EAAG,QAAO;AACzC,SAAO;AACT;AAYO,SAAS,sCACd,SACQ;AACR,QAAM,cAAc,QAAQ,SACzB;AAAA,IACC,CAAC,GAAG,MACF,UAAU,IAAI,CAAC,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,OAAO;AAAA,EAAO,EAAE,OAAO;AAAA,EAC1F,EACC,KAAK,MAAM;AAEd,SAAO,yDAAyD,QAAQ,SAAS,MAAM,qBAAqB,QAAQ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gBAmB9G,QAAQ,QAAQ;AAAA;AAAA;AAAA,EAG9B,WAAW;AAAA;AAAA;AAGb;AAgBO,SAAS,wCACd,UACA,SACkC;AAClC,QAAM,WAA6C;AAAA,IACjD,UAAU,4BAA4B,OAAO;AAAA,IAC7C,QAAQ,SAAS,KAAK;AAAA,EACxB;AAEA,QAAM,UAAU,SAAS,KAAK;AAC9B,MAAI,QAAQ,WAAW,EAAG,QAAO;AAGjC,QAAM,SAAS,qCAAqC,KAAK,OAAO;AAChE,QAAM,UAAU,SAAS,OAAO,CAAC,EAAE,KAAK,IAAI;AAQ5C,QAAM,SAAS,+BAA+B,OAAO;AACrD,MAAI,WAAW,OAAW,QAAO;AACjC,MAAI,OAAO,WAAW,YAAY,WAAW,KAAM,QAAO;AAE1D,QAAM,MAAM;AACZ,QAAM,cAAc,OAAO,IAAI,aAAa,WAAW,IAAI,SAAS,KAAK,EAAE,YAAY,IAAI;AAC3F,QAAM,YAAY,OAAO,IAAI,WAAW,WAAW,IAAI,SAAS;AAEhE,QAAM,WAAW,wBAAyB,WAAW,IACjD,cACA,4BAA4B,OAAO;AACvC,QAAM,SAAS,UAAU,KAAK,EAAE,SAAS,IAAI,UAAU,KAAK,IAAI,SAAS,KAAK;AAE9E,SAAO,EAAE,UAAU,OAAO;AAC5B;AAiBA,SAAS,+BAA+B,MAAuB;AAC7D,MAAI,aAAa;AACjB,MAAI,OAAgB;AACpB,SAAO,aAAa,KAAK,QAAQ;AAC/B,UAAM,QAAQ,KAAK,QAAQ,KAAK,UAAU;AAC1C,QAAI,QAAQ,EAAG,QAAO;AACtB,QAAI,QAAQ;AACZ,QAAI,WAAW;AACf,QAAI,SAAS;AACb,QAAI,SAAS;AACb,QAAI,SAAS;AACb,aAAS,IAAI,OAAO,IAAI,KAAK,QAAQ,KAAK;AACxC,YAAM,KAAK,KAAK,CAAC;AACjB,UAAI,UAAU;AACZ,YAAI,QAAQ;AACV,mBAAS;AAAA,QACX,WAAW,OAAO,MAAM;AACtB,mBAAS;AAAA,QACX,WAAW,OAAO,KAAK;AACrB,qBAAW;AAAA,QACb;AACA;AAAA,MACF;AACA,UAAI,OAAO,KAAK;AACd,mBAAW;AAAA,MACb,WAAW,OAAO,KAAK;AACrB,iBAAS;AAAA,MACX,WAAW,OAAO,KAAK;AACrB,iBAAS;AACT,YAAI,UAAU,GAAG;AACf,mBAAS;AACT,mBAAS;AACT;AAAA,QACF;AAAA,MACF;AAAA,IACF;AACA,QAAI,CAAC,OAAQ,QAAO;AACpB,UAAM,QAAQ,KAAK,MAAM,OAAO,SAAS,CAAC;AAC1C,QAAI;AACF,YAAM,SAAS,KAAK,MAAM,KAAK;AAC/B,UACE,OAAO,WAAW,YAClB,WAAW,QACX,cAAe,QACf;AACA,eAAO;AAAA,MACT;AAAA,IACF,QAAQ;AAAA,IAER;AACA,iBAAa,SAAS;AAAA,EACxB;AACA,SAAO;AACT;AAUA,eAAsB,qCACpB,QACiB;AACjB,MAAI,CAAC,OAAO,wBAAyB,QAAO;AAC5C,QAAM,OAAO,sBAAsB,MAAM;AACzC,QAAM,aAAa,MAAM,yBAAyB,MAAM,GAAG;AAC3D,MAAI,WAAW,WAAW,EAAG,QAAO;AACpC,SAAO,sBAAsB,UAAU;AACzC;AAWA,eAAsB,sCAAsC,SAQtB;AAGpC,SAAO,gCAAgC,4BAA4B,OAAO;AAC5E;","names":["path","existsSync","path","existsSync"]}

package/dist/{chunk-JL2PU6AI.js → chunk-R2XRID2N.js}

@@ -1,6 +1,6 @@
 import {
   launchProcessSync
-} from "./chunk-LK6SGL53.js";
+} from "./chunk-OR64ZGRZ.js";
 import {
   mergeEnv,
   readEnvVar
@@ -933,4 +933,4 @@ var LocalLlmClient = class _LocalLlmClient {
 export {
   LocalLlmClient
 };
-//# sourceMappingURL=chunk-JL2PU6AI.js.map
+//# sourceMappingURL=chunk-R2XRID2N.js.map