@remnic/core 10.0.59 → 10.0.61

package/dist/chunk-JCL7RO2G.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/storage/buffer-drain-claims.ts","../src/storage/buffer-session-files.ts"],"sourcesContent":["/**\n * Durable drain claims for the extraction buffer (`remnic buffer drain`).\n *\n * A claim is the atomic handover of one session's buffered turns from the\n * live buffer (daemon or CLI process) to a drain worker, so extraction can\n * run out of process without a live buffer owner resurrecting or losing the\n * turns. Files under `<stateDir>/buffer/drain/`:\n *\n *   s-<sha256(key)>.json        claim content: { key, entry, claimedAt }\n *                               — the turns NOT yet extracted. Renamed into\n *                               place from the session file (atomic on one\n *                               filesystem), rewritten atomically as chunks\n *                               drain.\n *   s-<sha256(key)>.lease.json  { ownerId, pid, acquiredAt, heartbeatAt,\n *                               leaseMs } — created with exclusive-create so\n *                               exactly one drainer holds a key.\n *\n * Invariants (see the buffer-drain PR for the full protocol):\n *   - At every instant the claim content file holds exactly the turns whose\n *     extraction is not durably finished, so a kill at any point loses\n *     nothing and the next run resumes.\n *   - A live buffer owner that must persist a claimed session hands its\n *     in-memory entry INTO the claim (merge, identity-deduped) instead of\n *     writing a session file — it can never resurrect claimed turns.\n *   - Claims are idempotent: re-claiming, double-draining, and two\n *     concurrent drainers are all safe (per-key mutation lock + exclusive\n *     lease; the lock also fences lease takeover and progress writes).\n *\n * All content reads/writes go through the storage's secure file I/O\n * (`BufferFileIo`); only lease/existence checks touch raw paths, and claim\n * rewrites serialize on a cross-process held file lock.\n */\n\nimport { hostname } from \"node:os\";\nimport { z } from \"zod\";\nimport { existsSync } from \"node:fs\";\nimport { mkdir, readdir, rename, unlink, writeFile } from \"node:fs/promises\";\nimport path from \"node:path\";\n\nimport { bufferSessionFileName, type BufferFileIo } from \"./buffer-session-files.js\";\nimport { bufferTurnsEqual, subtractBufferTurns } from \"../buffer-turn-helpers.js\";\nimport { log } from \"../logger.js\";\nimport { withHeldFileLock } from \"../utils/serialize-mutations.js\";\nimport type { BufferEntryState, BufferTurn } from \"../types.js\";\n\n/** Result of persisting one session's entry. */\nexport interface BufferSessionSaveOutcome {\n  /** \"saved\": the session file holds the entry. \"handed_over\": the entry moved into a drain claim. */\n  status: \"saved\" | \"handed_over\";\n  /** Turns a drain already extracted (claim tombstone): the owner subtracts them from its copy. */\n  drainedTurns?: BufferTurn[];\n}\n\nexport interface DrainLease {\n  ownerId: string;\n  pid: number;\n  /** Host the owner runs on: a takeover may only judge liveness on that host. */\n  host: string;\n  acquiredAt: string;\n  heartbeatAt: string;\n  leaseMs: number;\n}\n\nexport interface DrainClaimFile {\n  key: string;\n  entry: BufferEntryState;\n  claimedAt: string;\n  /**\n   * Turns the drain already extracted. Non-empty means the session was\n   * drained and the claim is a TOMBSTONE: a live buffer owner subtracts\n   * these from its (possibly stale) copy instead of writing them back, so\n   * drained turns can never be resurrected.\n   */\n  drained?: BufferTurn[];\n  /** Same tombstone for turns the drain extracted from `retainedTurns`. */\n  drainedRetained?: BufferTurn[];\n}\n\nexport type ClaimFromSessionOutcome = \"claimed\" | \"empty\" | \"already_claimed\";\nexport type AdoptOutcome = \"adopted\" | \"busy\";\nexport type AckOutcome = \"acked\" | \"not_empty\" | \"busy\";\n\nexport interface DrainClaimListing {\n  key: string;\n  turnCount: number;\n  leased: boolean;\n  leaseExpired: boolean;\n}\n\n/** Lock while a claim is read-modify-written; released on settle. */\nconst CLAIM_LOCK_STALE_MS = 120_000;\nconst CLAIM_LOCK_MAX_WAIT_MS = 120_000;\n\nfunction emptyEntry(): BufferEntryState {\n  return { turns: [], lastExtractionAt: null, extractionCount: 0 };\n}\n\n/** Identity-dedupe `incoming` turns into `existing` (they are the same turns a\n * live owner still held after claiming; only genuinely NEW turns append). */\nfunction mergeTurns<T>(existing: T[], incoming: readonly T[], isEqual: (a: T, b: T) => boolean): T[] {\n  const merged = [...existing];\n  for (const turn of incoming) {\n    if (merged.some((kept) => isEqual(kept, turn))) continue;\n    merged.push(turn);\n  }\n  return merged;\n}\n\nfunction mergeEntries(claim: DrainClaimFile, incoming: BufferEntryState): DrainClaimFile {\n  const entry = emptyEntry();\n  // Turns already extracted stay out of the pending entry even when the\n  // owner's incoming copy is stale and still carries them (either tombstone\n  // list counts — a turn in either one left the claim for good).\n  const gone = [...(claim.drained ?? []), ...(claim.drainedRetained ?? [])];\n  entry.turns = mergeTurns(\n    subtractBufferTurns(claim.entry.turns, gone),\n    subtractBufferTurns(incoming.turns, gone),\n    bufferTurnsEqual,\n  );\n  const retained = [\n    ...subtractBufferTurns(claim.entry.retainedTurns ?? [], gone),\n    ...subtractBufferTurns(incoming.retainedTurns ?? [], gone),\n  ];\n  // SAFETY: an empty accumulator of the same element type.\n  const dedupedRetained = mergeTurns([] as typeof retained, retained, bufferTurnsEqual);\n  if (dedupedRetained.length > 0) entry.retainedTurns = dedupedRetained;\n  const stamps = [claim.entry.lastExtractionAt, incoming.lastExtractionAt].filter(\n    (value): value is string => value !== null && value !== undefined,\n  );\n  entry.lastExtractionAt = stamps.sort().at(-1) ?? null;\n  entry.extractionCount = Math.max(claim.entry.extractionCount, incoming.extractionCount);\n  return { ...claim, entry };\n}\n\n/**\n * Is the lease owner still running? Only decidable on the owner's host; a\n * lease from another host counts as alive (its expiry decides).\n */\nfunction isOwnerAlive(lease: DrainLease): boolean {\n  if (lease.host !== hostname()) return true;\n  if (!Number.isInteger(lease.pid) || lease.pid <= 0) return true;\n  try {\n    process.kill(lease.pid, 0);\n    return true;\n  } catch (err) {\n    // EPERM: the process exists but belongs to another user.\n    // SAFETY: the value comes from this module's own write path; the shape is checked above.\n    return (err as NodeJS.ErrnoException)?.code === \"EPERM\";\n  }\n}\n\nfunction isLeaseExpired(lease: DrainLease, now = Date.now()): boolean {\n  const heartbeat = Date.parse(lease.heartbeatAt);\n  return !Number.isFinite(heartbeat) || now - heartbeat > lease.leaseMs;\n}\n\nconst claimBodySchema = z.object({\n  key: z.string().min(1),\n  entry: z.object({\n    turns: z.array(z.unknown()),\n    retainedTurns: z.array(z.unknown()).optional(),\n    lastExtractionAt: z.string().nullable().optional(),\n    extractionCount: z.number().optional(),\n  }).optional(),\n  turns: z.array(z.unknown()).optional(),\n  retainedTurns: z.array(z.unknown()).optional(),\n  lastExtractionAt: z.string().nullable().optional(),\n  extractionCount: z.number().optional(),\n  claimedAt: z.string().optional(),\n  drained: z.array(z.unknown()).optional(),\n  drainedRetained: z.array(z.unknown()).optional(),\n});\n\nfunction parseBody(raw: string): DrainClaimFile | null {\n  let body: z.infer<typeof claimBodySchema>;\n  try {\n    body = claimBodySchema.parse(JSON.parse(raw));\n  } catch {\n    return null;\n  }\n  // Two on-disk shapes, one format: a claim born from rename keeps the flat\n  // session-file shape ({key, turns, ...}) until its first rewrite, which\n  // nests under `entry`. Accept both.\n  const source = body.entry && Array.isArray(body.entry.turns) ? body.entry : body;\n  if (!Array.isArray(source.turns)) return null;\n  const entry = emptyEntry();\n  // SAFETY: the schema parsed these as an array of unknown; the claim file\n  // is written only by this module (BufferSessionFiles.save), so the entries\n  // are BufferTurn values.\n  // SAFETY: the claim file is written only by this module, so the parsed\n  // turn arrays hold BufferTurn values.\n  // SAFETY: the value comes from this module's own write path; the shape is checked above.\n  entry.turns = source.turns as BufferTurn[];\n  if (source.retainedTurns) {\n    // SAFETY: same boundary as the turns above (this module writes the file).\n    entry.retainedTurns = source.retainedTurns as BufferTurn[];\n  }\n  entry.lastExtractionAt = source.lastExtractionAt ?? null;\n  entry.extractionCount = Number.isFinite(source.extractionCount) ? Number(source.extractionCount) : 0;\n  const claim: DrainClaimFile = {\n    key: body.key,\n    entry,\n    claimedAt: body.claimedAt ?? new Date().toISOString(),\n  };\n  if (Array.isArray(body.drained)) {\n    // SAFETY: same boundary as the turns above (this module writes the file).\n    claim.drained = body.drained as BufferTurn[];\n  }\n  if (Array.isArray(body.drainedRetained)) {\n    // SAFETY: same boundary as the turns above (this module writes the file).\n    claim.drainedRetained = body.drainedRetained as BufferTurn[];\n  }\n  return claim;\n}\n\nconst leaseSchema = z.object({\n  ownerId: z.string().min(1),\n  pid: z.number().optional(),\n  host: z.string().optional(),\n  acquiredAt: z.string().optional(),\n  heartbeatAt: z.string(),\n  leaseMs: z.number(),\n});\n\nfunction parseLease(raw: string): DrainLease | null {\n  let lease: z.infer<typeof leaseSchema>;\n  try {\n    lease = leaseSchema.parse(JSON.parse(raw));\n  } catch {\n    return null;\n  }\n  return {\n    ownerId: lease.ownerId,\n    pid: lease.pid ?? 0,\n    host: lease.host ?? \"\",\n    acquiredAt: lease.acquiredAt ?? lease.heartbeatAt,\n    heartbeatAt: lease.heartbeatAt,\n    leaseMs: lease.leaseMs,\n  };\n}\n\nexport class BufferDrainClaims {\n  constructor(\n    private readonly stateDir: string,\n    private readonly io: BufferFileIo,\n  ) {}\n\n  private get dir(): string {\n    return path.join(this.stateDir, \"buffer\", \"drain\");\n  }\n\n  private fileFor(key: string): string {\n    return path.join(this.dir, bufferSessionFileName(key));\n  }\n\n  private leaseFileFor(key: string): string {\n    return `${this.fileFor(key)}.lease.json`;\n  }\n\n  private lockFileFor(key: string): string {\n    return `${this.fileFor(key)}.lock`;\n  }\n\n  /** Sync existence check for hot-path gates (`SmartBuffer.isSessionClaimed`). */\n  isClaimed(key: string): boolean {\n    return existsSync(this.fileFor(key));\n  }\n\n  /** Test + CLI seam: the lease file path for direct inspection. */\n  leasePathForTest(key: string): string {\n    return this.leaseFileFor(key);\n  }\n\n  private async readClaimBody(key: string): Promise<DrainClaimFile | null> {\n    try {\n      return parseBody(await this.io.read(this.fileFor(key)));\n    } catch {\n      return null;\n    }\n  }\n\n  /** The claim content for `key`, or null when the key is not claimed. */\n  load(key: string): Promise<DrainClaimFile | null> {\n    return this.readClaimBody(key);\n  }\n\n  private async writeClaimBody(key: string, claim: DrainClaimFile): Promise<void> {\n    await mkdir(this.dir, { recursive: true });\n    await this.io.write(this.fileFor(key), JSON.stringify({ ...claim, key }));\n  }\n\n  private async readLease(key: string): Promise<DrainLease | null> {\n    try {\n      return parseLease(await this.io.read(this.leaseFileFor(key)));\n    } catch {\n      return null;\n    }\n  }\n\n  private async writeLease(key: string, lease: DrainLease): Promise<void> {\n    await mkdir(this.dir, { recursive: true });\n    await this.io.write(this.leaseFileFor(key), JSON.stringify(lease));\n  }\n\n  /**\n   * Atomically move a session's persisted file into a claim. The rename is\n   * the handover: after it settles the turns exist ONLY as a claim, so no\n   * crash window can lose them or leave them in both places. Callers that\n   * lose the race (`already_claimed`) simply skip the key.\n   *\n   * The whole handover runs under the claim's mutation lock, so a claim\n   * create can never land on top of an existing claim (POSIX rename would\n   * silently replace it) and the lease write cannot race an adopter.\n   */\n  async claimFromSessionFile(key: string, lease: DrainLease): Promise<ClaimFromSessionOutcome> {\n    await mkdir(this.dir, { recursive: true });\n    const sessionPath = path.join(this.stateDir, \"buffer\", bufferSessionFileName(key));\n    if (existsSync(sessionPath)) {\n      // Advisory pre-read: an empty live session belongs to its owner, not\n      // the drain. A turn landing between this read and the rename is fine —\n      // the rename moves whatever is there and the claim drains it.\n      try {\n        const seeded = parseBody(await this.io.read(sessionPath));\n        if (seeded && seeded.entry.turns.length === 0 && (seeded.entry.retainedTurns?.length ?? 0) === 0) {\n          return \"empty\";\n        }\n      } catch {\n        // Unreadable live file: proceed with the rename and let the claim\n        // path report it loudly, like the loader skips corrupt files.\n      }\n    }\n    return await withHeldFileLock(\n      this.lockFileFor(key),\n      { staleMs: CLAIM_LOCK_STALE_MS, maxWaitMs: CLAIM_LOCK_MAX_WAIT_MS },\n      async (acquired) => {\n        if (!acquired) return \"already_claimed\";\n        // Under the lock the claim check is authoritative: an existing claim\n        // keeps its content and its lease; the session file stays with its\n        // owner (their next save merges into the claim).\n        if (this.isClaimed(key)) return \"already_claimed\";\n        try {\n          await rename(sessionPath, this.fileFor(key));\n        } catch (err) {\n          // The session file is gone: either it never existed, or another\n          // drainer claimed it first.\n          if (!existsSync(sessionPath)) {\n            if (this.isClaimed(key)) return \"already_claimed\";\n            return \"empty\";\n          }\n          throw err;\n        }\n        const claim = await this.readClaimBody(key);\n        if (!claim || (claim.entry.turns.length === 0 && (claim.entry.retainedTurns?.length ?? 0) === 0)) {\n          // Empty content: nothing to drain. Delete the moved file so the\n          // empty entry keeps living with its owner, not as a stale claim.\n          await unlink(this.fileFor(key)).catch(() => {});\n          return \"empty\";\n        }\n        await this.writeLease(key, lease);\n        return \"claimed\";\n      },\n    );\n  }\n\n  /**\n   * Take over a claim whose lease is missing, expired, or whose owner died.\n   * The whole judgement runs under the claim's mutation lock and re-reads\n   * the lease inside it, so exactly one concurrent adopter wins: the loser\n   * re-reads the winner's fresh lease and reports \"busy\" instead of\n   * unlinking it. A lease whose owner died is taken over in the same call.\n   */\n  async adopt(key: string, lease: DrainLease): Promise<AdoptOutcome> {\n    if (!this.isClaimed(key)) return \"busy\";\n    return await withHeldFileLock(\n      this.lockFileFor(key),\n      { staleMs: CLAIM_LOCK_STALE_MS, maxWaitMs: CLAIM_LOCK_MAX_WAIT_MS },\n      async (acquired) => {\n        if (!acquired) return \"busy\";\n        const existing = await this.readLease(key);\n        if (existing && !isLeaseExpired(existing)) {\n          if (existing.ownerId === lease.ownerId) {\n            // The same drainer already holds it: renew the lease.\n            await this.writeLease(key, { ...existing, heartbeatAt: new Date().toISOString(), leaseMs: lease.leaseMs });\n            return \"adopted\";\n          }\n          if (isOwnerAlive(existing)) return \"busy\";\n          // The owner died without releasing the claim (killed worker):\n          // take it over now instead of waiting for the lease to expire.\n          await unlink(this.leaseFileFor(key)).catch(() => {});\n        } else if (existing) {\n          // Expired lease: clear it before the exclusive create. We hold the\n          // lock, so no concurrent adopter can interleave its own\n          // unlink/create between these steps.\n          await unlink(this.leaseFileFor(key)).catch(() => {});\n        }\n        try {\n          await writeFile(this.leaseFileFor(key), JSON.stringify(lease), { flag: \"wx\" });\n        } catch (err) {\n          // The lease file exists: another drainer took it first.\n          if (existsSync(this.leaseFileFor(key))) return \"busy\";\n          throw err;\n        }\n        return \"adopted\";\n      },\n    );\n  }\n\n  /**\n   * Merge a live owner's in-memory entry INTO the claim (the handover path a\n   * buffer owner takes instead of persisting a claimed session). Serialized\n   * against drainer progress writes on the same lock.\n   */\n  async mergeIntoClaim(key: string, incoming: BufferEntryState): Promise<void> {\n    await withHeldFileLock(this.lockFileFor(key), { staleMs: CLAIM_LOCK_STALE_MS, maxWaitMs: CLAIM_LOCK_MAX_WAIT_MS }, async (acquired) => {\n      if (!acquired) {\n        // Never fall back to a session-file write behind a held claim lock:\n        // that would resurrect claimed turns. Fail so the owner's save stays\n        // pending and retries (SmartBuffer keeps pending state on failure).\n        throw new Error(`buffer drain claim for ${key} is busy; retrying the save later`);\n      }\n      const claim = await this.readClaimBody(key);\n      if (!claim) {\n        // The claim vanished (acked between the isClaimed check and now):\n        // nothing to hand over; the drain already owns everything.\n        return;\n      }\n      await this.writeClaimBody(key, mergeEntries(claim, incoming));\n    });\n  }\n\n  /** Drainer progress: replace the claim content with what is left to do.\n   *\n   * Fenced: `ownerId` must still match the claim's lease (checked under the\n   * same lock), so a drainer that lost its lease cannot write progress that\n   * would restore turns the new owner already extracted.\n   *\n   * `seen` is the entry the drainer LOADED (its snapshot of the claim). Only\n   * turns that were in that snapshot and are absent from BOTH of the\n   * drainer's lists were actually extracted and move to the tombstones — a\n   * turn the drainer moved into `entry.retainedTurns` is retained for retry,\n   * not extracted. Turns a live owner merged into the claim afterwards stay\n   * pending. Without `seen` the pre-existing behavior is kept (every claim\n   * turn missing from `entry` counts as extracted).\n   */\n  async writeEntry(key: string, ownerId: string, entry: BufferEntryState, seen?: BufferEntryState): Promise<void> {\n    await withHeldFileLock(this.lockFileFor(key), { staleMs: CLAIM_LOCK_STALE_MS, maxWaitMs: CLAIM_LOCK_MAX_WAIT_MS }, async (acquired) => {\n      if (!acquired) throw new Error(`buffer drain claim for ${key} is busy; progress write skipped`);\n      const lease = await this.readLease(key);\n      if (!lease || lease.ownerId !== ownerId) {\n        throw new Error(`buffer drain claim for ${key} is no longer owned by ${ownerId}; progress write skipped`);\n      }\n      const claim = await this.readClaimBody(key);\n      if (!claim) return;\n      const seenTurns = seen?.turns ?? claim.entry.turns;\n      const seenRetained = seen?.retainedTurns ?? claim.entry.retainedTurns ?? [];\n      const entryRetained = entry.retainedTurns ?? [];\n      // Still held by the drainer: in its remaining turns OR retained for retry.\n      const kept = (turn: BufferTurn): boolean =>\n        entry.turns.some((held) => bufferTurnsEqual(held, turn)) || entryRetained.some((held) => bufferTurnsEqual(held, turn));\n      // Progress: the snapshot turns that vanished from the entry were extracted.\n      const drained = [...(claim.drained ?? [])];\n      for (const turn of claim.entry.turns) {\n        const extracted =\n          seenTurns.some((snapshot) => bufferTurnsEqual(snapshot, turn)) && !kept(turn);\n        if (!extracted) continue;\n        if (drained.some((gone) => bufferTurnsEqual(gone, turn))) continue;\n        drained.push(turn);\n      }\n      const drainedRetained = [...(claim.drainedRetained ?? [])];\n      for (const turn of claim.entry.retainedTurns ?? []) {\n        const extracted =\n          seenRetained.some((snapshot) => bufferTurnsEqual(snapshot, turn)) && !kept(turn);\n        if (!extracted) continue;\n        if (drained.some((gone) => bufferTurnsEqual(gone, turn)) || drainedRetained.some((gone) => bufferTurnsEqual(gone, turn))) continue;\n        drainedRetained.push(turn);\n      }\n      // Turns merged in after the drainer loaded stay pending, in extraction\n      // order behind the drainer's own remainder.\n      const late = claim.entry.turns.filter(\n        (turn) =>\n          !seenTurns.some((snapshot) => bufferTurnsEqual(snapshot, turn)) && !kept(turn),\n      );\n      const next: BufferEntryState = { ...entry, turns: [...entry.turns, ...late] };\n      const lateRetained = (claim.entry.retainedTurns ?? []).filter(\n        (turn) =>\n          !seenRetained.some((snapshot) => bufferTurnsEqual(snapshot, turn)) && !kept(turn),\n      );\n      if (lateRetained.length > 0) next.retainedTurns = mergeTurns(entryRetained, lateRetained, bufferTurnsEqual);\n      await this.writeClaimBody(key, { ...claim, entry: next, drained, drainedRetained });\n    });\n  }\n\n  /** Extend the lease. \"lost\" means another drainer took the claim over.\n   * Serialized on the claim lock so a stale heartbeat can never overwrite a\n   * new owner's lease mid-takeover; a contended lock just skips this tick\n   * (usually the drainer's own progress write holds it). */\n  async heartbeat(key: string, ownerId: string, leaseMs: number): Promise<\"ok\" | \"lost\"> {\n    return await withHeldFileLock(this.lockFileFor(key), { staleMs: CLAIM_LOCK_STALE_MS, maxWaitMs: CLAIM_LOCK_MAX_WAIT_MS }, async (acquired) => {\n      if (!acquired) return \"ok\";\n      const lease = await this.readLease(key);\n      if (!lease || lease.ownerId !== ownerId) return \"lost\";\n      await this.writeLease(key, { ...lease, heartbeatAt: new Date().toISOString(), leaseMs });\n      return \"ok\";\n    });\n  }\n\n  /** Give the key back (content stays; the next run resumes it). */\n  async releaseLease(key: string, ownerId: string): Promise<void> {\n    const lease = await this.readLease(key);\n    if (!lease || lease.ownerId !== ownerId) return;\n    await unlink(this.leaseFileFor(key)).catch(() => {});\n  }\n\n  /**\n   * Finish a claim: only its owner may ack, and only when nothing is left to\n   * extract. Non-empty claims stay (deferred content is never dropped here).\n   */\n  async ack(key: string, ownerId: string): Promise<AckOutcome> {\n    const lease = await this.readLease(key);\n    if (!lease || lease.ownerId !== ownerId) return \"busy\";\n    const claim = await this.readClaimBody(key);\n    if (!claim) {\n      await unlink(this.leaseFileFor(key)).catch(() => {});\n      return \"acked\";\n    }\n    if (claim.entry.turns.length > 0 || (claim.entry.retainedTurns?.length ?? 0) > 0) return \"not_empty\";\n    // Keep the (empty) claim file as a TOMBSTONE: a live buffer owner that\n    // still holds a stale copy subtracts the drained turns instead of\n    // writing them back. The owner consumes the tombstone on its next save.\n    await unlink(this.leaseFileFor(key)).catch(() => {});\n    return \"acked\";\n  }\n\n  /** The turns a drain already extracted for `key` (tombstone content). */\n  async drainedTurns(key: string): Promise<BufferTurn[]> {\n    const claim = await this.readClaimBody(key);\n    return claim?.drained ?? [];\n  }\n\n  /**\n   * Is the drain for `key` FINISHED (acked): the claim holds extracted turns\n   * and nothing pending, and the drainer dropped its lease. A claim with\n   * partial progress or a live lease is still being drained — its owner must\n   * merge into it, never release it.\n   */\n  async isDrained(key: string): Promise<boolean> {\n    const claim = await this.readClaimBody(key);\n    if (!claim) return false;\n    if ((claim.drained?.length ?? 0) === 0 && (claim.drainedRetained?.length ?? 0) === 0) return false;\n    if (claim.entry.turns.length > 0 || (claim.entry.retainedTurns?.length ?? 0) > 0) return false;\n    return (await this.readLease(key)) === null;\n  }\n\n  /** Drop the claim file entirely (its owner consumed the tombstone). */\n  async release(key: string): Promise<void> {\n    await unlink(this.fileFor(key)).catch(() => {});\n    await unlink(this.leaseFileFor(key)).catch(() => {});\n  }\n\n  /** Every claim with its lease state (CLI scan + summaries). */\n  async list(): Promise<DrainClaimListing[]> {\n    let names: string[];\n    try {\n      names = (await readdir(this.dir)).filter((name) => name.endsWith(\".json\") && !name.endsWith(\".lease.json\"));\n    } catch (err) {\n      // SAFETY: the value comes from this module's own write path; the shape is checked above.\n      if ((err as NodeJS.ErrnoException)?.code === \"ENOENT\") return [];\n      throw err;\n    }\n    const out: DrainClaimListing[] = [];\n    for (const name of names) {\n      const claim = await this.readClaimBodyByKey(name);\n      if (!claim) continue;\n      const lease = await this.readLease(claim.key);\n      out.push({\n        key: claim.key,\n        turnCount: claim.entry.turns.length + (claim.entry.retainedTurns?.length ?? 0),\n        leased: lease !== null,\n        leaseExpired: lease !== null ? isLeaseExpired(lease) : true,\n      });\n    }\n    return out;\n  }\n\n  private async readClaimBodyByKey(name: string): Promise<DrainClaimFile | null> {\n    try {\n      return parseBody(await this.io.read(path.join(this.dir, name)));\n    } catch (err) {\n      log.debug(`buffer drain: skipping unreadable claim file ${name}: ${err instanceof Error ? err.message : String(err)}`);\n      return null;\n    }\n  }\n}\n","import { BufferDrainClaims, type BufferSessionSaveOutcome } from \"./buffer-drain-claims.js\";\nimport { createHash } from \"node:crypto\";\nimport type { Stats } from \"node:fs\";\nimport { lstat, readdir, unlink } from \"node:fs/promises\";\nimport path from \"node:path\";\nimport { subtractBufferTurns } from \"../buffer-turn-helpers.js\";\nimport { log } from \"../logger.js\";\nimport { SecureStoreDecryptError, SecureStoreLockedError } from \"../secure-store/secure-fs.js\";\nimport type { BufferEntryState, BufferState, BufferTurn } from \"../types.js\";\n\n/** The secure-store file I/O the owning StorageManager already provides. */\nexport interface BufferFileIo {\n  read(filePath: string): Promise<string>;\n  write(filePath: string, content: string): Promise<void>;\n}\n\ntype FsError = NodeJS.ErrnoException;\n\nfunction isMissing(err: FsError | null): boolean {\n  return err?.code === \"ENOENT\";\n}\n\nfunction asFsError(err: Error): FsError {\n  return err;\n}\n\n/**\n * Case-independent, collision-free file name for a buffer key: the lowercase\n * hex SHA-256 of the key under a fixed prefix. Hex has no case and no path\n * characters, so `Session-A` and `session-a` get different names even on\n * case-insensitive filesystems, every key (short or long) lives in the same\n * naming domain, and the key itself is stored inside the file (loading never\n * inverts the hash).\n */\nexport function bufferSessionFileName(key: string): string {\n  return `s-${createHash(\"sha256\").update(key).digest(\"hex\")}.json`;\n}\n\n/** Flatten a legacy BufferState into per-session entries (top-level fields\n * are the legacy mirror of the \"default\" entry). */\nexport function legacyStateToEntries(state: BufferState): Map<string, BufferEntryState> {\n  const entries = new Map<string, BufferEntryState>();\n  for (const [key, value] of Object.entries(state.entries ?? {})) {\n    if (value && Array.isArray(value.turns)) entries.set(key, value);\n  }\n  if (!entries.has(\"default\")) {\n    entries.set(\"default\", {\n      turns: Array.isArray(state.turns) ? state.turns : [],\n      lastExtractionAt: state.lastExtractionAt ?? null,\n      extractionCount: Number.isFinite(state.extractionCount) ? state.extractionCount : 0,\n    });\n  }\n  return entries;\n}\n\n/** What a per-session file contains once parsed (written only by this module). */\ninterface SessionFileBody {\n  key?: string;\n  turns?: BufferTurn[];\n  retainedTurns?: BufferTurn[];\n  lastExtractionAt?: string | null;\n  extractionCount?: number;\n}\n\nfunction entryFromBody(body: SessionFileBody): { key: string; entry: BufferEntryState } | null {\n  if (!body || !Array.isArray(body.turns) || (body.key?.length ?? 0) === 0) return null;\n  const entry: BufferEntryState = {\n    turns: body.turns,\n    lastExtractionAt: body.lastExtractionAt ?? null,\n    extractionCount: Number.isFinite(body.extractionCount) ? Number(body.extractionCount) : 0,\n  };\n  if (Array.isArray(body.retainedTurns)) entry.retainedTurns = body.retainedTurns;\n  return { key: String(body.key), entry };\n}\n\n/**\n * One file per buffer session under `<stateDir>/buffer/`, so the observe hot\n * path persists only the session that changed. All writes happen under\n * SmartBuffer's serialized mutation chain (one writer per process).\n *\n * Sessions claimed by `remnic buffer drain` (see buffer-drain-claims.ts) are\n * owned by the drain: `save` hands the in-memory entry INTO the claim\n * (identity-deduped merge) instead of writing a session file, so a live\n * buffer owner can never resurrect claimed turns.\n */\nexport class BufferSessionFiles {\n  private dirVerified = false;\n  private readonly claimsStore: BufferDrainClaims;\n\n  constructor(\n    private readonly stateDir: string,\n    private readonly io: BufferFileIo,\n  ) {\n    this.claimsStore = new BufferDrainClaims(stateDir, io);\n  }\n\n  /** The drain-claim store for this state dir (CLI scan + claim ops). */\n  get claims(): BufferDrainClaims {\n    return this.claimsStore;\n  }\n\n  /** Sync gate check: is this session claimed by a buffer drain? */\n  isClaimed(key: string): boolean {\n    return this.claimsStore.isClaimed(key);\n  }\n\n  private get dir(): string {\n    return path.join(this.stateDir, \"buffer\");\n  }\n\n  private fileFor(key: string): string {\n    return path.join(this.dir, bufferSessionFileName(key));\n  }\n\n  /**\n   * Refuse a symlinked buffer directory: following it would send buffered\n   * conversation data (and deletions) outside the memory root. One lstat of\n   * one directory, cached after it passes, so the observe path pays nothing\n   * per write; the cache is dropped on any failure.\n   */\n  private async assertDirSafe(): Promise<void> {\n    if (this.dirVerified) return;\n    let stat: Stats | null = null;\n    try {\n      stat = await lstat(this.dir);\n    } catch (err) {\n      if (!(err instanceof Error) || !isMissing(asFsError(err))) throw err;\n    }\n    if (stat && (stat.isSymbolicLink() || !stat.isDirectory())) {\n      throw new Error(`buffer session directory must be a real directory, not a symlink or file: ${this.dir}`);\n    }\n    this.dirVerified = stat !== null;\n  }\n\n  /** Persist ONE session atomically. Compact JSON: machine-read state, and\n   * pretty-printing a large buffer costs CPU and bytes on every observe.\n   * A drain-claimed session is handed over instead (see class doc). */\n  async save(key: string, entry: BufferEntryState): Promise<BufferSessionSaveOutcome> {\n    if (this.isClaimed(key)) {\n      // Consume the tombstone ONLY when the drain finished (acked: extracted\n      // turns recorded, nothing pending, no lease). Partial `drained` just\n      // means chunks completed — the drainer may still be running, and\n      // releasing here would unlink its claim and turn its later writes into\n      // no-ops.\n      if (await this.claimsStore.isDrained(key)) {\n        const drained = await this.claimsStore.drainedTurns(key);\n        // The drain finished this session: the claim is a tombstone. Write\n        // the owner's fresh remainder back as a session file (the drained\n        // turns are subtracted here too, so a caller that did not subtract\n        // them cannot resurrect them) and release the tombstone.\n        const fresh: BufferEntryState = { ...entry, turns: subtractBufferTurns(entry.turns, drained) };\n        if (entry.retainedTurns && entry.retainedTurns.length > 0) {\n          fresh.retainedTurns = subtractBufferTurns(entry.retainedTurns, drained);\n          if (fresh.retainedTurns.length === 0) delete fresh.retainedTurns;\n        }\n        await this.assertDirSafe();\n        await this.io.write(this.fileFor(key), JSON.stringify({ key, ...fresh }));\n        await this.claimsStore.release(key);\n        return { status: \"saved\", drainedTurns: drained };\n      }\n      await this.claimsStore.mergeIntoClaim(key, entry);\n      return { status: \"handed_over\" };\n    }\n    await this.assertDirSafe();\n    await this.io.write(this.fileFor(key), JSON.stringify({ key, ...entry }));\n    return { status: \"saved\" };\n  }\n\n  /** Remove one session's file. Idempotent: an absent file is fine. */\n  async remove(key: string): Promise<void> {\n    await this.assertDirSafe();\n    try {\n      await unlink(this.fileFor(key));\n    } catch (err) {\n      if (!(err instanceof Error) || !isMissing(asFsError(err))) throw err;\n    }\n  }\n\n  private async listFiles(): Promise<string[]> {\n    await this.assertDirSafe();\n    try {\n      const dirents = await readdir(this.dir, { withFileTypes: true });\n      // Regular files only: a symlink inside the directory is never followed.\n      return dirents.filter((d) => d.isFile() && d.name.endsWith(\".json\")).map((d) => d.name);\n    } catch (err) {\n      if (err instanceof Error && isMissing(asFsError(err))) return [];\n      throw err;\n    }\n  }\n\n  /** Read every per-session file. Corrupt files are skipped (and logged) so\n   * one bad file cannot nuke the other sessions' buffered turns. */\n  private async readAll(): Promise<{ entries: Map<string, BufferEntryState>; fileCount: number }> {\n    const names = await this.listFiles();\n    const entries = new Map<string, BufferEntryState>();\n    for (const name of names) {\n      try {\n        const body: SessionFileBody = JSON.parse(await this.io.read(path.join(this.dir, name)));\n        const parsed = entryFromBody(body);\n        if (!parsed) throw new Error(\"invalid buffer session file shape\");\n        if (entries.has(parsed.key)) {\n          log.warn(`buffer: duplicate session file for key ${parsed.key} (${name}); keeping the first`);\n          continue;\n        }\n        entries.set(parsed.key, parsed.entry);\n      } catch (err) {\n        // A locked store or a wrong key is not a corrupt file: reading it as empty would let\n        // later saves replace the real encrypted session.\n        if (err instanceof SecureStoreLockedError || err instanceof SecureStoreDecryptError) throw err;\n        log.warn(`buffer: skipping unreadable per-session buffer file ${name}: ${err instanceof Error ? err.message : String(err)}`);\n      }\n    }\n    return { entries, fileCount: names.length };\n  }\n\n  /**\n   * Read the legacy single-file buffer.json for migration. Null when absent,\n   * or unreadable while session files exist (they are authoritative; a\n   * corrupt leftover must not block startup). With no session files a corrupt\n   * legacy file THROWS, preserving the old contract so callers can reset it.\n   */\n  private async readLegacy(hasSessionFiles: boolean): Promise<BufferState | null> {\n    let raw: string;\n    try {\n      raw = await this.io.read(path.join(this.stateDir, \"buffer.json\"));\n    } catch (err) {\n      if (err instanceof SecureStoreLockedError) throw err;\n      if (err instanceof Error && isMissing(asFsError(err))) return null;\n      throw err;\n    }\n    try {\n      const legacy: BufferState = JSON.parse(raw);\n      return legacy;\n    } catch (err) {\n      if (!hasSessionFiles) throw err;\n      log.warn(\n        `buffer: legacy buffer.json is unreadable but per-session buffer files exist; ` +\n          `ignoring the legacy file (${err instanceof Error ? err.message : String(err)})`,\n      );\n      return null;\n    }\n  }\n\n  /**\n   * Load the whole buffer, migrating a legacy buffer.json once. A per-session\n   * file that parsed wins over the legacy snapshot (a crash mid-migration\n   * leaves exactly that pair); legacy entries without a usable file are\n   * written out, then the legacy file is retired. Both steps are idempotent.\n   */\n  async load(): Promise<BufferState> {\n    const { entries, fileCount } = await this.readAll();\n    const legacy = await this.readLegacy(fileCount > 0);\n    if (legacy !== null) {\n      for (const [key, entry] of legacyStateToEntries(legacy)) {\n        if (entries.has(key)) continue;\n        entries.set(key, entry);\n        await this.save(key, entry);\n      }\n      try {\n        await unlink(path.join(this.stateDir, \"buffer.json\"));\n      } catch (err) {\n        if (!(err instanceof Error) || !isMissing(asFsError(err))) throw err;\n      }\n    }\n    const out: NonNullable<BufferState[\"entries\"]> = Object.create(null);\n    for (const [key, entry] of entries) out[key] = entry;\n    const def = entries.get(\"default\");\n    return {\n      turns: def?.turns ?? [],\n      lastExtractionAt: def?.lastExtractionAt ?? null,\n      extractionCount: def?.extractionCount ?? 0,\n      entries: out,\n    };\n  }\n\n  /**\n   * Reconcile the files with a WHOLE buffer state: write every entry, then\n   * delete files for keys no longer present. Writes first, deletes last: a\n   * crash leaves stale extra files (removed by the next reconcile) but never\n   * loses sessions the state says exist. Not on the observe hot path.\n   */\n  async reconcile(state: BufferState): Promise<void> {\n    const entries = legacyStateToEntries(state);\n    const existing = await this.listFiles();\n    for (const [key, entry] of entries) await this.save(key, entry);\n    const live = new Set([...entries.keys()].map((key) => bufferSessionFileName(key)));\n    for (const name of existing) {\n      if (live.has(name)) continue;\n      try {\n        await unlink(path.join(this.dir, name));\n      } catch (err) {\n        if (!(err instanceof Error) || !isMissing(asFsError(err))) throw err;\n      }\n    }\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAiCA,SAAS,gBAAgB;AACzB,SAAS,SAAS;AAClB,SAAS,kBAAkB;AAC3B,SAAS,OAAO,WAAAA,UAAS,QAAQ,UAAAC,SAAQ,iBAAiB;AAC1D,OAAOC,WAAU;;;ACpCjB,SAAS,kBAAkB;AAE3B,SAAS,OAAO,SAAS,cAAc;AACvC,OAAO,UAAU;AAcjB,SAAS,UAAU,KAA8B;AAC/C,SAAO,KAAK,SAAS;AACvB;AAEA,SAAS,UAAU,KAAqB;AACtC,SAAO;AACT;AAUO,SAAS,sBAAsB,KAAqB;AACzD,SAAO,KAAK,WAAW,QAAQ,EAAE,OAAO,GAAG,EAAE,OAAO,KAAK,CAAC;AAC5D;AAIO,SAAS,qBAAqB,OAAmD;AACtF,QAAM,UAAU,oBAAI,IAA8B;AAClD,aAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,MAAM,WAAW,CAAC,CAAC,GAAG;AAC9D,QAAI,SAAS,MAAM,QAAQ,MAAM,KAAK,EAAG,SAAQ,IAAI,KAAK,KAAK;AAAA,EACjE;AACA,MAAI,CAAC,QAAQ,IAAI,SAAS,GAAG;AAC3B,YAAQ,IAAI,WAAW;AAAA,MACrB,OAAO,MAAM,QAAQ,MAAM,KAAK,IAAI,MAAM,QAAQ,CAAC;AAAA,MACnD,kBAAkB,MAAM,oBAAoB;AAAA,MAC5C,iBAAiB,OAAO,SAAS,MAAM,eAAe,IAAI,MAAM,kBAAkB;AAAA,IACpF,CAAC;AAAA,EACH;AACA,SAAO;AACT;AAWA,SAAS,cAAc,MAAwE;AAC7F,MAAI,CAAC,QAAQ,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,KAAK,KAAK,UAAU,OAAO,EAAG,QAAO;AACjF,QAAM,QAA0B;AAAA,IAC9B,OAAO,KAAK;AAAA,IACZ,kBAAkB,KAAK,oBAAoB;AAAA,IAC3C,iBAAiB,OAAO,SAAS,KAAK,eAAe,IAAI,OAAO,KAAK,eAAe,IAAI;AAAA,EAC1F;AACA,MAAI,MAAM,QAAQ,KAAK,aAAa,EAAG,OAAM,gBAAgB,KAAK;AAClE,SAAO,EAAE,KAAK,OAAO,KAAK,GAAG,GAAG,MAAM;AACxC;AAYO,IAAM,qBAAN,MAAyB;AAAA,EAI9B,YACmB,UACA,IACjB;AAFiB;AACA;AAEjB,SAAK,cAAc,IAAI,kBAAkB,UAAU,EAAE;AAAA,EACvD;AAAA,EAJmB;AAAA,EACA;AAAA,EALX,cAAc;AAAA,EACL;AAAA;AAAA,EAUjB,IAAI,SAA4B;AAC9B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,UAAU,KAAsB;AAC9B,WAAO,KAAK,YAAY,UAAU,GAAG;AAAA,EACvC;AAAA,EAEA,IAAY,MAAc;AACxB,WAAO,KAAK,KAAK,KAAK,UAAU,QAAQ;AAAA,EAC1C;AAAA,EAEQ,QAAQ,KAAqB;AACnC,WAAO,KAAK,KAAK,KAAK,KAAK,sBAAsB,GAAG,CAAC;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,gBAA+B;AAC3C,QAAI,KAAK,YAAa;AACtB,QAAI,OAAqB;AACzB,QAAI;AACF,aAAO,MAAM,MAAM,KAAK,GAAG;AAAA,IAC7B,SAAS,KAAK;AACZ,UAAI,EAAE,eAAe,UAAU,CAAC,UAAU,UAAU,GAAG,CAAC,EAAG,OAAM;AAAA,IACnE;AACA,QAAI,SAAS,KAAK,eAAe,KAAK,CAAC,KAAK,YAAY,IAAI;AAC1D,YAAM,IAAI,MAAM,6EAA6E,KAAK,GAAG,EAAE;AAAA,IACzG;AACA,SAAK,cAAc,SAAS;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,KAAK,KAAa,OAA4D;AAClF,QAAI,KAAK,UAAU,GAAG,GAAG;AAMvB,UAAI,MAAM,KAAK,YAAY,UAAU,GAAG,GAAG;AACzC,cAAM,UAAU,MAAM,KAAK,YAAY,aAAa,GAAG;AAKvD,cAAM,QAA0B,EAAE,GAAG,OAAO,OAAO,oBAAoB,MAAM,OAAO,OAAO,EAAE;AAC7F,YAAI,MAAM,iBAAiB,MAAM,cAAc,SAAS,GAAG;AACzD,gBAAM,gBAAgB,oBAAoB,MAAM,eAAe,OAAO;AACtE,cAAI,MAAM,cAAc,WAAW,EAAG,QAAO,MAAM;AAAA,QACrD;AACA,cAAM,KAAK,cAAc;AACzB,cAAM,KAAK,GAAG,MAAM,KAAK,QAAQ,GAAG,GAAG,KAAK,UAAU,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC;AACxE,cAAM,KAAK,YAAY,QAAQ,GAAG;AAClC,eAAO,EAAE,QAAQ,SAAS,cAAc,QAAQ;AAAA,MAClD;AACA,YAAM,KAAK,YAAY,eAAe,KAAK,KAAK;AAChD,aAAO,EAAE,QAAQ,cAAc;AAAA,IACjC;AACA,UAAM,KAAK,cAAc;AACzB,UAAM,KAAK,GAAG,MAAM,KAAK,QAAQ,GAAG,GAAG,KAAK,UAAU,EAAE,KAAK,GAAG,MAAM,CAAC,CAAC;AACxE,WAAO,EAAE,QAAQ,QAAQ;AAAA,EAC3B;AAAA;AAAA,EAGA,MAAM,OAAO,KAA4B;AACvC,UAAM,KAAK,cAAc;AACzB,QAAI;AACF,YAAM,OAAO,KAAK,QAAQ,GAAG,CAAC;AAAA,IAChC,SAAS,KAAK;AACZ,UAAI,EAAE,eAAe,UAAU,CAAC,UAAU,UAAU,GAAG,CAAC,EAAG,OAAM;AAAA,IACnE;AAAA,EACF;AAAA,EAEA,MAAc,YAA+B;AAC3C,UAAM,KAAK,cAAc;AACzB,QAAI;AACF,YAAM,UAAU,MAAM,QAAQ,KAAK,KAAK,EAAE,eAAe,KAAK,CAAC;AAE/D,aAAO,QAAQ,OAAO,CAAC,MAAM,EAAE,OAAO,KAAK,EAAE,KAAK,SAAS,OAAO,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;AAAA,IACxF,SAAS,KAAK;AACZ,UAAI,eAAe,SAAS,UAAU,UAAU,GAAG,CAAC,EAAG,QAAO,CAAC;AAC/D,YAAM;AAAA,IACR;AAAA,EACF;AAAA;AAAA;AAAA,EAIA,MAAc,UAAkF;AAC9F,UAAM,QAAQ,MAAM,KAAK,UAAU;AACnC,UAAM,UAAU,oBAAI,IAA8B;AAClD,eAAW,QAAQ,OAAO;AACxB,UAAI;AACF,cAAM,OAAwB,KAAK,MAAM,MAAM,KAAK,GAAG,KAAK,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AACtF,cAAM,SAAS,cAAc,IAAI;AACjC,YAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,mCAAmC;AAChE,YAAI,QAAQ,IAAI,OAAO,GAAG,GAAG;AAC3B,cAAI,KAAK,0CAA0C,OAAO,GAAG,KAAK,IAAI,sBAAsB;AAC5F;AAAA,QACF;AACA,gBAAQ,IAAI,OAAO,KAAK,OAAO,KAAK;AAAA,MACtC,SAAS,KAAK;AAGZ,YAAI,eAAe,0BAA0B,eAAe,wBAAyB,OAAM;AAC3F,YAAI,KAAK,uDAAuD,IAAI,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC,EAAE;AAAA,MAC7H;AAAA,IACF;AACA,WAAO,EAAE,SAAS,WAAW,MAAM,OAAO;AAAA,EAC5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAc,WAAW,iBAAuD;AAC9E,QAAI;AACJ,QAAI;AACF,YAAM,MAAM,KAAK,GAAG,KAAK,KAAK,KAAK,KAAK,UAAU,aAAa,CAAC;AAAA,IAClE,SAAS,KAAK;AACZ,UAAI,eAAe,uBAAwB,OAAM;AACjD,UAAI,eAAe,SAAS,UAAU,UAAU,GAAG,CAAC,EAAG,QAAO;AAC9D,YAAM;AAAA,IACR;AACA,QAAI;AACF,YAAM,SAAsB,KAAK,MAAM,GAAG;AAC1C,aAAO;AAAA,IACT,SAAS,KAAK;AACZ,UAAI,CAAC,gBAAiB,OAAM;AAC5B,UAAI;AAAA,QACF,0GAC+B,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC;AAAA,MACjF;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,OAA6B;AACjC,UAAM,EAAE,SAAS,UAAU,IAAI,MAAM,KAAK,QAAQ;AAClD,UAAM,SAAS,MAAM,KAAK,WAAW,YAAY,CAAC;AAClD,QAAI,WAAW,MAAM;AACnB,iBAAW,CAAC,KAAK,KAAK,KAAK,qBAAqB,MAAM,GAAG;AACvD,YAAI,QAAQ,IAAI,GAAG,EAAG;AACtB,gBAAQ,IAAI,KAAK,KAAK;AACtB,cAAM,KAAK,KAAK,KAAK,KAAK;AAAA,MAC5B;AACA,UAAI;AACF,cAAM,OAAO,KAAK,KAAK,KAAK,UAAU,aAAa,CAAC;AAAA,MACtD,SAAS,KAAK;AACZ,YAAI,EAAE,eAAe,UAAU,CAAC,UAAU,UAAU,GAAG,CAAC,EAAG,OAAM;AAAA,MACnE;AAAA,IACF;AACA,UAAM,MAA2C,uBAAO,OAAO,IAAI;AACnE,eAAW,CAAC,KAAK,KAAK,KAAK,QAAS,KAAI,GAAG,IAAI;AAC/C,UAAM,MAAM,QAAQ,IAAI,SAAS;AACjC,WAAO;AAAA,MACL,OAAO,KAAK,SAAS,CAAC;AAAA,MACtB,kBAAkB,KAAK,oBAAoB;AAAA,MAC3C,iBAAiB,KAAK,mBAAmB;AAAA,MACzC,SAAS;AAAA,IACX;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,UAAU,OAAmC;AACjD,UAAM,UAAU,qBAAqB,KAAK;AAC1C,UAAM,WAAW,MAAM,KAAK,UAAU;AACtC,eAAW,CAAC,KAAK,KAAK,KAAK,QAAS,OAAM,KAAK,KAAK,KAAK,KAAK;AAC9D,UAAM,OAAO,IAAI,IAAI,CAAC,GAAG,QAAQ,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,sBAAsB,GAAG,CAAC,CAAC;AACjF,eAAW,QAAQ,UAAU;AAC3B,UAAI,KAAK,IAAI,IAAI,EAAG;AACpB,UAAI;AACF,cAAM,OAAO,KAAK,KAAK,KAAK,KAAK,IAAI,CAAC;AAAA,MACxC,SAAS,KAAK;AACZ,YAAI,EAAE,eAAe,UAAU,CAAC,UAAU,UAAU,GAAG,CAAC,EAAG,OAAM;AAAA,MACnE;AAAA,IACF;AAAA,EACF;AACF;;;AD7MA,IAAM,sBAAsB;AAC5B,IAAM,yBAAyB;AAE/B,SAAS,aAA+B;AACtC,SAAO,EAAE,OAAO,CAAC,GAAG,kBAAkB,MAAM,iBAAiB,EAAE;AACjE;AAIA,SAAS,WAAc,UAAe,UAAwB,SAAuC;AACnG,QAAM,SAAS,CAAC,GAAG,QAAQ;AAC3B,aAAW,QAAQ,UAAU;AAC3B,QAAI,OAAO,KAAK,CAAC,SAAS,QAAQ,MAAM,IAAI,CAAC,EAAG;AAChD,WAAO,KAAK,IAAI;AAAA,EAClB;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAAuB,UAA4C;AACvF,QAAM,QAAQ,WAAW;AAIzB,QAAM,OAAO,CAAC,GAAI,MAAM,WAAW,CAAC,GAAI,GAAI,MAAM,mBAAmB,CAAC,CAAE;AACxE,QAAM,QAAQ;AAAA,IACZ,oBAAoB,MAAM,MAAM,OAAO,IAAI;AAAA,IAC3C,oBAAoB,SAAS,OAAO,IAAI;AAAA,IACxC;AAAA,EACF;AACA,QAAM,WAAW;AAAA,IACf,GAAG,oBAAoB,MAAM,MAAM,iBAAiB,CAAC,GAAG,IAAI;AAAA,IAC5D,GAAG,oBAAoB,SAAS,iBAAiB,CAAC,GAAG,IAAI;AAAA,EAC3D;AAEA,QAAM,kBAAkB,WAAW,CAAC,GAAsB,UAAU,gBAAgB;AACpF,MAAI,gBAAgB,SAAS,EAAG,OAAM,gBAAgB;AACtD,QAAM,SAAS,CAAC,MAAM,MAAM,kBAAkB,SAAS,gBAAgB,EAAE;AAAA,IACvE,CAAC,UAA2B,UAAU,QAAQ,UAAU;AAAA,EAC1D;AACA,QAAM,mBAAmB,OAAO,KAAK,EAAE,GAAG,EAAE,KAAK;AACjD,QAAM,kBAAkB,KAAK,IAAI,MAAM,MAAM,iBAAiB,SAAS,eAAe;AACtF,SAAO,EAAE,GAAG,OAAO,MAAM;AAC3B;AAMA,SAAS,aAAa,OAA4B;AAChD,MAAI,MAAM,SAAS,SAAS,EAAG,QAAO;AACtC,MAAI,CAAC,OAAO,UAAU,MAAM,GAAG,KAAK,MAAM,OAAO,EAAG,QAAO;AAC3D,MAAI;AACF,YAAQ,KAAK,MAAM,KAAK,CAAC;AACzB,WAAO;AAAA,EACT,SAAS,KAAK;AAGZ,WAAQ,KAA+B,SAAS;AAAA,EAClD;AACF;AAEA,SAAS,eAAe,OAAmB,MAAM,KAAK,IAAI,GAAY;AACpE,QAAM,YAAY,KAAK,MAAM,MAAM,WAAW;AAC9C,SAAO,CAAC,OAAO,SAAS,SAAS,KAAK,MAAM,YAAY,MAAM;AAChE;AAEA,IAAM,kBAAkB,EAAE,OAAO;AAAA,EAC/B,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACrB,OAAO,EAAE,OAAO;AAAA,IACd,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC;AAAA,IAC1B,eAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,IAC7C,kBAAkB,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,IACjD,iBAAiB,EAAE,OAAO,EAAE,SAAS;AAAA,EACvC,CAAC,EAAE,SAAS;AAAA,EACZ,OAAO,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,EACrC,eAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,EAC7C,kBAAkB,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;AAAA,EACjD,iBAAiB,EAAE,OAAO,EAAE,SAAS;AAAA,EACrC,WAAW,EAAE,OAAO,EAAE,SAAS;AAAA,EAC/B,SAAS,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS;AAAA,EACvC,iBAAiB,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS;AACjD,CAAC;AAED,SAAS,UAAU,KAAoC;AACrD,MAAI;AACJ,MAAI;AACF,WAAO,gBAAgB,MAAM,KAAK,MAAM,GAAG,CAAC;AAAA,EAC9C,QAAQ;AACN,WAAO;AAAA,EACT;AAIA,QAAM,SAAS,KAAK,SAAS,MAAM,QAAQ,KAAK,MAAM,KAAK,IAAI,KAAK,QAAQ;AAC5E,MAAI,CAAC,MAAM,QAAQ,OAAO,KAAK,EAAG,QAAO;AACzC,QAAM,QAAQ,WAAW;AAOzB,QAAM,QAAQ,OAAO;AACrB,MAAI,OAAO,eAAe;AAExB,UAAM,gBAAgB,OAAO;AAAA,EAC/B;AACA,QAAM,mBAAmB,OAAO,oBAAoB;AACpD,QAAM,kBAAkB,OAAO,SAAS,OAAO,eAAe,IAAI,OAAO,OAAO,eAAe,IAAI;AACnG,QAAM,QAAwB;AAAA,IAC5B,KAAK,KAAK;AAAA,IACV;AAAA,IACA,WAAW,KAAK,cAAa,oBAAI,KAAK,GAAE,YAAY;AAAA,EACtD;AACA,MAAI,MAAM,QAAQ,KAAK,OAAO,GAAG;AAE/B,UAAM,UAAU,KAAK;AAAA,EACvB;AACA,MAAI,MAAM,QAAQ,KAAK,eAAe,GAAG;AAEvC,UAAM,kBAAkB,KAAK;AAAA,EAC/B;AACA,SAAO;AACT;AAEA,IAAM,cAAc,EAAE,OAAO;AAAA,EAC3B,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC;AAAA,EACzB,KAAK,EAAE,OAAO,EAAE,SAAS;AAAA,EACzB,MAAM,EAAE,OAAO,EAAE,SAAS;AAAA,EAC1B,YAAY,EAAE,OAAO,EAAE,SAAS;AAAA,EAChC,aAAa,EAAE,OAAO;AAAA,EACtB,SAAS,EAAE,OAAO;AACpB,CAAC;AAED,SAAS,WAAW,KAAgC;AAClD,MAAI;AACJ,MAAI;AACF,YAAQ,YAAY,MAAM,KAAK,MAAM,GAAG,CAAC;AAAA,EAC3C,QAAQ;AACN,WAAO;AAAA,EACT;AACA,SAAO;AAAA,IACL,SAAS,MAAM;AAAA,IACf,KAAK,MAAM,OAAO;AAAA,IAClB,MAAM,MAAM,QAAQ;AAAA,IACpB,YAAY,MAAM,cAAc,MAAM;AAAA,IACtC,aAAa,MAAM;AAAA,IACnB,SAAS,MAAM;AAAA,EACjB;AACF;AAEO,IAAM,oBAAN,MAAwB;AAAA,EAC7B,YACmB,UACA,IACjB;AAFiB;AACA;AAAA,EAChB;AAAA,EAFgB;AAAA,EACA;AAAA,EAGnB,IAAY,MAAc;AACxB,WAAOC,MAAK,KAAK,KAAK,UAAU,UAAU,OAAO;AAAA,EACnD;AAAA,EAEQ,QAAQ,KAAqB;AACnC,WAAOA,MAAK,KAAK,KAAK,KAAK,sBAAsB,GAAG,CAAC;AAAA,EACvD;AAAA,EAEQ,aAAa,KAAqB;AACxC,WAAO,GAAG,KAAK,QAAQ,GAAG,CAAC;AAAA,EAC7B;AAAA,EAEQ,YAAY,KAAqB;AACvC,WAAO,GAAG,KAAK,QAAQ,GAAG,CAAC;AAAA,EAC7B;AAAA;AAAA,EAGA,UAAU,KAAsB;AAC9B,WAAO,WAAW,KAAK,QAAQ,GAAG,CAAC;AAAA,EACrC;AAAA;AAAA,EAGA,iBAAiB,KAAqB;AACpC,WAAO,KAAK,aAAa,GAAG;AAAA,EAC9B;AAAA,EAEA,MAAc,cAAc,KAA6C;AACvE,QAAI;AACF,aAAO,UAAU,MAAM,KAAK,GAAG,KAAK,KAAK,QAAQ,GAAG,CAAC,CAAC;AAAA,IACxD,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA;AAAA,EAGA,KAAK,KAA6C;AAChD,WAAO,KAAK,cAAc,GAAG;AAAA,EAC/B;AAAA,EAEA,MAAc,eAAe,KAAa,OAAsC;AAC9E,UAAM,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;AACzC,UAAM,KAAK,GAAG,MAAM,KAAK,QAAQ,GAAG,GAAG,KAAK,UAAU,EAAE,GAAG,OAAO,IAAI,CAAC,CAAC;AAAA,EAC1E;AAAA,EAEA,MAAc,UAAU,KAAyC;AAC/D,QAAI;AACF,aAAO,WAAW,MAAM,KAAK,GAAG,KAAK,KAAK,aAAa,GAAG,CAAC,CAAC;AAAA,IAC9D,QAAQ;AACN,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAc,WAAW,KAAa,OAAkC;AACtE,UAAM,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;AACzC,UAAM,KAAK,GAAG,MAAM,KAAK,aAAa,GAAG,GAAG,KAAK,UAAU,KAAK,CAAC;AAAA,EACnE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,qBAAqB,KAAa,OAAqD;AAC3F,UAAM,MAAM,KAAK,KAAK,EAAE,WAAW,KAAK,CAAC;AACzC,UAAM,cAAcA,MAAK,KAAK,KAAK,UAAU,UAAU,sBAAsB,GAAG,CAAC;AACjF,QAAI,WAAW,WAAW,GAAG;AAI3B,UAAI;AACF,cAAM,SAAS,UAAU,MAAM,KAAK,GAAG,KAAK,WAAW,CAAC;AACxD,YAAI,UAAU,OAAO,MAAM,MAAM,WAAW,MAAM,OAAO,MAAM,eAAe,UAAU,OAAO,GAAG;AAChG,iBAAO;AAAA,QACT;AAAA,MACF,QAAQ;AAAA,MAGR;AAAA,IACF;AACA,WAAO,MAAM;AAAA,MACX,KAAK,YAAY,GAAG;AAAA,MACpB,EAAE,SAAS,qBAAqB,WAAW,uBAAuB;AAAA,MAClE,OAAO,aAAa;AAClB,YAAI,CAAC,SAAU,QAAO;AAItB,YAAI,KAAK,UAAU,GAAG,EAAG,QAAO;AAChC,YAAI;AACF,gBAAM,OAAO,aAAa,KAAK,QAAQ,GAAG,CAAC;AAAA,QAC7C,SAAS,KAAK;AAGZ,cAAI,CAAC,WAAW,WAAW,GAAG;AAC5B,gBAAI,KAAK,UAAU,GAAG,EAAG,QAAO;AAChC,mBAAO;AAAA,UACT;AACA,gBAAM;AAAA,QACR;AACA,cAAM,QAAQ,MAAM,KAAK,cAAc,GAAG;AAC1C,YAAI,CAAC,SAAU,MAAM,MAAM,MAAM,WAAW,MAAM,MAAM,MAAM,eAAe,UAAU,OAAO,GAAI;AAGhG,gBAAMC,QAAO,KAAK,QAAQ,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,UAAC,CAAC;AAC9C,iBAAO;AAAA,QACT;AACA,cAAM,KAAK,WAAW,KAAK,KAAK;AAChC,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAM,MAAM,KAAa,OAA0C;AACjE,QAAI,CAAC,KAAK,UAAU,GAAG,EAAG,QAAO;AACjC,WAAO,MAAM;AAAA,MACX,KAAK,YAAY,GAAG;AAAA,MACpB,EAAE,SAAS,qBAAqB,WAAW,uBAAuB;AAAA,MAClE,OAAO,aAAa;AAClB,YAAI,CAAC,SAAU,QAAO;AACtB,cAAM,WAAW,MAAM,KAAK,UAAU,GAAG;AACzC,YAAI,YAAY,CAAC,eAAe,QAAQ,GAAG;AACzC,cAAI,SAAS,YAAY,MAAM,SAAS;AAEtC,kBAAM,KAAK,WAAW,KAAK,EAAE,GAAG,UAAU,cAAa,oBAAI,KAAK,GAAE,YAAY,GAAG,SAAS,MAAM,QAAQ,CAAC;AACzG,mBAAO;AAAA,UACT;AACA,cAAI,aAAa,QAAQ,EAAG,QAAO;AAGnC,gBAAMA,QAAO,KAAK,aAAa,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,UAAC,CAAC;AAAA,QACrD,WAAW,UAAU;AAInB,gBAAMA,QAAO,KAAK,aAAa,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,UAAC,CAAC;AAAA,QACrD;AACA,YAAI;AACF,gBAAM,UAAU,KAAK,aAAa,GAAG,GAAG,KAAK,UAAU,KAAK,GAAG,EAAE,MAAM,KAAK,CAAC;AAAA,QAC/E,SAAS,KAAK;AAEZ,cAAI,WAAW,KAAK,aAAa,GAAG,CAAC,EAAG,QAAO;AAC/C,gBAAM;AAAA,QACR;AACA,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,eAAe,KAAa,UAA2C;AAC3E,UAAM,iBAAiB,KAAK,YAAY,GAAG,GAAG,EAAE,SAAS,qBAAqB,WAAW,uBAAuB,GAAG,OAAO,aAAa;AACrI,UAAI,CAAC,UAAU;AAIb,cAAM,IAAI,MAAM,0BAA0B,GAAG,mCAAmC;AAAA,MAClF;AACA,YAAM,QAAQ,MAAM,KAAK,cAAc,GAAG;AAC1C,UAAI,CAAC,OAAO;AAGV;AAAA,MACF;AACA,YAAM,KAAK,eAAe,KAAK,aAAa,OAAO,QAAQ,CAAC;AAAA,IAC9D,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,WAAW,KAAa,SAAiB,OAAyB,MAAwC;AAC9G,UAAM,iBAAiB,KAAK,YAAY,GAAG,GAAG,EAAE,SAAS,qBAAqB,WAAW,uBAAuB,GAAG,OAAO,aAAa;AACrI,UAAI,CAAC,SAAU,OAAM,IAAI,MAAM,0BAA0B,GAAG,kCAAkC;AAC9F,YAAM,QAAQ,MAAM,KAAK,UAAU,GAAG;AACtC,UAAI,CAAC,SAAS,MAAM,YAAY,SAAS;AACvC,cAAM,IAAI,MAAM,0BAA0B,GAAG,0BAA0B,OAAO,0BAA0B;AAAA,MAC1G;AACA,YAAM,QAAQ,MAAM,KAAK,cAAc,GAAG;AAC1C,UAAI,CAAC,MAAO;AACZ,YAAM,YAAY,MAAM,SAAS,MAAM,MAAM;AAC7C,YAAM,eAAe,MAAM,iBAAiB,MAAM,MAAM,iBAAiB,CAAC;AAC1E,YAAM,gBAAgB,MAAM,iBAAiB,CAAC;AAE9C,YAAM,OAAO,CAAC,SACZ,MAAM,MAAM,KAAK,CAAC,SAAS,iBAAiB,MAAM,IAAI,CAAC,KAAK,cAAc,KAAK,CAAC,SAAS,iBAAiB,MAAM,IAAI,CAAC;AAEvH,YAAM,UAAU,CAAC,GAAI,MAAM,WAAW,CAAC,CAAE;AACzC,iBAAW,QAAQ,MAAM,MAAM,OAAO;AACpC,cAAM,YACJ,UAAU,KAAK,CAAC,aAAa,iBAAiB,UAAU,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI;AAC9E,YAAI,CAAC,UAAW;AAChB,YAAI,QAAQ,KAAK,CAAC,SAAS,iBAAiB,MAAM,IAAI,CAAC,EAAG;AAC1D,gBAAQ,KAAK,IAAI;AAAA,MACnB;AACA,YAAM,kBAAkB,CAAC,GAAI,MAAM,mBAAmB,CAAC,CAAE;AACzD,iBAAW,QAAQ,MAAM,MAAM,iBAAiB,CAAC,GAAG;AAClD,cAAM,YACJ,aAAa,KAAK,CAAC,aAAa,iBAAiB,UAAU,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI;AACjF,YAAI,CAAC,UAAW;AAChB,YAAI,QAAQ,KAAK,CAAC,SAAS,iBAAiB,MAAM,IAAI,CAAC,KAAK,gBAAgB,KAAK,CAAC,SAAS,iBAAiB,MAAM,IAAI,CAAC,EAAG;AAC1H,wBAAgB,KAAK,IAAI;AAAA,MAC3B;AAGA,YAAM,OAAO,MAAM,MAAM,MAAM;AAAA,QAC7B,CAAC,SACC,CAAC,UAAU,KAAK,CAAC,aAAa,iBAAiB,UAAU,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI;AAAA,MACjF;AACA,YAAM,OAAyB,EAAE,GAAG,OAAO,OAAO,CAAC,GAAG,MAAM,OAAO,GAAG,IAAI,EAAE;AAC5E,YAAM,gBAAgB,MAAM,MAAM,iBAAiB,CAAC,GAAG;AAAA,QACrD,CAAC,SACC,CAAC,aAAa,KAAK,CAAC,aAAa,iBAAiB,UAAU,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI;AAAA,MACpF;AACA,UAAI,aAAa,SAAS,EAAG,MAAK,gBAAgB,WAAW,eAAe,cAAc,gBAAgB;AAC1G,YAAM,KAAK,eAAe,KAAK,EAAE,GAAG,OAAO,OAAO,MAAM,SAAS,gBAAgB,CAAC;AAAA,IACpF,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,UAAU,KAAa,SAAiB,SAAyC;AACrF,WAAO,MAAM,iBAAiB,KAAK,YAAY,GAAG,GAAG,EAAE,SAAS,qBAAqB,WAAW,uBAAuB,GAAG,OAAO,aAAa;AAC5I,UAAI,CAAC,SAAU,QAAO;AACtB,YAAM,QAAQ,MAAM,KAAK,UAAU,GAAG;AACtC,UAAI,CAAC,SAAS,MAAM,YAAY,QAAS,QAAO;AAChD,YAAM,KAAK,WAAW,KAAK,EAAE,GAAG,OAAO,cAAa,oBAAI,KAAK,GAAE,YAAY,GAAG,QAAQ,CAAC;AACvF,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA;AAAA,EAGA,MAAM,aAAa,KAAa,SAAgC;AAC9D,UAAM,QAAQ,MAAM,KAAK,UAAU,GAAG;AACtC,QAAI,CAAC,SAAS,MAAM,YAAY,QAAS;AACzC,UAAMA,QAAO,KAAK,aAAa,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,IAAI,KAAa,SAAsC;AAC3D,UAAM,QAAQ,MAAM,KAAK,UAAU,GAAG;AACtC,QAAI,CAAC,SAAS,MAAM,YAAY,QAAS,QAAO;AAChD,UAAM,QAAQ,MAAM,KAAK,cAAc,GAAG;AAC1C,QAAI,CAAC,OAAO;AACV,YAAMA,QAAO,KAAK,aAAa,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,MAAC,CAAC;AACnD,aAAO;AAAA,IACT;AACA,QAAI,MAAM,MAAM,MAAM,SAAS,MAAM,MAAM,MAAM,eAAe,UAAU,KAAK,EAAG,QAAO;AAIzF,UAAMA,QAAO,KAAK,aAAa,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AACnD,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,MAAM,aAAa,KAAoC;AACrD,UAAM,QAAQ,MAAM,KAAK,cAAc,GAAG;AAC1C,WAAO,OAAO,WAAW,CAAC;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,UAAU,KAA+B;AAC7C,UAAM,QAAQ,MAAM,KAAK,cAAc,GAAG;AAC1C,QAAI,CAAC,MAAO,QAAO;AACnB,SAAK,MAAM,SAAS,UAAU,OAAO,MAAM,MAAM,iBAAiB,UAAU,OAAO,EAAG,QAAO;AAC7F,QAAI,MAAM,MAAM,MAAM,SAAS,MAAM,MAAM,MAAM,eAAe,UAAU,KAAK,EAAG,QAAO;AACzF,WAAQ,MAAM,KAAK,UAAU,GAAG,MAAO;AAAA,EACzC;AAAA;AAAA,EAGA,MAAM,QAAQ,KAA4B;AACxC,UAAMA,QAAO,KAAK,QAAQ,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AAC9C,UAAMA,QAAO,KAAK,aAAa,GAAG,CAAC,EAAE,MAAM,MAAM;AAAA,IAAC,CAAC;AAAA,EACrD;AAAA;AAAA,EAGA,MAAM,OAAqC;AACzC,QAAI;AACJ,QAAI;AACF,eAAS,MAAMC,SAAQ,KAAK,GAAG,GAAG,OAAO,CAAC,SAAS,KAAK,SAAS,OAAO,KAAK,CAAC,KAAK,SAAS,aAAa,CAAC;AAAA,IAC5G,SAAS,KAAK;AAEZ,UAAK,KAA+B,SAAS,SAAU,QAAO,CAAC;AAC/D,YAAM;AAAA,IACR;AACA,UAAM,MAA2B,CAAC;AAClC,eAAW,QAAQ,OAAO;AACxB,YAAM,QAAQ,MAAM,KAAK,mBAAmB,IAAI;AAChD,UAAI,CAAC,MAAO;AACZ,YAAM,QAAQ,MAAM,KAAK,UAAU,MAAM,GAAG;AAC5C,UAAI,KAAK;AAAA,QACP,KAAK,MAAM;AAAA,QACX,WAAW,MAAM,MAAM,MAAM,UAAU,MAAM,MAAM,eAAe,UAAU;AAAA,QAC5E,QAAQ,UAAU;AAAA,QAClB,cAAc,UAAU,OAAO,eAAe,KAAK,IAAI;AAAA,MACzD,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AAAA,EAEA,MAAc,mBAAmB,MAA8C;AAC7E,QAAI;AACF,aAAO,UAAU,MAAM,KAAK,GAAG,KAAKF,MAAK,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC;AAAA,IAChE,SAAS,KAAK;AACZ,UAAI,MAAM,gDAAgD,IAAI,KAAK,eAAe,QAAQ,IAAI,UAAU,OAAO,GAAG,CAAC,EAAE;AACrH,aAAO;AAAA,IACT;AAAA,EACF;AACF;","names":["readdir","unlink","path","path","unlink","readdir"]}

package/dist/{chunk-IEW6NDHX.js → chunk-JGSWWD33.js}

@@ -1,3 +1,6 @@
+import {
+  PROJECTION_REBUILD_RUNNER_FLAG
+} from "./chunk-XAFSZ4DP.js";
 import {
   ensureContradictionScanCron,
   ensureDaySummaryCron,
@@ -7,28 +10,25 @@ import {
   ensureProceduralMiningCron,
   graphEdgeDecayCadenceToCronExpr
 } from "./chunk-666A3MOW.js";
-import {
-  PROJECTION_REBUILD_RUNNER_FLAG
-} from "./chunk-KBOQQEVC.js";
 import {
   startLocationAutoSync
-} from "./chunk-YDDLSGYE.js";
+} from "./chunk-PUTH5REB.js";
 import {
   CompoundingEngine,
   isIsoWeekId,
   msUntilNextIsoWeek,
   previousIsoWeekId
-} from "./chunk-4G2A7MH3.js";
+} from "./chunk-JKUVPVKR.js";
 import {
   rebuildMemoryLifecycleLedger
-} from "./chunk-EH46DHBU.js";
+} from "./chunk-ENAPZQA6.js";
 import {
   planNamespaceMaintenance,
   runNamespaceMaintenanceBatchPlan
-} from "./chunk-EJFOGYF3.js";
+} from "./chunk-DTQJ7BRN.js";
 import {
   rebuildMemoryProjection
-} from "./chunk-JD5F5MYN.js";
+} from "./chunk-EGCC5OJE.js";
 import {
   DEFAULT_TIMELINE_CATEGORIES,
   TIMELINE_RESERVED_IDLE,
@@ -2874,4 +2874,4 @@ export {
   ActivitySyncScheduler,
   MaintenanceScheduler
 };
-//# sourceMappingURL=chunk-IEW6NDHX.js.map
+//# sourceMappingURL=chunk-JGSWWD33.js.map

package/dist/{chunk-A3UFV4K3.js → chunk-JIYJIH5N.js}

@@ -19,7 +19,7 @@ import {
 import {
   decryptCapsuleFileInMemory,
   isEncryptedCapsuleFile
-} from "./chunk-X7Y7WX73.js";
+} from "./chunk-UVYI6VIX.js";
 import {
   assertIsDirectoryNotSymlink,
   assertRealpathInsideRoot,
@@ -294,4 +294,4 @@ function mintForkId(capsuleId, originalId, now) {
 export {
   importCapsule
 };
-//# sourceMappingURL=chunk-A3UFV4K3.js.map
+//# sourceMappingURL=chunk-JIYJIH5N.js.map

package/dist/{chunk-4G2A7MH3.js → chunk-JKUVPVKR.js}

@@ -8,11 +8,11 @@ import {
 } from "./chunk-WR5POHQ3.js";
 import {
   resolveDefaultNamespaceRoot
-} from "./chunk-AMKIIRLL.js";
+} from "./chunk-TBFAQHQZ.js";
 import {
   StorageManager,
   readRawMemoryDocument
-} from "./chunk-WXBVGKS6.js";
+} from "./chunk-N7RAABFM.js";
 import {
   parseContinuityImprovementLoops
 } from "./chunk-LDXUBPMO.js";
@@ -1869,4 +1869,4 @@ export {
   defaultTierMigrationCycleBudget,
   CompoundingEngine
 };
-//# sourceMappingURL=chunk-4G2A7MH3.js.map
+//# sourceMappingURL=chunk-JKUVPVKR.js.map

package/dist/{chunk-YJHOVA42.js → chunk-JL5FHZ7O.js}

@@ -3,13 +3,13 @@ import {
 } from "./chunk-KASJJGRG.js";
 import {
   BufferSessionPersistence
-} from "./chunk-4OFXLQJD.js";
+} from "./chunk-MPDLLLOG.js";
 import {
   scanSignals
 } from "./chunk-H3FZVNRN.js";
 import {
   ExtractionDeadlineError
-} from "./chunk-XDKEHZUC.js";
+} from "./chunk-264B57GV.js";
 import {
   bufferTurnArrayIsSuffixOfSnapshot,
   bufferTurnArraysEqual,
@@ -21,8 +21,9 @@ import {
   matchingQueuedExtractionPrefixLength,
   probeWithTimeout,
   scopeProfilePlanIdentity,
-  selectRetainedDeferredTurns
-} from "./chunk-KZMRMKC7.js";
+  selectRetainedDeferredTurns,
+  subtractBufferTurns
+} from "./chunk-U7MIMS2Y.js";
 import {
   resolvePrincipal
 } from "./chunk-ESG6ITGP.js";
@@ -223,7 +224,30 @@ var SmartBuffer = class {
     this.loaded = true;
   }
   async saveUnlocked() {
-    await this.persistence.persist(this.storage, this.state, (key) => this.peekEntry(key) ?? void 0);
+    const { handedOver, drainedTurns } = await this.persistence.persist(this.storage, this.state, (key) => this.peekEntry(key) ?? void 0);
+    for (const [key, drained] of drainedTurns) {
+      const entry = this.peekEntry(key);
+      if (!entry) continue;
+      entry.turns = subtractBufferTurns(entry.turns, drained);
+      if (entry.retainedTurns && entry.retainedTurns.length > 0) {
+        entry.retainedTurns = subtractBufferTurns(entry.retainedTurns, drained);
+        if (entry.retainedTurns.length === 0) delete entry.retainedTurns;
+      }
+      if (key === "default") this.state.turns = entry.turns;
+    }
+    if (handedOver.length === 0) return;
+    const entries = this.state.entries;
+    if (!entries) return;
+    for (const key of handedOver) {
+      delete entries[key];
+      if (key === "default") {
+        this.state.turns = [];
+      }
+    }
+  }
+  /** Sync gate for the extraction queue: is this session claimed by a buffer drain? */
+  isSessionClaimed(key) {
+    return this.storage.isBufferSessionClaimed?.(key) === true;
   }
   async save() {
     await this.enqueueMutation(async () => this.saveUnlocked());
@@ -885,4 +909,4 @@ var SmartBuffer = class {
 export {
   SmartBuffer
 };
-//# sourceMappingURL=chunk-YJHOVA42.js.map
+//# sourceMappingURL=chunk-JL5FHZ7O.js.map

package/dist/chunk-JL5FHZ7O.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/buffer.ts"],"sourcesContent":["import { log } from \"./logger.js\";\nimport { throwIfAborted } from \"./abort-error.js\";\nimport { scanSignals } from \"./signal.js\";\nimport { BufferSessionPersistence, type BufferStorage } from \"./buffer-persistence.js\";\nimport { selectEvictedBufferKeys } from \"./buffer-eviction.js\";\nimport type {\n  BufferEntryState,\n  BufferState,\n  BufferSurpriseEvent,\n  BufferTurn,\n  PluginConfig,\n  SignalLevel,\n} from \"./types.js\";\nimport { resolvePresentationCapabilities, resolveNamespaceCapabilities } from \"./capabilities.js\";\nimport { resolvePrincipal } from \"./namespaces/principal.js\";\nimport { scopeProfilePlanIdentity, subtractBufferTurns } from \"./buffer-turn-helpers.js\";\nimport { ExtractionDeadlineError } from \"./orchestration/extraction-run.js\";\nimport type { ExtractionBufferSnapshot } from \"./extraction-liveness.js\";\nimport {\n  bufferTurnArrayIsSuffixOfSnapshot,\n  bufferTurnArraysEqual,\n  bufferTurnsEqual,\n  copyBufferTurn,\n  describeError,\n  hasPinnedCaptureScope,\n  liveTurnsFromExtractionSnapshot,\n  matchingQueuedExtractionPrefixLength,\n  probeWithTimeout,\n  selectRetainedDeferredTurns,\n} from \"./buffer-turn-helpers.js\";\n\nexport type TriggerDecision = \"extract_now\" | \"extract_batch\" | \"keep_buffering\";\n\nexport type { BufferSurpriseProbe } from \"./buffer-types.js\";\nimport type { BufferSurpriseProbe, SurpriseTelemetryQueueEntry } from \"./buffer-types.js\";\n\nexport interface AddTurnOutcome {\n  decision: TriggerDecision;\n  extractionTurns?: BufferTurn[];\n}\n\nexport interface RetainedTurnCleanupOptions {\n  abortSignal?: AbortSignal;\n  deadlineMs?: number;\n  /** Keep cleanup within the accepted namespace. */\n  writeNamespaceOverride?: string;\n  /** Match the original profile and project binding, not just its write namespace. */\n  scopeProfileWritePlan?: import(\"./namespaces/scope-profiles.js\").ResolvedScopeProfilePlan | null;\n  codingContext?: import(\"./types.js\").CodingContext;\n}\n\nconst MAX_BUFFER_ENTRY_COUNT = 200;\nconst isAcceptedTurn = (t: { acceptedCapture?: boolean; writeNamespaceOverride?: string }): boolean =>\n  t.acceptedCapture === true || t.writeNamespaceOverride !== undefined;\n\n/**\n * Upper bound on how long a debounced buffer save may be deferred under\n * sustained activity (issue #1909). Each new turn re-arms the trailing-edge\n * timer, so a steady stream of turns could otherwise push the save out\n * indefinitely and widen the crash-loss window without bound. Once a pending\n * save has been deferred this many debounce windows, the next scheduled save\n * forces an inline flush instead of re-arming.\n */\nconst BUFFER_SAVE_MAX_DEFER_MULTIPLIER = 5;\n\n/**\n * Node's maximum 32-bit `setTimeout` delay (2^31-1 ms, ~24.8 days). A larger\n * value is overflow-clamped by Node to 1ms with a TimeoutOverflowWarning, so we\n * clamp defensively at every timer arm (issue #1909 review round 5) even though\n * parseConfig already caps `bufferSaveDebounceMs` — a directly-constructed config\n * could still exceed it.\n */\nconst MAX_SET_TIMEOUT_MS = 2_147_483_647;\n\ninterface AddTurnMutationResult {\n  decision: TriggerDecision;\n  signalLevel: SignalLevel;\n  priorTurns: BufferTurn[];\n  activeTurnsSnapshot: BufferTurn[];\n  retainedTurnsSnapshot: BufferTurn[];\n  turnCountInWindow: number;\n}\n\nexport class SmartBuffer {\n  private state: BufferState;\n  private loaded = false;\n  private loadPromise: Promise<void> | null = null;\n  private readonly surpriseProbe: BufferSurpriseProbe | null;\n  private mutationChain: Promise<unknown> = Promise.resolve();\n  /**\n   * Serialized write chain for `BUFFER_SURPRISE` telemetry events.\n   *\n   * The telemetry path is fire-and-forget (`addTurn` does not await the\n   * ledger append), but multiple concurrent appends would still settle\n   * out of order under variable filesystem latency. The report path\n   * assumes chronological ordering — it slices the tail of the ledger\n   * and treats the most recent entry as the current threshold in force.\n   * Chaining ensures each append only runs after the previous settles,\n   * preserving wall-clock order.\n   *\n   * We include a `.catch` on every link so a rejected append does not\n   * poison the chain (CLAUDE.md rule #40).\n   */\n  private surpriseTelemetryWriteChain: Promise<unknown> = Promise.resolve();\n\n  /**\n   * Debounced buffer-save state (issue #1909). Steady-state buffering used to\n   * serialize + rewrite the whole multi-session buffer on EVERY turn. We now\n   * coalesce those writes onto a trailing-edge timer; correctness boundaries\n   * (extraction trigger, extraction clear, shutdown) still force an immediate\n   * flush. `bufferSaveDebounceMs: 0` restores save-every-turn exactly.\n   */\n  private saveTimer: NodeJS.Timeout | null = null;\n  private pendingSave = false;\n  /** Wall-clock ms when the currently-pending save was first scheduled (issue\n   * #1909). Null when nothing is pending. Used to bound deferral under sustained\n   * activity (see BUFFER_SAVE_MAX_DEFER_MULTIPLIER). */\n  private firstPendingAtMs: number | null = null;\n\n  /** Which sessions' persisted files are stale (per-session incremental saves). */\n  private readonly persistence = new BufferSessionPersistence();\n\n  constructor(\n    private readonly config: PluginConfig,\n    private readonly storage: BufferStorage,\n    surpriseProbe: BufferSurpriseProbe | null = null,\n  ) {\n    this.state = { turns: [], lastExtractionAt: null, extractionCount: 0 };\n    this.surpriseProbe = surpriseProbe;\n  }\n\n  private enqueueMutation<T>(op: () => Promise<T>): Promise<T> {\n    const run = this.mutationChain.catch(() => {}).then(op);\n    this.mutationChain = run.catch(() => {});\n    return run;\n  }\n\n  private entryFor(key: string): BufferEntryState {\n    if (!this.state.entries) {\n      this.state.entries = Object.create(null) as NonNullable<BufferState[\"entries\"]>;\n    }\n    const entries = this.state.entries as NonNullable<BufferState[\"entries\"]>;\n    if (Object.hasOwn(entries, key)) {\n      const stored = entries[key];\n      // Guard against corrupted state/buffer.json — if the stored entry\n      // is not a valid object shape, discard it and recreate.\n      if (stored && typeof stored === \"object\" && Array.isArray(stored.turns)) {\n        return stored;\n      }\n      // Corrupted — fall through to recreate.\n    }\n    const created: BufferEntryState = {\n      turns: [],\n      lastExtractionAt: null,\n      extractionCount: 0,\n    };\n    entries[key] = created;\n    return created;\n  }\n\n  private peekEntry(key: string): BufferEntryState | null {\n    const existing = this.state.entries?.[key];\n    if (existing) return existing;\n    if (key !== \"default\") return null;\n    return {\n      turns: Array.isArray(this.state.turns) ? this.state.turns : [],\n      lastExtractionAt: this.state.lastExtractionAt ?? null,\n      extractionCount:\n        typeof this.state.extractionCount === \"number\" ? this.state.extractionCount : 0,\n    };\n  }\n\n  private normalizeState(state: BufferState): BufferState {\n    const entries = Object.assign(\n      Object.create(null),\n      state.entries ?? {},\n    ) as NonNullable<BufferState[\"entries\"]>;\n    if (!entries.default) {\n      entries.default = {\n        turns: Array.isArray(state.turns) ? [...state.turns] : [],\n        lastExtractionAt: state.lastExtractionAt ?? null,\n        extractionCount:\n          typeof state.extractionCount === \"number\" ? state.extractionCount : 0,\n      };\n    }\n    return {\n      turns: entries.default.turns,\n      lastExtractionAt: entries.default.lastExtractionAt,\n      extractionCount: entries.default.extractionCount,\n      entries,\n    };\n  }\n\n  private entryActivityAt(entry: BufferEntryState): number {\n    const lastTurnAt = entry.turns.reduce((latest, turn) => {\n      const parsed = Date.parse(turn.timestamp);\n      return Number.isFinite(parsed) ? Math.max(latest, parsed) : latest;\n    }, -1);\n    const lastExtractionAt =\n      typeof entry.lastExtractionAt === \"string\"\n        ? Date.parse(entry.lastExtractionAt)\n        : Number.NaN;\n    return Math.max(\n      lastTurnAt,\n      Number.isFinite(lastExtractionAt) ? lastExtractionAt : -1,\n    );\n  }\n\n  /** Evict oldest entries past MAX_BUFFER_ENTRY_COUNT and queue their session files for deletion. */\n  private pruneEntries(retainKeys: string[]): void {\n    const entries = this.state.entries;\n    if (!entries) return;\n    const evicted = selectEvictedBufferKeys(entries, retainKeys, MAX_BUFFER_ENTRY_COUNT, {\n      activityAt: (entry) => this.entryActivityAt(entry),\n      holdsAcceptedCapture: (entry) => this.entryHoldsAcceptedCapture(entry),\n    });\n    for (const key of evicted) delete entries[key];\n    this.persistence.markEvicted(evicted);\n    if (evicted.length > 0) {\n      // Loud degradation (extraction hot-loop hardening, Step 7): buffer\n      // pressure during a provider outage is bounded and expected, but must\n      // be observable, not silent.\n      log.warn(\n        `buffer: pruned ${evicted.length} oldest session entr${evicted.length === 1 ? \"y\" : \"ies\"} ` +\n          `past MAX_BUFFER_ENTRY_COUNT=${MAX_BUFFER_ENTRY_COUNT}; buffered turn data for those sessions was dropped`,\n      );\n    }\n  }\n\n  private async loadUnlocked(): Promise<void> {\n    if (this.loaded) return;\n    if (!this.loadPromise) {\n      this.loadPromise = this.storage.loadBuffer()\n        .then((state) => {\n          this.state = this.normalizeState(state);\n          this.loaded = true;\n        })\n        .finally(() => {\n          this.loadPromise = null;\n        });\n    }\n    await this.loadPromise;\n  }\n\n  async load(): Promise<void> {\n    await this.enqueueMutation(async () => this.loadUnlocked());\n  }\n\n  /** Snapshot of buffered, not-yet-extracted work across sessions (#2151): session count,\n   * pending-turn total, oldest buffered turn. Counts retained (#562) + active turns per entry. */\n  async getBufferSnapshot(): Promise<ExtractionBufferSnapshot> {\n    await this.load();\n    let bufferedSessionCount = 0;\n    let pendingTurnCount = 0;\n    let oldestMs = Number.POSITIVE_INFINITY;\n    let oldestTurnTimestamp: string | null = null;\n    const consider = (turns: BufferTurn[] | undefined): void => {\n      if (!Array.isArray(turns) || turns.length === 0) return;\n      bufferedSessionCount += 1;\n      pendingTurnCount += turns.length;\n      const first = turns[0]?.timestamp;\n      const parsed = typeof first === \"string\" ? Date.parse(first) : Number.NaN;\n      if (Number.isFinite(parsed) && parsed < oldestMs) {\n        oldestMs = parsed;\n        oldestTurnTimestamp = first ?? null;\n      }\n    };\n    const entries = this.state.entries;\n    if (entries) {\n      // Retained turns (deferred #562) are pending too - count with active (oldest-first), like getTurns().\n      for (const entry of Object.values(entries)) consider([...(entry?.retainedTurns ?? []), ...(entry?.turns ?? [])]);\n    } else {\n      consider(this.state.turns);\n    }\n    return { bufferedSessionCount, pendingTurnCount, oldestTurnTimestamp };\n  }\n\n  /**\n   * Reset the buffer to an empty, usable state.\n   * Called when the persisted buffer file is corrupt and load() fails,\n   * so the buffer can still accept new turns for the rest of the session.\n   */\n  resetToEmpty(): void {\n    for (const key of Object.keys(this.state.entries ?? {})) {\n      this.persistence.markDeleted(key);\n    }\n    this.state = { turns: [], lastExtractionAt: null, extractionCount: 0 };\n    this.loaded = true;\n  }\n\n  private async saveUnlocked(): Promise<void> {\n    const { handedOver, drainedTurns } = await this.persistence.persist(this.storage, this.state, (key) => this.peekEntry(key) ?? undefined);\n    // A drain tombstone: the turns the drain extracted leave this copy too,\n    // so a stale owner never extracts (or persists) them a second time.\n    for (const [key, drained] of drainedTurns) {\n      const entry = this.peekEntry(key);\n      if (!entry) continue;\n      entry.turns = subtractBufferTurns(entry.turns, drained);\n      if (entry.retainedTurns && entry.retainedTurns.length > 0) {\n        entry.retainedTurns = subtractBufferTurns(entry.retainedTurns, drained);\n        if (entry.retainedTurns.length === 0) delete entry.retainedTurns;\n      }\n      if (key === \"default\") this.state.turns = entry.turns;\n    }\n    if (handedOver.length === 0) return;\n    // A drain claim now owns these sessions' turns (durable in the claim\n    // file): drop the in-memory entries so this process cannot resurrect\n    // them. A later observe for the same key starts a fresh entry whose\n    // turns flow into the claim at the next handover.\n    const entries = this.state.entries;\n    if (!entries) return;\n    for (const key of handedOver) {\n      delete entries[key];\n      if (key === \"default\") {\n        this.state.turns = [];\n      }\n    }\n  }\n\n  /** Sync gate for the extraction queue: is this session claimed by a buffer drain? */\n  isSessionClaimed(key: string): boolean {\n    return this.storage.isBufferSessionClaimed?.(key) === true;\n  }\n\n  async save(): Promise<void> {\n    await this.enqueueMutation(async () => this.saveUnlocked());\n  }\n\n  /**\n   * Schedule a coalesced, TRUE trailing-edge buffer save (issue #1909). Only\n   * used for the debounced (`bufferSaveDebounceMs > 0`) steady-state buffering\n   * path; the debounce-off and correctness-boundary paths save inline within the\n   * mutation (see `recordTurnUnlocked`). Each call re-arms the timer from now so\n   * the write lands one full window after the LAST turn, not the first. To keep\n   * sustained activity from deferring the save without bound (which would widen\n   * the crash-loss window), once a pending save has been deferred\n   * BUFFER_SAVE_MAX_DEFER_MULTIPLIER windows it is flushed inline instead of\n   * re-armed. Runs inside the record mutation, so the inline save is awaited.\n   */\n  private async scheduleSave(): Promise<void> {\n    const ms = Math.min(this.config.bufferSaveDebounceMs, MAX_SET_TIMEOUT_MS);\n    const now = Date.now();\n    this.pendingSave = true;\n    if (this.firstPendingAtMs === null) this.firstPendingAtMs = now;\n    if (now - this.firstPendingAtMs >= ms * BUFFER_SAVE_MAX_DEFER_MULTIPLIER) {\n      // Staleness cap hit: persist now rather than deferring further. Drop the\n      // armed timer, attempt the write, and only mark clean on success — a\n      // failure keeps the save pending + re-arms so shutdown/the next timer\n      // retries (issue #1909 review round 2), never diverging memory from disk.\n      clearTimeout(this.saveTimer ?? undefined);\n      this.saveTimer = null;\n      try {\n        await this.saveUnlocked();\n        this.pendingSave = false;\n        this.firstPendingAtMs = null;\n      } catch (err) {\n        log.warn(`buffer.scheduleSave: staleness-cap save failed, keeping it pending: ${describeError(err)}`);\n        this.saveTimer = setTimeout(() => {\n          this.saveTimer = null;\n          void this.flushPendingSave();\n        }, ms);\n        this.saveTimer.unref?.();\n      }\n      return;\n    }\n    // True trailing edge: drop any armed timer and re-arm from now.\n    clearTimeout(this.saveTimer ?? undefined);\n    this.saveTimer = setTimeout(() => {\n      this.saveTimer = null;\n      void this.flushPendingSave();\n    }, ms);\n    this.saveTimer.unref?.();\n  }\n\n  /** Cancel any armed debounced save without persisting. */\n  private cancelScheduledSave(): void {\n    if (this.saveTimer) {\n      clearTimeout(this.saveTimer);\n      this.saveTimer = null;\n    }\n    this.pendingSave = false;\n    this.firstPendingAtMs = null;\n  }\n\n  /**\n   * Persist the current in-memory buffer state inline, keeping the global\n   * pending-save state armed until the write SUCCEEDS (issue #1909). On failure\n   * the save stays pending and — when debounced — a background retry timer is\n   * (re-)armed before the error propagates, so a graceful shutdown flush and the\n   * next timer tick both retry. A failed post-mutation save therefore can never\n   * silently drop buffered turns, including turns from OTHER sessions that were\n   * only in the debounced pending state. The pending flag is cleared (and any\n   * armed timer dropped) only after a durable write.\n   */\n  private async saveNowRetainingPendingOnFailure(context: string): Promise<void> {\n    this.pendingSave = true;\n    if (this.firstPendingAtMs === null) this.firstPendingAtMs = Date.now();\n    try {\n      await this.saveUnlocked();\n    } catch (err) {\n      log.warn(\n        `buffer.${context}: inline save failed, keeping it pending for retry: ${describeError(err)}`,\n      );\n      const ms = Math.min(this.config.bufferSaveDebounceMs, MAX_SET_TIMEOUT_MS);\n      if (ms > 0 && !this.saveTimer) {\n        this.saveTimer = setTimeout(() => {\n          this.saveTimer = null;\n          void this.flushPendingSave();\n        }, ms);\n        this.saveTimer.unref?.();\n      }\n      throw err;\n    }\n    this.cancelScheduledSave();\n  }\n\n  /**\n   * Force any pending debounced save to land now (issue #1909). Idempotent and\n   * safe to call from outside a mutation (timer tick, shutdown/dispose, or the\n   * surprise-promotion path in `addTurnWithOutcome`). Do NOT `await` this from\n   * inside a mutation — it enqueues its own mutation and would deadlock the\n   * serializer.\n   *\n   * `throwOnFailure` (review round 7 finding 5): when set, a failed write is\n   * rethrown AFTER the keep-pending + re-arm bookkeeping, so the surprise\n   * extraction boundary gets the same durability guarantee as the built-in\n   * extract triggers (which propagate saveUnlocked failures) instead of\n   * proceeding to extract_now on a non-durable triggering turn. Default false\n   * keeps the fail-open behavior for the timer/shutdown callers.\n   */\n  async flushPendingSave(opts?: { throwOnFailure?: boolean }): Promise<void> {\n    if (this.saveTimer) {\n      clearTimeout(this.saveTimer);\n      this.saveTimer = null;\n    }\n    // resetToEmpty-only deletions are pending work too, even with no\n    // pending-save flag set.\n    if (!this.pendingSave && !this.persistence.hasPending()) return;\n    try {\n      await this.enqueueMutation(async () => {\n        // Re-check under the serializer: a concurrent flush may have already\n        // persisted this pending save. Skip the redundant write (no phantom\n        // writes). resetToEmpty-only deletions also land here without a\n        // pending-save flag.\n        if (!this.pendingSave && !this.persistence.hasPending()) return;\n        await this.saveUnlocked();\n        // Clear the pending flag INSIDE the same serialized mutation as the\n        // write (issue #1909 review). Clearing it after the enqueue await\n        // resolved raced an addTurn interleaving between the write and the\n        // clear: that turn's scheduleSave re-armed pendingSave + a timer, then\n        // this clear wiped it and the debounced flush was lost. Atomic\n        // write+clear means any addTurn runs wholly before (its turn is in the\n        // write) or wholly after (its pendingSave survives and its timer\n        // persists it).\n        this.pendingSave = false;\n        this.firstPendingAtMs = null;\n      });\n    } catch (err) {\n      // The write failed: memory and disk diverge (issue #1909 review round 2).\n      // Keep the save PENDING (do NOT clear pendingSave/firstPendingAtMs) so a\n      // graceful shutdown flush and the re-armed timer both retry it — clearing\n      // the flag here would drop the buffered turns permanently. Re-arm a\n      // background retry when debounced.\n      log.warn(`buffer.flushPendingSave: save failed, keeping it pending for retry: ${describeError(err)}`);\n      const ms = Math.min(this.config.bufferSaveDebounceMs, MAX_SET_TIMEOUT_MS);\n      if (ms > 0 && !this.saveTimer) {\n        this.saveTimer = setTimeout(() => {\n          this.saveTimer = null;\n          void this.flushPendingSave();\n        }, ms);\n        this.saveTimer.unref?.();\n      }\n      // Surprise-extraction boundary needs the durability guarantee — surface\n      // the failure so the caller does not proceed with a non-durable flush.\n      if (opts?.throwOnFailure) throw err;\n      return; // fail-open for timer/shutdown callers\n    }\n  }\n\n  async addTurn(bufferKey: string, turn: BufferTurn): Promise<TriggerDecision> {\n    return (await this.addTurnWithOutcome(bufferKey, turn)).decision;\n  }\n\n  /** Admit atomically; refuse at capacity rather than evict accepted work. */\n  async addTurnBounded(bufferKey: string, turn: BufferTurn): Promise<AddTurnOutcome | null> {\n    const mutation = await this.enqueueMutation(async () => {\n      await this.loadUnlocked();\n      if (this.peekEntry(bufferKey) === null) {\n        this.makeRoomForEntryUnlocked();\n        if (Object.keys(this.state.entries ?? {}).length >= MAX_BUFFER_ENTRY_COUNT) {\n          log.warn(\n            `buffer[${bufferKey}]: durable capture refused at MAX_BUFFER_ENTRY_COUNT=${MAX_BUFFER_ENTRY_COUNT}`,\n          );\n          return null;\n        }\n      }\n      return this.recordTurnUnlocked(bufferKey, turn);\n    });\n    if (mutation === null) return null;\n    return this.completeAddTurnOutcome(bufferKey, turn, mutation);\n  }\n\n  /** Prune empty entries only; accepted work must survive capacity pressure. */\n  private makeRoomForEntryUnlocked(): void {\n    const entries = this.state.entries;\n    if (!entries) return;\n    const keys = Object.keys(entries);\n    if (keys.length < MAX_BUFFER_ENTRY_COUNT) return;\n    const byOldestActivity = (left: string, right: string): number =>\n      this.entryActivityAt(entries[left] ?? { turns: [], lastExtractionAt: null, extractionCount: 0 }) -\n      this.entryActivityAt(entries[right] ?? { turns: [], lastExtractionAt: null, extractionCount: 0 });\n    const emptyRemovable = keys\n      .filter(\n        (key) =>\n          key !== \"default\" &&\n          (entries[key]?.turns.length ?? 0) === 0 &&\n          (entries[key]?.retainedTurns?.length ?? 0) === 0,\n      )\n      .sort(byOldestActivity);\n    for (const key of emptyRemovable) {\n      if (Object.keys(entries).length < MAX_BUFFER_ENTRY_COUNT) break;\n      delete entries[key];\n      this.persistence.markDeleted(key);\n    }\n  }\n\n  private entryHoldsAcceptedCapture(entry: BufferEntryState | undefined): boolean {\n    return (entry?.turns ?? []).some(isAcceptedTurn) || (entry?.retainedTurns ?? []).some(isAcceptedTurn);\n  }\n\n  async addTurnWithOutcome(\n    bufferKey: string,\n    turn: BufferTurn,\n  ): Promise<AddTurnOutcome> {\n    const mutation = await this.enqueueMutation(() => this.recordTurnUnlocked(bufferKey, turn));\n    return this.completeAddTurnOutcome(bufferKey, turn, mutation);\n  }\n\n  /** Run probes outside the mutation lock to avoid reentrancy deadlocks. */\n  private async completeAddTurnOutcome(\n    bufferKey: string,\n    turn: BufferTurn,\n    mutation: AddTurnMutationResult,\n  ): Promise<AddTurnOutcome> {\n    let decision = mutation.decision;\n    let extractionTurns: BufferTurn[] | undefined;\n\n    // Surprise-gated flush (issue #563). Additive only: if the probe is\n    // disabled, unavailable, or the score is below threshold, the decision\n    // from the existing trigger logic stands. The probe only ever *promotes*\n    // `keep_buffering` → `extract_now`; it never suppresses an existing\n    // flush. This preserves the invariant that enabling surprise cannot\n    // *reduce* extraction frequency.\n    if (\n      decision === \"keep_buffering\" &&\n      resolvePresentationCapabilities(this.config).bufferSurpriseTrigger &&\n      this.surpriseProbe !== null &&\n      // Matching the existing \"smart\" branch: surprise is a lower-tier\n      // novelty signal that should not second-guess a high-signal hit\n      // (which already flushes) or fight `every_n` / `time_based` modes.\n      this.config.triggerMode === \"smart\" &&\n      mutation.signalLevel !== \"high\"\n    ) {\n      const surprise = await this.computeSurpriseSafe(bufferKey, turn, mutation.priorTurns);\n      if (surprise !== null) {\n        const shouldPromote = surprise > this.config.bufferSurpriseThreshold;\n        let triggered = false;\n        if (shouldPromote) {\n          const currentTurns = await this.getExtractionTurnsIfBufferSnapshotStillCurrent(\n            bufferKey,\n            mutation.activeTurnsSnapshot,\n            mutation.retainedTurnsSnapshot,\n          );\n          if (currentTurns) {\n            log.debug(\n              `buffer[${bufferKey}]: surprise=${surprise.toFixed(3)} > threshold=${this.config.bufferSurpriseThreshold} → extract_now`,\n            );\n            decision = \"extract_now\";\n            triggered = true;\n            extractionTurns = currentTurns;\n            // Issue #1909 (review): the record mutation for a `keep_buffering`\n            // turn only SCHEDULED a debounced save. Surprise now promotes it to\n            // extract_now AFTER that mutation, so force the buffer durable before\n            // the caller runs extraction — otherwise state/buffer.json lags the\n            // extracted turns by up to the debounce window on a crash. Safe to\n            // await here: we are outside the record mutation (deadlock-free).\n            // throwOnFailure (round 7 finding 5): match the built-in extract\n            // triggers — a failed durability write must NOT silently proceed to\n            // extract_now on a non-durable turn.\n            await this.flushPendingSave({ throwOnFailure: true });\n          } else {\n            log.debug(\n              `buffer[${bufferKey}]: surprise=${surprise.toFixed(3)} ignored because buffer changed before probe resolved`,\n            );\n          }\n        }\n        // Emit telemetry on every scored turn — both triggering and\n        // non-triggering — so operators can fit the threshold to real\n        // traffic distributions. Fire-and-forget: `addTurn` does NOT\n        // await the ledger append, so slow/contended filesystems cannot\n        // add JSONL-append latency to every `processTurn`. But we DO\n        // serialize writes through a promise chain so concurrent\n        // appends settle in wall-clock order — the report path assumes\n        // chronological tail rows and reads the most recent as the\n        // \"current\" threshold.\n        //\n        // Project only the fields we need into the queue entry rather\n        // than capturing the full `BufferTurn` — under slow filesystem\n        // latency the chain can back up, and we must not retain the\n        // (potentially large) `turn.content` string for every pending\n        // append.\n        this.queueSurpriseTelemetryWrite({\n          bufferKey,\n          turnRole: turn.role,\n          sessionKey:\n            typeof turn.sessionKey === \"string\" ? turn.sessionKey : null,\n          surpriseScore: surprise,\n          triggered,\n          turnCountInWindow: mutation.turnCountInWindow,\n          // Stamp at decision time so backpressure on the write chain\n          // does not shift the event's apparent moment away from when\n          // the turn was actually scored.\n          timestamp: new Date().toISOString(),\n          // Snapshot the threshold used to compute `triggered` so a\n          // concurrent config mutation cannot retroactively change\n          // what the ledger row claims the decision was against.\n          threshold: this.config.bufferSurpriseThreshold,\n        });\n      }\n    }\n\n    log.debug(\n      `buffer[${bufferKey}]: ${mutation.turnCountInWindow} turns, signal=${mutation.signalLevel}, decision=${decision}`,\n    );\n    if (decision !== \"keep_buffering\" && extractionTurns === undefined) {\n      extractionTurns = [\n        ...mutation.retainedTurnsSnapshot,\n        ...mutation.activeTurnsSnapshot,\n      ];\n    }\n    return extractionTurns ? { decision, extractionTurns } : { decision };\n  }\n\n  private async recordTurnUnlocked(bufferKey: string, turn: BufferTurn): Promise<AddTurnMutationResult> {\n    await this.loadUnlocked();\n    const entry = this.entryFor(bufferKey);\n    const priorTurns = entry.turns.slice();\n    entry.turns.push(turn);\n    const activeTurnsSnapshot = entry.turns.map(copyBufferTurn);\n    const retainedTurnsSnapshot = (entry.retainedTurns ?? []).map(copyBufferTurn);\n    if (bufferKey === \"default\") {\n      this.state.turns = entry.turns;\n    }\n\n    const signal = scanSignals(turn.content, this.config.highSignalPatterns);\n    const decision = this.evaluate(entry, signal.level);\n    const turnCountInWindow = entry.turns.length;\n\n    this.persistence.markDirty(bufferKey);\n    this.pruneEntries([bufferKey]);\n    if (decision === \"keep_buffering\" && this.config.bufferSaveDebounceMs > 0) {\n      // Steady-state buffering: coalesce the whole-state serialize onto a\n      // trailing-edge timer (issue #1909) instead of rewriting per turn.\n      await this.scheduleSave();\n    } else {\n      // Persist immediately within this mutation (awaited) when either:\n      //  - the turn triggered extraction (the buffer must be durable), or\n      //  - debounce is disabled (bufferSaveDebounceMs <= 0), which reproduces\n      //    the legacy save-every-turn behavior byte-for-byte.\n      // Round 8 thread 4: the write is attempted BEFORE the pending state is\n      // cleared, and a failed write leaves it pending (+ a re-armed timer) for\n      // shutdown/timer retry instead of dropping the in-memory turns.\n      await this.saveNowRetainingPendingOnFailure(\"recordTurn\");\n    }\n    return {\n      decision,\n      signalLevel: signal.level,\n      priorTurns,\n      activeTurnsSnapshot,\n      retainedTurnsSnapshot,\n      turnCountInWindow,\n    };\n  }\n\n  private async getExtractionTurnsIfBufferSnapshotStillCurrent(\n    bufferKey: string,\n    activeTurnsSnapshot: readonly BufferTurn[],\n    retainedTurnsSnapshot: readonly BufferTurn[],\n  ): Promise<BufferTurn[] | null> {\n    return this.enqueueMutation(async () => {\n      await this.loadUnlocked();\n      const entry = this.peekEntry(bufferKey);\n      if (!entry) return null;\n      const retained = entry.retainedTurns ?? [];\n      const stillCurrent =\n        bufferTurnArrayIsSuffixOfSnapshot(entry.turns, activeTurnsSnapshot) &&\n        bufferTurnArraysEqual(retained, retainedTurnsSnapshot);\n      if (!stillCurrent) return null;\n      return [...retained, ...entry.turns];\n    });\n  }\n\n  /**\n   * Enqueue a telemetry append on the serialized write chain.\n   *\n   * The chain is a classic `writeChain = writeChain.then(fn).catch(...)`\n   * — each link waits for the previous to settle before its append\n   * starts, so out-of-order chronology cannot happen even under\n   * variable filesystem latency. We always attach `.catch` so one\n   * rejection does not poison the chain for the rest of the session\n   * (CLAUDE.md rule #40). The error is logged through\n   * `emitSurpriseEventSafe` itself, which swallows its own rejections.\n   *\n   * Public surface is deliberately narrow — only `addTurn` should call\n   * this, so the surprise telemetry path stays centralized.\n   */\n  private queueSurpriseTelemetryWrite(params: SurpriseTelemetryQueueEntry): void {\n    this.surpriseTelemetryWriteChain = this.surpriseTelemetryWriteChain\n      .then(() => this.emitSurpriseEventSafe(params))\n      .catch(() => {\n        // `emitSurpriseEventSafe` already handles the logging. We\n        // swallow here only so one failure does not break the chain\n        // for future writes.\n      });\n  }\n\n  /**\n   * Append a single `BUFFER_SURPRISE` telemetry row (issue #563 PR 3).\n   *\n   * Deliberately swallows write errors: the buffer must never fail to\n   * record a turn because the observation ledger is read-only, out of\n   * disk, or otherwise unhappy. The log line at debug lets operators\n   * confirm the path fired without polluting the error channel.\n   */\n  private async emitSurpriseEventSafe(\n    params: SurpriseTelemetryQueueEntry,\n  ): Promise<void> {\n    const storage = this.storage;\n    if (typeof storage.appendBufferSurpriseEvents !== \"function\") {\n      // Older StorageManager / test double without the telemetry sink.\n      // Silently skip — core path is still covered by the log line above.\n      return;\n    }\n    const event: BufferSurpriseEvent = {\n      event: \"BUFFER_SURPRISE\",\n      // Use the decision-time stamp captured when the event was\n      // queued, NOT `Date.now()` here — backpressure on the write\n      // chain could otherwise shift timestamps into the future relative\n      // to when the turn was scored.\n      timestamp: params.timestamp,\n      bufferKey: params.bufferKey,\n      sessionKey: params.sessionKey,\n      turnRole: params.turnRole,\n      surpriseScore: params.surpriseScore,\n      // Use the snapshotted threshold from the queue entry, not the\n      // live config — see `SurpriseTelemetryQueueEntry.threshold`\n      // doc for the rationale.\n      threshold: params.threshold,\n      triggeredFlush: params.triggered,\n      turnCountInWindow: params.turnCountInWindow,\n    };\n    try {\n      await storage.appendBufferSurpriseEvents([event]);\n    } catch (err) {\n      // Same guard as `computeSurpriseSafe`: non-Error rejections must\n      // not crash the telemetry helper, which would defeat the whole\n      // point of isolating the ledger write from the hot path.\n      log.debug(\n        `buffer[${params.bufferKey}]: surprise telemetry write failed, continuing: ${describeError(err)}`,\n      );\n    }\n  }\n\n  /**\n   * Invoke the injected surprise probe defensively. Any error (probe throws,\n   * embedder unavailable, timeout) is swallowed and logged at debug: the\n   * surprise path must never crash the happy-path trigger evaluation. A\n   * `null` return indicates \"no score available, fall through to existing\n   * triggers\".\n   */\n  private async computeSurpriseSafe(\n    bufferKey: string,\n    turn: BufferTurn,\n    priorTurns: readonly BufferTurn[],\n  ): Promise<number | null> {\n    if (!this.surpriseProbe) return null;\n    try {\n      // Hard timeout around the probe so a hung embedder cannot stall\n      // `addTurn()` before `save()`. A slow probe would otherwise\n      // prevent the just-appended turn from ever being persisted. The\n      // timeout is a soft bound — we race it against the probe, take\n      // whichever settles first, and treat the timeout as\n      // \"probe unavailable, fall through\" rather than an error that\n      // surfaces to the caller.\n      const score = await probeWithTimeout(\n        this.surpriseProbe.scoreTurn(bufferKey, turn, priorTurns),\n        this.config.bufferSurpriseProbeTimeoutMs,\n      );\n      if (score === null) return null;\n      if (typeof score !== \"number\" || !Number.isFinite(score)) {\n        log.debug(\n          `buffer[${bufferKey}]: surprise probe returned non-finite score (${String(score)}), ignoring`,\n        );\n        return null;\n      }\n      // Defensive clamp: formula lives in buffer-surprise.ts, but we never\n      // want a misbehaving probe to inject an out-of-range value into the\n      // threshold comparison.\n      if (score < 0) return 0;\n      if (score > 1) return 1;\n      return score;\n    } catch (err) {\n      // `err` may be any thrown value — `throw null` and\n      // `Promise.reject(\"x\")` are both legal. Accessing `.message` on a\n      // non-Error would itself throw and defeat the failure-isolation\n      // contract, so describe the value safely.\n      log.debug(\n        `buffer[${bufferKey}]: surprise probe failed, falling back to existing triggers: ${describeError(err)}`,\n      );\n      return null;\n    }\n  }\n\n  private evaluate(entry: BufferEntryState, signalLevel: SignalLevel): TriggerDecision {\n    if (this.config.triggerMode === \"smart\") {\n      if (signalLevel === \"high\") return \"extract_now\";\n\n      if (entry.turns.length >= this.config.bufferMaxTurns) {\n        return \"extract_batch\";\n      }\n\n      if (entry.lastExtractionAt) {\n        const elapsed =\n          Date.now() - new Date(entry.lastExtractionAt).getTime();\n        if (elapsed >= this.config.bufferMaxMinutes * 60_000) {\n          return \"extract_batch\";\n        }\n      }\n\n      return \"keep_buffering\";\n    }\n\n    if (this.config.triggerMode === \"every_n\") {\n      return entry.turns.length >= this.config.bufferMaxTurns\n        ? \"extract_batch\"\n        : \"keep_buffering\";\n    }\n\n    if (this.config.triggerMode === \"time_based\") {\n      if (!entry.lastExtractionAt) {\n        return entry.turns.length >= this.config.bufferMaxTurns\n          ? \"extract_batch\"\n          : \"keep_buffering\";\n      }\n      const elapsed =\n        Date.now() - new Date(entry.lastExtractionAt).getTime();\n      return elapsed >= this.config.bufferMaxMinutes * 60_000\n        ? \"extract_batch\"\n        : \"keep_buffering\";\n    }\n\n    return \"keep_buffering\";\n  }\n\n  getTurns(bufferKey = \"default\"): BufferTurn[] {\n    const entry = this.peekEntry(bufferKey);\n    if (!entry) return [];\n    const retained = entry.retainedTurns ?? [];\n    // Retained turns (from a previous defer verdict, issue #562 PR 2) are\n    // prepended so the chronological order — oldest context first — is\n    // preserved for the next extraction pass.\n    return [...retained, ...entry.turns];\n  }\n\n  /**\n   * Retain a subset of the current turns across `clearAfterExtraction` so a\n   * future extraction pass sees the context behind a deferred candidate\n   * (issue #562, PR 2). Callers pass the turns that were seen during the\n   * current extraction; the buffer keeps the tail (latest `max` turns) as\n   * the retention window. Passing an empty array or `max <= 0` clears the\n   * retention slot instead.\n   */\n  async retainDeferredTurns(\n    bufferKey: string,\n    turns: BufferTurn[],\n    max = 10,\n    originalTurns?: readonly BufferTurn[],\n  ): Promise<void> {\n    await this.enqueueMutation(async () => {\n      await this.loadUnlocked();\n      const entry = this.entryFor(bufferKey);\n      const retained = selectRetainedDeferredTurns(\n        entry.retainedTurns ?? [], turns, max, originalTurns,\n      );\n      if (retained.length > 0) entry.retainedTurns = retained;\n      else delete entry.retainedTurns;\n      this.persistence.markDirty(bufferKey);\n      await this.saveUnlocked();\n    });\n  }\n\n  /**\n   * Return the current retention window (issue #562, PR 2). Primarily for\n   * tests and diagnostics.\n   */\n  getRetainedDeferredTurns(bufferKey = \"default\"): BufferTurn[] {\n    const entry = this.peekEntry(bufferKey);\n    return entry?.retainedTurns ? [...entry.retainedTurns] : [];\n  }\n\n  /**\n   * Clear deferred retention copies for a force-flushed session. Normal\n   * extraction preserves these copies so a deferred candidate can be retried;\n   * an explicit force flush is the caller's request to drain that context.\n   */\n  async clearRetainedTurnsForSession(\n    sessionKey: string,\n    ownerPrincipal?: string,\n    options: RetainedTurnCleanupOptions = {},\n  ): Promise<void> {\n    if (typeof sessionKey !== \"string\" || sessionKey.length === 0) return;\n    const normalizedOwnerPrincipal =\n      typeof ownerPrincipal === \"string\" && ownerPrincipal.trim().length > 0\n        ? ownerPrincipal.trim()\n        : undefined;\n    const namespacesEnabled = resolveNamespaceCapabilities(this.config).namespaces === true;\n    const normalizedCleanupNamespace =\n      namespacesEnabled && options.writeNamespaceOverride !== undefined && options.writeNamespaceOverride.length > 0\n        ? options.writeNamespaceOverride\n        : undefined;\n    const assertLifecycle = (): void => {\n      throwIfAborted(options.abortSignal, \"extraction force-flush aborted\");\n      if (typeof options.deadlineMs === \"number\" && Date.now() >= options.deadlineMs) {\n        throw new ExtractionDeadlineError(\"retained_turn_cleanup\");\n      }\n    };\n    assertLifecycle();\n    await this.enqueueMutation(async () => {\n      assertLifecycle();\n      const hadPendingSave = this.pendingSave;\n      if (this.saveTimer) {\n        clearTimeout(this.saveTimer);\n        this.saveTimer = null;\n      }\n      await this.loadUnlocked();\n      assertLifecycle();\n      const bufferKeys = this.matchingSessionBufferKeysUnlocked(sessionKey);\n      if (bufferKeys.length === 0) {\n        if (hadPendingSave) {\n          assertLifecycle();\n          await this.saveNowRetainingPendingOnFailure(\"clearRetainedTurnsForSession\");\n        }\n        return;\n      }\n      let changed = false;\n      const matchesCleanupScope = (turn: BufferTurn): boolean => {\n        // Legacy unpinned turns keep their existing cleanup semantics.\n        if (\n          turn.writeNamespaceOverride !== undefined &&\n          normalizedCleanupNamespace !== undefined &&\n          turn.writeNamespaceOverride !== normalizedCleanupNamespace\n        ) {\n          return false;\n        }\n        // Equal write namespaces can still belong to different project bindings.\n        if (options.scopeProfileWritePlan && hasPinnedCaptureScope(turn)) {\n          if (\n            scopeProfilePlanIdentity(turn.scopeProfileWritePlan) !== scopeProfilePlanIdentity(options.scopeProfileWritePlan) &&\n            !(turn.acceptedCapture === true && turn.scopeProfileWritePlan === undefined)\n          ) {\n            return false;\n          }\n          const ctx = options.codingContext;\n          if (\n            ctx && turn.codingContext &&\n            (turn.codingContext.projectId !== ctx.projectId ||\n              turn.codingContext.rootPath !== ctx.rootPath ||\n              turn.codingContext.branch !== ctx.branch ||\n              turn.codingContext.defaultBranch !== ctx.defaultBranch)\n          ) {\n            return false;\n          }\n        }\n        return true;\n      };\n      const belongsToOwner = (turn: BufferTurn): boolean => {\n        if (turn.sessionKey !== sessionKey) return false;\n        if (!matchesCleanupScope(turn)) return false;\n        if (normalizedOwnerPrincipal === undefined) return true;\n        if (turn.sessionOwnerPrincipal === normalizedOwnerPrincipal) return true;\n        return (\n          turn.sessionOwnerPrincipal === undefined &&\n          resolvePrincipal(turn.sessionKey, this.config) === normalizedOwnerPrincipal\n        );\n      };\n      for (const bufferKey of bufferKeys) {\n        const entry = this.entryFor(bufferKey);\n        const retainedTurns = entry.retainedTurns ?? [];\n        const remainingTurns = retainedTurns.filter((turn) => !belongsToOwner(turn));\n        if (remainingTurns.length === retainedTurns.length) continue;\n        changed = true;\n        if (remainingTurns.length > 0) entry.retainedTurns = remainingTurns;\n        else delete entry.retainedTurns;\n        if (bufferKey === \"default\") this.state.turns = entry.turns;\n        this.persistence.markDirty(bufferKey);\n      }\n      if (changed || hadPendingSave) {\n        assertLifecycle();\n        await this.saveNowRetainingPendingOnFailure(\"clearRetainedTurnsForSession\");\n      }\n      assertLifecycle();\n    });\n  }\n\n  async findBufferKeyForSession(sessionKey: string): Promise<string | null> {\n    const bufferKeys = await this.findBufferKeysForSession(sessionKey);\n    return bufferKeys[0] ?? null;\n  }\n\n  private matchingSessionBufferKeysUnlocked(sessionKey: string): string[] {\n    const matches: string[] = [];\n    const hasSessionTurns = (entry: BufferEntryState | null | undefined): boolean =>\n      [...(entry?.turns ?? []), ...(entry?.retainedTurns ?? [])].some(\n        (turn) => typeof turn.sessionKey === \"string\" && turn.sessionKey === sessionKey,\n      );\n    const directEntry = this.peekEntry(sessionKey);\n    if (hasSessionTurns(directEntry)) {\n      matches.push(sessionKey);\n    }\n\n    const entries = this.state.entries ?? {};\n    for (const [bufferKey, entry] of Object.entries(entries)) {\n      if (!matches.includes(bufferKey) && hasSessionTurns(entry)) {\n        matches.push(bufferKey);\n      }\n    }\n\n    return matches;\n  }\n\n  async findBufferKeysForSession(sessionKey: string): Promise<string[]> {\n    if (typeof sessionKey !== \"string\" || sessionKey.length === 0) return [];\n    await this.mutationChain.catch(() => {});\n    await this.load();\n    return this.matchingSessionBufferKeysUnlocked(sessionKey);\n  }\n\n  async clearAfterExtraction(\n    bufferKey = \"default\",\n    extractedTurns?: readonly BufferTurn[],\n    options?: { allowNonPrefix?: boolean },\n  ): Promise<void> {\n    await this.enqueueMutation(async () => {\n      // Drop any armed debounce TIMER so it cannot fire mid-mutation and race\n      // our post-clear write, but KEEP the pending-save state (issue #1909\n      // review round 13): the post-clear save below can fail, and clearing the\n      // pending flag here would strand buffered turns — including turns from\n      // OTHER sessions that only ever entered the debounced pending state — with\n      // nothing left to retry them. saveNowRetainingPendingOnFailure clears the\n      // pending state only after a durable write, or re-arms it on failure.\n      if (this.saveTimer) {\n        clearTimeout(this.saveTimer);\n        this.saveTimer = null;\n      }\n      await this.loadUnlocked();\n      const entry = this.entryFor(bufferKey);\n      if (Array.isArray(extractedTurns)) {\n        const liveExtractedTurns = liveTurnsFromExtractionSnapshot(\n          entry,\n          extractedTurns,\n        );\n        let clearedLiveTurns = false;\n        if (liveExtractedTurns.length > 0) {\n          if (options?.allowNonPrefix === true) {\n            const remainingTurns = [...entry.turns];\n            for (const extractedTurn of liveExtractedTurns) {\n              const matchingIndex = remainingTurns.findIndex((liveTurn) =>\n                bufferTurnsEqual(liveTurn, extractedTurn),\n              );\n              if (matchingIndex >= 0) {\n                remainingTurns.splice(matchingIndex, 1);\n                clearedLiveTurns = true;\n              }\n            }\n            if (clearedLiveTurns) entry.turns = remainingTurns;\n          } else {\n            const matchedCount = matchingQueuedExtractionPrefixLength(\n              entry.turns,\n              liveExtractedTurns,\n            );\n            if (matchedCount > 0) {\n              entry.turns = entry.turns.slice(matchedCount);\n              clearedLiveTurns = true;\n            }\n          }\n          if (!clearedLiveTurns) {\n            log.debug(\n              `buffer[${bufferKey}]: extraction clear skipped because live turns changed before clear`,\n            );\n          }\n        }\n        if (!clearedLiveTurns) {\n          await this.saveNowRetainingPendingOnFailure(\"clearAfterExtraction\");\n          return;\n        }\n      } else {\n        entry.turns = [];\n      }\n      entry.lastExtractionAt = new Date().toISOString();\n      entry.extractionCount += 1;\n      if (bufferKey === \"default\") {\n        this.state.turns = entry.turns;\n        this.state.lastExtractionAt = entry.lastExtractionAt;\n        this.state.extractionCount = entry.extractionCount;\n      }\n      this.persistence.markDirty(bufferKey);\n      this.pruneEntries([bufferKey]);\n      await this.saveNowRetainingPendingOnFailure(\"clearAfterExtraction\");\n    });\n  }\n\n  /**\n   * Remove an extraction-window chunk from the buffer WITHOUT recording an\n   * extraction (trigger-drain drop path). Used when a chunk fails extraction\n   * repeatedly and must be dropped so the session can drain; the caller is\n   * responsible for the side-file copy and logging. Returns the number of\n   * live turns dropped; 0 when the turns no longer match. `allowNonPrefix`\n   * matches by identity, like `clearAfterExtraction`, for callers (native\n   * groups) whose chunk can sit behind a pinned capture.\n   */\n  async dropExtractionChunk(\n    bufferKey = \"default\",\n    turns: readonly BufferTurn[],\n    options?: { allowNonPrefix?: boolean },\n  ): Promise<number> {\n    return await this.enqueueMutation(async () => {\n      await this.loadUnlocked();\n      const entry = this.entryFor(bufferKey);\n      // A window's head can be deferred-retained turns (retainDeferredTurns): take those out of the chunk first.\n      const retained = [...(entry.retainedTurns ?? [])];\n      const liveTurns: BufferTurn[] = [];\n      for (const turn of turns) {\n        const at = retained.findIndex((kept) => bufferTurnsEqual(kept, turn));\n        if (at >= 0) retained.splice(at, 1);\n        else liveTurns.push(turn);\n      }\n      const retainedDropped = (entry.retainedTurns?.length ?? 0) - retained.length;\n      let remaining = entry.turns;\n      if (options?.allowNonPrefix === true) {\n        remaining = [...entry.turns];\n        for (const turn of liveTurns) {\n          const at = remaining.findIndex((live) => bufferTurnsEqual(live, turn));\n          if (at >= 0) remaining.splice(at, 1);\n        }\n      } else {\n        remaining = entry.turns.slice(matchingQueuedExtractionPrefixLength(entry.turns, liveTurns));\n      }\n      const matchedCount = entry.turns.length - remaining.length + retainedDropped;\n      if (matchedCount === 0) return 0;\n      if (this.saveTimer) {\n        clearTimeout(this.saveTimer);\n        this.saveTimer = null;\n      }\n      entry.turns = remaining;\n      if (retainedDropped > 0) {\n        if (retained.length > 0) entry.retainedTurns = retained;\n        else delete entry.retainedTurns;\n      }\n      if (bufferKey === \"default\") {\n        this.state.turns = entry.turns;\n      }\n      this.persistence.markDirty(bufferKey);\n      this.pruneEntries([bufferKey]);\n      await this.saveNowRetainingPendingOnFailure(\"dropExtractionChunk\");\n      return matchedCount;\n    });\n  }\n\n  getExtractionCount(bufferKey = \"default\"): number {\n    return this.peekEntry(bufferKey)?.extractionCount ?? 0;\n  }\n\n  /**\n   * Await any pending `BUFFER_SURPRISE` telemetry writes.\n   *\n   * The telemetry path is fire-and-forget from the hot path's point of\n   * view, but tests and before-exit hooks sometimes need to make sure\n   * the ledger has been flushed before they assert on its contents or\n   * close the process. This method resolves once the current chain\n   * head has settled; new writes scheduled after this call return a\n   * separate, later settlement.\n   *\n   * Never throws — the chain already catches its own rejections.\n   */\n  async flushSurpriseTelemetry(): Promise<void> {\n    await this.surpriseTelemetryWriteChain;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmDA,IAAM,yBAAyB;AAC/B,IAAM,iBAAiB,CAAC,MACtB,EAAE,oBAAoB,QAAQ,EAAE,2BAA2B;AAU7D,IAAM,mCAAmC;AASzC,IAAM,qBAAqB;AAWpB,IAAM,cAAN,MAAkB;AAAA,EAuCvB,YACmB,QACA,SACjB,gBAA4C,MAC5C;AAHiB;AACA;AAGjB,SAAK,QAAQ,EAAE,OAAO,CAAC,GAAG,kBAAkB,MAAM,iBAAiB,EAAE;AACrE,SAAK,gBAAgB;AAAA,EACvB;AAAA,EANmB;AAAA,EACA;AAAA,EAxCX;AAAA,EACA,SAAS;AAAA,EACT,cAAoC;AAAA,EAC3B;AAAA,EACT,gBAAkC,QAAQ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAelD,8BAAgD,QAAQ,QAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAShE,YAAmC;AAAA,EACnC,cAAc;AAAA;AAAA;AAAA;AAAA,EAId,mBAAkC;AAAA;AAAA,EAGzB,cAAc,IAAI,yBAAyB;AAAA,EAWpD,gBAAmB,IAAkC;AAC3D,UAAM,MAAM,KAAK,cAAc,MAAM,MAAM;AAAA,IAAC,CAAC,EAAE,KAAK,EAAE;AACtD,SAAK,gBAAgB,IAAI,MAAM,MAAM;AAAA,IAAC,CAAC;AACvC,WAAO;AAAA,EACT;AAAA,EAEQ,SAAS,KAA+B;AAC9C,QAAI,CAAC,KAAK,MAAM,SAAS;AACvB,WAAK,MAAM,UAAU,uBAAO,OAAO,IAAI;AAAA,IACzC;AACA,UAAM,UAAU,KAAK,MAAM;AAC3B,QAAI,OAAO,OAAO,SAAS,GAAG,GAAG;AAC/B,YAAM,SAAS,QAAQ,GAAG;AAG1B,UAAI,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,OAAO,KAAK,GAAG;AACvE,eAAO;AAAA,MACT;AAAA,IAEF;AACA,UAAM,UAA4B;AAAA,MAChC,OAAO,CAAC;AAAA,MACR,kBAAkB;AAAA,MAClB,iBAAiB;AAAA,IACnB;AACA,YAAQ,GAAG,IAAI;AACf,WAAO;AAAA,EACT;AAAA,EAEQ,UAAU,KAAsC;AACtD,UAAM,WAAW,KAAK,MAAM,UAAU,GAAG;AACzC,QAAI,SAAU,QAAO;AACrB,QAAI,QAAQ,UAAW,QAAO;AAC9B,WAAO;AAAA,MACL,OAAO,MAAM,QAAQ,KAAK,MAAM,KAAK,IAAI,KAAK,MAAM,QAAQ,CAAC;AAAA,MAC7D,kBAAkB,KAAK,MAAM,oBAAoB;AAAA,MACjD,iBACE,OAAO,KAAK,MAAM,oBAAoB,WAAW,KAAK,MAAM,kBAAkB;AAAA,IAClF;AAAA,EACF;AAAA,EAEQ,eAAe,OAAiC;AACtD,UAAM,UAAU,OAAO;AAAA,MACrB,uBAAO,OAAO,IAAI;AAAA,MAClB,MAAM,WAAW,CAAC;AAAA,IACpB;AACA,QAAI,CAAC,QAAQ,SAAS;AACpB,cAAQ,UAAU;AAAA,QAChB,OAAO,MAAM,QAAQ,MAAM,KAAK,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI,CAAC;AAAA,QACxD,kBAAkB,MAAM,oBAAoB;AAAA,QAC5C,iBACE,OAAO,MAAM,oBAAoB,WAAW,MAAM,kBAAkB;AAAA,MACxE;AAAA,IACF;AACA,WAAO;AAAA,MACL,OAAO,QAAQ,QAAQ;AAAA,MACvB,kBAAkB,QAAQ,QAAQ;AAAA,MAClC,iBAAiB,QAAQ,QAAQ;AAAA,MACjC;AAAA,IACF;AAAA,EACF;AAAA,EAEQ,gBAAgB,OAAiC;AACvD,UAAM,aAAa,MAAM,MAAM,OAAO,CAAC,QAAQ,SAAS;AACtD,YAAM,SAAS,KAAK,MAAM,KAAK,SAAS;AACxC,aAAO,OAAO,SAAS,MAAM,IAAI,KAAK,IAAI,QAAQ,MAAM,IAAI;AAAA,IAC9D,GAAG,EAAE;AACL,UAAM,mBACJ,OAAO,MAAM,qBAAqB,WAC9B,KAAK,MAAM,MAAM,gBAAgB,IACjC,OAAO;AACb,WAAO,KAAK;AAAA,MACV;AAAA,MACA,OAAO,SAAS,gBAAgB,IAAI,mBAAmB;AAAA,IACzD;AAAA,EACF;AAAA;AAAA,EAGQ,aAAa,YAA4B;AAC/C,UAAM,UAAU,KAAK,MAAM;AAC3B,QAAI,CAAC,QAAS;AACd,UAAM,UAAU,wBAAwB,SAAS,YAAY,wBAAwB;AAAA,MACnF,YAAY,CAAC,UAAU,KAAK,gBAAgB,KAAK;AAAA,MACjD,sBAAsB,CAAC,UAAU,KAAK,0BAA0B,KAAK;AAAA,IACvE,CAAC;AACD,eAAW,OAAO,QAAS,QAAO,QAAQ,GAAG;AAC7C,SAAK,YAAY,YAAY,OAAO;AACpC,QAAI,QAAQ,SAAS,GAAG;AAItB,UAAI;AAAA,QACF,kBAAkB,QAAQ,MAAM,uBAAuB,QAAQ,WAAW,IAAI,MAAM,KAAK,gCACxD,sBAAsB;AAAA,MACzD;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,eAA8B;AAC1C,QAAI,KAAK,OAAQ;AACjB,QAAI,CAAC,KAAK,aAAa;AACrB,WAAK,cAAc,KAAK,QAAQ,WAAW,EACxC,KAAK,CAAC,UAAU;AACf,aAAK,QAAQ,KAAK,eAAe,KAAK;AACtC,aAAK,SAAS;AAAA,MAChB,CAAC,EACA,QAAQ,MAAM;AACb,aAAK,cAAc;AAAA,MACrB,CAAC;AAAA,IACL;AACA,UAAM,KAAK;AAAA,EACb;AAAA,EAEA,MAAM,OAAsB;AAC1B,UAAM,KAAK,gBAAgB,YAAY,KAAK,aAAa,CAAC;AAAA,EAC5D;AAAA;AAAA;AAAA,EAIA,MAAM,oBAAuD;AAC3D,UAAM,KAAK,KAAK;AAChB,QAAI,uBAAuB;AAC3B,QAAI,mBAAmB;AACvB,QAAI,WAAW,OAAO;AACtB,QAAI,sBAAqC;AACzC,UAAM,WAAW,CAAC,UAA0C;AAC1D,UAAI,CAAC,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,EAAG;AACjD,8BAAwB;AACxB,0BAAoB,MAAM;AAC1B,YAAM,QAAQ,MAAM,CAAC,GAAG;AACxB,YAAM,SAAS,OAAO,UAAU,WAAW,KAAK,MAAM,KAAK,IAAI,OAAO;AACtE,UAAI,OAAO,SAAS,MAAM,KAAK,SAAS,UAAU;AAChD,mBAAW;AACX,8BAAsB,SAAS;AAAA,MACjC;AAAA,IACF;AACA,UAAM,UAAU,KAAK,MAAM;AAC3B,QAAI,SAAS;AAEX,iBAAW,SAAS,OAAO,OAAO,OAAO,EAAG,UAAS,CAAC,GAAI,OAAO,iBAAiB,CAAC,GAAI,GAAI,OAAO,SAAS,CAAC,CAAE,CAAC;AAAA,IACjH,OAAO;AACL,eAAS,KAAK,MAAM,KAAK;AAAA,IAC3B;AACA,WAAO,EAAE,sBAAsB,kBAAkB,oBAAoB;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAqB;AACnB,eAAW,OAAO,OAAO,KAAK,KAAK,MAAM,WAAW,CAAC,CAAC,GAAG;AACvD,WAAK,YAAY,YAAY,GAAG;AAAA,IAClC;AACA,SAAK,QAAQ,EAAE,OAAO,CAAC,GAAG,kBAAkB,MAAM,iBAAiB,EAAE;AACrE,SAAK,SAAS;AAAA,EAChB;AAAA,EAEA,MAAc,eAA8B;AAC1C,UAAM,EAAE,YAAY,aAAa,IAAI,MAAM,KAAK,YAAY,QAAQ,KAAK,SAAS,KAAK,OAAO,CAAC,QAAQ,KAAK,UAAU,GAAG,KAAK,MAAS;AAGvI,eAAW,CAAC,KAAK,OAAO,KAAK,cAAc;AACzC,YAAM,QAAQ,KAAK,UAAU,GAAG;AAChC,UAAI,CAAC,MAAO;AACZ,YAAM,QAAQ,oBAAoB,MAAM,OAAO,OAAO;AACtD,UAAI,MAAM,iBAAiB,MAAM,cAAc,SAAS,GAAG;AACzD,cAAM,gBAAgB,oBAAoB,MAAM,eAAe,OAAO;AACtE,YAAI,MAAM,cAAc,WAAW,EAAG,QAAO,MAAM;AAAA,MACrD;AACA,UAAI,QAAQ,UAAW,MAAK,MAAM,QAAQ,MAAM;AAAA,IAClD;AACA,QAAI,WAAW,WAAW,EAAG;AAK7B,UAAM,UAAU,KAAK,MAAM;AAC3B,QAAI,CAAC,QAAS;AACd,eAAW,OAAO,YAAY;AAC5B,aAAO,QAAQ,GAAG;AAClB,UAAI,QAAQ,WAAW;AACrB,aAAK,MAAM,QAAQ,CAAC;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AAAA;AAAA,EAGA,iBAAiB,KAAsB;AACrC,WAAO,KAAK,QAAQ,yBAAyB,GAAG,MAAM;AAAA,EACxD;AAAA,EAEA,MAAM,OAAsB;AAC1B,UAAM,KAAK,gBAAgB,YAAY,KAAK,aAAa,CAAC;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,MAAc,eAA8B;AAC1C,UAAM,KAAK,KAAK,IAAI,KAAK,OAAO,sBAAsB,kBAAkB;AACxE,UAAM,MAAM,KAAK,IAAI;AACrB,SAAK,cAAc;AACnB,QAAI,KAAK,qBAAqB,KAAM,MAAK,mBAAmB;AAC5D,QAAI,MAAM,KAAK,oBAAoB,KAAK,kCAAkC;AAKxE,mBAAa,KAAK,aAAa,MAAS;AACxC,WAAK,YAAY;AACjB,UAAI;AACF,cAAM,KAAK,aAAa;AACxB,aAAK,cAAc;AACnB,aAAK,mBAAmB;AAAA,MAC1B,SAAS,KAAK;AACZ,YAAI,KAAK,uEAAuE,cAAc,GAAG,CAAC,EAAE;AACpG,aAAK,YAAY,WAAW,MAAM;AAChC,eAAK,YAAY;AACjB,eAAK,KAAK,iBAAiB;AAAA,QAC7B,GAAG,EAAE;AACL,aAAK,UAAU,QAAQ;AAAA,MACzB;AACA;AAAA,IACF;AAEA,iBAAa,KAAK,aAAa,MAAS;AACxC,SAAK,YAAY,WAAW,MAAM;AAChC,WAAK,YAAY;AACjB,WAAK,KAAK,iBAAiB;AAAA,IAC7B,GAAG,EAAE;AACL,SAAK,UAAU,QAAQ;AAAA,EACzB;AAAA;AAAA,EAGQ,sBAA4B;AAClC,QAAI,KAAK,WAAW;AAClB,mBAAa,KAAK,SAAS;AAC3B,WAAK,YAAY;AAAA,IACnB;AACA,SAAK,cAAc;AACnB,SAAK,mBAAmB;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAc,iCAAiC,SAAgC;AAC7E,SAAK,cAAc;AACnB,QAAI,KAAK,qBAAqB,KAAM,MAAK,mBAAmB,KAAK,IAAI;AACrE,QAAI;AACF,YAAM,KAAK,aAAa;AAAA,IAC1B,SAAS,KAAK;AACZ,UAAI;AAAA,QACF,UAAU,OAAO,uDAAuD,cAAc,GAAG,CAAC;AAAA,MAC5F;AACA,YAAM,KAAK,KAAK,IAAI,KAAK,OAAO,sBAAsB,kBAAkB;AACxE,UAAI,KAAK,KAAK,CAAC,KAAK,WAAW;AAC7B,aAAK,YAAY,WAAW,MAAM;AAChC,eAAK,YAAY;AACjB,eAAK,KAAK,iBAAiB;AAAA,QAC7B,GAAG,EAAE;AACL,aAAK,UAAU,QAAQ;AAAA,MACzB;AACA,YAAM;AAAA,IACR;AACA,SAAK,oBAAoB;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,MAAM,iBAAiB,MAAoD;AACzE,QAAI,KAAK,WAAW;AAClB,mBAAa,KAAK,SAAS;AAC3B,WAAK,YAAY;AAAA,IACnB;AAGA,QAAI,CAAC,KAAK,eAAe,CAAC,KAAK,YAAY,WAAW,EAAG;AACzD,QAAI;AACF,YAAM,KAAK,gBAAgB,YAAY;AAKrC,YAAI,CAAC,KAAK,eAAe,CAAC,KAAK,YAAY,WAAW,EAAG;AACzD,cAAM,KAAK,aAAa;AASxB,aAAK,cAAc;AACnB,aAAK,mBAAmB;AAAA,MAC1B,CAAC;AAAA,IACH,SAAS,KAAK;AAMZ,UAAI,KAAK,uEAAuE,cAAc,GAAG,CAAC,EAAE;AACpG,YAAM,KAAK,KAAK,IAAI,KAAK,OAAO,sBAAsB,kBAAkB;AACxE,UAAI,KAAK,KAAK,CAAC,KAAK,WAAW;AAC7B,aAAK,YAAY,WAAW,MAAM;AAChC,eAAK,YAAY;AACjB,eAAK,KAAK,iBAAiB;AAAA,QAC7B,GAAG,EAAE;AACL,aAAK,UAAU,QAAQ;AAAA,MACzB;AAGA,UAAI,MAAM,eAAgB,OAAM;AAChC;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAM,QAAQ,WAAmB,MAA4C;AAC3E,YAAQ,MAAM,KAAK,mBAAmB,WAAW,IAAI,GAAG;AAAA,EAC1D;AAAA;AAAA,EAGA,MAAM,eAAe,WAAmB,MAAkD;AACxF,UAAM,WAAW,MAAM,KAAK,gBAAgB,YAAY;AACtD,YAAM,KAAK,aAAa;AACxB,UAAI,KAAK,UAAU,SAAS,MAAM,MAAM;AACtC,aAAK,yBAAyB;AAC9B,YAAI,OAAO,KAAK,KAAK,MAAM,WAAW,CAAC,CAAC,EAAE,UAAU,wBAAwB;AAC1E,cAAI;AAAA,YACF,UAAU,SAAS,wDAAwD,sBAAsB;AAAA,UACnG;AACA,iBAAO;AAAA,QACT;AAAA,MACF;AACA,aAAO,KAAK,mBAAmB,WAAW,IAAI;AAAA,IAChD,CAAC;AACD,QAAI,aAAa,KAAM,QAAO;AAC9B,WAAO,KAAK,uBAAuB,WAAW,MAAM,QAAQ;AAAA,EAC9D;AAAA;AAAA,EAGQ,2BAAiC;AACvC,UAAM,UAAU,KAAK,MAAM;AAC3B,QAAI,CAAC,QAAS;AACd,UAAM,OAAO,OAAO,KAAK,OAAO;AAChC,QAAI,KAAK,SAAS,uBAAwB;AAC1C,UAAM,mBAAmB,CAAC,MAAc,UACtC,KAAK,gBAAgB,QAAQ,IAAI,KAAK,EAAE,OAAO,CAAC,GAAG,kBAAkB,MAAM,iBAAiB,EAAE,CAAC,IAC/F,KAAK,gBAAgB,QAAQ,KAAK,KAAK,EAAE,OAAO,CAAC,GAAG,kBAAkB,MAAM,iBAAiB,EAAE,CAAC;AAClG,UAAM,iBAAiB,KACpB;AAAA,MACC,CAAC,QACC,QAAQ,cACP,QAAQ,GAAG,GAAG,MAAM,UAAU,OAAO,MACrC,QAAQ,GAAG,GAAG,eAAe,UAAU,OAAO;AAAA,IACnD,EACC,KAAK,gBAAgB;AACxB,eAAW,OAAO,gBAAgB;AAChC,UAAI,OAAO,KAAK,OAAO,EAAE,SAAS,uBAAwB;AAC1D,aAAO,QAAQ,GAAG;AAClB,WAAK,YAAY,YAAY,GAAG;AAAA,IAClC;AAAA,EACF;AAAA,EAEQ,0BAA0B,OAA8C;AAC9E,YAAQ,OAAO,SAAS,CAAC,GAAG,KAAK,cAAc,MAAM,OAAO,iBAAiB,CAAC,GAAG,KAAK,cAAc;AAAA,EACtG;AAAA,EAEA,MAAM,mBACJ,WACA,MACyB;AACzB,UAAM,WAAW,MAAM,KAAK,gBAAgB,MAAM,KAAK,mBAAmB,WAAW,IAAI,CAAC;AAC1F,WAAO,KAAK,uBAAuB,WAAW,MAAM,QAAQ;AAAA,EAC9D;AAAA;AAAA,EAGA,MAAc,uBACZ,WACA,MACA,UACyB;AACzB,QAAI,WAAW,SAAS;AACxB,QAAI;AAQJ,QACE,aAAa,oBACb,gCAAgC,KAAK,MAAM,EAAE,yBAC7C,KAAK,kBAAkB;AAAA;AAAA;AAAA,IAIvB,KAAK,OAAO,gBAAgB,WAC5B,SAAS,gBAAgB,QACzB;AACA,YAAM,WAAW,MAAM,KAAK,oBAAoB,WAAW,MAAM,SAAS,UAAU;AACpF,UAAI,aAAa,MAAM;AACrB,cAAM,gBAAgB,WAAW,KAAK,OAAO;AAC7C,YAAI,YAAY;AAChB,YAAI,eAAe;AACjB,gBAAM,eAAe,MAAM,KAAK;AAAA,YAC9B;AAAA,YACA,SAAS;AAAA,YACT,SAAS;AAAA,UACX;AACA,cAAI,cAAc;AAChB,gBAAI;AAAA,cACF,UAAU,SAAS,eAAe,SAAS,QAAQ,CAAC,CAAC,gBAAgB,KAAK,OAAO,uBAAuB;AAAA,YAC1G;AACA,uBAAW;AACX,wBAAY;AACZ,8BAAkB;AAUlB,kBAAM,KAAK,iBAAiB,EAAE,gBAAgB,KAAK,CAAC;AAAA,UACtD,OAAO;AACL,gBAAI;AAAA,cACF,UAAU,SAAS,eAAe,SAAS,QAAQ,CAAC,CAAC;AAAA,YACvD;AAAA,UACF;AAAA,QACF;AAgBA,aAAK,4BAA4B;AAAA,UAC/B;AAAA,UACA,UAAU,KAAK;AAAA,UACf,YACE,OAAO,KAAK,eAAe,WAAW,KAAK,aAAa;AAAA,UAC1D,eAAe;AAAA,UACf;AAAA,UACA,mBAAmB,SAAS;AAAA;AAAA;AAAA;AAAA,UAI5B,YAAW,oBAAI,KAAK,GAAE,YAAY;AAAA;AAAA;AAAA;AAAA,UAIlC,WAAW,KAAK,OAAO;AAAA,QACzB,CAAC;AAAA,MACH;AAAA,IACF;AAEA,QAAI;AAAA,MACF,UAAU,SAAS,MAAM,SAAS,iBAAiB,kBAAkB,SAAS,WAAW,cAAc,QAAQ;AAAA,IACjH;AACA,QAAI,aAAa,oBAAoB,oBAAoB,QAAW;AAClE,wBAAkB;AAAA,QAChB,GAAG,SAAS;AAAA,QACZ,GAAG,SAAS;AAAA,MACd;AAAA,IACF;AACA,WAAO,kBAAkB,EAAE,UAAU,gBAAgB,IAAI,EAAE,SAAS;AAAA,EACtE;AAAA,EAEA,MAAc,mBAAmB,WAAmB,MAAkD;AACpG,UAAM,KAAK,aAAa;AACxB,UAAM,QAAQ,KAAK,SAAS,SAAS;AACrC,UAAM,aAAa,MAAM,MAAM,MAAM;AACrC,UAAM,MAAM,KAAK,IAAI;AACrB,UAAM,sBAAsB,MAAM,MAAM,IAAI,cAAc;AAC1D,UAAM,yBAAyB,MAAM,iBAAiB,CAAC,GAAG,IAAI,cAAc;AAC5E,QAAI,cAAc,WAAW;AAC3B,WAAK,MAAM,QAAQ,MAAM;AAAA,IAC3B;AAEA,UAAM,SAAS,YAAY,KAAK,SAAS,KAAK,OAAO,kBAAkB;AACvE,UAAM,WAAW,KAAK,SAAS,OAAO,OAAO,KAAK;AAClD,UAAM,oBAAoB,MAAM,MAAM;AAEtC,SAAK,YAAY,UAAU,SAAS;AACpC,SAAK,aAAa,CAAC,SAAS,CAAC;AAC7B,QAAI,aAAa,oBAAoB,KAAK,OAAO,uBAAuB,GAAG;AAGzE,YAAM,KAAK,aAAa;AAAA,IAC1B,OAAO;AAQL,YAAM,KAAK,iCAAiC,YAAY;AAAA,IAC1D;AACA,WAAO;AAAA,MACL;AAAA,MACA,aAAa,OAAO;AAAA,MACpB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AAAA,EACF;AAAA,EAEA,MAAc,+CACZ,WACA,qBACA,uBAC8B;AAC9B,WAAO,KAAK,gBAAgB,YAAY;AACtC,YAAM,KAAK,aAAa;AACxB,YAAM,QAAQ,KAAK,UAAU,SAAS;AACtC,UAAI,CAAC,MAAO,QAAO;AACnB,YAAM,WAAW,MAAM,iBAAiB,CAAC;AACzC,YAAM,eACJ,kCAAkC,MAAM,OAAO,mBAAmB,KAClE,sBAAsB,UAAU,qBAAqB;AACvD,UAAI,CAAC,aAAc,QAAO;AAC1B,aAAO,CAAC,GAAG,UAAU,GAAG,MAAM,KAAK;AAAA,IACrC,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBQ,4BAA4B,QAA2C;AAC7E,SAAK,8BAA8B,KAAK,4BACrC,KAAK,MAAM,KAAK,sBAAsB,MAAM,CAAC,EAC7C,MAAM,MAAM;AAAA,IAIb,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAc,sBACZ,QACe;AACf,UAAM,UAAU,KAAK;AACrB,QAAI,OAAO,QAAQ,+BAA+B,YAAY;AAG5D;AAAA,IACF;AACA,UAAM,QAA6B;AAAA,MACjC,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA,MAKP,WAAW,OAAO;AAAA,MAClB,WAAW,OAAO;AAAA,MAClB,YAAY,OAAO;AAAA,MACnB,UAAU,OAAO;AAAA,MACjB,eAAe,OAAO;AAAA;AAAA;AAAA;AAAA,MAItB,WAAW,OAAO;AAAA,MAClB,gBAAgB,OAAO;AAAA,MACvB,mBAAmB,OAAO;AAAA,IAC5B;AACA,QAAI;AACF,YAAM,QAAQ,2BAA2B,CAAC,KAAK,CAAC;AAAA,IAClD,SAAS,KAAK;AAIZ,UAAI;AAAA,QACF,UAAU,OAAO,SAAS,mDAAmD,cAAc,GAAG,CAAC;AAAA,MACjG;AAAA,IACF;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,MAAc,oBACZ,WACA,MACA,YACwB;AACxB,QAAI,CAAC,KAAK,cAAe,QAAO;AAChC,QAAI;AAQF,YAAM,QAAQ,MAAM;AAAA,QAClB,KAAK,cAAc,UAAU,WAAW,MAAM,UAAU;AAAA,QACxD,KAAK,OAAO;AAAA,MACd;AACA,UAAI,UAAU,KAAM,QAAO;AAC3B,UAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GAAG;AACxD,YAAI;AAAA,UACF,UAAU,SAAS,gDAAgD,OAAO,KAAK,CAAC;AAAA,QAClF;AACA,eAAO;AAAA,MACT;AAIA,UAAI,QAAQ,EAAG,QAAO;AACtB,UAAI,QAAQ,EAAG,QAAO;AACtB,aAAO;AAAA,IACT,SAAS,KAAK;AAKZ,UAAI;AAAA,QACF,UAAU,SAAS,gEAAgE,cAAc,GAAG,CAAC;AAAA,MACvG;AACA,aAAO;AAAA,IACT;AAAA,EACF;AAAA,EAEQ,SAAS,OAAyB,aAA2C;AACnF,QAAI,KAAK,OAAO,gBAAgB,SAAS;AACvC,UAAI,gBAAgB,OAAQ,QAAO;AAEnC,UAAI,MAAM,MAAM,UAAU,KAAK,OAAO,gBAAgB;AACpD,eAAO;AAAA,MACT;AAEA,UAAI,MAAM,kBAAkB;AAC1B,cAAM,UACJ,KAAK,IAAI,IAAI,IAAI,KAAK,MAAM,gBAAgB,EAAE,QAAQ;AACxD,YAAI,WAAW,KAAK,OAAO,mBAAmB,KAAQ;AACpD,iBAAO;AAAA,QACT;AAAA,MACF;AAEA,aAAO;AAAA,IACT;AAEA,QAAI,KAAK,OAAO,gBAAgB,WAAW;AACzC,aAAO,MAAM,MAAM,UAAU,KAAK,OAAO,iBACrC,kBACA;AAAA,IACN;AAEA,QAAI,KAAK,OAAO,gBAAgB,cAAc;AAC5C,UAAI,CAAC,MAAM,kBAAkB;AAC3B,eAAO,MAAM,MAAM,UAAU,KAAK,OAAO,iBACrC,kBACA;AAAA,MACN;AACA,YAAM,UACJ,KAAK,IAAI,IAAI,IAAI,KAAK,MAAM,gBAAgB,EAAE,QAAQ;AACxD,aAAO,WAAW,KAAK,OAAO,mBAAmB,MAC7C,kBACA;AAAA,IACN;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,SAAS,YAAY,WAAyB;AAC5C,UAAM,QAAQ,KAAK,UAAU,SAAS;AACtC,QAAI,CAAC,MAAO,QAAO,CAAC;AACpB,UAAM,WAAW,MAAM,iBAAiB,CAAC;AAIzC,WAAO,CAAC,GAAG,UAAU,GAAG,MAAM,KAAK;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,MAAM,oBACJ,WACA,OACA,MAAM,IACN,eACe;AACf,UAAM,KAAK,gBAAgB,YAAY;AACrC,YAAM,KAAK,aAAa;AACxB,YAAM,QAAQ,KAAK,SAAS,SAAS;AACrC,YAAM,WAAW;AAAA,QACf,MAAM,iBAAiB,CAAC;AAAA,QAAG;AAAA,QAAO;AAAA,QAAK;AAAA,MACzC;AACA,UAAI,SAAS,SAAS,EAAG,OAAM,gBAAgB;AAAA,UAC1C,QAAO,MAAM;AAClB,WAAK,YAAY,UAAU,SAAS;AACpC,YAAM,KAAK,aAAa;AAAA,IAC1B,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,yBAAyB,YAAY,WAAyB;AAC5D,UAAM,QAAQ,KAAK,UAAU,SAAS;AACtC,WAAO,OAAO,gBAAgB,CAAC,GAAG,MAAM,aAAa,IAAI,CAAC;AAAA,EAC5D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,MAAM,6BACJ,YACA,gBACA,UAAsC,CAAC,GACxB;AACf,QAAI,OAAO,eAAe,YAAY,WAAW,WAAW,EAAG;AAC/D,UAAM,2BACJ,OAAO,mBAAmB,YAAY,eAAe,KAAK,EAAE,SAAS,IACjE,eAAe,KAAK,IACpB;AACN,UAAM,oBAAoB,6BAA6B,KAAK,MAAM,EAAE,eAAe;AACnF,UAAM,6BACJ,qBAAqB,QAAQ,2BAA2B,UAAa,QAAQ,uBAAuB,SAAS,IACzG,QAAQ,yBACR;AACN,UAAM,kBAAkB,MAAY;AAClC,qBAAe,QAAQ,aAAa,gCAAgC;AACpE,UAAI,OAAO,QAAQ,eAAe,YAAY,KAAK,IAAI,KAAK,QAAQ,YAAY;AAC9E,cAAM,IAAI,wBAAwB,uBAAuB;AAAA,MAC3D;AAAA,IACF;AACA,oBAAgB;AAChB,UAAM,KAAK,gBAAgB,YAAY;AACrC,sBAAgB;AAChB,YAAM,iBAAiB,KAAK;AAC5B,UAAI,KAAK,WAAW;AAClB,qBAAa,KAAK,SAAS;AAC3B,aAAK,YAAY;AAAA,MACnB;AACA,YAAM,KAAK,aAAa;AACxB,sBAAgB;AAChB,YAAM,aAAa,KAAK,kCAAkC,UAAU;AACpE,UAAI,WAAW,WAAW,GAAG;AAC3B,YAAI,gBAAgB;AAClB,0BAAgB;AAChB,gBAAM,KAAK,iCAAiC,8BAA8B;AAAA,QAC5E;AACA;AAAA,MACF;AACA,UAAI,UAAU;AACd,YAAM,sBAAsB,CAAC,SAA8B;AAEzD,YACE,KAAK,2BAA2B,UAChC,+BAA+B,UAC/B,KAAK,2BAA2B,4BAChC;AACA,iBAAO;AAAA,QACT;AAEA,YAAI,QAAQ,yBAAyB,sBAAsB,IAAI,GAAG;AAChE,cACE,yBAAyB,KAAK,qBAAqB,MAAM,yBAAyB,QAAQ,qBAAqB,KAC/G,EAAE,KAAK,oBAAoB,QAAQ,KAAK,0BAA0B,SAClE;AACA,mBAAO;AAAA,UACT;AACA,gBAAM,MAAM,QAAQ;AACpB,cACE,OAAO,KAAK,kBACX,KAAK,cAAc,cAAc,IAAI,aACpC,KAAK,cAAc,aAAa,IAAI,YACpC,KAAK,cAAc,WAAW,IAAI,UAClC,KAAK,cAAc,kBAAkB,IAAI,gBAC3C;AACA,mBAAO;AAAA,UACT;AAAA,QACF;AACA,eAAO;AAAA,MACT;AACA,YAAM,iBAAiB,CAAC,SAA8B;AACpD,YAAI,KAAK,eAAe,WAAY,QAAO;AAC3C,YAAI,CAAC,oBAAoB,IAAI,EAAG,QAAO;AACvC,YAAI,6BAA6B,OAAW,QAAO;AACnD,YAAI,KAAK,0BAA0B,yBAA0B,QAAO;AACpE,eACE,KAAK,0BAA0B,UAC/B,iBAAiB,KAAK,YAAY,KAAK,MAAM,MAAM;AAAA,MAEvD;AACA,iBAAW,aAAa,YAAY;AAClC,cAAM,QAAQ,KAAK,SAAS,SAAS;AACrC,cAAM,gBAAgB,MAAM,iBAAiB,CAAC;AAC9C,cAAM,iBAAiB,cAAc,OAAO,CAAC,SAAS,CAAC,eAAe,IAAI,CAAC;AAC3E,YAAI,eAAe,WAAW,cAAc,OAAQ;AACpD,kBAAU;AACV,YAAI,eAAe,SAAS,EAAG,OAAM,gBAAgB;AAAA,YAChD,QAAO,MAAM;AAClB,YAAI,cAAc,UAAW,MAAK,MAAM,QAAQ,MAAM;AACtD,aAAK,YAAY,UAAU,SAAS;AAAA,MACtC;AACA,UAAI,WAAW,gBAAgB;AAC7B,wBAAgB;AAChB,cAAM,KAAK,iCAAiC,8BAA8B;AAAA,MAC5E;AACA,sBAAgB;AAAA,IAClB,CAAC;AAAA,EACH;AAAA,EAEA,MAAM,wBAAwB,YAA4C;AACxE,UAAM,aAAa,MAAM,KAAK,yBAAyB,UAAU;AACjE,WAAO,WAAW,CAAC,KAAK;AAAA,EAC1B;AAAA,EAEQ,kCAAkC,YAA8B;AACtE,UAAM,UAAoB,CAAC;AAC3B,UAAM,kBAAkB,CAAC,UACvB,CAAC,GAAI,OAAO,SAAS,CAAC,GAAI,GAAI,OAAO,iBAAiB,CAAC,CAAE,EAAE;AAAA,MACzD,CAAC,SAAS,OAAO,KAAK,eAAe,YAAY,KAAK,eAAe;AAAA,IACvE;AACF,UAAM,cAAc,KAAK,UAAU,UAAU;AAC7C,QAAI,gBAAgB,WAAW,GAAG;AAChC,cAAQ,KAAK,UAAU;AAAA,IACzB;AAEA,UAAM,UAAU,KAAK,MAAM,WAAW,CAAC;AACvC,eAAW,CAAC,WAAW,KAAK,KAAK,OAAO,QAAQ,OAAO,GAAG;AACxD,UAAI,CAAC,QAAQ,SAAS,SAAS,KAAK,gBAAgB,KAAK,GAAG;AAC1D,gBAAQ,KAAK,SAAS;AAAA,MACxB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA,EAEA,MAAM,yBAAyB,YAAuC;AACpE,QAAI,OAAO,eAAe,YAAY,WAAW,WAAW,EAAG,QAAO,CAAC;AACvE,UAAM,KAAK,cAAc,MAAM,MAAM;AAAA,IAAC,CAAC;AACvC,UAAM,KAAK,KAAK;AAChB,WAAO,KAAK,kCAAkC,UAAU;AAAA,EAC1D;AAAA,EAEA,MAAM,qBACJ,YAAY,WACZ,gBACA,SACe;AACf,UAAM,KAAK,gBAAgB,YAAY;AAQrC,UAAI,KAAK,WAAW;AAClB,qBAAa,KAAK,SAAS;AAC3B,aAAK,YAAY;AAAA,MACnB;AACA,YAAM,KAAK,aAAa;AACxB,YAAM,QAAQ,KAAK,SAAS,SAAS;AACrC,UAAI,MAAM,QAAQ,cAAc,GAAG;AACjC,cAAM,qBAAqB;AAAA,UACzB;AAAA,UACA;AAAA,QACF;AACA,YAAI,mBAAmB;AACvB,YAAI,mBAAmB,SAAS,GAAG;AACjC,cAAI,SAAS,mBAAmB,MAAM;AACpC,kBAAM,iBAAiB,CAAC,GAAG,MAAM,KAAK;AACtC,uBAAW,iBAAiB,oBAAoB;AAC9C,oBAAM,gBAAgB,eAAe;AAAA,gBAAU,CAAC,aAC9C,iBAAiB,UAAU,aAAa;AAAA,cAC1C;AACA,kBAAI,iBAAiB,GAAG;AACtB,+BAAe,OAAO,eAAe,CAAC;AACtC,mCAAmB;AAAA,cACrB;AAAA,YACF;AACA,gBAAI,iBAAkB,OAAM,QAAQ;AAAA,UACtC,OAAO;AACL,kBAAM,eAAe;AAAA,cACnB,MAAM;AAAA,cACN;AAAA,YACF;AACA,gBAAI,eAAe,GAAG;AACpB,oBAAM,QAAQ,MAAM,MAAM,MAAM,YAAY;AAC5C,iCAAmB;AAAA,YACrB;AAAA,UACF;AACA,cAAI,CAAC,kBAAkB;AACrB,gBAAI;AAAA,cACF,UAAU,SAAS;AAAA,YACrB;AAAA,UACF;AAAA,QACF;AACA,YAAI,CAAC,kBAAkB;AACrB,gBAAM,KAAK,iCAAiC,sBAAsB;AAClE;AAAA,QACF;AAAA,MACF,OAAO;AACL,cAAM,QAAQ,CAAC;AAAA,MACjB;AACA,YAAM,oBAAmB,oBAAI,KAAK,GAAE,YAAY;AAChD,YAAM,mBAAmB;AACzB,UAAI,cAAc,WAAW;AAC3B,aAAK,MAAM,QAAQ,MAAM;AACzB,aAAK,MAAM,mBAAmB,MAAM;AACpC,aAAK,MAAM,kBAAkB,MAAM;AAAA,MACrC;AACA,WAAK,YAAY,UAAU,SAAS;AACpC,WAAK,aAAa,CAAC,SAAS,CAAC;AAC7B,YAAM,KAAK,iCAAiC,sBAAsB;AAAA,IACpE,CAAC;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,MAAM,oBACJ,YAAY,WACZ,OACA,SACiB;AACjB,WAAO,MAAM,KAAK,gBAAgB,YAAY;AAC5C,YAAM,KAAK,aAAa;AACxB,YAAM,QAAQ,KAAK,SAAS,SAAS;AAErC,YAAM,WAAW,CAAC,GAAI,MAAM,iBAAiB,CAAC,CAAE;AAChD,YAAM,YAA0B,CAAC;AACjC,iBAAW,QAAQ,OAAO;AACxB,cAAM,KAAK,SAAS,UAAU,CAAC,SAAS,iBAAiB,MAAM,IAAI,CAAC;AACpE,YAAI,MAAM,EAAG,UAAS,OAAO,IAAI,CAAC;AAAA,YAC7B,WAAU,KAAK,IAAI;AAAA,MAC1B;AACA,YAAM,mBAAmB,MAAM,eAAe,UAAU,KAAK,SAAS;AACtE,UAAI,YAAY,MAAM;AACtB,UAAI,SAAS,mBAAmB,MAAM;AACpC,oBAAY,CAAC,GAAG,MAAM,KAAK;AAC3B,mBAAW,QAAQ,WAAW;AAC5B,gBAAM,KAAK,UAAU,UAAU,CAAC,SAAS,iBAAiB,MAAM,IAAI,CAAC;AACrE,cAAI,MAAM,EAAG,WAAU,OAAO,IAAI,CAAC;AAAA,QACrC;AAAA,MACF,OAAO;AACL,oBAAY,MAAM,MAAM,MAAM,qCAAqC,MAAM,OAAO,SAAS,CAAC;AAAA,MAC5F;AACA,YAAM,eAAe,MAAM,MAAM,SAAS,UAAU,SAAS;AAC7D,UAAI,iBAAiB,EAAG,QAAO;AAC/B,UAAI,KAAK,WAAW;AAClB,qBAAa,KAAK,SAAS;AAC3B,aAAK,YAAY;AAAA,MACnB;AACA,YAAM,QAAQ;AACd,UAAI,kBAAkB,GAAG;AACvB,YAAI,SAAS,SAAS,EAAG,OAAM,gBAAgB;AAAA,YAC1C,QAAO,MAAM;AAAA,MACpB;AACA,UAAI,cAAc,WAAW;AAC3B,aAAK,MAAM,QAAQ,MAAM;AAAA,MAC3B;AACA,WAAK,YAAY,UAAU,SAAS;AACpC,WAAK,aAAa,CAAC,SAAS,CAAC;AAC7B,YAAM,KAAK,iCAAiC,qBAAqB;AACjE,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA,EAEA,mBAAmB,YAAY,WAAmB;AAChD,WAAO,KAAK,UAAU,SAAS,GAAG,mBAAmB;AAAA,EACvD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,MAAM,yBAAwC;AAC5C,UAAM,KAAK;AAAA,EACb;AACF;","names":[]}

package/dist/{chunk-VCLNU6MY.js → chunk-L2HSSVVD.js}

@@ -1,6 +1,6 @@
 import {
   StorageManager
-} from "./chunk-WXBVGKS6.js";
+} from "./chunk-N7RAABFM.js";
 import {
   getCachedRuleMemories,
   setCachedRuleMemories
@@ -119,4 +119,4 @@ export {
   compareVerifiedSemanticRuleResults,
   searchVerifiedSemanticRules
 };
-//# sourceMappingURL=chunk-VCLNU6MY.js.map
+//# sourceMappingURL=chunk-L2HSSVVD.js.map

package/dist/{chunk-U2A56LLF.js → chunk-L334PSLW.js}

@@ -1,9 +1,3 @@
-import {
-  LanceDbBackend
-} from "./chunk-DOJBV6WR.js";
-import {
-  MeilisearchBackend
-} from "./chunk-PFUXPTBT.js";
 import {
   NoopSearchBackend
 } from "./chunk-CYEPCZN5.js";
@@ -16,6 +10,12 @@ import {
 import {
   EmbedHelper
 } from "./chunk-EXYT52NR.js";
+import {
+  LanceDbBackend
+} from "./chunk-DOJBV6WR.js";
+import {
+  MeilisearchBackend
+} from "./chunk-PFUXPTBT.js";
 import {
   createConversationIndexBackend
 } from "./chunk-TFA6HPOA.js";
@@ -24,7 +24,7 @@ import {
 } from "./chunk-F4TWWUMP.js";
 import {
   QmdClient
-} from "./chunk-WBN66HPI.js";
+} from "./chunk-ELHJK7LM.js";
 import {
   resolveIndexingCapabilities,
   resolvePipelineProcessingCapabilities,
@@ -179,4 +179,4 @@ export {
   createConversationSearchBackend,
   createConversationIndexRuntime
 };
-//# sourceMappingURL=chunk-U2A56LLF.js.map
+//# sourceMappingURL=chunk-L334PSLW.js.map

package/dist/{chunk-HQUYENKK.js → chunk-LIUI46BX.js}

@@ -1,6 +1,6 @@
 import {
   isValidCapsuleSince
-} from "./chunk-KQAFEZQX.js";
+} from "./chunk-BUKK5SWA.js";
 import {
   CAPSULE_ID_PATTERN
 } from "./chunk-WEHSQBFR.js";
@@ -12,7 +12,7 @@ import {
 import {
   OFFLINE_SYNC_FILE_CONTENT_MAX_CHUNK_BYTES,
   OFFLINE_SYNC_MAX_MTIME_MS
-} from "./chunk-TEH5MDX5.js";
+} from "./chunk-YH7HJNWV.js";
 import {
   validateArchiveRelativePath
 } from "./chunk-GCGJW34D.js";
@@ -560,4 +560,4 @@ export {
   actionConfidenceRequestSchema,
   validateRequest
 };
-//# sourceMappingURL=chunk-HQUYENKK.js.map
+//# sourceMappingURL=chunk-LIUI46BX.js.map

package/dist/{chunk-ERMT5WQM.js → chunk-MKE5DP3S.js}

@@ -1,6 +1,6 @@
 import {
   readAllEdges
-} from "./chunk-KRAMCBIW.js";
+} from "./chunk-QKXPOLQD.js";
 import {
   readEdgeConfidence
 } from "./chunk-2LSZVONP.js";
@@ -162,4 +162,4 @@ export {
   parseGraphSnapshotSince,
   buildGraphSnapshot
 };
-//# sourceMappingURL=chunk-ERMT5WQM.js.map
+//# sourceMappingURL=chunk-MKE5DP3S.js.map

package/dist/{chunk-4OFXLQJD.js → chunk-MPDLLLOG.js}

@@ -34,8 +34,10 @@ var BufferSessionPersistence = class {
       await storage.saveBuffer(state);
       this.dirty.clear();
       this.deleted.clear();
-      return;
+      return { handedOver: [], drainedTurns: /* @__PURE__ */ new Map() };
     }
+    const handedOver = [];
+    const drainedTurns = /* @__PURE__ */ new Map();
     for (const key of [...this.deleted]) {
       await deleteSession(key);
       this.deleted.delete(key);
@@ -46,13 +48,16 @@ var BufferSessionPersistence = class {
         this.markDeleted(key);
         continue;
       }
-      await saveSession(key, entry);
+      const outcome = await saveSession(key, entry);
       this.dirty.delete(key);
+      if (outcome?.status === "handed_over") handedOver.push(key);
+      if (outcome?.drainedTurns && outcome.drainedTurns.length > 0) drainedTurns.set(key, outcome.drainedTurns);
     }
+    return { handedOver, drainedTurns };
   }
 };
 
 export {
   BufferSessionPersistence
 };
-//# sourceMappingURL=chunk-4OFXLQJD.js.map
+//# sourceMappingURL=chunk-MPDLLLOG.js.map

package/dist/chunk-MPDLLLOG.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/buffer-persistence.ts"],"sourcesContent":["import type { BufferEntryState, BufferState, BufferSurpriseEvent, BufferTurn } from \"./types.js\";\nimport type { BufferSessionSaveOutcome } from \"./storage/buffer-drain-claims.js\";\n\n/**\n * The buffer persistence surface SmartBuffer depends on.\n *\n * `saveBufferSession` / `deleteBufferSession` are the per-session incremental\n * writes (one file per session); when a storage backend does not provide\n * them, the buffer falls back to the whole-state `saveBuffer`. Both are\n * optional in the type so a storage double only has to implement what it\n * actually supports.\n */\nexport interface BufferStorage {\n  loadBuffer(): Promise<BufferState>;\n  saveBuffer(state: BufferState): Promise<void>;\n  /** Reports \"handed_over\" when the session is claimed by `remnic buffer drain` and the entry moved into the claim instead of a session file. Legacy doubles may return void (treated as \"saved\"). */\n  saveBufferSession?(key: string, entry: BufferEntryState): Promise<BufferSessionSaveOutcome | void>;\n  deleteBufferSession?(key: string): Promise<void>;\n  /** Sync claim check for the extraction gate; omitted when the backend has no drain-claim store. */\n  isBufferSessionClaimed?(key: string): boolean;\n  /** Optional surprise-telemetry sink; older storage and test doubles omit it. */\n  appendBufferSurpriseEvents?(events: BufferSurpriseEvent[]): Promise<number>;\n}\n\n/** What one persist pass changed beyond plain writes. */\nexport interface BufferPersistOutcome {\n  /** Sessions whose in-memory entry moved into a drain claim: the caller must evict them (a claimed session no longer lives in this process). */\n  handedOver: string[];\n  /** Per session, the turns a drain already extracted: the caller subtracts them from its in-memory copy. */\n  drainedTurns: Map<string, BufferTurn[]>;\n}\n\n/**\n * Tracks which sessions' persisted files are stale and writes only those.\n *\n * Marks are cleared only after a durable write of that session. All calls\n * happen under SmartBuffer's serialized mutation chain: one writer.\n */\nexport class BufferSessionPersistence {\n  private readonly dirty = new Set<string>();\n  private readonly deleted = new Set<string>();\n\n  markDirty(key: string): void {\n    this.dirty.add(key);\n    this.deleted.delete(key);\n  }\n\n  markDeleted(key: string): void {\n    this.deleted.add(key);\n    this.dirty.delete(key);\n  }\n\n  /** Eviction removed `key` from memory: its session file must go, any pending write is moot. */\n  markEvicted(keys: readonly string[]): void {\n    for (const key of keys) this.markDeleted(key);\n  }\n\n  hasPending(): boolean {\n    return this.dirty.size > 0 || this.deleted.size > 0;\n  }\n\n  /**\n   * Persist buffer state. On session-capable storage this writes ONLY the\n   * sessions whose state changed since the last successful persist and\n   * deletes files for evicted/reset sessions, so the observe path never\n   * re-serializes other sessions' turns. On legacy storage it falls back to\n   * the whole-state saveBuffer. Files are deleted before dirty writes: a\n   * crash mid-persist can then only resurrect already-evicted data (the same\n   * exposure as a whole-file rewrite), never drop sessions the state says\n   * exist.\n   */\n  async persist(\n    storage: BufferStorage,\n    state: BufferState,\n    peekEntry: (key: string) => BufferEntryState | undefined,\n  ): Promise<BufferPersistOutcome> {\n    const saveSession = storage.saveBufferSession?.bind(storage);\n    const deleteSession = storage.deleteBufferSession?.bind(storage);\n    if (!saveSession || !deleteSession) {\n      await storage.saveBuffer(state);\n      this.dirty.clear();\n      this.deleted.clear();\n      return { handedOver: [], drainedTurns: new Map() };\n    }\n    const handedOver: string[] = [];\n    const drainedTurns = new Map<string, BufferTurn[]>();\n    for (const key of [...this.deleted]) {\n      await deleteSession(key);\n      this.deleted.delete(key);\n    }\n    for (const key of [...this.dirty]) {\n      const entry = peekEntry(key);\n      if (!entry) {\n        // A dirty key without state must not be written from a fabricated\n        // empty entry: treat it as a deletion instead.\n        this.markDeleted(key);\n        continue;\n      }\n      const outcome = await saveSession(key, entry);\n      this.dirty.delete(key);\n      // \"handed_over\": the entry moved into a drain claim. Content is durable\n      // in the claim, so this key's pending state is settled — the caller\n      // evicts the in-memory entry on its side.\n      if (outcome?.status === \"handed_over\") handedOver.push(key);\n      // A drain tombstone: the turns it extracted must leave this process's\n      // copy too, or the owner would extract them a second time.\n      if (outcome?.drainedTurns && outcome.drainedTurns.length > 0) drainedTurns.set(key, outcome.drainedTurns);\n    }\n    return { handedOver, drainedTurns };\n  }\n}\n"],"mappings":";AAsCO,IAAM,2BAAN,MAA+B;AAAA,EACnB,QAAQ,oBAAI,IAAY;AAAA,EACxB,UAAU,oBAAI,IAAY;AAAA,EAE3C,UAAU,KAAmB;AAC3B,SAAK,MAAM,IAAI,GAAG;AAClB,SAAK,QAAQ,OAAO,GAAG;AAAA,EACzB;AAAA,EAEA,YAAY,KAAmB;AAC7B,SAAK,QAAQ,IAAI,GAAG;AACpB,SAAK,MAAM,OAAO,GAAG;AAAA,EACvB;AAAA;AAAA,EAGA,YAAY,MAA+B;AACzC,eAAW,OAAO,KAAM,MAAK,YAAY,GAAG;AAAA,EAC9C;AAAA,EAEA,aAAsB;AACpB,WAAO,KAAK,MAAM,OAAO,KAAK,KAAK,QAAQ,OAAO;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,MAAM,QACJ,SACA,OACA,WAC+B;AAC/B,UAAM,cAAc,QAAQ,mBAAmB,KAAK,OAAO;AAC3D,UAAM,gBAAgB,QAAQ,qBAAqB,KAAK,OAAO;AAC/D,QAAI,CAAC,eAAe,CAAC,eAAe;AAClC,YAAM,QAAQ,WAAW,KAAK;AAC9B,WAAK,MAAM,MAAM;AACjB,WAAK,QAAQ,MAAM;AACnB,aAAO,EAAE,YAAY,CAAC,GAAG,cAAc,oBAAI,IAAI,EAAE;AAAA,IACnD;AACA,UAAM,aAAuB,CAAC;AAC9B,UAAM,eAAe,oBAAI,IAA0B;AACnD,eAAW,OAAO,CAAC,GAAG,KAAK,OAAO,GAAG;AACnC,YAAM,cAAc,GAAG;AACvB,WAAK,QAAQ,OAAO,GAAG;AAAA,IACzB;AACA,eAAW,OAAO,CAAC,GAAG,KAAK,KAAK,GAAG;AACjC,YAAM,QAAQ,UAAU,GAAG;AAC3B,UAAI,CAAC,OAAO;AAGV,aAAK,YAAY,GAAG;AACpB;AAAA,MACF;AACA,YAAM,UAAU,MAAM,YAAY,KAAK,KAAK;AAC5C,WAAK,MAAM,OAAO,GAAG;AAIrB,UAAI,SAAS,WAAW,cAAe,YAAW,KAAK,GAAG;AAG1D,UAAI,SAAS,gBAAgB,QAAQ,aAAa,SAAS,EAAG,cAAa,IAAI,KAAK,QAAQ,YAAY;AAAA,IAC1G;AACA,WAAO,EAAE,YAAY,aAAa;AAAA,EACpC;AACF;","names":[]}

package/dist/{chunk-6BO27AWQ.js → chunk-MPJ7VHHA.js}

@@ -5,7 +5,7 @@ import {
 } from "./chunk-5JMAGU26.js";
 import {
   runPostConsolidationMaterialize
-} from "./chunk-OL7A7NKH.js";
+} from "./chunk-GNP4BV4Z.js";
 import {
   isSemanticConsolidationLlmOperator
 } from "./chunk-G7D6GZ5J.js";
@@ -220,4 +220,4 @@ export {
   buildExtensionsBlockForConsolidation,
   materializeAfterSemanticConsolidation
 };
-//# sourceMappingURL=chunk-6BO27AWQ.js.map
+//# sourceMappingURL=chunk-MPJ7VHHA.js.map