@remnic/core 9.69.39 → 9.69.41

package/dist/chunk-WKDFJXW5.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/local-llm-helpers.ts"],"sourcesContent":["import { log } from \"./logger.js\";\nexport function isAbortError(err: unknown): boolean {\n  if (!err || typeof err !== \"object\") return false;\n  const maybe = err as { name?: string; message?: string };\n  return (\n    maybe.name === \"AbortError\" ||\n    maybe.message === \"This operation was aborted\" ||\n    maybe.message === \"The operation was aborted\"\n  );\n}\n\nexport function waitForRetryBackoff(backoffMs: number, signal?: AbortSignal): Promise<boolean> {\n  return new Promise((resolve) => {\n    let settled = false;\n    let timer: NodeJS.Timeout | undefined;\n    const onAbort = (): void => {\n      if (settled) return;\n      settled = true;\n      if (timer) clearTimeout(timer);\n      signal?.removeEventListener(\"abort\", onAbort);\n      resolve(false);\n    };\n    const onTimer = (): void => {\n      if (settled) return;\n      settled = true;\n      signal?.removeEventListener(\"abort\", onAbort);\n      resolve(true);\n    };\n    timer = setTimeout(onTimer, backoffMs);\n    if (signal) {\n      if (signal.aborted) onAbort();\n      else signal.addEventListener(\"abort\", onAbort, { once: true });\n    }\n  });\n}\n\nexport function normalizeBackendTripReason(reason: string): string {\n  const cleaned = reason.replace(/\\s+/g, \" \").replace(/^[-:–—\\s]+/, \"\").trim();\n  if (!cleaned) return \"unknown local backend failure\";\n  return cleaned.length > 160 ? `${cleaned.slice(0, 157)}...` : cleaned;\n}\n\nexport function extractNonRecoverableBackendReason(reason: string): string | null {\n  const match = reason.match(\n    /Failed to load model|Library not loaded|different Team IDs|code signature|llm_engine_mlx_amphibian/i,\n  );\n  return match?.[0] ?? null;\n}\n\nexport function extractNonRecoverableBackendReasonFromErrorText(errorText: string): string | null {\n  const directReason = extractNonRecoverableBackendReason(errorText);\n  if (directReason) return directReason;\n  try {\n    const parsed = JSON.parse(errorText) as { error?: { message?: string } };\n    return extractNonRecoverableBackendReason(parsed?.error?.message ?? \"\");\n  } catch {\n    return null;\n  }\n}\n\n/**\n * Flatten a fetch rejection into one line, including the `cause` undici hides\n * the real reason behind (`fetch failed` alone says nothing).\n */\nexport function describeFetchFailure(err: unknown): string {\n  const name = err instanceof Error ? err.name : \"\";\n  const message = err instanceof Error ? err.message : String(err);\n  const cause: unknown = err instanceof Error ? (err as Error & { cause?: unknown }).cause : undefined;\n  const causeText = cause instanceof Error\n    ? ` (cause: ${cause.name}: ${cause.message}${\n      typeof (cause as Error & { code?: unknown }).code === \"string\"\n        ? ` [${String((cause as Error & { code?: unknown }).code)}]`\n        : \"\"\n    })`\n    : cause === undefined\n      ? \"\"\n      : ` (cause: ${String(cause)})`;\n  return `${name ? `${name}: ` : \"\"}${message}${causeText}`;\n}\n\n/**\n * What to record when every availability probe failed.\n *\n * A probe that TIMED OUT is not evidence the backend is down: the budget is a\n * fixed 2s and a busy event loop can burn it before the socket is scheduled,\n * so the backend looks dead while it answers other callers in single-digit ms.\n * Caching that verdict took extraction offline for a whole health-check\n * interval at a time (issue #2210), so a timeout leaves availability UNKNOWN —\n * this call fails, the next one re-probes instead of reading a stale false.\n *\n * A backend that ANSWERED and said no is a real verdict and stays cached, or\n * the daemon re-probes a known-bad endpoint on every request.\n */\nexport function resolveUnavailableVerdict(args: {\n  baseUrl: string;\n  sawAbortedProbe: boolean;\n  wasAvailable: boolean | null;\n}): { cacheVerdict: boolean; warning: string | null } {\n  if (args.sawAbortedProbe) {\n    return {\n      cacheVerdict: false,\n      warning:\n        `local LLM availability probe timed out at ${args.baseUrl} (event loop busy?); treating availability as ` +\n        \"unknown and re-probing on the next request rather than marking the backend down\",\n    };\n  }\n  return {\n    cacheVerdict: true,\n    // Surfaced at warn, not debug: extraction stops silently when this flips,\n    // and the daemon emits no debug at all unless configured for it.\n    warning: args.wasAvailable !== false ? `local LLM became unavailable at ${args.baseUrl}` : null,\n  };\n}\n\nexport interface ProbeFetchResult {\n  ok: boolean;\n  data: unknown;\n  status: number | null;\n  /** The probe hit its own budget rather than getting an answer. */\n  aborted?: boolean;\n}\n\n/**\n * One health-probe request.\n *\n * Every failure is logged with its cause: a transport error and a 404 both\n * returned `ok: false` with nothing recorded, so an unreachable backend was\n * indistinguishable from a wrong path and an availability failure had no\n * diagnosable reason at all (§22, issue #2210).\n */\nexport async function probeFetch(\n  url: string,\n  options: { timeoutMs: number; headers: Record<string, string>; signal?: AbortSignal },\n): Promise<ProbeFetchResult> {\n  const controller = new AbortController();\n  const requestSignal = options.signal\n    ? AbortSignal.any([options.signal, controller.signal])\n    : controller.signal;\n  const timeout = setTimeout(() => controller.abort(), options.timeoutMs);\n  try {\n    const response = await fetch(url, { signal: requestSignal, headers: options.headers });\n    clearTimeout(timeout);\n    if (!response.ok) {\n      log.debug(`local LLM probe: ${url} returned HTTP ${response.status}`);\n      return { ok: false, data: null, status: response.status };\n    }\n    const contentType = response.headers.get(\"content-type\");\n    const data = contentType?.includes(\"application/json\") ? await response.json() : await response.text();\n    return { ok: true, data, status: response.status };\n  } catch (err) {\n    clearTimeout(timeout);\n    const aborted = isAbortError(err);\n    log.debug(\n      `local LLM probe: ${url} ${aborted ? `timed out after ${options.timeoutMs}ms` : \"failed\"}: ${describeFetchFailure(err)}`,\n    );\n    return { ok: false, data: null, status: null, aborted };\n  }\n}\n\ninterface PendingProbe {\n  promise: Promise<boolean>;\n  controller: AbortController;\n  /** Callers still awaiting this sequence; at zero the sequence is aborted. */\n  waiters: number;\n}\n\n/**\n * Collapses concurrent probe sequences onto one in-flight run.\n *\n * A timed-out availability probe deliberately caches nothing (issue #2210),\n * which removed the false verdict that used to absorb concurrent callers:\n * every queued request would then run its own full probe sequence, on a host\n * already slow enough to blow the probe budget.\n *\n * Cancellation is refcounted rather than shared: one caller walking away must\n * not abort a sequence the others are still waiting on, so the underlying task\n * is aborted only once every waiter has gone.\n */\nexport class SingleFlightProbe {\n  private pending: PendingProbe | null = null;\n\n  run(task: (signal: AbortSignal) => Promise<boolean>, signal?: AbortSignal): Promise<boolean> {\n    let active = this.pending;\n    if (!active) {\n      const controller = new AbortController();\n      const created: PendingProbe = { promise: Promise.resolve(false), controller, waiters: 0 };\n      created.promise = task(controller.signal).finally(() => {\n        if (this.pending === created) this.pending = null;\n      });\n      this.pending = created;\n      active = created;\n    }\n    const entry = active;\n    entry.waiters += 1;\n    let released = false;\n    const release = () => {\n      if (released) return;\n      released = true;\n      entry.waiters -= 1;\n      if (entry.waiters > 0) return;\n      // Detach BEFORE aborting. `pending` would otherwise still point at this\n      // doomed entry until the task's own `finally` runs a microtask later, and\n      // a caller arriving in that window would join an aborted sequence and\n      // read its `false` as a verdict.\n      if (this.pending === entry) this.pending = null;\n      entry.controller.abort();\n    };\n    if (!signal) return entry.promise.finally(release);\n    return new Promise<boolean>((resolve, reject) => {\n      const onAbort = () => {\n        release();\n        resolve(false);\n      };\n      signal.addEventListener(\"abort\", onAbort, { once: true });\n      entry.promise.then(\n        (value) => {\n          signal.removeEventListener(\"abort\", onAbort);\n          release();\n          resolve(value);\n        },\n        (err: unknown) => {\n          signal.removeEventListener(\"abort\", onAbort);\n          release();\n          reject(err instanceof Error ? err : new Error(String(err)));\n        },\n      );\n    });\n  }\n}\n"],"mappings":";;;;;AACO,SAAS,aAAa,KAAuB;AAClD,MAAI,CAAC,OAAO,OAAO,QAAQ,SAAU,QAAO;AAC5C,QAAM,QAAQ;AACd,SACE,MAAM,SAAS,gBACf,MAAM,YAAY,gCAClB,MAAM,YAAY;AAEtB;AAEO,SAAS,oBAAoB,WAAmB,QAAwC;AAC7F,SAAO,IAAI,QAAQ,CAAC,YAAY;AAC9B,QAAI,UAAU;AACd,QAAI;AACJ,UAAM,UAAU,MAAY;AAC1B,UAAI,QAAS;AACb,gBAAU;AACV,UAAI,MAAO,cAAa,KAAK;AAC7B,cAAQ,oBAAoB,SAAS,OAAO;AAC5C,cAAQ,KAAK;AAAA,IACf;AACA,UAAM,UAAU,MAAY;AAC1B,UAAI,QAAS;AACb,gBAAU;AACV,cAAQ,oBAAoB,SAAS,OAAO;AAC5C,cAAQ,IAAI;AAAA,IACd;AACA,YAAQ,WAAW,SAAS,SAAS;AACrC,QAAI,QAAQ;AACV,UAAI,OAAO,QAAS,SAAQ;AAAA,UACvB,QAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAAA,IAC/D;AAAA,EACF,CAAC;AACH;AAEO,SAAS,2BAA2B,QAAwB;AACjE,QAAM,UAAU,OAAO,QAAQ,QAAQ,GAAG,EAAE,QAAQ,cAAc,EAAE,EAAE,KAAK;AAC3E,MAAI,CAAC,QAAS,QAAO;AACrB,SAAO,QAAQ,SAAS,MAAM,GAAG,QAAQ,MAAM,GAAG,GAAG,CAAC,QAAQ;AAChE;AAEO,SAAS,mCAAmC,QAA+B;AAChF,QAAM,QAAQ,OAAO;AAAA,IACnB;AAAA,EACF;AACA,SAAO,QAAQ,CAAC,KAAK;AACvB;AAEO,SAAS,gDAAgD,WAAkC;AAChG,QAAM,eAAe,mCAAmC,SAAS;AACjE,MAAI,aAAc,QAAO;AACzB,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,SAAS;AACnC,WAAO,mCAAmC,QAAQ,OAAO,WAAW,EAAE;AAAA,EACxE,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAMO,SAAS,qBAAqB,KAAsB;AACzD,QAAM,OAAO,eAAe,QAAQ,IAAI,OAAO;AAC/C,QAAM,UAAU,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG;AAC/D,QAAM,QAAiB,eAAe,QAAS,IAAoC,QAAQ;AAC3F,QAAM,YAAY,iBAAiB,QAC/B,YAAY,MAAM,IAAI,KAAK,MAAM,OAAO,GACxC,OAAQ,MAAqC,SAAS,WAClD,KAAK,OAAQ,MAAqC,IAAI,CAAC,MACvD,EACN,MACE,UAAU,SACR,KACA,YAAY,OAAO,KAAK,CAAC;AAC/B,SAAO,GAAG,OAAO,GAAG,IAAI,OAAO,EAAE,GAAG,OAAO,GAAG,SAAS;AACzD;AAeO,SAAS,0BAA0B,MAIY;AACpD,MAAI,KAAK,iBAAiB;AACxB,WAAO;AAAA,MACL,cAAc;AAAA,MACd,SACE,6CAA6C,KAAK,OAAO;AAAA,IAE7D;AAAA,EACF;AACA,SAAO;AAAA,IACL,cAAc;AAAA;AAAA;AAAA,IAGd,SAAS,KAAK,iBAAiB,QAAQ,mCAAmC,KAAK,OAAO,KAAK;AAAA,EAC7F;AACF;AAkBA,eAAsB,WACpB,KACA,SAC2B;AAC3B,QAAM,aAAa,IAAI,gBAAgB;AACvC,QAAM,gBAAgB,QAAQ,SAC1B,YAAY,IAAI,CAAC,QAAQ,QAAQ,WAAW,MAAM,CAAC,IACnD,WAAW;AACf,QAAM,UAAU,WAAW,MAAM,WAAW,MAAM,GAAG,QAAQ,SAAS;AACtE,MAAI;AACF,UAAM,WAAW,MAAM,MAAM,KAAK,EAAE,QAAQ,eAAe,SAAS,QAAQ,QAAQ,CAAC;AACrF,iBAAa,OAAO;AACpB,QAAI,CAAC,SAAS,IAAI;AAChB,UAAI,MAAM,oBAAoB,GAAG,kBAAkB,SAAS,MAAM,EAAE;AACpE,aAAO,EAAE,IAAI,OAAO,MAAM,MAAM,QAAQ,SAAS,OAAO;AAAA,IAC1D;AACA,UAAM,cAAc,SAAS,QAAQ,IAAI,cAAc;AACvD,UAAM,OAAO,aAAa,SAAS,kBAAkB,IAAI,MAAM,SAAS,KAAK,IAAI,MAAM,SAAS,KAAK;AACrG,WAAO,EAAE,IAAI,MAAM,MAAM,QAAQ,SAAS,OAAO;AAAA,EACnD,SAAS,KAAK;AACZ,iBAAa,OAAO;AACpB,UAAM,UAAU,aAAa,GAAG;AAChC,QAAI;AAAA,MACF,oBAAoB,GAAG,IAAI,UAAU,mBAAmB,QAAQ,SAAS,OAAO,QAAQ,KAAK,qBAAqB,GAAG,CAAC;AAAA,IACxH;AACA,WAAO,EAAE,IAAI,OAAO,MAAM,MAAM,QAAQ,MAAM,QAAQ;AAAA,EACxD;AACF;AAqBO,IAAM,oBAAN,MAAwB;AAAA,EACrB,UAA+B;AAAA,EAEvC,IAAI,MAAiD,QAAwC;AAC3F,QAAI,SAAS,KAAK;AAClB,QAAI,CAAC,QAAQ;AACX,YAAM,aAAa,IAAI,gBAAgB;AACvC,YAAM,UAAwB,EAAE,SAAS,QAAQ,QAAQ,KAAK,GAAG,YAAY,SAAS,EAAE;AACxF,cAAQ,UAAU,KAAK,WAAW,MAAM,EAAE,QAAQ,MAAM;AACtD,YAAI,KAAK,YAAY,QAAS,MAAK,UAAU;AAAA,MAC/C,CAAC;AACD,WAAK,UAAU;AACf,eAAS;AAAA,IACX;AACA,UAAM,QAAQ;AACd,UAAM,WAAW;AACjB,QAAI,WAAW;AACf,UAAM,UAAU,MAAM;AACpB,UAAI,SAAU;AACd,iBAAW;AACX,YAAM,WAAW;AACjB,UAAI,MAAM,UAAU,EAAG;AAKvB,UAAI,KAAK,YAAY,MAAO,MAAK,UAAU;AAC3C,YAAM,WAAW,MAAM;AAAA,IACzB;AACA,QAAI,CAAC,OAAQ,QAAO,MAAM,QAAQ,QAAQ,OAAO;AACjD,WAAO,IAAI,QAAiB,CAAC,SAAS,WAAW;AAC/C,YAAM,UAAU,MAAM;AACpB,gBAAQ;AACR,gBAAQ,KAAK;AAAA,MACf;AACA,aAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AACxD,YAAM,QAAQ;AAAA,QACZ,CAAC,UAAU;AACT,iBAAO,oBAAoB,SAAS,OAAO;AAC3C,kBAAQ;AACR,kBAAQ,KAAK;AAAA,QACf;AAAA,QACA,CAAC,QAAiB;AAChB,iBAAO,oBAAoB,SAAS,OAAO;AAC3C,kBAAQ;AACR,iBAAO,eAAe,QAAQ,MAAM,IAAI,MAAM,OAAO,GAAG,CAAC,CAAC;AAAA,QAC5D;AAAA,MACF;AAAA,IACF,CAAC;AAAA,EACH;AACF;","names":[]}

package/dist/chunk-YDVAM7S4.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/recall-state-view.ts"],"sourcesContent":["/**\n * Recall state views (issue #1952).\n *\n * Config key: `recallStateViews` (default false). When false, annotateStateView\n * is identity: same array reference, no `stateLabel`. config.ts is at its\n * fileSizeGrandfather ceiling, so parseConfig wiring waits for a later PR.\n * Call `parseRecallStateViews` at the recall seam when that lands.\n *\n * Change-intent morphology lives here (do not grow intent.ts). A superseded\n * memory is admitted only when its successor is also in the candidate set.\n *\n * #2859 — chain identities are namespace-qualified (`namespace\\0id`): the\n * same id in two namespaces never cross-anchors. The reverse chain derives\n * from the successor's `supersedes` back-pointer when a predecessor lacks\n * `supersededBy`, and asOf snapshot labels use the temporal validity\n * boundary (predecessor `invalidAt` / successor `validAt`), not the\n * `supersededAt` write time.\n */\nimport { coerceBooleanLike } from \"./connectors/coerce.js\";\n\nexport type StateLabel = \"current\" | \"historical\" | \"transition\";\n\nexport interface StateViewChain {\n  predecessorId: string;\n  successorId: string;\n  supersededAt?: string;\n  /** #2859 — namespace scope; a chain link never crosses namespaces. */\n  namespace?: string;\n}\n\nexport interface StateViewResult {\n  id?: string;\n  docid?: string;\n  status?: string;\n  /** #2859 — namespace that owns this row; qualifies every chain identity. */\n  namespace?: string;\n  /** #2859 — back-pointer: id of the row this one replaced. */\n  supersedes?: string;\n  supersededBy?: string;\n  supersededAt?: string;\n  /** #2859 — fact validity start (frontmatter `valid_at`). */\n  validAt?: string;\n  /** #2859 — fact validity end (frontmatter `invalid_at`). */\n  invalidAt?: string;\n  stateLabel?: StateLabel;\n}\n\nexport const DEFAULT_RECALL_STATE_VIEWS = false;\n\nconst CHANGE_WORDS = [\"switch\", \"switches\", \"switched\", \"switching\", \"change\", \"changes\", \"changed\", \"changing\"];\n\n// Phrase matches are token-bounded: \"when Didi\" must not fire the\n// \"when did\" phrase, and \"confused to\" must not fire \"used to\".\nconst CHANGE_PHRASE_RE = /\\bwhen\\s+did\\b|\\bused\\s+to\\b/;\nconst CHANGE_WORD_RE = new RegExp(`\\\\b(?:${CHANGE_WORDS.join(\"|\")})\\\\b`);\n// Bare \"before\"/\"after\" are ordinary sequencing (\"before lunch\",\n// \"after install\"). They carry change intent only when they point at a\n// specific event through a determiner (\"before the move\", \"after the\n// cutover\").\nconst EVENT_POINTER_RE = /\\b(?:before|after)\\s+(?:the|a|an|this|that|these|those)\\b/;\n\nexport function parseRecallStateViews(raw: unknown): boolean {\n  return coerceBooleanLike(raw, \"recallStateViews\") === true;\n}\n\nexport function isChangeOrientedQuery(query: string): boolean {\n  const lower = query.toLowerCase();\n  return CHANGE_PHRASE_RE.test(lower) || CHANGE_WORD_RE.test(lower) || EVENT_POINTER_RE.test(lower);\n}\n\nexport function shouldWidenSuperseded(\n  successorId: string | undefined,\n  candidateIds: ReadonlySet<string>,\n): boolean {\n  return typeof successorId === \"string\" && successorId.length > 0 && candidateIds.has(successorId);\n}\n\nexport function formatSupersededPrefix(date: string, successorId: string): string {\n  return `[superseded ${date} by ${successorId}]`;\n}\n\nexport function resultStateViewId(result: StateViewResult): string {\n  return result.id ?? result.docid ?? \"\";\n}\n\n/**\n * #2859 — namespace-qualified chain identity. Namespace fanout can surface\n * the same id from two namespaces; every successor/admission match runs on\n * `namespace\\0id` keys so a row in one namespace can never anchor (or be\n * anchored by) an identically-named row in another.\n */\nexport function stateViewKey(namespace: string | undefined, id: string): string {\n  return `${typeof namespace === \"string\" ? namespace : \"\"}\\u0000${id}`;\n}\n\nexport function resultStateViewKey(result: StateViewResult): string {\n  const id = resultStateViewId(result);\n  return id ? stateViewKey(result.namespace, id) : \"\";\n}\n\n/** Inverse of {@link stateViewKey}: the id after the namespace separator. */\nfunction stateViewIdFromKey(key: string): string {\n  const sep = key.indexOf(\"\\u0000\");\n  return sep === -1 ? key : key.slice(sep + 1);\n}\n\n/**\n * predecessorKey → successorKey, namespace-qualified. Precedence: explicit\n * chains, then successor rows' `supersedes` back-pointers (#2859 — derives\n * the reverse chain when the predecessor lacks `supersededBy`), then the\n * predecessor's own `supersededBy` (authoritative when present).\n */\nfunction buildSuccessorMap(\n  results: readonly StateViewResult[],\n  chains: readonly StateViewChain[],\n): Map<string, string> {\n  const byPred = new Map<string, string>();\n  const link = (predKey: string, succKey: string, overwrite: boolean): void => {\n    if (!predKey || !succKey) return;\n    if (overwrite || !byPred.has(predKey)) byPred.set(predKey, succKey);\n  };\n  for (const chain of chains) {\n    if (chain.predecessorId && chain.successorId) {\n      link(\n        stateViewKey(chain.namespace, chain.predecessorId),\n        stateViewKey(chain.namespace, chain.successorId),\n        false,\n      );\n    }\n  }\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key && result.supersedes) {\n      link(stateViewKey(result.namespace, result.supersedes), key, false);\n    }\n  }\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key && result.supersededBy) {\n      link(key, stateViewKey(result.namespace, result.supersededBy), true);\n    }\n  }\n  return byPred;\n}\n\nfunction successorLinkOf(\n  result: StateViewResult,\n  byPred: ReadonlyMap<string, string>,\n): { superseded: boolean; successorKey: string | undefined } {\n  const key = resultStateViewKey(result);\n  return {\n    superseded:\n      result.status === \"superseded\" ||\n      Boolean(result.supersededBy) ||\n      byPred.has(key),\n    successorKey: result.supersededBy\n      ? stateViewKey(result.namespace, result.supersededBy)\n      : byPred.get(key),\n  };\n}\n\nfunction labelFor(\n  key: string,\n  result: StateViewResult,\n  byPred: Map<string, string>,\n  admittedIds: ReadonlySet<string>,\n  asOfMs: number | null,\n): StateLabel {\n  const { successorKey } = successorLinkOf(result, byPred);\n  const isPred = shouldWidenSuperseded(successorKey, admittedIds);\n  let isSucc = false;\n  for (const [predId, succId] of byPred) {\n    if (succId === key && admittedIds.has(predId)) {\n      isSucc = true;\n      break;\n    }\n  }\n  if (isPred && isSucc) return \"transition\";\n  if (isPred) return \"historical\";\n  if (isSucc) return \"current\";\n  if (result.status === \"superseded\") {\n    // #1952 asOf mode: the successor is legitimately absent under the\n    // historical pin (a linked successor takes the pair branches above).\n    // The row was the live fact at the snapshot when the temporal\n    // validity boundary postdates the pin (\"current\" relative to the\n    // snapshot); already replaced at the pin is \"historical\". #2859: the\n    // boundary is the fact's validity flip — `invalidAt` (the supersession\n    // pipeline sets it to the successor's valid_at) — not the\n    // `supersededAt` write time; legacy rows without a window fall back\n    // to supersededAt.\n    return asOfMs === null ? \"historical\" : snapshotStateLabel(result, asOfMs);\n  }\n  return \"current\";\n}\n\nfunction snapshotStateLabel(result: StateViewResult, asOfMs: number): StateLabel {\n  const invalidAtMs = Date.parse(result.invalidAt ?? \"\");\n  const boundaryMs = Number.isFinite(invalidAtMs)\n    ? invalidAtMs\n    : Date.parse(result.supersededAt ?? \"\");\n  return Number.isFinite(boundaryMs) && boundaryMs <= asOfMs ? \"historical\" : \"current\";\n}\n\nexport function annotateStateView<T extends StateViewResult>(\n  results: T[],\n  query: string,\n  chains: readonly StateViewChain[],\n  options: { enabled?: boolean; asOfMs?: number } = {},\n): T[] {\n  const enabled = options.enabled === true;\n  if (!enabled || !isChangeOrientedQuery(query)) return results;\n  // #1952 asOf mode: under a historical pin the pipeline's isValidAsOf\n  // gate already decided validity at the pinned instant, so a predecessor\n  // must not be discarded merely because its successor is absent under\n  // the same filter. A valid asOf result is never emptied here.\n  const asOfMs =\n    typeof options.asOfMs === \"number\" && Number.isFinite(options.asOfMs)\n      ? options.asOfMs\n      : null;\n\n  const byPred = buildSuccessorMap(results, chains);\n  const candidateIds = new Set<string>();\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (key) candidateIds.add(key);\n  }\n  let admitted: T[];\n  if (asOfMs !== null) {\n    admitted = results.slice();\n  } else {\n    admitted = [];\n    for (const result of results) {\n      const { superseded, successorKey } = successorLinkOf(result, byPred);\n      if (!superseded || shouldWidenSuperseded(successorKey, candidateIds)) {\n        admitted.push(result);\n      }\n    }\n\n    // #1952 contract: superseded never appears without its successor. A\n    // successor can itself be dropped (filtered elsewhere, or transitively\n    // orphaned), so reconcile to a fixpoint instead of trusting the first pass.\n    let admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n    for (let changed = true; changed; ) {\n      changed = false;\n      for (let i = admitted.length - 1; i >= 0; i -= 1) {\n        const row = admitted[i]!;\n        const { superseded, successorKey } = successorLinkOf(row, byPred);\n        if (superseded && !shouldWidenSuperseded(successorKey, admittedIds)) {\n          admitted.splice(i, 1);\n          changed = true;\n        }\n      }\n      if (changed) admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n    }\n  }\n\n  const admittedIds = new Set(admitted.map(resultStateViewKey).filter(Boolean));\n  return admitted.map((result) => {\n    const key = resultStateViewKey(result);\n    const { successorKey } = successorLinkOf(result, byPred);\n    const stateLabel = labelFor(key, result, byPred, admittedIds, asOfMs);\n    if (result.supersededBy || !successorKey) return { ...result, stateLabel };\n    return { ...result, stateLabel, supersededBy: stateViewIdFromKey(successorKey) };\n  });\n}\n\n/**\n * #2859 — drop superseded rows whose successor is not in the pool BEFORE\n * the user cap/MMR runs, so post-cap orphan removal can never underfill\n * the result set. Reconciles to a fixpoint (a dropped successor orphans\n * its own predecessors). Rows with no successor links pass through in\n * order. ponytail: repeated full-pool passes are O(n²) on one long chain;\n * recall pools stay small, memoize per-key if pools ever grow.\n */\nexport function reconcileStateViewPairs<T extends StateViewResult>(results: readonly T[]): T[] {\n  const byPred = buildSuccessorMap(results, []);\n  let kept = results.slice();\n  for (let changed = true; changed; ) {\n    changed = false;\n    const keptKeys = new Set(kept.map(resultStateViewKey).filter(Boolean));\n    const next: T[] = [];\n    for (const row of kept) {\n      const { superseded, successorKey } = successorLinkOf(row, byPred);\n      if (superseded && !shouldWidenSuperseded(successorKey, keptKeys)) {\n        changed = true;\n        continue;\n      }\n      next.push(row);\n    }\n    if (changed) kept = next;\n  }\n  return kept;\n}\n\n/**\n * #2859 — packet-counting cap. A predecessor/successor chain admitted\n * together is ONE complete evidence packet: it consumes a single slot of\n * the user cap, and the slice never splits a packet at the boundary (no\n * underfill from post-cap orphan removal). Rows keep their incoming\n * (MMR) order; packets are ordered by first appearance. Call\n * reconcileStateViewPairs first so orphans never consume a slot.\n */\nexport function capStateViewPackets<T extends StateViewResult>(\n  ordered: readonly T[],\n  limit: number,\n): T[] {\n  const safeLimit =\n    typeof limit === \"number\" && Number.isFinite(limit) ? Math.max(0, Math.floor(limit)) : 0;\n  if (safeLimit === 0) return [];\n  if (ordered.length === 0) return [];\n\n  const byPred = buildSuccessorMap(ordered, []);\n  // Union-find over row keys; blank-key rows become per-index singletons.\n  const parent = new Map<string, string>();\n  const root = (key: string): string => {\n    let current = key;\n    for (;;) {\n      const up = parent.get(current);\n      if (up === undefined || up === current) {\n        parent.set(current, current);\n        return current;\n      }\n      current = up;\n    }\n  };\n  const union = (a: string, b: string): void => {\n    const ra = root(a);\n    const rb = root(b);\n    if (ra !== rb) parent.set(ra, rb);\n  };\n  const keys: string[] = [];\n  const keyToIndex = new Map<string, number>();\n  for (let i = 0; i < ordered.length; i += 1) {\n    // ponytail: blank-key rows must stay distinct singletons; index-keyed.\n    const key = resultStateViewKey(ordered[i]!) || `#idx${i}`;\n    keys.push(key);\n    if (!parent.has(key)) parent.set(key, key);\n    const first = keyToIndex.get(key);\n    if (first !== undefined) union(keys[first]!, key);\n    else keyToIndex.set(key, i);\n  }\n  for (const [predKey, succKey] of byPred) {\n    const predIdx = keyToIndex.get(predKey);\n    const succIdx = keyToIndex.get(succKey);\n    if (predIdx !== undefined && succIdx !== undefined) union(keys[predIdx]!, keys[succIdx]!);\n  }\n  // Packets ordered by first appearance; admit whole packets until the cap.\n  const selectedRoots = new Set<string>();\n  for (let i = 0; i < ordered.length && selectedRoots.size < safeLimit; i += 1) {\n    selectedRoots.add(root(keys[i]!));\n  }\n  const selected: T[] = [];\n  for (let i = 0; i < ordered.length; i += 1) {\n    if (selectedRoots.has(root(keys[i]!))) selected.push(ordered[i]!);\n  }\n  return selected;\n}\n"],"mappings":";;;;;AA+CO,IAAM,6BAA6B;AAE1C,IAAM,eAAe,CAAC,UAAU,YAAY,YAAY,aAAa,UAAU,WAAW,WAAW,UAAU;AAI/G,IAAM,mBAAmB;AACzB,IAAM,iBAAiB,IAAI,OAAO,SAAS,aAAa,KAAK,GAAG,CAAC,MAAM;AAKvE,IAAM,mBAAmB;AAElB,SAAS,sBAAsB,KAAuB;AAC3D,SAAO,kBAAkB,KAAK,kBAAkB,MAAM;AACxD;AAEO,SAAS,sBAAsB,OAAwB;AAC5D,QAAM,QAAQ,MAAM,YAAY;AAChC,SAAO,iBAAiB,KAAK,KAAK,KAAK,eAAe,KAAK,KAAK,KAAK,iBAAiB,KAAK,KAAK;AAClG;AAEO,SAAS,sBACd,aACA,cACS;AACT,SAAO,OAAO,gBAAgB,YAAY,YAAY,SAAS,KAAK,aAAa,IAAI,WAAW;AAClG;AAEO,SAAS,uBAAuB,MAAc,aAA6B;AAChF,SAAO,eAAe,IAAI,OAAO,WAAW;AAC9C;AAEO,SAAS,kBAAkB,QAAiC;AACjE,SAAO,OAAO,MAAM,OAAO,SAAS;AACtC;AAQO,SAAS,aAAa,WAA+B,IAAoB;AAC9E,SAAO,GAAG,OAAO,cAAc,WAAW,YAAY,EAAE,KAAS,EAAE;AACrE;AAEO,SAAS,mBAAmB,QAAiC;AAClE,QAAM,KAAK,kBAAkB,MAAM;AACnC,SAAO,KAAK,aAAa,OAAO,WAAW,EAAE,IAAI;AACnD;AAGA,SAAS,mBAAmB,KAAqB;AAC/C,QAAM,MAAM,IAAI,QAAQ,IAAQ;AAChC,SAAO,QAAQ,KAAK,MAAM,IAAI,MAAM,MAAM,CAAC;AAC7C;AAQA,SAAS,kBACP,SACA,QACqB;AACrB,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,OAAO,CAAC,SAAiB,SAAiB,cAA6B;AAC3E,QAAI,CAAC,WAAW,CAAC,QAAS;AAC1B,QAAI,aAAa,CAAC,OAAO,IAAI,OAAO,EAAG,QAAO,IAAI,SAAS,OAAO;AAAA,EACpE;AACA,aAAW,SAAS,QAAQ;AAC1B,QAAI,MAAM,iBAAiB,MAAM,aAAa;AAC5C;AAAA,QACE,aAAa,MAAM,WAAW,MAAM,aAAa;AAAA,QACjD,aAAa,MAAM,WAAW,MAAM,WAAW;AAAA,QAC/C;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,OAAO,OAAO,YAAY;AAC5B,WAAK,aAAa,OAAO,WAAW,OAAO,UAAU,GAAG,KAAK,KAAK;AAAA,IACpE;AAAA,EACF;AACA,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,OAAO,OAAO,cAAc;AAC9B,WAAK,KAAK,aAAa,OAAO,WAAW,OAAO,YAAY,GAAG,IAAI;AAAA,IACrE;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBACP,QACA,QAC2D;AAC3D,QAAM,MAAM,mBAAmB,MAAM;AACrC,SAAO;AAAA,IACL,YACE,OAAO,WAAW,gBAClB,QAAQ,OAAO,YAAY,KAC3B,OAAO,IAAI,GAAG;AAAA,IAChB,cAAc,OAAO,eACjB,aAAa,OAAO,WAAW,OAAO,YAAY,IAClD,OAAO,IAAI,GAAG;AAAA,EACpB;AACF;AAEA,SAAS,SACP,KACA,QACA,QACA,aACA,QACY;AACZ,QAAM,EAAE,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACvD,QAAM,SAAS,sBAAsB,cAAc,WAAW;AAC9D,MAAI,SAAS;AACb,aAAW,CAAC,QAAQ,MAAM,KAAK,QAAQ;AACrC,QAAI,WAAW,OAAO,YAAY,IAAI,MAAM,GAAG;AAC7C,eAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,MAAI,UAAU,OAAQ,QAAO;AAC7B,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAQ,QAAO;AACnB,MAAI,OAAO,WAAW,cAAc;AAUlC,WAAO,WAAW,OAAO,eAAe,mBAAmB,QAAQ,MAAM;AAAA,EAC3E;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,QAAyB,QAA4B;AAC/E,QAAM,cAAc,KAAK,MAAM,OAAO,aAAa,EAAE;AACrD,QAAM,aAAa,OAAO,SAAS,WAAW,IAC1C,cACA,KAAK,MAAM,OAAO,gBAAgB,EAAE;AACxC,SAAO,OAAO,SAAS,UAAU,KAAK,cAAc,SAAS,eAAe;AAC9E;AAEO,SAAS,kBACd,SACA,OACA,QACA,UAAkD,CAAC,GAC9C;AACL,QAAM,UAAU,QAAQ,YAAY;AACpC,MAAI,CAAC,WAAW,CAAC,sBAAsB,KAAK,EAAG,QAAO;AAKtD,QAAM,SACJ,OAAO,QAAQ,WAAW,YAAY,OAAO,SAAS,QAAQ,MAAM,IAChE,QAAQ,SACR;AAEN,QAAM,SAAS,kBAAkB,SAAS,MAAM;AAChD,QAAM,eAAe,oBAAI,IAAY;AACrC,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,IAAK,cAAa,IAAI,GAAG;AAAA,EAC/B;AACA,MAAI;AACJ,MAAI,WAAW,MAAM;AACnB,eAAW,QAAQ,MAAM;AAAA,EAC3B,OAAO;AACL,eAAW,CAAC;AACZ,eAAW,UAAU,SAAS;AAC5B,YAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACnE,UAAI,CAAC,cAAc,sBAAsB,cAAc,YAAY,GAAG;AACpE,iBAAS,KAAK,MAAM;AAAA,MACtB;AAAA,IACF;AAKA,QAAIA,eAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAC1E,aAAS,UAAU,MAAM,WAAW;AAClC,gBAAU;AACV,eAAS,IAAI,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG;AAChD,cAAM,MAAM,SAAS,CAAC;AACtB,cAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,KAAK,MAAM;AAChE,YAAI,cAAc,CAAC,sBAAsB,cAAcA,YAAW,GAAG;AACnE,mBAAS,OAAO,GAAG,CAAC;AACpB,oBAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI,QAAS,CAAAA,eAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAAA,IACrF;AAAA,EACF;AAEA,QAAM,cAAc,IAAI,IAAI,SAAS,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AAC5E,SAAO,SAAS,IAAI,CAAC,WAAW;AAC9B,UAAM,MAAM,mBAAmB,MAAM;AACrC,UAAM,EAAE,aAAa,IAAI,gBAAgB,QAAQ,MAAM;AACvD,UAAM,aAAa,SAAS,KAAK,QAAQ,QAAQ,aAAa,MAAM;AACpE,QAAI,OAAO,gBAAgB,CAAC,aAAc,QAAO,EAAE,GAAG,QAAQ,WAAW;AACzE,WAAO,EAAE,GAAG,QAAQ,YAAY,cAAc,mBAAmB,YAAY,EAAE;AAAA,EACjF,CAAC;AACH;AAUO,SAAS,wBAAmD,SAA4B;AAC7F,QAAM,SAAS,kBAAkB,SAAS,CAAC,CAAC;AAC5C,MAAI,OAAO,QAAQ,MAAM;AACzB,WAAS,UAAU,MAAM,WAAW;AAClC,cAAU;AACV,UAAM,WAAW,IAAI,IAAI,KAAK,IAAI,kBAAkB,EAAE,OAAO,OAAO,CAAC;AACrE,UAAM,OAAY,CAAC;AACnB,eAAW,OAAO,MAAM;AACtB,YAAM,EAAE,YAAY,aAAa,IAAI,gBAAgB,KAAK,MAAM;AAChE,UAAI,cAAc,CAAC,sBAAsB,cAAc,QAAQ,GAAG;AAChE,kBAAU;AACV;AAAA,MACF;AACA,WAAK,KAAK,GAAG;AAAA,IACf;AACA,QAAI,QAAS,QAAO;AAAA,EACtB;AACA,SAAO;AACT;AAUO,SAAS,oBACd,SACA,OACK;AACL,QAAM,YACJ,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC,IAAI;AACzF,MAAI,cAAc,EAAG,QAAO,CAAC;AAC7B,MAAI,QAAQ,WAAW,EAAG,QAAO,CAAC;AAElC,QAAM,SAAS,kBAAkB,SAAS,CAAC,CAAC;AAE5C,QAAM,SAAS,oBAAI,IAAoB;AACvC,QAAM,OAAO,CAAC,QAAwB;AACpC,QAAI,UAAU;AACd,eAAS;AACP,YAAM,KAAK,OAAO,IAAI,OAAO;AAC7B,UAAI,OAAO,UAAa,OAAO,SAAS;AACtC,eAAO,IAAI,SAAS,OAAO;AAC3B,eAAO;AAAA,MACT;AACA,gBAAU;AAAA,IACZ;AAAA,EACF;AACA,QAAM,QAAQ,CAAC,GAAW,MAAoB;AAC5C,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,KAAK,KAAK,CAAC;AACjB,QAAI,OAAO,GAAI,QAAO,IAAI,IAAI,EAAE;AAAA,EAClC;AACA,QAAM,OAAiB,CAAC;AACxB,QAAM,aAAa,oBAAI,IAAoB;AAC3C,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAE1C,UAAM,MAAM,mBAAmB,QAAQ,CAAC,CAAE,KAAK,OAAO,CAAC;AACvD,SAAK,KAAK,GAAG;AACb,QAAI,CAAC,OAAO,IAAI,GAAG,EAAG,QAAO,IAAI,KAAK,GAAG;AACzC,UAAM,QAAQ,WAAW,IAAI,GAAG;AAChC,QAAI,UAAU,OAAW,OAAM,KAAK,KAAK,GAAI,GAAG;AAAA,QAC3C,YAAW,IAAI,KAAK,CAAC;AAAA,EAC5B;AACA,aAAW,CAAC,SAAS,OAAO,KAAK,QAAQ;AACvC,UAAM,UAAU,WAAW,IAAI,OAAO;AACtC,UAAM,UAAU,WAAW,IAAI,OAAO;AACtC,QAAI,YAAY,UAAa,YAAY,OAAW,OAAM,KAAK,OAAO,GAAI,KAAK,OAAO,CAAE;AAAA,EAC1F;AAEA,QAAM,gBAAgB,oBAAI,IAAY;AACtC,WAAS,IAAI,GAAG,IAAI,QAAQ,UAAU,cAAc,OAAO,WAAW,KAAK,GAAG;AAC5E,kBAAc,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC;AAAA,EAClC;AACA,QAAM,WAAgB,CAAC;AACvB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,GAAG;AAC1C,QAAI,cAAc,IAAI,KAAK,KAAK,CAAC,CAAE,CAAC,EAAG,UAAS,KAAK,QAAQ,CAAC,CAAE;AAAA,EAClE;AACA,SAAO;AACT;","names":["admittedIds"]}

package/dist/chunk-YFTNZMGR.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/background-generation-config.ts"],"sourcesContent":["import { isLoopbackHost } from \"./runtime/http-transport.js\";\n\nexport interface BackgroundGenerationConfig {\n  /** Full chat-completions URL. Never used as the global OpenAI base URL. */\n  endpoint: string;\n  /** Loopback bearer from the generated client file. */\n  token: string;\n  timeoutSeconds: number;\n}\n\nfunction stripTrailingSlashes(value: string): string {\n  let end = value.length;\n  while (end > 0 && value.charCodeAt(end - 1) === 47) {\n    end -= 1;\n  }\n  return end === value.length ? value : value.slice(0, end);\n}\n\nfunction parseBackgroundEndpoint(value: string, keyName: string): string {\n  const trimmed = stripTrailingSlashes(value.trim());\n  let parsed: URL;\n  try {\n    parsed = new URL(trimmed);\n  } catch {\n    throw new Error(`${keyName} must be an absolute HTTP or HTTPS URL`);\n  }\n  if (parsed.protocol !== \"https:\" && parsed.protocol !== \"http:\") {\n    throw new Error(`${keyName} must use HTTP or HTTPS`);\n  }\n  if (parsed.protocol === \"http:\" && !isLoopbackHost(parsed.hostname)) {\n    throw new Error(`${keyName} must use HTTPS unless the host is loopback`);\n  }\n  if (parsed.username || parsed.password || parsed.search || parsed.hash) {\n    throw new Error(\n      `${keyName} must not include credentials, query parameters, or fragments`,\n    );\n  }\n  return trimmed;\n}\n\nfunction parseBackgroundGenerationObject(\n  raw: unknown,\n  keyName: string,\n): BackgroundGenerationConfig {\n  if (!raw || typeof raw !== \"object\" || Array.isArray(raw)) {\n    throw new Error(`${keyName} must be an object`);\n  }\n  const record = raw as Record<string, unknown>;\n  const endpointRaw = record.endpoint;\n  if (typeof endpointRaw !== \"string\" || endpointRaw.trim().length === 0) {\n    throw new Error(`${keyName} must include an endpoint URL`);\n  }\n  const tokenRaw = record.token;\n  if (typeof tokenRaw !== \"string\" || tokenRaw.length === 0) {\n    throw new Error(`${keyName} must include a token`);\n  }\n  const timeoutRaw = record.timeoutSeconds;\n  let timeoutSeconds = 120;\n  if (timeoutRaw !== undefined) {\n    const parsed = typeof timeoutRaw === \"number\" ? timeoutRaw : Number(timeoutRaw);\n    if (!Number.isFinite(parsed) || parsed <= 0) {\n      throw new Error(`${keyName} timeoutSeconds must be a finite number > 0`);\n    }\n    timeoutSeconds = parsed;\n  }\n  return {\n    endpoint: parseBackgroundEndpoint(endpointRaw, `${keyName}.endpoint`),\n    token: tokenRaw,\n    timeoutSeconds,\n  };\n}\n\nexport function parseBackgroundGeneration(\n  cfg: Record<string, unknown>,\n): BackgroundGenerationConfig | undefined {\n  const explicitRaw = cfg.backgroundGeneration;\n  if (explicitRaw === undefined || explicitRaw === null) return undefined;\n  return parseBackgroundGenerationObject(explicitRaw, \"backgroundGeneration\");\n}\n"],"mappings":";;;;;AAUA,SAAS,qBAAqB,OAAuB;AACnD,MAAI,MAAM,MAAM;AAChB,SAAO,MAAM,KAAK,MAAM,WAAW,MAAM,CAAC,MAAM,IAAI;AAClD,WAAO;AAAA,EACT;AACA,SAAO,QAAQ,MAAM,SAAS,QAAQ,MAAM,MAAM,GAAG,GAAG;AAC1D;AAEA,SAAS,wBAAwB,OAAe,SAAyB;AACvE,QAAM,UAAU,qBAAqB,MAAM,KAAK,CAAC;AACjD,MAAI;AACJ,MAAI;AACF,aAAS,IAAI,IAAI,OAAO;AAAA,EAC1B,QAAQ;AACN,UAAM,IAAI,MAAM,GAAG,OAAO,wCAAwC;AAAA,EACpE;AACA,MAAI,OAAO,aAAa,YAAY,OAAO,aAAa,SAAS;AAC/D,UAAM,IAAI,MAAM,GAAG,OAAO,yBAAyB;AAAA,EACrD;AACA,MAAI,OAAO,aAAa,WAAW,CAAC,eAAe,OAAO,QAAQ,GAAG;AACnE,UAAM,IAAI,MAAM,GAAG,OAAO,6CAA6C;AAAA,EACzE;AACA,MAAI,OAAO,YAAY,OAAO,YAAY,OAAO,UAAU,OAAO,MAAM;AACtE,UAAM,IAAI;AAAA,MACR,GAAG,OAAO;AAAA,IACZ;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gCACP,KACA,SAC4B;AAC5B,MAAI,CAAC,OAAO,OAAO,QAAQ,YAAY,MAAM,QAAQ,GAAG,GAAG;AACzD,UAAM,IAAI,MAAM,GAAG,OAAO,oBAAoB;AAAA,EAChD;AACA,QAAM,SAAS;AACf,QAAM,cAAc,OAAO;AAC3B,MAAI,OAAO,gBAAgB,YAAY,YAAY,KAAK,EAAE,WAAW,GAAG;AACtE,UAAM,IAAI,MAAM,GAAG,OAAO,+BAA+B;AAAA,EAC3D;AACA,QAAM,WAAW,OAAO;AACxB,MAAI,OAAO,aAAa,YAAY,SAAS,WAAW,GAAG;AACzD,UAAM,IAAI,MAAM,GAAG,OAAO,uBAAuB;AAAA,EACnD;AACA,QAAM,aAAa,OAAO;AAC1B,MAAI,iBAAiB;AACrB,MAAI,eAAe,QAAW;AAC5B,UAAM,SAAS,OAAO,eAAe,WAAW,aAAa,OAAO,UAAU;AAC9E,QAAI,CAAC,OAAO,SAAS,MAAM,KAAK,UAAU,GAAG;AAC3C,YAAM,IAAI,MAAM,GAAG,OAAO,6CAA6C;AAAA,IACzE;AACA,qBAAiB;AAAA,EACnB;AACA,SAAO;AAAA,IACL,UAAU,wBAAwB,aAAa,GAAG,OAAO,WAAW;AAAA,IACpE,OAAO;AAAA,IACP;AAAA,EACF;AACF;AAEO,SAAS,0BACd,KACwC;AACxC,QAAM,cAAc,IAAI;AACxB,MAAI,gBAAgB,UAAa,gBAAgB,KAAM,QAAO;AAC9D,SAAO,gCAAgC,aAAa,sBAAsB;AAC5E;","names":[]}

package/dist/chunk-YKREX63Z.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/recall-state-view-widen.ts"],"sourcesContent":["/**\n * Recall state-view widening (issue #1952).\n *\n * When recallStateViews is on and the query is change-oriented, admit a\n * superseded memory only if its successor is already in the candidate set.\n * Flag off / non-change queries are identity.\n */\nimport {\n  annotateStateView,\n  isChangeOrientedQuery,\n  parseRecallStateViews,\n  resultStateViewKey,\n  shouldWidenSuperseded,\n  stateViewKey,\n  type StateViewResult,\n} from \"./recall-state-view.js\";\n\nexport function widenRecallStateViews<T extends StateViewResult>(\n  results: T[],\n  query: string,\n  config: unknown,\n  pool: readonly T[] = [],\n  /**\n   * #1952 — per-request effective flag (per-call `stateView` OR config,\n   * gated on change intent), computed once at recall entry and threaded\n   * through. When `true` it wins over the config read so a per-call\n   * override survives a global `false` at the inject seam. Callers that\n   * omit it keep the legacy config-only behavior.\n   */\n  stateViewActive?: boolean,\n  /**\n   * #1952 — historical recall pin (epoch ms). When set, the pool is\n   * never widened (pool rows did not survive the asOf validity filter,\n   * so pulling a not-yet-valid successor into a historical snapshot\n   * would be wrong) and annotation runs in asOf mode: a predecessor is\n   * kept and labeled relative to the snapshot without requiring its\n   * successor.\n   */\n  asOfMs?: number,\n): T[] {\n  const raw =\n    typeof config === \"object\" && config !== null && \"recallStateViews\" in config\n      ? config.recallStateViews\n      : undefined;\n  const enabled = stateViewActive === true || parseRecallStateViews(raw);\n  if (!enabled || !isChangeOrientedQuery(query)) return results;\n  const asOfActive = typeof asOfMs === \"number\" && Number.isFinite(asOfMs);\n\n  // #2859: matches are namespace-qualified, and a successor's `supersedes`\n  // back-pointer anchors its predecessor even when the predecessor's own\n  // `supersededBy` is absent.\n  const candidateIds = new Set<string>();\n  const supersedesAnchors = new Set<string>();\n  for (const result of results) {\n    const key = resultStateViewKey(result);\n    if (!key) continue;\n    candidateIds.add(key);\n    if (result.supersedes) {\n      supersedesAnchors.add(stateViewKey(result.namespace, result.supersedes));\n    }\n  }\n\n  const seen = new Set(candidateIds);\n  const extra: T[] = [];\n  if (!asOfActive) {\n    for (const item of pool) {\n      const key = resultStateViewKey(item);\n      if (!key || seen.has(key)) continue;\n      const successorKey = item.supersededBy\n        ? stateViewKey(item.namespace, item.supersededBy)\n        : undefined;\n      if (!shouldWidenSuperseded(successorKey, candidateIds) && !supersedesAnchors.has(key)) {\n        continue;\n      }\n      extra.push(item);\n      seen.add(key);\n    }\n  }\n\n  return annotateStateView(extra.length > 0 ? results.concat(extra) : results, query, [], {\n    enabled: true,\n    ...(asOfActive ? { asOfMs } : {}),\n  });\n}\n"],"mappings":";;;;;;;;;;AAiBO,SAAS,sBACd,SACA,OACA,QACA,OAAqB,CAAC,GAQtB,iBASA,QACK;AACL,QAAM,MACJ,OAAO,WAAW,YAAY,WAAW,QAAQ,sBAAsB,SACnE,OAAO,mBACP;AACN,QAAM,UAAU,oBAAoB,QAAQ,sBAAsB,GAAG;AACrE,MAAI,CAAC,WAAW,CAAC,sBAAsB,KAAK,EAAG,QAAO;AACtD,QAAM,aAAa,OAAO,WAAW,YAAY,OAAO,SAAS,MAAM;AAKvE,QAAM,eAAe,oBAAI,IAAY;AACrC,QAAM,oBAAoB,oBAAI,IAAY;AAC1C,aAAW,UAAU,SAAS;AAC5B,UAAM,MAAM,mBAAmB,MAAM;AACrC,QAAI,CAAC,IAAK;AACV,iBAAa,IAAI,GAAG;AACpB,QAAI,OAAO,YAAY;AACrB,wBAAkB,IAAI,aAAa,OAAO,WAAW,OAAO,UAAU,CAAC;AAAA,IACzE;AAAA,EACF;AAEA,QAAM,OAAO,IAAI,IAAI,YAAY;AACjC,QAAM,QAAa,CAAC;AACpB,MAAI,CAAC,YAAY;AACf,eAAW,QAAQ,MAAM;AACvB,YAAM,MAAM,mBAAmB,IAAI;AACnC,UAAI,CAAC,OAAO,KAAK,IAAI,GAAG,EAAG;AAC3B,YAAM,eAAe,KAAK,eACtB,aAAa,KAAK,WAAW,KAAK,YAAY,IAC9C;AACJ,UAAI,CAAC,sBAAsB,cAAc,YAAY,KAAK,CAAC,kBAAkB,IAAI,GAAG,GAAG;AACrF;AAAA,MACF;AACA,YAAM,KAAK,IAAI;AACf,WAAK,IAAI,GAAG;AAAA,IACd;AAAA,EACF;AAEA,SAAO,kBAAkB,MAAM,SAAS,IAAI,QAAQ,OAAO,KAAK,IAAI,SAAS,OAAO,CAAC,GAAG;AAAA,IACtF,SAAS;AAAA,IACT,GAAI,aAAa,EAAE,OAAO,IAAI,CAAC;AAAA,EACjC,CAAC;AACH;","names":[]}