@remnic/core 1.0.2 → 1.1.0

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

package/dist/{chunk-ORZMT74A.js → chunk-4NRAJUDS.js}

@@ -114,6 +114,14 @@ async function readCausalTrajectoryRecords(options) {
   }
   return { files, trajectories, invalidTrajectories };
 }
+function filterTrajectoriesByLookbackDays(trajectories, lookbackDays, nowMs = Date.now()) {
+  const days = Math.max(1, Math.floor(lookbackDays));
+  const cutoff = nowMs - days * 864e5;
+  return trajectories.filter((t) => {
+    const ms = Date.parse(t.recordedAt);
+    return Number.isFinite(ms) && ms >= cutoff;
+  });
+}
 async function getCausalTrajectoryStoreStatus(options) {
   const rootDir = resolveCausalTrajectoryStoreDir(options.memoryDir, options.causalTrajectoryStoreDir);
   const trajectoriesDir = path.join(rootDir, "trajectories");
@@ -203,7 +211,9 @@ export {
   resolveCausalTrajectoryStoreDir,
   validateCausalTrajectoryRecord,
   recordCausalTrajectory,
+  readCausalTrajectoryRecords,
+  filterTrajectoriesByLookbackDays,
   getCausalTrajectoryStoreStatus,
   searchCausalTrajectories
 };
-//# sourceMappingURL=chunk-ORZMT74A.js.map
+//# sourceMappingURL=chunk-4NRAJUDS.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/causal-trajectory.ts"],"sourcesContent":["import path from \"node:path\";\nimport { mkdir, writeFile } from \"node:fs/promises\";\nimport { listJsonFiles, readJsonFile } from \"./json-store.js\";\nimport type { ObjectiveStateOutcome } from \"./objective-state.js\";\nimport { countRecallTokenOverlap, normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport {\n  assertIsoRecordedAt,\n  assertSafePathSegment,\n  assertString,\n  isRecord,\n  optionalString,\n  optionalStringArray,\n  recordStoreDay,\n  validateStringRecord,\n} from \"./store-contract.js\";\n\nexport interface CausalTrajectoryRecord {\n  schemaVersion: 1;\n  trajectoryId: string;\n  recordedAt: string;\n  sessionKey: string;\n  goal: string;\n  actionSummary: string;\n  observationSummary: string;\n  outcomeKind: ObjectiveStateOutcome;\n  outcomeSummary: string;\n  followUpSummary?: string;\n  objectiveStateSnapshotRefs?: string[];\n  entityRefs?: string[];\n  tags?: string[];\n  metadata?: Record<string, string>;\n}\n\nexport interface CausalTrajectoryStoreStatus {\n  enabled: boolean;\n  rootDir: string;\n  trajectoriesDir: string;\n  trajectories: {\n    total: number;\n    valid: number;\n    invalid: number;\n    byOutcome: Partial<Record<ObjectiveStateOutcome, number>>;\n    latestTrajectoryId?: string;\n    latestRecordedAt?: string;\n    latestSessionKey?: string;\n  };\n  latestTrajectory?: CausalTrajectoryRecord;\n  invalidTrajectories: Array<{\n    path: string;\n    error: string;\n  }>;\n}\n\nexport interface CausalTrajectorySearchResult {\n  record: CausalTrajectoryRecord;\n  score: number;\n  matchedFields: string[];\n}\n\nfunction validateMetadata(raw: unknown): Record<string, string> | undefined {\n  return validateStringRecord(raw, \"metadata\");\n}\n\nexport function resolveCausalTrajectoryStoreDir(memoryDir: string, overrideDir?: string): string {\n  if (typeof overrideDir === \"string\" && overrideDir.trim().length > 0) {\n    return overrideDir.trim();\n  }\n  return path.join(memoryDir, \"state\", \"causal-trajectories\");\n}\n\nexport function validateCausalTrajectoryRecord(raw: unknown): CausalTrajectoryRecord {\n  if (!isRecord(raw)) throw new Error(\"causal trajectory record must be an object\");\n  if (raw.schemaVersion !== 1) throw new Error(\"schemaVersion must be 1\");\n\n  const outcomeKind = assertString(raw.outcomeKind, \"outcomeKind\");\n  if (![\"success\", \"failure\", \"partial\", \"unknown\"].includes(outcomeKind)) {\n    throw new Error(\"outcomeKind must be one of success|failure|partial|unknown\");\n  }\n\n  return {\n    schemaVersion: 1,\n    trajectoryId: assertSafePathSegment(assertString(raw.trajectoryId, \"trajectoryId\"), \"trajectoryId\"),\n    recordedAt: assertIsoRecordedAt(assertString(raw.recordedAt, \"recordedAt\")),\n    sessionKey: assertString(raw.sessionKey, \"sessionKey\"),\n    goal: assertString(raw.goal, \"goal\"),\n    actionSummary: assertString(raw.actionSummary, \"actionSummary\"),\n    observationSummary: assertString(raw.observationSummary, \"observationSummary\"),\n    outcomeKind: outcomeKind as ObjectiveStateOutcome,\n    outcomeSummary: assertString(raw.outcomeSummary, \"outcomeSummary\"),\n    followUpSummary: optionalString(raw.followUpSummary),\n    objectiveStateSnapshotRefs: optionalStringArray(raw.objectiveStateSnapshotRefs, \"objectiveStateSnapshotRefs\"),\n    entityRefs: optionalStringArray(raw.entityRefs, \"entityRefs\"),\n    tags: optionalStringArray(raw.tags, \"tags\"),\n    metadata: validateMetadata(raw.metadata),\n  };\n}\n\nexport async function recordCausalTrajectory(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  actionGraphRecallEnabled?: boolean;\n  cmcEnabled?: boolean;\n  cmcStitchLookbackDays?: number;\n  cmcStitchMinScore?: number;\n  cmcStitchMaxEdgesPerTrajectory?: number;\n  record: CausalTrajectoryRecord;\n}): Promise<string> {\n  const rootDir = resolveCausalTrajectoryStoreDir(options.memoryDir, options.causalTrajectoryStoreDir);\n  const validated = validateCausalTrajectoryRecord(options.record);\n  const day = recordStoreDay(validated.recordedAt);\n  const trajectoriesDir = path.join(rootDir, \"trajectories\", day);\n  const filePath = path.join(trajectoriesDir, `${validated.trajectoryId}.json`);\n  await mkdir(trajectoriesDir, { recursive: true });\n  await writeFile(filePath, JSON.stringify(validated, null, 2), \"utf8\");\n  if (options.actionGraphRecallEnabled === true) {\n    try {\n      const { appendCausalTrajectoryGraphEdges } = await import(\"./causal-trajectory-graph.js\");\n      await appendCausalTrajectoryGraphEdges({\n        memoryDir: options.memoryDir,\n        record: validated,\n      });\n    } catch (error) {\n      const { log } = await import(\"./logger.js\");\n      log.warn(\n        `[causal-trajectory] action-conditioned graph write failed for ${validated.trajectoryId}: ${error instanceof Error ? error.message : String(error)}`,\n      );\n    }\n  }\n  if (options.cmcEnabled === true) {\n    try {\n      const { stitchCausalChain } = await import(\"./causal-chain.js\");\n      await stitchCausalChain({\n        memoryDir: options.memoryDir,\n        causalTrajectoryStoreDir: options.causalTrajectoryStoreDir,\n        newTrajectory: validated,\n        config: {\n          lookbackDays: options.cmcStitchLookbackDays ?? 7,\n          minScore: options.cmcStitchMinScore ?? 2.5,\n          maxEdgesPerTrajectory: options.cmcStitchMaxEdgesPerTrajectory ?? 3,\n        },\n      });\n    } catch (error) {\n      const { log } = await import(\"./logger.js\");\n      log.warn(\n        `[cmc] causal chain stitching failed for ${validated.trajectoryId}: ${error instanceof Error ? error.message : String(error)}`,\n      );\n    }\n  }\n  return filePath;\n}\n\nexport async function readCausalTrajectoryRecords(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n}): Promise<{\n  files: string[];\n  trajectories: CausalTrajectoryRecord[];\n  invalidTrajectories: Array<{ path: string; error: string }>;\n}> {\n  const rootDir = resolveCausalTrajectoryStoreDir(options.memoryDir, options.causalTrajectoryStoreDir);\n  const files = await listJsonFiles(path.join(rootDir, \"trajectories\"));\n  const trajectories: CausalTrajectoryRecord[] = [];\n  const invalidTrajectories: Array<{ path: string; error: string }> = [];\n  for (const filePath of files) {\n    try {\n      trajectories.push(validateCausalTrajectoryRecord(await readJsonFile(filePath)));\n    } catch (error) {\n      invalidTrajectories.push({\n        path: filePath,\n        error: error instanceof Error ? error.message : String(error),\n      });\n    }\n  }\n  return { files, trajectories, invalidTrajectories };\n}\n\n/** Keep trajectories whose recordedAt is within the last `lookbackDays` (issue #519 miner). */\nexport function filterTrajectoriesByLookbackDays(\n  trajectories: CausalTrajectoryRecord[],\n  lookbackDays: number,\n  nowMs: number = Date.now(),\n): CausalTrajectoryRecord[] {\n  const days = Math.max(1, Math.floor(lookbackDays));\n  const cutoff = nowMs - days * 86_400_000;\n  return trajectories.filter((t) => {\n    const ms = Date.parse(t.recordedAt);\n    return Number.isFinite(ms) && ms >= cutoff;\n  });\n}\n\nexport async function getCausalTrajectoryStoreStatus(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  enabled: boolean;\n}): Promise<CausalTrajectoryStoreStatus> {\n  const rootDir = resolveCausalTrajectoryStoreDir(options.memoryDir, options.causalTrajectoryStoreDir);\n  const trajectoriesDir = path.join(rootDir, \"trajectories\");\n  const { files, trajectories, invalidTrajectories } = await readCausalTrajectoryRecords(options);\n\n  trajectories.sort((a, b) => b.recordedAt.localeCompare(a.recordedAt));\n  const byOutcome: Partial<Record<ObjectiveStateOutcome, number>> = {};\n  for (const trajectory of trajectories) {\n    byOutcome[trajectory.outcomeKind] = (byOutcome[trajectory.outcomeKind] ?? 0) + 1;\n  }\n\n  return {\n    enabled: options.enabled,\n    rootDir,\n    trajectoriesDir,\n    trajectories: {\n      total: files.length,\n      valid: trajectories.length,\n      invalid: invalidTrajectories.length,\n      byOutcome,\n      latestTrajectoryId: trajectories[0]?.trajectoryId,\n      latestRecordedAt: trajectories[0]?.recordedAt,\n      latestSessionKey: trajectories[0]?.sessionKey,\n    },\n    latestTrajectory: trajectories[0],\n    invalidTrajectories,\n  };\n}\n\nfunction lexicalScoreCausalTrajectoryRecord(\n  record: CausalTrajectoryRecord,\n  queryTokens: Set<string>,\n): { score: number; matchedFields: string[] } {\n  const weightedFields: Array<[field: string, value: string | undefined, weight: number]> = [\n    [\"goal\", record.goal, 4],\n    [\"action\", record.actionSummary, 3],\n    [\"observation\", record.observationSummary, 3],\n    [\"outcome\", record.outcomeSummary, 3],\n    [\"follow_up\", record.followUpSummary, 2],\n    [\"outcome_kind\", record.outcomeKind, 1],\n    [\"tags\", record.tags?.join(\" \"), 2],\n    [\"entity_refs\", record.entityRefs?.join(\" \"), 2],\n    [\"objective_state_refs\", record.objectiveStateSnapshotRefs?.join(\" \"), 1],\n  ];\n\n  let score = 0;\n  const matchedFields: string[] = [];\n  for (const [field, value, weight] of weightedFields) {\n    const matches = countRecallTokenOverlap(queryTokens, value, [\"make\"]);\n    if (matches > 0) matchedFields.push(field);\n    score += matches * weight;\n  }\n  return { score, matchedFields };\n}\n\nfunction scoreCausalTrajectoryRecord(\n  record: CausalTrajectoryRecord,\n  lexicalScore: number,\n  sessionKey?: string,\n): number {\n  let score = lexicalScore;\n  if (sessionKey && record.sessionKey === sessionKey) score += 1.5;\n\n  const recordedAtMs = Date.parse(record.recordedAt);\n  if (Number.isFinite(recordedAtMs)) {\n    const ageHours = Math.max(0, (Date.now() - recordedAtMs) / 3_600_000);\n    score += 1 / (1 + ageHours);\n  }\n  return score;\n}\n\nexport async function searchCausalTrajectories(options: {\n  memoryDir: string;\n  causalTrajectoryStoreDir?: string;\n  query: string;\n  maxResults: number;\n  sessionKey?: string;\n}): Promise<CausalTrajectorySearchResult[]> {\n  const maxResults = Math.max(0, Math.floor(options.maxResults));\n  if (maxResults === 0) return [];\n\n  const { trajectories } = await readCausalTrajectoryRecords(options);\n  if (trajectories.length === 0) return [];\n\n  const queryTokens = new Set(normalizeRecallTokens(options.query, [\"make\"]));\n  if (queryTokens.size === 0) return [];\n  const scored = trajectories.map((record) => {\n    const lexical = lexicalScoreCausalTrajectoryRecord(record, queryTokens);\n    return {\n      record,\n      matchedFields: lexical.matchedFields,\n      lexicalScore: lexical.score,\n      score: scoreCausalTrajectoryRecord(record, lexical.score, options.sessionKey),\n    };\n  });\n\n  const filtered = scored.filter((result) => result.lexicalScore > 0);\n\n  filtered.sort((left, right) => {\n    if (right.score !== left.score) return right.score - left.score;\n    return right.record.recordedAt.localeCompare(left.record.recordedAt);\n  });\n\n  return filtered.slice(0, maxResults).map(({ record, score, matchedFields }) => ({\n    record,\n    score,\n    matchedFields,\n  }));\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,OAAO,iBAAiB;AA0DjC,SAAS,iBAAiB,KAAkD;AAC1E,SAAO,qBAAqB,KAAK,UAAU;AAC7C;AAEO,SAAS,gCAAgC,WAAmB,aAA8B;AAC/F,MAAI,OAAO,gBAAgB,YAAY,YAAY,KAAK,EAAE,SAAS,GAAG;AACpE,WAAO,YAAY,KAAK;AAAA,EAC1B;AACA,SAAO,KAAK,KAAK,WAAW,SAAS,qBAAqB;AAC5D;AAEO,SAAS,+BAA+B,KAAsC;AACnF,MAAI,CAAC,SAAS,GAAG,EAAG,OAAM,IAAI,MAAM,4CAA4C;AAChF,MAAI,IAAI,kBAAkB,EAAG,OAAM,IAAI,MAAM,yBAAyB;AAEtE,QAAM,cAAc,aAAa,IAAI,aAAa,aAAa;AAC/D,MAAI,CAAC,CAAC,WAAW,WAAW,WAAW,SAAS,EAAE,SAAS,WAAW,GAAG;AACvE,UAAM,IAAI,MAAM,4DAA4D;AAAA,EAC9E;AAEA,SAAO;AAAA,IACL,eAAe;AAAA,IACf,cAAc,sBAAsB,aAAa,IAAI,cAAc,cAAc,GAAG,cAAc;AAAA,IAClG,YAAY,oBAAoB,aAAa,IAAI,YAAY,YAAY,CAAC;AAAA,IAC1E,YAAY,aAAa,IAAI,YAAY,YAAY;AAAA,IACrD,MAAM,aAAa,IAAI,MAAM,MAAM;AAAA,IACnC,eAAe,aAAa,IAAI,eAAe,eAAe;AAAA,IAC9D,oBAAoB,aAAa,IAAI,oBAAoB,oBAAoB;AAAA,IAC7E;AAAA,IACA,gBAAgB,aAAa,IAAI,gBAAgB,gBAAgB;AAAA,IACjE,iBAAiB,eAAe,IAAI,eAAe;AAAA,IACnD,4BAA4B,oBAAoB,IAAI,4BAA4B,4BAA4B;AAAA,IAC5G,YAAY,oBAAoB,IAAI,YAAY,YAAY;AAAA,IAC5D,MAAM,oBAAoB,IAAI,MAAM,MAAM;AAAA,IAC1C,UAAU,iBAAiB,IAAI,QAAQ;AAAA,EACzC;AACF;AAEA,eAAsB,uBAAuB,SASzB;AAClB,QAAM,UAAU,gCAAgC,QAAQ,WAAW,QAAQ,wBAAwB;AACnG,QAAM,YAAY,+BAA+B,QAAQ,MAAM;AAC/D,QAAM,MAAM,eAAe,UAAU,UAAU;AAC/C,QAAM,kBAAkB,KAAK,KAAK,SAAS,gBAAgB,GAAG;AAC9D,QAAM,WAAW,KAAK,KAAK,iBAAiB,GAAG,UAAU,YAAY,OAAO;AAC5E,QAAM,MAAM,iBAAiB,EAAE,WAAW,KAAK,CAAC;AAChD,QAAM,UAAU,UAAU,KAAK,UAAU,WAAW,MAAM,CAAC,GAAG,MAAM;AACpE,MAAI,QAAQ,6BAA6B,MAAM;AAC7C,QAAI;AACF,YAAM,EAAE,iCAAiC,IAAI,MAAM,OAAO,8BAA8B;AACxF,YAAM,iCAAiC;AAAA,QACrC,WAAW,QAAQ;AAAA,QACnB,QAAQ;AAAA,MACV,CAAC;AAAA,IACH,SAAS,OAAO;AACd,YAAM,EAAE,IAAI,IAAI,MAAM,OAAO,aAAa;AAC1C,UAAI;AAAA,QACF,iEAAiE,UAAU,YAAY,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,MACpJ;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ,eAAe,MAAM;AAC/B,QAAI;AACF,YAAM,EAAE,kBAAkB,IAAI,MAAM,OAAO,mBAAmB;AAC9D,YAAM,kBAAkB;AAAA,QACtB,WAAW,QAAQ;AAAA,QACnB,0BAA0B,QAAQ;AAAA,QAClC,eAAe;AAAA,QACf,QAAQ;AAAA,UACN,cAAc,QAAQ,yBAAyB;AAAA,UAC/C,UAAU,QAAQ,qBAAqB;AAAA,UACvC,uBAAuB,QAAQ,kCAAkC;AAAA,QACnE;AAAA,MACF,CAAC;AAAA,IACH,SAAS,OAAO;AACd,YAAM,EAAE,IAAI,IAAI,MAAM,OAAO,aAAa;AAC1C,UAAI;AAAA,QACF,2CAA2C,UAAU,YAAY,KAAK,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,MAC9H;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,4BAA4B,SAO/C;AACD,QAAM,UAAU,gCAAgC,QAAQ,WAAW,QAAQ,wBAAwB;AACnG,QAAM,QAAQ,MAAM,cAAc,KAAK,KAAK,SAAS,cAAc,CAAC;AACpE,QAAM,eAAyC,CAAC;AAChD,QAAM,sBAA8D,CAAC;AACrE,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,mBAAa,KAAK,+BAA+B,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAChF,SAAS,OAAO;AACd,0BAAoB,KAAK;AAAA,QACvB,MAAM;AAAA,QACN,OAAO,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AAAA,MAC9D,CAAC;AAAA,IACH;AAAA,EACF;AACA,SAAO,EAAE,OAAO,cAAc,oBAAoB;AACpD;AAGO,SAAS,iCACd,cACA,cACA,QAAgB,KAAK,IAAI,GACC;AAC1B,QAAM,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,CAAC;AACjD,QAAM,SAAS,QAAQ,OAAO;AAC9B,SAAO,aAAa,OAAO,CAAC,MAAM;AAChC,UAAM,KAAK,KAAK,MAAM,EAAE,UAAU;AAClC,WAAO,OAAO,SAAS,EAAE,KAAK,MAAM;AAAA,EACtC,CAAC;AACH;AAEA,eAAsB,+BAA+B,SAIZ;AACvC,QAAM,UAAU,gCAAgC,QAAQ,WAAW,QAAQ,wBAAwB;AACnG,QAAM,kBAAkB,KAAK,KAAK,SAAS,cAAc;AACzD,QAAM,EAAE,OAAO,cAAc,oBAAoB,IAAI,MAAM,4BAA4B,OAAO;AAE9F,eAAa,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,cAAc,EAAE,UAAU,CAAC;AACpE,QAAM,YAA4D,CAAC;AACnE,aAAW,cAAc,cAAc;AACrC,cAAU,WAAW,WAAW,KAAK,UAAU,WAAW,WAAW,KAAK,KAAK;AAAA,EACjF;AAEA,SAAO;AAAA,IACL,SAAS,QAAQ;AAAA,IACjB;AAAA,IACA;AAAA,IACA,cAAc;AAAA,MACZ,OAAO,MAAM;AAAA,MACb,OAAO,aAAa;AAAA,MACpB,SAAS,oBAAoB;AAAA,MAC7B;AAAA,MACA,oBAAoB,aAAa,CAAC,GAAG;AAAA,MACrC,kBAAkB,aAAa,CAAC,GAAG;AAAA,MACnC,kBAAkB,aAAa,CAAC,GAAG;AAAA,IACrC;AAAA,IACA,kBAAkB,aAAa,CAAC;AAAA,IAChC;AAAA,EACF;AACF;AAEA,SAAS,mCACP,QACA,aAC4C;AAC5C,QAAM,iBAAoF;AAAA,IACxF,CAAC,QAAQ,OAAO,MAAM,CAAC;AAAA,IACvB,CAAC,UAAU,OAAO,eAAe,CAAC;AAAA,IAClC,CAAC,eAAe,OAAO,oBAAoB,CAAC;AAAA,IAC5C,CAAC,WAAW,OAAO,gBAAgB,CAAC;AAAA,IACpC,CAAC,aAAa,OAAO,iBAAiB,CAAC;AAAA,IACvC,CAAC,gBAAgB,OAAO,aAAa,CAAC;AAAA,IACtC,CAAC,QAAQ,OAAO,MAAM,KAAK,GAAG,GAAG,CAAC;AAAA,IAClC,CAAC,eAAe,OAAO,YAAY,KAAK,GAAG,GAAG,CAAC;AAAA,IAC/C,CAAC,wBAAwB,OAAO,4BAA4B,KAAK,GAAG,GAAG,CAAC;AAAA,EAC1E;AAEA,MAAI,QAAQ;AACZ,QAAM,gBAA0B,CAAC;AACjC,aAAW,CAAC,OAAO,OAAO,MAAM,KAAK,gBAAgB;AACnD,UAAM,UAAU,wBAAwB,aAAa,OAAO,CAAC,MAAM,CAAC;AACpE,QAAI,UAAU,EAAG,eAAc,KAAK,KAAK;AACzC,aAAS,UAAU;AAAA,EACrB;AACA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,SAAS,4BACP,QACA,cACA,YACQ;AACR,MAAI,QAAQ;AACZ,MAAI,cAAc,OAAO,eAAe,WAAY,UAAS;AAE7D,QAAM,eAAe,KAAK,MAAM,OAAO,UAAU;AACjD,MAAI,OAAO,SAAS,YAAY,GAAG;AACjC,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,IAAI,IAAI,gBAAgB,IAAS;AACpE,aAAS,KAAK,IAAI;AAAA,EACpB;AACA,SAAO;AACT;AAEA,eAAsB,yBAAyB,SAMH;AAC1C,QAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,UAAU,CAAC;AAC7D,MAAI,eAAe,EAAG,QAAO,CAAC;AAE9B,QAAM,EAAE,aAAa,IAAI,MAAM,4BAA4B,OAAO;AAClE,MAAI,aAAa,WAAW,EAAG,QAAO,CAAC;AAEvC,QAAM,cAAc,IAAI,IAAI,sBAAsB,QAAQ,OAAO,CAAC,MAAM,CAAC,CAAC;AAC1E,MAAI,YAAY,SAAS,EAAG,QAAO,CAAC;AACpC,QAAM,SAAS,aAAa,IAAI,CAAC,WAAW;AAC1C,UAAM,UAAU,mCAAmC,QAAQ,WAAW;AACtE,WAAO;AAAA,MACL;AAAA,MACA,eAAe,QAAQ;AAAA,MACvB,cAAc,QAAQ;AAAA,MACtB,OAAO,4BAA4B,QAAQ,QAAQ,OAAO,QAAQ,UAAU;AAAA,IAC9E;AAAA,EACF,CAAC;AAED,QAAM,WAAW,OAAO,OAAO,CAAC,WAAW,OAAO,eAAe,CAAC;AAElE,WAAS,KAAK,CAAC,MAAM,UAAU;AAC7B,QAAI,MAAM,UAAU,KAAK,MAAO,QAAO,MAAM,QAAQ,KAAK;AAC1D,WAAO,MAAM,OAAO,WAAW,cAAc,KAAK,OAAO,UAAU;AAAA,EACrE,CAAC;AAED,SAAO,SAAS,MAAM,GAAG,UAAU,EAAE,IAAI,CAAC,EAAE,QAAQ,OAAO,cAAc,OAAO;AAAA,IAC9E;AAAA,IACA;AAAA,IACA;AAAA,EACF,EAAE;AACJ;","names":[]}

package/dist/{chunk-B7LOFDVE.js → chunk-4WMCPJWX.js}

@@ -68,8 +68,13 @@ function chunkContent(content, config = DEFAULT_CHUNKING_CONFIG) {
       chunkIndex++;
       if (!isLastSentence) {
         const overlapCount = Math.min(config.overlapSentences, currentChunkSentences.length);
-        currentChunkSentences = currentChunkSentences.slice(-overlapCount);
-        currentTokens = currentChunkSentences.reduce((sum, s) => sum + estimateTokens(s), 0);
+        if (overlapCount <= 0) {
+          currentChunkSentences = [];
+          currentTokens = 0;
+        } else {
+          currentChunkSentences = currentChunkSentences.slice(-overlapCount);
+          currentTokens = currentChunkSentences.reduce((sum, s) => sum + estimateTokens(s), 0);
+        }
       }
     }
   }
@@ -109,4 +114,4 @@ export {
   chunkContent,
   reassembleChunks
 };
-//# sourceMappingURL=chunk-B7LOFDVE.js.map
+//# sourceMappingURL=chunk-4WMCPJWX.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/chunking.ts"],"sourcesContent":["/**\n * Automatic Chunking with Overlap (Phase 2A)\n *\n * Sentence-boundary chunking for long memories.\n * Preserves coherent thoughts by never splitting mid-sentence.\n */\n\nexport interface ChunkingConfig {\n  /** Target tokens per chunk (default 200) */\n  targetTokens: number;\n  /** Minimum tokens to trigger chunking (default 150) */\n  minTokens: number;\n  /** Number of sentences to overlap between chunks (default 2) */\n  overlapSentences: number;\n}\n\nexport interface Chunk {\n  /** Chunk content */\n  content: string;\n  /** 0-based index */\n  index: number;\n  /** Approximate token count */\n  tokenCount: number;\n}\n\nexport interface ChunkResult {\n  /** Whether content was chunked */\n  chunked: boolean;\n  /** Array of chunks (length 1 if not chunked) */\n  chunks: Chunk[];\n}\n\n/** Default chunking configuration */\nexport const DEFAULT_CHUNKING_CONFIG: ChunkingConfig = {\n  targetTokens: 200,\n  minTokens: 150,\n  overlapSentences: 2,\n};\n\n/**\n * Estimate token count for text.\n * Rough approximation: ~4 characters per token for English.\n */\nfunction estimateTokens(text: string): number {\n  return Math.ceil(text.length / 4);\n}\n\n/**\n * Split text into sentences.\n * Handles common abbreviations and edge cases.\n */\nfunction splitSentences(text: string): string[] {\n  // Split on sentence-ending punctuation followed by whitespace or end of string\n  // Preserve the punctuation with the sentence\n  const sentences: string[] = [];\n\n  // Regex to match sentence boundaries\n  // Match: period/exclamation/question followed by space or end, but not abbreviations\n  const sentenceRegex = /[^.!?]*[.!?]+(?:\\s+|$)/g;\n\n  let match: RegExpExecArray | null;\n  let lastIndex = 0;\n\n  while ((match = sentenceRegex.exec(text)) !== null) {\n    sentences.push(match[0].trim());\n    lastIndex = sentenceRegex.lastIndex;\n  }\n\n  // Handle remaining text without sentence-ending punctuation\n  if (lastIndex < text.length) {\n    const remaining = text.slice(lastIndex).trim();\n    if (remaining) {\n      sentences.push(remaining);\n    }\n  }\n\n  // Filter out empty sentences\n  return sentences.filter((s) => s.length > 0);\n}\n\n/**\n * Chunk content into overlapping segments at sentence boundaries.\n *\n * @param content - The text content to chunk\n * @param config - Chunking configuration\n * @returns ChunkResult with chunks array\n */\nexport function chunkContent(\n  content: string,\n  config: ChunkingConfig = DEFAULT_CHUNKING_CONFIG,\n): ChunkResult {\n  const totalTokens = estimateTokens(content);\n\n  // Don't chunk if below minimum threshold\n  if (totalTokens < config.minTokens) {\n    return {\n      chunked: false,\n      chunks: [{\n        content,\n        index: 0,\n        tokenCount: totalTokens,\n      }],\n    };\n  }\n\n  const sentences = splitSentences(content);\n\n  // If we couldn't split into multiple sentences, don't chunk\n  if (sentences.length <= 1) {\n    return {\n      chunked: false,\n      chunks: [{\n        content,\n        index: 0,\n        tokenCount: totalTokens,\n      }],\n    };\n  }\n\n  const chunks: Chunk[] = [];\n  let currentChunkSentences: string[] = [];\n  let currentTokens = 0;\n  let chunkIndex = 0;\n\n  for (let i = 0; i < sentences.length; i++) {\n    const sentence = sentences[i];\n    const sentenceTokens = estimateTokens(sentence);\n\n    // Add sentence to current chunk\n    currentChunkSentences.push(sentence);\n    currentTokens += sentenceTokens;\n\n    // Check if we've reached target size (with some flexibility)\n    // Allow going over by up to 50% to avoid tiny final chunks\n    const atTarget = currentTokens >= config.targetTokens;\n    const isLastSentence = i === sentences.length - 1;\n\n    if (atTarget || isLastSentence) {\n      // Create chunk from accumulated sentences\n      const chunkContent = currentChunkSentences.join(\" \");\n      chunks.push({\n        content: chunkContent,\n        index: chunkIndex,\n        tokenCount: estimateTokens(chunkContent),\n      });\n      chunkIndex++;\n\n      // Start new chunk with overlap (if not at end)\n      if (!isLastSentence) {\n        // Keep last N sentences for overlap.\n        // Guard: slice(-0) === slice(0), which returns the ENTIRE array\n        // (CLAUDE.md gotcha #27). When overlapSentences is 0, clear fully.\n        const overlapCount = Math.min(config.overlapSentences, currentChunkSentences.length);\n        if (overlapCount <= 0) {\n          currentChunkSentences = [];\n          currentTokens = 0;\n        } else {\n          currentChunkSentences = currentChunkSentences.slice(-overlapCount);\n          currentTokens = currentChunkSentences.reduce((sum, s) => sum + estimateTokens(s), 0);\n        }\n      }\n    }\n  }\n\n  // Only consider it \"chunked\" if we got multiple chunks\n  return {\n    chunked: chunks.length > 1,\n    chunks,\n  };\n}\n\n/**\n * Get parent content by reassembling chunks.\n * Useful for displaying full context when a chunk is retrieved.\n *\n * @param chunks - Array of chunk contents in order\n * @returns Reassembled parent content (with overlap removed)\n */\nexport function reassembleChunks(chunks: string[]): string {\n  if (chunks.length === 0) return \"\";\n  if (chunks.length === 1) return chunks[0];\n\n  // For overlapping chunks, we need to deduplicate\n  // Simple approach: use full first chunk, then non-overlapping parts of subsequent chunks\n  // This is imperfect but handles most cases\n  const result: string[] = [chunks[0]];\n\n  for (let i = 1; i < chunks.length; i++) {\n    const prevChunk = chunks[i - 1];\n    const currChunk = chunks[i];\n\n    // Find overlap by looking for common suffix/prefix\n    // Try to find where the previous chunk ends in the current chunk\n    const prevSentences = splitSentences(prevChunk);\n    const currSentences = splitSentences(currChunk);\n\n    // Find how many sentences from prev are at the start of curr\n    let overlapCount = 0;\n    for (let j = 0; j < Math.min(prevSentences.length, currSentences.length); j++) {\n      // Check if last N sentences of prev match first N sentences of curr\n      const prevEnd = prevSentences.slice(-(j + 1));\n      const currStart = currSentences.slice(0, j + 1);\n\n      if (prevEnd.join(\" \") === currStart.join(\" \")) {\n        overlapCount = j + 1;\n      }\n    }\n\n    // Add non-overlapping portion\n    if (overlapCount > 0 && overlapCount < currSentences.length) {\n      result.push(currSentences.slice(overlapCount).join(\" \"));\n    } else if (overlapCount === 0) {\n      // No detected overlap, add full chunk\n      result.push(currChunk);\n    }\n    // If overlapCount === currSentences.length, skip (fully contained)\n  }\n\n  return result.join(\" \");\n}\n"],"mappings":";AAiCO,IAAM,0BAA0C;AAAA,EACrD,cAAc;AAAA,EACd,WAAW;AAAA,EACX,kBAAkB;AACpB;AAMA,SAAS,eAAe,MAAsB;AAC5C,SAAO,KAAK,KAAK,KAAK,SAAS,CAAC;AAClC;AAMA,SAAS,eAAe,MAAwB;AAG9C,QAAM,YAAsB,CAAC;AAI7B,QAAM,gBAAgB;AAEtB,MAAI;AACJ,MAAI,YAAY;AAEhB,UAAQ,QAAQ,cAAc,KAAK,IAAI,OAAO,MAAM;AAClD,cAAU,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC;AAC9B,gBAAY,cAAc;AAAA,EAC5B;AAGA,MAAI,YAAY,KAAK,QAAQ;AAC3B,UAAM,YAAY,KAAK,MAAM,SAAS,EAAE,KAAK;AAC7C,QAAI,WAAW;AACb,gBAAU,KAAK,SAAS;AAAA,IAC1B;AAAA,EACF;AAGA,SAAO,UAAU,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC;AAC7C;AASO,SAAS,aACd,SACA,SAAyB,yBACZ;AACb,QAAM,cAAc,eAAe,OAAO;AAG1C,MAAI,cAAc,OAAO,WAAW;AAClC,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ,CAAC;AAAA,QACP;AAAA,QACA,OAAO;AAAA,QACP,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,YAAY,eAAe,OAAO;AAGxC,MAAI,UAAU,UAAU,GAAG;AACzB,WAAO;AAAA,MACL,SAAS;AAAA,MACT,QAAQ,CAAC;AAAA,QACP;AAAA,QACA,OAAO;AAAA,QACP,YAAY;AAAA,MACd,CAAC;AAAA,IACH;AAAA,EACF;AAEA,QAAM,SAAkB,CAAC;AACzB,MAAI,wBAAkC,CAAC;AACvC,MAAI,gBAAgB;AACpB,MAAI,aAAa;AAEjB,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,KAAK;AACzC,UAAM,WAAW,UAAU,CAAC;AAC5B,UAAM,iBAAiB,eAAe,QAAQ;AAG9C,0BAAsB,KAAK,QAAQ;AACnC,qBAAiB;AAIjB,UAAM,WAAW,iBAAiB,OAAO;AACzC,UAAM,iBAAiB,MAAM,UAAU,SAAS;AAEhD,QAAI,YAAY,gBAAgB;AAE9B,YAAMA,gBAAe,sBAAsB,KAAK,GAAG;AACnD,aAAO,KAAK;AAAA,QACV,SAASA;AAAA,QACT,OAAO;AAAA,QACP,YAAY,eAAeA,aAAY;AAAA,MACzC,CAAC;AACD;AAGA,UAAI,CAAC,gBAAgB;AAInB,cAAM,eAAe,KAAK,IAAI,OAAO,kBAAkB,sBAAsB,MAAM;AACnF,YAAI,gBAAgB,GAAG;AACrB,kCAAwB,CAAC;AACzB,0BAAgB;AAAA,QAClB,OAAO;AACL,kCAAwB,sBAAsB,MAAM,CAAC,YAAY;AACjE,0BAAgB,sBAAsB,OAAO,CAAC,KAAK,MAAM,MAAM,eAAe,CAAC,GAAG,CAAC;AAAA,QACrF;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,SAAO;AAAA,IACL,SAAS,OAAO,SAAS;AAAA,IACzB;AAAA,EACF;AACF;AASO,SAAS,iBAAiB,QAA0B;AACzD,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,MAAI,OAAO,WAAW,EAAG,QAAO,OAAO,CAAC;AAKxC,QAAM,SAAmB,CAAC,OAAO,CAAC,CAAC;AAEnC,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,YAAY,OAAO,IAAI,CAAC;AAC9B,UAAM,YAAY,OAAO,CAAC;AAI1B,UAAM,gBAAgB,eAAe,SAAS;AAC9C,UAAM,gBAAgB,eAAe,SAAS;AAG9C,QAAI,eAAe;AACnB,aAAS,IAAI,GAAG,IAAI,KAAK,IAAI,cAAc,QAAQ,cAAc,MAAM,GAAG,KAAK;AAE7E,YAAM,UAAU,cAAc,MAAM,EAAE,IAAI,EAAE;AAC5C,YAAM,YAAY,cAAc,MAAM,GAAG,IAAI,CAAC;AAE9C,UAAI,QAAQ,KAAK,GAAG,MAAM,UAAU,KAAK,GAAG,GAAG;AAC7C,uBAAe,IAAI;AAAA,MACrB;AAAA,IACF;AAGA,QAAI,eAAe,KAAK,eAAe,cAAc,QAAQ;AAC3D,aAAO,KAAK,cAAc,MAAM,YAAY,EAAE,KAAK,GAAG,CAAC;AAAA,IACzD,WAAW,iBAAiB,GAAG;AAE7B,aAAO,KAAK,SAAS;AAAA,IACvB;AAAA,EAEF;AAEA,SAAO,OAAO,KAAK,GAAG;AACxB;","names":["chunkContent"]}

package/dist/{chunk-G3AG3KZN.js → chunk-5IZL4DCV.js}

@@ -1,6 +1,6 @@
 import {
   clamp01
-} from "./chunk-QCCCQT3O.js";
+} from "./chunk-TBBDFYXW.js";
 
 // src/retrieval.ts
 var DEFAULT_STOPWORDS = /* @__PURE__ */ new Set([
@@ -75,4 +75,4 @@ export {
   applyRuntimeRetrievalPolicy,
   expandQuery
 };
-//# sourceMappingURL=chunk-G3AG3KZN.js.map
+//# sourceMappingURL=chunk-5IZL4DCV.js.map

package/dist/{chunk-BRK4ODMI.js → chunk-5NPGSAVB.js}

@@ -1,6 +1,6 @@
 import {
   log
-} from "./chunk-KWBU5S5U.js";
+} from "./chunk-2ODBA7MQ.js";
 
 // src/relevance.ts
 import { mkdir, readFile, writeFile } from "fs/promises";
@@ -57,4 +57,4 @@ var RelevanceStore = class {
 export {
   RelevanceStore
 };
-//# sourceMappingURL=chunk-BRK4ODMI.js.map
+//# sourceMappingURL=chunk-5NPGSAVB.js.map

package/dist/{chunk-QANCTXQF.js → chunk-6LX5ORAS.js}

@@ -4,7 +4,7 @@ import {
 } from "./chunk-CULXMQJH.js";
 import {
   TranscriptManager
-} from "./chunk-UV2FO7J4.js";
+} from "./chunk-E6K4NIEU.js";
 import {
   resolveObjectiveStateStoreDir,
   validateObjectiveStateSnapshot
@@ -15,7 +15,7 @@ import {
 } from "./chunk-FYIYMQ5N.js";
 import {
   parseConfig
-} from "./chunk-ISY75RLM.js";
+} from "./chunk-MBJHSA7F.js";
 import {
   assertIsoRecordedAt,
   assertSafePathSegment,
@@ -268,4 +268,4 @@ export {
   recordResumeBundle,
   getResumeBundleStatus
 };
-//# sourceMappingURL=chunk-QANCTXQF.js.map
+//# sourceMappingURL=chunk-6LX5ORAS.js.map

package/dist/chunk-6MKAMLQL.js

@@ -0,0 +1,16 @@
+// src/whitespace.ts
+function collapseWhitespace(value) {
+  return value.replace(/\s+/g, " ").trim();
+}
+function truncateCodePointSafe(value, maxChars) {
+  const glyphs = Array.from(value);
+  if (maxChars <= 0) return "";
+  if (glyphs.length <= maxChars) return value;
+  return glyphs.slice(0, Math.max(1, maxChars)).join("").trimEnd();
+}
+
+export {
+  collapseWhitespace,
+  truncateCodePointSafe
+};
+//# sourceMappingURL=chunk-6MKAMLQL.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/whitespace.ts"],"sourcesContent":["export function collapseWhitespace(value: string): string {\n  return value.replace(/\\s+/g, \" \").trim();\n}\n\nexport function truncateCodePointSafe(value: string, maxChars: number): string {\n  const glyphs = Array.from(value);\n  if (maxChars <= 0) return \"\";\n  if (glyphs.length <= maxChars) return value;\n  return glyphs.slice(0, Math.max(1, maxChars)).join(\"\").trimEnd();\n}\n"],"mappings":";AAAO,SAAS,mBAAmB,OAAuB;AACxD,SAAO,MAAM,QAAQ,QAAQ,GAAG,EAAE,KAAK;AACzC;AAEO,SAAS,sBAAsB,OAAe,UAA0B;AAC7E,QAAM,SAAS,MAAM,KAAK,KAAK;AAC/B,MAAI,YAAY,EAAG,QAAO;AAC1B,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,SAAO,OAAO,MAAM,GAAG,KAAK,IAAI,GAAG,QAAQ,CAAC,EAAE,KAAK,EAAE,EAAE,QAAQ;AACjE;","names":[]}

package/dist/{chunk-ESSMF2FR.js → chunk-6PFRXT4K.js}

@@ -32,14 +32,21 @@ function setCachedArchivedMemories(baseDir, memories, version) {
   archiveCacheByDir.set(baseDir, { memories: map, version, loadedAt: Date.now() });
 }
 var entityCacheByDir = /* @__PURE__ */ new Map();
-function getCachedEntities(baseDir, currentVersion) {
+function buildEntityCacheKey(baseDir, schemaKey = "") {
+  return `${baseDir}\0${schemaKey}`;
+}
+function getCachedEntities(baseDir, currentVersion, schemaKey = "") {
   if (currentVersion === 0) return null;
-  const entry = entityCacheByDir.get(baseDir);
+  const entry = entityCacheByDir.get(buildEntityCacheKey(baseDir, schemaKey));
   if (!entry || entry.version !== currentVersion) return null;
   return entry.entities;
 }
-function setCachedEntities(baseDir, entities, version) {
-  entityCacheByDir.set(baseDir, { entities, version, loadedAt: Date.now() });
+function setCachedEntities(baseDir, entities, version, schemaKey = "") {
+  entityCacheByDir.set(buildEntityCacheKey(baseDir, schemaKey), {
+    entities,
+    version,
+    loadedAt: Date.now()
+  });
 }
 var episodeMapByDir = /* @__PURE__ */ new Map();
 var ruleMemoriesByDir = /* @__PURE__ */ new Map();
@@ -102,7 +109,9 @@ function clearMemoryCache(baseDir) {
   if (baseDir) {
     hotCacheByDir.delete(baseDir);
     archiveCacheByDir.delete(baseDir);
-    entityCacheByDir.delete(baseDir);
+    const entityPrefix = `${baseDir}\0`;
+    const entityKeysToDelete = [...entityCacheByDir.keys()].filter((key) => key.startsWith(entityPrefix));
+    for (const key of entityKeysToDelete) entityCacheByDir.delete(key);
     episodeMapByDir.delete(baseDir);
     ruleMemoriesByDir.delete(baseDir);
   } else {
@@ -143,4 +152,4 @@ export {
   clearMemoryCache,
   getMemoryCacheStats
 };
-//# sourceMappingURL=chunk-ESSMF2FR.js.map
+//# sourceMappingURL=chunk-6PFRXT4K.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/memory-cache.ts"],"sourcesContent":["import type { EntityFile, MemoryFile } from \"./types.js\";\n\ninterface CacheEntry {\n  memories: Map<string, MemoryFile>; // keyed by file path\n  version: number;\n  loadedAt: number;\n}\n\n// Module-level singleton — shared across all StorageManager instances and sessions\nconst hotCacheByDir = new Map<string, CacheEntry>();\nconst archiveCacheByDir = new Map<string, CacheEntry>();\n\nexport function getCachedMemories(baseDir: string, currentVersion: number): MemoryFile[] | null {\n  // Don't serve from cache when version tracking is unavailable (version=0).\n  // This ensures tests and fresh installs without a version file always read disk.\n  if (currentVersion === 0) return null;\n  const entry = hotCacheByDir.get(baseDir);\n  if (!entry || entry.version !== currentVersion) return null;\n  return [...entry.memories.values()];\n}\n\nexport function setCachedMemories(baseDir: string, memories: MemoryFile[], version: number): void {\n  const map = new Map<string, MemoryFile>();\n  for (const m of memories) map.set(m.path, m);\n  hotCacheByDir.set(baseDir, { memories: map, version, loadedAt: Date.now() });\n}\n\nexport function updateCacheOnWrite(baseDir: string, memory: MemoryFile): void {\n  const entry = hotCacheByDir.get(baseDir);\n  if (entry) entry.memories.set(memory.path, memory);\n}\n\nexport function updateCacheOnDelete(baseDir: string, filePath: string): void {\n  const entry = hotCacheByDir.get(baseDir);\n  if (entry) entry.memories.delete(filePath);\n}\n\n// Archive cache — same pattern, separate store\nexport function getCachedArchivedMemories(baseDir: string, currentVersion: number): MemoryFile[] | null {\n  if (currentVersion === 0) return null;\n  const entry = archiveCacheByDir.get(baseDir);\n  if (!entry || entry.version !== currentVersion) return null;\n  return [...entry.memories.values()];\n}\n\nexport function setCachedArchivedMemories(baseDir: string, memories: MemoryFile[], version: number): void {\n  const map = new Map<string, MemoryFile>();\n  for (const m of memories) map.set(m.path, m);\n  archiveCacheByDir.set(baseDir, { memories: map, version, loadedAt: Date.now() });\n}\n\n// Entity cache — same pattern as memory cache, but keyed by schema-aware parse inputs.\nconst entityCacheByDir = new Map<string, { entities: EntityFile[]; version: number; loadedAt: number }>();\n\nfunction buildEntityCacheKey(baseDir: string, schemaKey: string = \"\"): string {\n  return `${baseDir}\\u0000${schemaKey}`;\n}\n\nexport function getCachedEntities(\n  baseDir: string,\n  currentVersion: number,\n  schemaKey: string = \"\",\n): EntityFile[] | null {\n  if (currentVersion === 0) return null;\n  const entry = entityCacheByDir.get(buildEntityCacheKey(baseDir, schemaKey));\n  if (!entry || entry.version !== currentVersion) return null;\n  return entry.entities;\n}\n\nexport function setCachedEntities(\n  baseDir: string,\n  entities: EntityFile[],\n  version: number,\n  schemaKey: string = \"\",\n): void {\n  entityCacheByDir.set(buildEntityCacheKey(baseDir, schemaKey), {\n    entities,\n    version,\n    loadedAt: Date.now(),\n  });\n}\n\n// Derived caches — pre-filtered views invalidated alongside the main cache.\n// These avoid O(146K) filter+map on every verified recall/rules call.\ninterface DerivedCacheEntry<T> {\n  data: T;\n  sourceVersion: number; // matches the hot cache version it was derived from\n}\n\nconst episodeMapByDir = new Map<string, DerivedCacheEntry<Map<string, MemoryFile>>>();\nconst ruleMemoriesByDir = new Map<string, DerivedCacheEntry<{ all: MemoryFile[]; byId: Map<string, MemoryFile> }>>();\n\n/** Get a pre-filtered Map of episode memories (keyed by ID). Derived from hot cache. */\nexport function getCachedEpisodeMap(baseDir: string, currentVersion: number): Map<string, MemoryFile> | null {\n  if (currentVersion === 0) return null;\n  const entry = episodeMapByDir.get(baseDir);\n  if (!entry || entry.sourceVersion !== currentVersion) return null;\n  return entry.data;\n}\n\n/** Build and cache the episode memory map from the full memory list. */\nexport function setCachedEpisodeMap(baseDir: string, memories: MemoryFile[], version: number): Map<string, MemoryFile> {\n  const map = new Map<string, MemoryFile>();\n  for (const m of memories) {\n    if (m.frontmatter.status === \"archived\") continue;\n    if (m.frontmatter.memoryKind !== \"episode\") continue;\n    map.set(m.frontmatter.id, m);\n  }\n  episodeMapByDir.set(baseDir, { data: map, sourceVersion: version });\n  return map;\n}\n\n/** Get pre-filtered rule memories. Derived from hot cache. */\nexport function getCachedRuleMemories(baseDir: string, currentVersion: number): { all: MemoryFile[]; byId: Map<string, MemoryFile> } | null {\n  if (currentVersion === 0) return null;\n  const entry = ruleMemoriesByDir.get(baseDir);\n  if (!entry || entry.sourceVersion !== currentVersion) return null;\n  return entry.data;\n}\n\n/** Build and cache the rule memories from the full memory list. */\nexport function setCachedRuleMemories(baseDir: string, memories: MemoryFile[], version: number): { all: MemoryFile[]; byId: Map<string, MemoryFile> } {\n  const byId = new Map<string, MemoryFile>();\n  const all: MemoryFile[] = [];\n  for (const m of memories) {\n    byId.set(m.frontmatter.id, m);\n    if (m.frontmatter.category === \"rule\" && m.frontmatter.status !== \"archived\") {\n      all.push(m);\n    }\n  }\n  const result = { all, byId };\n  ruleMemoriesByDir.set(baseDir, { data: result, sourceVersion: version });\n  return result;\n}\n\n// QMD search result cache — short-lived (60s TTL) to avoid stale results\n// while reducing redundant daemon calls for repeated/similar queries.\ninterface QmdCacheEntry {\n  results: unknown[];\n  cachedAt: number;\n}\nconst QMD_CACHE_TTL_MS = 60_000;\nconst qmdSearchCache = new Map<string, QmdCacheEntry>();\n\nexport function getCachedQmdSearch(cacheKey: string): unknown[] | null {\n  const entry = qmdSearchCache.get(cacheKey);\n  if (!entry) return null;\n  if (Date.now() - entry.cachedAt > QMD_CACHE_TTL_MS) {\n    qmdSearchCache.delete(cacheKey);\n    return null;\n  }\n  return entry.results;\n}\n\nexport function setCachedQmdSearch(cacheKey: string, results: unknown[]): void {\n  qmdSearchCache.set(cacheKey, { results, cachedAt: Date.now() });\n  // Evict old entries to prevent unbounded growth\n  if (qmdSearchCache.size > 200) {\n    const now = Date.now();\n    for (const [key, entry] of qmdSearchCache) {\n      if (now - entry.cachedAt > QMD_CACHE_TTL_MS) qmdSearchCache.delete(key);\n    }\n  }\n}\n\nexport function clearMemoryCache(baseDir?: string): void {\n  if (baseDir) {\n    hotCacheByDir.delete(baseDir);\n    archiveCacheByDir.delete(baseDir);\n    const entityPrefix = `${baseDir}\\u0000`;\n    const entityKeysToDelete = [...entityCacheByDir.keys()].filter((key) => key.startsWith(entityPrefix));\n    for (const key of entityKeysToDelete) entityCacheByDir.delete(key);\n    episodeMapByDir.delete(baseDir);\n    ruleMemoriesByDir.delete(baseDir);\n  } else {\n    hotCacheByDir.clear();\n    archiveCacheByDir.clear();\n    entityCacheByDir.clear();\n    episodeMapByDir.clear();\n    ruleMemoriesByDir.clear();\n    qmdSearchCache.clear();\n  }\n}\n\nexport function getMemoryCacheStats(baseDir: string): {\n  hotSize: number;\n  archiveSize: number;\n  hotVersion: number | null;\n  archiveVersion: number | null;\n} {\n  const hot = hotCacheByDir.get(baseDir);\n  const archive = archiveCacheByDir.get(baseDir);\n  return {\n    hotSize: hot?.memories.size ?? 0,\n    archiveSize: archive?.memories.size ?? 0,\n    hotVersion: hot?.version ?? null,\n    archiveVersion: archive?.version ?? null,\n  };\n}\n"],"mappings":";AASA,IAAM,gBAAgB,oBAAI,IAAwB;AAClD,IAAM,oBAAoB,oBAAI,IAAwB;AAE/C,SAAS,kBAAkB,SAAiB,gBAA6C;AAG9F,MAAI,mBAAmB,EAAG,QAAO;AACjC,QAAM,QAAQ,cAAc,IAAI,OAAO;AACvC,MAAI,CAAC,SAAS,MAAM,YAAY,eAAgB,QAAO;AACvD,SAAO,CAAC,GAAG,MAAM,SAAS,OAAO,CAAC;AACpC;AAEO,SAAS,kBAAkB,SAAiB,UAAwB,SAAuB;AAChG,QAAM,MAAM,oBAAI,IAAwB;AACxC,aAAW,KAAK,SAAU,KAAI,IAAI,EAAE,MAAM,CAAC;AAC3C,gBAAc,IAAI,SAAS,EAAE,UAAU,KAAK,SAAS,UAAU,KAAK,IAAI,EAAE,CAAC;AAC7E;AAEO,SAAS,mBAAmB,SAAiB,QAA0B;AAC5E,QAAM,QAAQ,cAAc,IAAI,OAAO;AACvC,MAAI,MAAO,OAAM,SAAS,IAAI,OAAO,MAAM,MAAM;AACnD;AAEO,SAAS,oBAAoB,SAAiB,UAAwB;AAC3E,QAAM,QAAQ,cAAc,IAAI,OAAO;AACvC,MAAI,MAAO,OAAM,SAAS,OAAO,QAAQ;AAC3C;AAGO,SAAS,0BAA0B,SAAiB,gBAA6C;AACtG,MAAI,mBAAmB,EAAG,QAAO;AACjC,QAAM,QAAQ,kBAAkB,IAAI,OAAO;AAC3C,MAAI,CAAC,SAAS,MAAM,YAAY,eAAgB,QAAO;AACvD,SAAO,CAAC,GAAG,MAAM,SAAS,OAAO,CAAC;AACpC;AAEO,SAAS,0BAA0B,SAAiB,UAAwB,SAAuB;AACxG,QAAM,MAAM,oBAAI,IAAwB;AACxC,aAAW,KAAK,SAAU,KAAI,IAAI,EAAE,MAAM,CAAC;AAC3C,oBAAkB,IAAI,SAAS,EAAE,UAAU,KAAK,SAAS,UAAU,KAAK,IAAI,EAAE,CAAC;AACjF;AAGA,IAAM,mBAAmB,oBAAI,IAA2E;AAExG,SAAS,oBAAoB,SAAiB,YAAoB,IAAY;AAC5E,SAAO,GAAG,OAAO,KAAS,SAAS;AACrC;AAEO,SAAS,kBACd,SACA,gBACA,YAAoB,IACC;AACrB,MAAI,mBAAmB,EAAG,QAAO;AACjC,QAAM,QAAQ,iBAAiB,IAAI,oBAAoB,SAAS,SAAS,CAAC;AAC1E,MAAI,CAAC,SAAS,MAAM,YAAY,eAAgB,QAAO;AACvD,SAAO,MAAM;AACf;AAEO,SAAS,kBACd,SACA,UACA,SACA,YAAoB,IACd;AACN,mBAAiB,IAAI,oBAAoB,SAAS,SAAS,GAAG;AAAA,IAC5D;AAAA,IACA;AAAA,IACA,UAAU,KAAK,IAAI;AAAA,EACrB,CAAC;AACH;AASA,IAAM,kBAAkB,oBAAI,IAAwD;AACpF,IAAM,oBAAoB,oBAAI,IAAqF;AAG5G,SAAS,oBAAoB,SAAiB,gBAAwD;AAC3G,MAAI,mBAAmB,EAAG,QAAO;AACjC,QAAM,QAAQ,gBAAgB,IAAI,OAAO;AACzC,MAAI,CAAC,SAAS,MAAM,kBAAkB,eAAgB,QAAO;AAC7D,SAAO,MAAM;AACf;AAGO,SAAS,oBAAoB,SAAiB,UAAwB,SAA0C;AACrH,QAAM,MAAM,oBAAI,IAAwB;AACxC,aAAW,KAAK,UAAU;AACxB,QAAI,EAAE,YAAY,WAAW,WAAY;AACzC,QAAI,EAAE,YAAY,eAAe,UAAW;AAC5C,QAAI,IAAI,EAAE,YAAY,IAAI,CAAC;AAAA,EAC7B;AACA,kBAAgB,IAAI,SAAS,EAAE,MAAM,KAAK,eAAe,QAAQ,CAAC;AAClE,SAAO;AACT;AAGO,SAAS,sBAAsB,SAAiB,gBAAqF;AAC1I,MAAI,mBAAmB,EAAG,QAAO;AACjC,QAAM,QAAQ,kBAAkB,IAAI,OAAO;AAC3C,MAAI,CAAC,SAAS,MAAM,kBAAkB,eAAgB,QAAO;AAC7D,SAAO,MAAM;AACf;AAGO,SAAS,sBAAsB,SAAiB,UAAwB,SAAuE;AACpJ,QAAM,OAAO,oBAAI,IAAwB;AACzC,QAAM,MAAoB,CAAC;AAC3B,aAAW,KAAK,UAAU;AACxB,SAAK,IAAI,EAAE,YAAY,IAAI,CAAC;AAC5B,QAAI,EAAE,YAAY,aAAa,UAAU,EAAE,YAAY,WAAW,YAAY;AAC5E,UAAI,KAAK,CAAC;AAAA,IACZ;AAAA,EACF;AACA,QAAM,SAAS,EAAE,KAAK,KAAK;AAC3B,oBAAkB,IAAI,SAAS,EAAE,MAAM,QAAQ,eAAe,QAAQ,CAAC;AACvE,SAAO;AACT;AAQA,IAAM,mBAAmB;AACzB,IAAM,iBAAiB,oBAAI,IAA2B;AAE/C,SAAS,mBAAmB,UAAoC;AACrE,QAAM,QAAQ,eAAe,IAAI,QAAQ;AACzC,MAAI,CAAC,MAAO,QAAO;AACnB,MAAI,KAAK,IAAI,IAAI,MAAM,WAAW,kBAAkB;AAClD,mBAAe,OAAO,QAAQ;AAC9B,WAAO;AAAA,EACT;AACA,SAAO,MAAM;AACf;AAEO,SAAS,mBAAmB,UAAkB,SAA0B;AAC7E,iBAAe,IAAI,UAAU,EAAE,SAAS,UAAU,KAAK,IAAI,EAAE,CAAC;AAE9D,MAAI,eAAe,OAAO,KAAK;AAC7B,UAAM,MAAM,KAAK,IAAI;AACrB,eAAW,CAAC,KAAK,KAAK,KAAK,gBAAgB;AACzC,UAAI,MAAM,MAAM,WAAW,iBAAkB,gBAAe,OAAO,GAAG;AAAA,IACxE;AAAA,EACF;AACF;AAEO,SAAS,iBAAiB,SAAwB;AACvD,MAAI,SAAS;AACX,kBAAc,OAAO,OAAO;AAC5B,sBAAkB,OAAO,OAAO;AAChC,UAAM,eAAe,GAAG,OAAO;AAC/B,UAAM,qBAAqB,CAAC,GAAG,iBAAiB,KAAK,CAAC,EAAE,OAAO,CAAC,QAAQ,IAAI,WAAW,YAAY,CAAC;AACpG,eAAW,OAAO,mBAAoB,kBAAiB,OAAO,GAAG;AACjE,oBAAgB,OAAO,OAAO;AAC9B,sBAAkB,OAAO,OAAO;AAAA,EAClC,OAAO;AACL,kBAAc,MAAM;AACpB,sBAAkB,MAAM;AACxB,qBAAiB,MAAM;AACvB,oBAAgB,MAAM;AACtB,sBAAkB,MAAM;AACxB,mBAAe,MAAM;AAAA,EACvB;AACF;AAEO,SAAS,oBAAoB,SAKlC;AACA,QAAM,MAAM,cAAc,IAAI,OAAO;AACrC,QAAM,UAAU,kBAAkB,IAAI,OAAO;AAC7C,SAAO;AAAA,IACL,SAAS,KAAK,SAAS,QAAQ;AAAA,IAC/B,aAAa,SAAS,SAAS,QAAQ;AAAA,IACvC,YAAY,KAAK,WAAW;AAAA,IAC5B,gBAAgB,SAAS,WAAW;AAAA,EACtC;AACF;","names":[]}

package/dist/{chunk-UIYZ5T3I.js → chunk-6UJ47TVX.js}

@@ -1,17 +1,17 @@
 import {
   BoxBuilder
-} from "./chunk-M5KEYE5E.js";
+} from "./chunk-URB2WSKZ.js";
+import {
+  countRecallTokenOverlap,
+  normalizeRecallTokens
+} from "./chunk-DT5TVLJE.js";
 import {
   StorageManager
-} from "./chunk-QWUUMMIK.js";
+} from "./chunk-GV6NLQ4X.js";
 import {
   getCachedEpisodeMap,
   setCachedEpisodeMap
-} from "./chunk-ESSMF2FR.js";
-import {
-  countRecallTokenOverlap,
-  normalizeRecallTokens
-} from "./chunk-DT5TVLJE.js";
+} from "./chunk-6PFRXT4K.js";
 
 // src/verified-recall.ts
 function createReadOnlyBoxBuilder(memoryDir) {
@@ -105,4 +105,4 @@ async function searchVerifiedEpisodes(options) {
 export {
   searchVerifiedEpisodes
 };
-//# sourceMappingURL=chunk-UIYZ5T3I.js.map
+//# sourceMappingURL=chunk-6UJ47TVX.js.map