agents 0.22.0 → 0.23.0

package/dist/compaction-helpers-iiKMr2TQ.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"compaction-helpers-iiKMr2TQ.js","names":[],"sources":["../src/experimental/memory/utils/tokens.ts","../src/experimental/memory/utils/compaction-helpers.ts"],"sourcesContent":["/**\n * Token Estimation Utilities\n *\n * IMPORTANT: These are heuristic estimates, not actual tokenizer counts.\n *\n * We intentionally avoid real tokenizers (e.g. tiktoken, sentencepiece) because:\n * - A single tiktoken instance costs ~80-120MB of heap\n * - Cloudflare Workers have tight memory limits (128MB)\n * - For compaction thresholds, a conservative estimate is sufficient\n *\n * The hybrid approach (max of character-based and word-based estimates) handles\n * both dense token content (JSON, code) and natural language reasonably well.\n *\n * Calibration notes:\n * - Character-based: ~4 chars per token (conservative, from OpenAI guidance)\n * - Word-based: ~1.3 tokens per word (empirical, from Mastra's memory system)\n * - Per-message overhead: ~4 tokens for role/framing (empirical)\n *\n * These ratios are tuned for English. CJK, emoji-heavy, or highly technical\n * content may have different ratios. The conservative estimates help ensure\n * compaction triggers before context windows are actually exceeded.\n */\n\nimport type { SessionMessage } from \"../session/types\";\n\n/** Approximate characters per token for English text */\nexport const CHARS_PER_TOKEN = 4;\n\n/** Approximate token multiplier per whitespace-separated word */\nexport const WORDS_TOKEN_MULTIPLIER = 1.3;\n\n/** Approximate overhead tokens per message (role, framing) */\nexport const TOKENS_PER_MESSAGE = 4;\n\n/**\n * Estimate token count for a string using a hybrid heuristic.\n *\n * Takes the max of two estimates:\n * - Character-based: `length / 4` — better for dense content (JSON, code, URLs)\n * - Word-based: `words * 1.3` — better for natural language prose\n *\n * This is a heuristic. Do not use where exact counts are required.\n */\nexport function estimateStringTokens(text: string): number {\n  if (!text) return 0;\n  const charEstimate = text.length / CHARS_PER_TOKEN;\n  const wordEstimate =\n    text.split(/\\s+/).filter(Boolean).length * WORDS_TOKEN_MULTIPLIER;\n  return Math.ceil(Math.max(charEstimate, wordEstimate));\n}\n\nfunction estimateUnknownTokens(value: unknown): number {\n  if (value === null || value === undefined) return 0;\n  if (typeof value === \"string\") return estimateStringTokens(value);\n\n  try {\n    return estimateStringTokens(JSON.stringify(value));\n  } catch {\n    return estimateStringTokens(String(value));\n  }\n}\n\n/**\n * Estimate total token count for an array of UIMessages.\n *\n * Walks each message's parts (text, reasoning, tool invocations, tool results)\n * and applies per-message overhead.\n *\n * This is a heuristic. Do not use where exact counts are required.\n */\nexport function estimateMessageTokens(messages: SessionMessage[]): number {\n  let tokens = 0;\n  for (const msg of messages) {\n    tokens += TOKENS_PER_MESSAGE;\n    for (const part of msg.parts) {\n      if (part.type === \"text\" || part.type === \"reasoning\") {\n        tokens += estimateUnknownTokens(part.text ?? part.reasoning);\n      } else if (\n        part.type.startsWith(\"tool-\") ||\n        part.type === \"dynamic-tool\"\n      ) {\n        tokens += estimateUnknownTokens(part.input);\n        tokens += estimateUnknownTokens(part.output ?? part.result);\n      } else if (part.text !== undefined) {\n        tokens += estimateUnknownTokens(part.text);\n      } else if (part.result !== undefined) {\n        tokens += estimateUnknownTokens(part.result);\n      }\n    }\n  }\n  return tokens;\n}\n","/**\n * Compaction Helpers\n *\n * Utilities for full compaction (LLM-based summarization).\n * Used by the reference compaction implementation and available\n * for custom CompactFunction implementations.\n */\n\nimport type { CompactContext, SessionMessage } from \"../session/types\";\nimport { estimateMessageTokens } from \"./tokens\";\n\nexport type CompactTokenCounter = (\n  messages: SessionMessage[]\n) => number | Promise<number>;\n\n// ── Compaction ID constants ─────────────────────────────────────────\n\n/** Prefix for all compaction messages (overlays and summaries) */\nexport const COMPACTION_PREFIX = \"compaction_\";\n\n/** Check if a message is a compaction message */\nexport function isCompactionMessage(msg: SessionMessage): boolean {\n  return msg.id.startsWith(COMPACTION_PREFIX);\n}\n\n// ── Tool Pair Alignment ──────────────────────────────────────────────\n\n/**\n * Check if a message contains tool invocations.\n */\nfunction hasToolCalls(msg: SessionMessage): boolean {\n  return msg.parts.some(\n    (p) => p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\"\n  );\n}\n\n/**\n * Get tool call IDs from a message's parts.\n */\nfunction getToolCallIds(msg: SessionMessage): Set<string> {\n  const ids = new Set<string>();\n  for (const part of msg.parts) {\n    if (\n      (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n      \"toolCallId\" in part\n    ) {\n      ids.add((part as { toolCallId: string }).toolCallId);\n    }\n  }\n  return ids;\n}\n\n/**\n * Check if a message is a tool result referencing a specific call ID.\n */\nfunction isToolResultFor(msg: SessionMessage, callIds: Set<string>): boolean {\n  return msg.parts.some(\n    (p) =>\n      (p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\") &&\n      \"toolCallId\" in p &&\n      callIds.has((p as { toolCallId: string }).toolCallId)\n  );\n}\n\n/**\n * Align a boundary index forward to avoid splitting tool call/result groups.\n * If the boundary falls between an assistant message with tool calls and its\n * tool results, move it forward past the results.\n */\nexport function alignBoundaryForward(\n  messages: SessionMessage[],\n  idx: number\n): number {\n  if (idx <= 0 || idx >= messages.length) return idx;\n\n  // Check if the message before the boundary has tool calls\n  const prev = messages[idx - 1];\n  if (prev.role === \"assistant\" && hasToolCalls(prev)) {\n    const callIds = getToolCallIds(prev);\n    // Skip forward past any tool results for these calls\n    while (idx < messages.length && isToolResultFor(messages[idx], callIds)) {\n      idx++;\n    }\n  }\n\n  return idx;\n}\n\n/**\n * Align a boundary index backward to avoid splitting tool call/result groups.\n * If the boundary falls in the middle of tool results, move it backward to\n * include the assistant message that made the calls.\n */\nexport function alignBoundaryBackward(\n  messages: SessionMessage[],\n  idx: number\n): number {\n  if (idx <= 0 || idx >= messages.length) return idx;\n\n  // If the message at idx is a tool result, walk backward to find the call\n  while (idx > 0) {\n    const msg = messages[idx];\n    if (msg.role === \"assistant\" && hasToolCalls(msg)) {\n      break; // This is a tool call message — include it\n    }\n    // Check if this looks like a tool result (assistant message following another)\n    const prev = messages[idx - 1];\n    if (prev.role === \"assistant\" && hasToolCalls(prev)) {\n      const callIds = getToolCallIds(prev);\n      if (isToolResultFor(msg, callIds)) {\n        idx--; // Move back to include the call\n        continue;\n      }\n    }\n    break;\n  }\n\n  return idx;\n}\n\n// ── Token-Budget Tail Protection ─────────────────────────────────────\n\n/**\n * Find the compression end boundary using a token budget for the tail.\n * Walks backward from the end, accumulating tokens until budget is reached.\n * Returns the index where compression should stop (everything from this\n * index onward is protected).\n *\n * @param messages All messages\n * @param headEnd Index where the protected head ends (compression starts here)\n * @param tailTokenBudget Maximum tokens to keep in the tail\n * @param minTailMessages Minimum messages to protect in the tail (fallback)\n */\nexport function findTailCutByTokens(\n  messages: SessionMessage[],\n  headEnd: number,\n  tailTokenBudget = 20000,\n  minTailMessages = 2\n): number {\n  const n = messages.length;\n  let accumulated = 0;\n  let tokenCut = n;\n\n  for (let i = n - 1; i >= headEnd; i--) {\n    const msgTokens = estimateMessageTokens([messages[i]]);\n\n    if (accumulated + msgTokens > tailTokenBudget && tokenCut < n) {\n      // Budget exceeded and we already have at least one tail message\n      break;\n    }\n    accumulated += msgTokens;\n    tokenCut = i;\n  }\n\n  // Protect whichever is larger: token-based tail or minTailMessages\n  const minCut = n - minTailMessages;\n  const cutIdx = minCut >= headEnd ? Math.min(tokenCut, minCut) : tokenCut;\n\n  // Align to avoid splitting tool groups\n  return alignBoundaryBackward(messages, cutIdx);\n}\n\nasync function findTailCutByTokensWithCounter(\n  messages: SessionMessage[],\n  headEnd: number,\n  tokenCounter: CompactTokenCounter,\n  tailTokenBudget = 20000,\n  minTailMessages = 2\n): Promise<number> {\n  const n = messages.length;\n  let accumulated = 0;\n  let tokenCut = n;\n\n  for (let i = n - 1; i >= headEnd; i--) {\n    const msgTokens = await tokenCounter([messages[i]]);\n\n    if (accumulated + msgTokens > tailTokenBudget && tokenCut < n) {\n      break;\n    }\n    accumulated += msgTokens;\n    tokenCut = i;\n  }\n\n  const minCut = n - minTailMessages;\n  const cutIdx = minCut >= headEnd ? Math.min(tokenCut, minCut) : tokenCut;\n  return alignBoundaryBackward(messages, cutIdx);\n}\n\n// ── Tool Pair Sanitization ───────────────────────────────────────────\n\n/**\n * Fix orphaned tool call/result pairs after compaction.\n *\n * Two failure modes:\n * 1. Tool result references a call_id whose assistant tool_call was removed\n *    → Remove the orphaned result\n * 2. Assistant has tool_calls whose results were dropped\n *    → Add stub results so the API doesn't error\n *\n * @param messages Messages after compaction\n * @returns Sanitized messages with no orphaned pairs\n */\nexport function sanitizeToolPairs(\n  messages: SessionMessage[]\n): SessionMessage[] {\n  // Build set of surviving tool call IDs (from assistant messages)\n  const survivingCallIds = new Set<string>();\n  for (const msg of messages) {\n    if (msg.role === \"assistant\") {\n      for (const id of getToolCallIds(msg)) {\n        survivingCallIds.add(id);\n      }\n    }\n  }\n\n  // Build set of tool result IDs\n  const resultCallIds = new Set<string>();\n  for (const msg of messages) {\n    for (const part of msg.parts) {\n      if (\n        (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n        \"toolCallId\" in part &&\n        \"output\" in part\n      ) {\n        resultCallIds.add((part as { toolCallId: string }).toolCallId);\n      }\n    }\n  }\n\n  // Remove orphaned results (results whose calls were dropped)\n  const orphanedResults = new Set<string>();\n  for (const id of resultCallIds) {\n    if (!survivingCallIds.has(id)) {\n      orphanedResults.add(id);\n    }\n  }\n\n  let result = messages;\n  if (orphanedResults.size > 0) {\n    result = result.map((msg) => {\n      const filteredParts = msg.parts.filter((part) => {\n        if (\n          (part.type.startsWith(\"tool-\") || part.type === \"dynamic-tool\") &&\n          \"toolCallId\" in part &&\n          \"output\" in part\n        ) {\n          return !orphanedResults.has(\n            (part as { toolCallId: string }).toolCallId\n          );\n        }\n        return true;\n      });\n      if (filteredParts.length !== msg.parts.length) {\n        return { ...msg, parts: filteredParts } as SessionMessage;\n      }\n      return msg;\n    });\n  }\n\n  // Add stub results for calls whose results were dropped\n  const missingResults = new Set<string>();\n  for (const id of survivingCallIds) {\n    if (!resultCallIds.has(id) && !orphanedResults.has(id)) {\n      missingResults.add(id);\n    }\n  }\n\n  if (missingResults.size > 0) {\n    const patched: SessionMessage[] = [];\n    for (const msg of result) {\n      patched.push(msg);\n      if (msg.role === \"assistant\") {\n        for (const id of getToolCallIds(msg)) {\n          if (missingResults.has(id)) {\n            // Find the tool name from the call\n            const callPart = msg.parts.find(\n              (p) =>\n                \"toolCallId\" in p &&\n                (p as { toolCallId: string }).toolCallId === id\n            ) as { toolName?: string } | undefined;\n\n            patched.push({\n              id: `stub-${id}`,\n              role: \"assistant\",\n              parts: [\n                {\n                  type: \"tool-result\" as const,\n                  toolCallId: id,\n                  toolName: callPart?.toolName ?? \"unknown\",\n                  result:\n                    \"[Result from earlier conversation — see context summary above]\"\n                } as unknown as SessionMessage[\"parts\"][number]\n              ],\n              createdAt: new Date()\n            } as SessionMessage);\n          }\n        }\n      }\n    }\n    result = patched;\n  }\n\n  // Remove empty messages (all parts filtered out)\n  return result.filter((msg) => msg.parts.length > 0);\n}\n\n// ── Summary Budget ───────────────────────────────────────────────────\n\n/**\n * Compute a summary token budget based on the content being compressed.\n * 20% of the compressed content, clamped to 2K-8K tokens.\n */\nexport function computeSummaryBudget(messages: SessionMessage[]): number {\n  const contentTokens = estimateMessageTokens(messages);\n  // Summary is ~20% of the content being compressed.\n  // The summary replaces the compressed middle, so it's sized relative\n  // to what it's replacing — not the tail budget (they occupy different\n  // slots in the context window).\n  const budget = Math.floor(contentTokens * 0.2);\n  return Math.max(100, budget);\n}\n\n// ── Structured Summary Prompt ────────────────────────────────────────\n\n/**\n * Build a prompt for LLM summarization of compressed messages.\n *\n * @param messages Messages to summarize\n * @param previousSummary Previous summary for iterative updates (or null for first compaction)\n * @param budget Target token count for the summary\n */\nexport function buildSummaryPrompt(\n  messages: SessionMessage[],\n  previousSummary: string | null,\n  budget: number\n): string {\n  const content = messages\n    .map((msg) => {\n      const textParts = msg.parts\n        .filter((p) => p.type === \"text\")\n        .map((p) => (p as { text: string }).text)\n        .join(\"\\n\");\n\n      const toolParts = msg.parts\n        .filter((p) => p.type.startsWith(\"tool-\") || p.type === \"dynamic-tool\")\n        .map((p) => {\n          const tp = p as {\n            toolName?: string;\n            input?: unknown;\n            output?: unknown;\n          };\n          const parts = [`[Tool: ${tp.toolName ?? \"unknown\"}]`];\n          if (tp.input)\n            parts.push(`Input: ${JSON.stringify(tp.input).slice(0, 500)}`);\n          if (tp.output)\n            parts.push(`Output: ${String(tp.output).slice(0, 500)}`);\n          return parts.join(\"\\n\");\n        })\n        .join(\"\\n\");\n\n      return `[${msg.role}]\\n${textParts}${toolParts ? \"\\n\" + toolParts : \"\"}`;\n    })\n    .join(\"\\n\\n---\\n\\n\");\n\n  if (previousSummary) {\n    return `You are updating a conversation summary. A previous summary exists below. New conversation turns have occurred since then and need to be incorporated.\n\nPREVIOUS SUMMARY:\n${previousSummary}\n\nNEW TURNS TO INCORPORATE:\n${content}\n\nUpdate the summary. PRESERVE existing information that is still relevant. ADD new information. Remove information only if it is clearly obsolete.\n\n## Topic\n[What the conversation is about]\n\n## Key Points\n[Important information, decisions, and conclusions from the conversation]\n\n## Current State\n[Where things stand now — what has been done, what is in progress]\n\n## Open Items\n[Unresolved questions, pending tasks, or next steps discussed]\n\nTarget ~${budget} tokens. Be factual — only include information that was explicitly discussed in the conversation. Do NOT invent file paths, commands, or details that were not mentioned. Write only the summary body.`;\n  }\n\n  return `Create a concise summary of this conversation that preserves the important information for future context.\n\nCONVERSATION TO SUMMARIZE:\n${content}\n\nUse this structure:\n\n## Topic\n[What the conversation is about]\n\n## Key Points\n[Important information, decisions, and conclusions from the conversation]\n\n## Current State\n[Where things stand now — what has been done, what is in progress]\n\n## Open Items\n[Unresolved questions, pending tasks, or next steps discussed]\n\nTarget ~${budget} tokens. Be factual — only include information that was explicitly discussed in the conversation. Do NOT invent file paths, commands, or details that were not mentioned. Write only the summary body.`;\n}\n\n// ── Reference Compaction Implementation ──────────────────────────────\n\n/**\n * Result of a compaction function — describes the overlay to store.\n */\nexport interface CompactResult {\n  /** First message ID in the compacted range */\n  fromMessageId: string;\n  /** Last message ID in the compacted range */\n  toMessageId: string;\n  /** Summary text to store as the overlay */\n  summary: string;\n}\n\nexport interface CompactOptions {\n  /**\n   * Function to call the LLM for summarization.\n   * Takes a user prompt string, returns the LLM's text response.\n   */\n  summarize: (prompt: string) => Promise<string>;\n\n  /** Number of head messages to protect (default: 2) */\n  protectHead?: number;\n\n  /** Token budget for tail protection (default: 20000) */\n  tailTokenBudget?: number;\n\n  /** Minimum tail messages to protect (default: 2) */\n  minTailMessages?: number;\n\n  /**\n   * Optional counter for tail-budget decisions. Use this when a tokenizer or\n   * model-reported accounting is available; otherwise the Workers-safe\n   * heuristic is used.\n   */\n  tokenCounter?: CompactTokenCounter;\n}\n\n/**\n * Reference compaction implementation.\n *\n * Implements the full hermes-style compaction algorithm:\n * 1. Protect head messages (first N)\n * 2. Protect tail by token budget (walk backward)\n * 3. Align boundaries to tool call groups\n * 4. Summarize middle section with LLM (structured format)\n * 5. Sanitize orphaned tool pairs\n * 6. Iterative summary updates on subsequent compactions\n *\n * @example\n * ```typescript\n * import { createCompactFunction } from \"agents/experimental/memory/utils\";\n *\n * const session = new Session(provider, {\n *   compaction: {\n *     tokenThreshold: 100000,\n *     fn: createCompactFunction({\n *       summarize: (prompt) => generateText({ model, prompt }).then(r => r.text)\n *     })\n *   }\n * });\n * ```\n */\nexport function createCompactFunction(opts: CompactOptions) {\n  const protectHead = opts.protectHead ?? 3;\n  const tailTokenBudget = opts.tailTokenBudget ?? 20000;\n  const minTailMessages = opts.minTailMessages ?? 2;\n\n  return async (\n    messages: SessionMessage[],\n    context?: CompactContext\n  ): Promise<CompactResult | null> => {\n    if (messages.length <= protectHead + minTailMessages) {\n      return null;\n    }\n\n    // Prefer an explicit counter; otherwise adapt the Session's counter (flowed\n    // via CompactContext) so a single `tokenCounter` on `compactAfter` drives\n    // the boundary cut too — without it, a fire counter + the default heuristic\n    // under-counting a tool-heavy history makes compaction fire every turn but\n    // never shorten anything. The session counter is whole-prompt shaped; for\n    // the tail walk we feed it individual messages with empty system/context.\n    //\n    // Caveat: this counter is invoked once PER MESSAGE. A tokenizer-style\n    // counter yields accurate per-message tokens; a counter that returns a\n    // fixed whole-prompt total (e.g. `usage.inputTokens`) returns the same\n    // value for every message, which degrades `tailTokenBudget` to\n    // `minTailMessages` — compaction still runs and context stays bounded, but\n    // the byte budget is effectively ignored. It is also called O(n) times per\n    // compaction, so an async/remote counter (e.g. a `count_tokens` API) will\n    // be slow. For precise tail budgeting with such counters, pass an explicit\n    // per-message `CompactOptions.tokenCounter` instead.\n    const sessionCounter = context?.tokenCounter;\n    const tailCounter: CompactTokenCounter | undefined =\n      opts.tokenCounter ??\n      (sessionCounter\n        ? (msgs) =>\n            sessionCounter({\n              messages: msgs,\n              systemPrompt: \"\",\n              contextBlocks: []\n            })\n        : undefined);\n\n    // 1. Find compression boundaries\n    let compressStart = protectHead;\n    compressStart = alignBoundaryForward(messages, compressStart);\n\n    let compressEnd = tailCounter\n      ? await findTailCutByTokensWithCounter(\n          messages,\n          compressStart,\n          tailCounter,\n          tailTokenBudget,\n          minTailMessages\n        )\n      : findTailCutByTokens(\n          messages,\n          compressStart,\n          tailTokenBudget,\n          minTailMessages\n        );\n\n    if (compressEnd <= compressStart) {\n      return null;\n    }\n\n    // Filter out compaction overlay messages — they have virtual IDs\n    // and should not be included in the summary prompt or used as range IDs\n    const middleMessages = messages\n      .slice(compressStart, compressEnd)\n      .filter((m) => !isCompactionMessage(m));\n\n    if (middleMessages.length === 0) return null;\n\n    // 2. Generate summary — extract previous summary from compaction overlays\n    const existingCompaction = messages.find(isCompactionMessage);\n    const previousSummary = existingCompaction\n      ? existingCompaction.parts\n          .filter((p) => p.type === \"text\")\n          .map((p) => (p as { text: string }).text)\n          .join(\"\\n\")\n      : null;\n\n    const budget = computeSummaryBudget(middleMessages);\n    const prompt = buildSummaryPrompt(middleMessages, previousSummary, budget);\n    const summary = await opts.summarize(prompt);\n\n    if (!summary.trim()) return null;\n\n    return {\n      fromMessageId: middleMessages[0].id,\n      toMessageId: middleMessages[middleMessages.length - 1].id,\n      summary\n    };\n  };\n}\n"],"mappings":";;AA0BA,MAAa,kBAAkB;;AAG/B,MAAa,yBAAyB;;AAGtC,MAAa,qBAAqB;;;;;;;;;;AAWlC,SAAgB,qBAAqB,MAAsB;CACzD,IAAI,CAAC,MAAM,OAAO;CAClB,MAAM,eAAe,KAAK,SAAA;CAC1B,MAAM,eACJ,KAAK,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,SAAS;CAC7C,OAAO,KAAK,KAAK,KAAK,IAAI,cAAc,YAAY,CAAC;AACvD;AAEA,SAAS,sBAAsB,OAAwB;CACrD,IAAI,UAAU,QAAQ,UAAU,KAAA,GAAW,OAAO;CAClD,IAAI,OAAO,UAAU,UAAU,OAAO,qBAAqB,KAAK;CAEhE,IAAI;EACF,OAAO,qBAAqB,KAAK,UAAU,KAAK,CAAC;CACnD,QAAQ;EACN,OAAO,qBAAqB,OAAO,KAAK,CAAC;CAC3C;AACF;;;;;;;;;AAUA,SAAgB,sBAAsB,UAAoC;CACxE,IAAI,SAAS;CACb,KAAK,MAAM,OAAO,UAAU;EAC1B,UAAA;EACA,KAAK,MAAM,QAAQ,IAAI,OACrB,IAAI,KAAK,SAAS,UAAU,KAAK,SAAS,aACxC,UAAU,sBAAsB,KAAK,QAAQ,KAAK,SAAS;OACtD,IACL,KAAK,KAAK,WAAW,OAAO,KAC5B,KAAK,SAAS,gBACd;GACA,UAAU,sBAAsB,KAAK,KAAK;GAC1C,UAAU,sBAAsB,KAAK,UAAU,KAAK,MAAM;EAC5D,OAAO,IAAI,KAAK,SAAS,KAAA,GACvB,UAAU,sBAAsB,KAAK,IAAI;OACpC,IAAI,KAAK,WAAW,KAAA,GACzB,UAAU,sBAAsB,KAAK,MAAM;CAGjD;CACA,OAAO;AACT;;;;ACzEA,MAAa,oBAAoB;;AAGjC,SAAgB,oBAAoB,KAA8B;CAChE,OAAO,IAAI,GAAG,WAAW,iBAAiB;AAC5C;;;;AAOA,SAAS,aAAa,KAA8B;CAClD,OAAO,IAAI,MAAM,MACd,MAAM,EAAE,KAAK,WAAW,OAAO,KAAK,EAAE,SAAS,cAClD;AACF;;;;AAKA,SAAS,eAAe,KAAkC;CACxD,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,QAAQ,IAAI,OACrB,KACG,KAAK,KAAK,WAAW,OAAO,KAAK,KAAK,SAAS,mBAChD,gBAAgB,MAEhB,IAAI,IAAK,KAAgC,UAAU;CAGvD,OAAO;AACT;;;;AAKA,SAAS,gBAAgB,KAAqB,SAA+B;CAC3E,OAAO,IAAI,MAAM,MACd,OACE,EAAE,KAAK,WAAW,OAAO,KAAK,EAAE,SAAS,mBAC1C,gBAAgB,KAChB,QAAQ,IAAK,EAA6B,UAAU,CACxD;AACF;;;;;;AAOA,SAAgB,qBACd,UACA,KACQ;CACR,IAAI,OAAO,KAAK,OAAO,SAAS,QAAQ,OAAO;CAG/C,MAAM,OAAO,SAAS,MAAM;CAC5B,IAAI,KAAK,SAAS,eAAe,aAAa,IAAI,GAAG;EACnD,MAAM,UAAU,eAAe,IAAI;EAEnC,OAAO,MAAM,SAAS,UAAU,gBAAgB,SAAS,MAAM,OAAO,GACpE;CAEJ;CAEA,OAAO;AACT;;;;;;AAOA,SAAgB,sBACd,UACA,KACQ;CACR,IAAI,OAAO,KAAK,OAAO,SAAS,QAAQ,OAAO;CAG/C,OAAO,MAAM,GAAG;EACd,MAAM,MAAM,SAAS;EACrB,IAAI,IAAI,SAAS,eAAe,aAAa,GAAG,GAC9C;EAGF,MAAM,OAAO,SAAS,MAAM;EAC5B,IAAI,KAAK,SAAS,eAAe,aAAa,IAAI;OAE5C,gBAAgB,KADJ,eAAe,IACA,CAAC,GAAG;IACjC;IACA;GACF;;EAEF;CACF;CAEA,OAAO;AACT;;;;;;;;;;;;AAeA,SAAgB,oBACd,UACA,SACA,kBAAkB,KAClB,kBAAkB,GACV;CACR,MAAM,IAAI,SAAS;CACnB,IAAI,cAAc;CAClB,IAAI,WAAW;CAEf,KAAK,IAAI,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;EACrC,MAAM,YAAY,sBAAsB,CAAC,SAAS,EAAE,CAAC;EAErD,IAAI,cAAc,YAAY,mBAAmB,WAAW,GAE1D;EAEF,eAAe;EACf,WAAW;CACb;CAGA,MAAM,SAAS,IAAI;CAInB,OAAO,sBAAsB,UAHd,UAAU,UAAU,KAAK,IAAI,UAAU,MAAM,IAAI,QAGnB;AAC/C;AAEA,eAAe,+BACb,UACA,SACA,cACA,kBAAkB,KAClB,kBAAkB,GACD;CACjB,MAAM,IAAI,SAAS;CACnB,IAAI,cAAc;CAClB,IAAI,WAAW;CAEf,KAAK,IAAI,IAAI,IAAI,GAAG,KAAK,SAAS,KAAK;EACrC,MAAM,YAAY,MAAM,aAAa,CAAC,SAAS,EAAE,CAAC;EAElD,IAAI,cAAc,YAAY,mBAAmB,WAAW,GAC1D;EAEF,eAAe;EACf,WAAW;CACb;CAEA,MAAM,SAAS,IAAI;CAEnB,OAAO,sBAAsB,UADd,UAAU,UAAU,KAAK,IAAI,UAAU,MAAM,IAAI,QACnB;AAC/C;;;;;;;;;;;;;AAgBA,SAAgB,kBACd,UACkB;CAElB,MAAM,mCAAmB,IAAI,IAAY;CACzC,KAAK,MAAM,OAAO,UAChB,IAAI,IAAI,SAAS,aACf,KAAK,MAAM,MAAM,eAAe,GAAG,GACjC,iBAAiB,IAAI,EAAE;CAM7B,MAAM,gCAAgB,IAAI,IAAY;CACtC,KAAK,MAAM,OAAO,UAChB,KAAK,MAAM,QAAQ,IAAI,OACrB,KACG,KAAK,KAAK,WAAW,OAAO,KAAK,KAAK,SAAS,mBAChD,gBAAgB,QAChB,YAAY,MAEZ,cAAc,IAAK,KAAgC,UAAU;CAMnE,MAAM,kCAAkB,IAAI,IAAY;CACxC,KAAK,MAAM,MAAM,eACf,IAAI,CAAC,iBAAiB,IAAI,EAAE,GAC1B,gBAAgB,IAAI,EAAE;CAI1B,IAAI,SAAS;CACb,IAAI,gBAAgB,OAAO,GACzB,SAAS,OAAO,KAAK,QAAQ;EAC3B,MAAM,gBAAgB,IAAI,MAAM,QAAQ,SAAS;GAC/C,KACG,KAAK,KAAK,WAAW,OAAO,KAAK,KAAK,SAAS,mBAChD,gBAAgB,QAChB,YAAY,MAEZ,OAAO,CAAC,gBAAgB,IACrB,KAAgC,UACnC;GAEF,OAAO;EACT,CAAC;EACD,IAAI,cAAc,WAAW,IAAI,MAAM,QACrC,OAAO;GAAE,GAAG;GAAK,OAAO;EAAc;EAExC,OAAO;CACT,CAAC;CAIH,MAAM,iCAAiB,IAAI,IAAY;CACvC,KAAK,MAAM,MAAM,kBACf,IAAI,CAAC,cAAc,IAAI,EAAE,KAAK,CAAC,gBAAgB,IAAI,EAAE,GACnD,eAAe,IAAI,EAAE;CAIzB,IAAI,eAAe,OAAO,GAAG;EAC3B,MAAM,UAA4B,CAAC;EACnC,KAAK,MAAM,OAAO,QAAQ;GACxB,QAAQ,KAAK,GAAG;GAChB,IAAI,IAAI,SAAS;SACV,MAAM,MAAM,eAAe,GAAG,GACjC,IAAI,eAAe,IAAI,EAAE,GAAG;KAE1B,MAAM,WAAW,IAAI,MAAM,MACxB,MACC,gBAAgB,KACf,EAA6B,eAAe,EACjD;KAEA,QAAQ,KAAK;MACX,IAAI,QAAQ;MACZ,MAAM;MACN,OAAO,CACL;OACE,MAAM;OACN,YAAY;OACZ,UAAU,UAAU,YAAY;OAChC,QACE;MACJ,CACF;MACA,2BAAW,IAAI,KAAK;KACtB,CAAmB;IACrB;;EAGN;EACA,SAAS;CACX;CAGA,OAAO,OAAO,QAAQ,QAAQ,IAAI,MAAM,SAAS,CAAC;AACpD;;;;;AAQA,SAAgB,qBAAqB,UAAoC;CACvE,MAAM,gBAAgB,sBAAsB,QAAQ;CAKpD,MAAM,SAAS,KAAK,MAAM,gBAAgB,EAAG;CAC7C,OAAO,KAAK,IAAI,KAAK,MAAM;AAC7B;;;;;;;;AAWA,SAAgB,mBACd,UACA,iBACA,QACQ;CACR,MAAM,UAAU,SACb,KAAK,QAAQ;EACZ,MAAM,YAAY,IAAI,MACnB,QAAQ,MAAM,EAAE,SAAS,MAAM,CAAC,CAChC,KAAK,MAAO,EAAuB,IAAI,CAAC,CACxC,KAAK,IAAI;EAEZ,MAAM,YAAY,IAAI,MACnB,QAAQ,MAAM,EAAE,KAAK,WAAW,OAAO,KAAK,EAAE,SAAS,cAAc,CAAC,CACtE,KAAK,MAAM;GACV,MAAM,KAAK;GAKX,MAAM,QAAQ,CAAC,UAAU,GAAG,YAAY,UAAU,EAAE;GACpD,IAAI,GAAG,OACL,MAAM,KAAK,UAAU,KAAK,UAAU,GAAG,KAAK,CAAC,CAAC,MAAM,GAAG,GAAG,GAAG;GAC/D,IAAI,GAAG,QACL,MAAM,KAAK,WAAW,OAAO,GAAG,MAAM,CAAC,CAAC,MAAM,GAAG,GAAG,GAAG;GACzD,OAAO,MAAM,KAAK,IAAI;EACxB,CAAC,CAAC,CACD,KAAK,IAAI;EAEZ,OAAO,IAAI,IAAI,KAAK,KAAK,YAAY,YAAY,OAAO,YAAY;CACtE,CAAC,CAAC,CACD,KAAK,aAAa;CAErB,IAAI,iBACF,OAAO;;;EAGT,gBAAgB;;;EAGhB,QAAQ;;;;;;;;;;;;;;;;UAgBA,OAAO;CAGf,OAAO;;;EAGP,QAAQ;;;;;;;;;;;;;;;;UAgBA,OAAO;AACjB;;;;;;;;;;;;;;;;;;;;;;;;;;AAiEA,SAAgB,sBAAsB,MAAsB;CAC1D,MAAM,cAAc,KAAK,eAAe;CACxC,MAAM,kBAAkB,KAAK,mBAAmB;CAChD,MAAM,kBAAkB,KAAK,mBAAmB;CAEhD,OAAO,OACL,UACA,YACkC;EAClC,IAAI,SAAS,UAAU,cAAc,iBACnC,OAAO;EAmBT,MAAM,iBAAiB,SAAS;EAChC,MAAM,cACJ,KAAK,iBACJ,kBACI,SACC,eAAe;GACb,UAAU;GACV,cAAc;GACd,eAAe,CAAC;EAClB,CAAC,IACH,KAAA;EAGN,IAAI,gBAAgB;EACpB,gBAAgB,qBAAqB,UAAU,aAAa;EAE5D,IAAI,cAAc,cACd,MAAM,+BACJ,UACA,eACA,aACA,iBACA,eACF,IACA,oBACE,UACA,eACA,iBACA,eACF;EAEJ,IAAI,eAAe,eACjB,OAAO;EAKT,MAAM,iBAAiB,SACpB,MAAM,eAAe,WAAW,CAAC,CACjC,QAAQ,MAAM,CAAC,oBAAoB,CAAC,CAAC;EAExC,IAAI,eAAe,WAAW,GAAG,OAAO;EAGxC,MAAM,qBAAqB,SAAS,KAAK,mBAAmB;EAS5D,MAAM,SAAS,mBAAmB,gBARV,qBACpB,mBAAmB,MAChB,QAAQ,MAAM,EAAE,SAAS,MAAM,CAAC,CAChC,KAAK,MAAO,EAAuB,IAAI,CAAC,CACxC,KAAK,IAAI,IACZ,MAEW,qBAAqB,cACoC,CAAC;EACzE,MAAM,UAAU,MAAM,KAAK,UAAU,MAAM;EAE3C,IAAI,CAAC,QAAQ,KAAK,GAAG,OAAO;EAE5B,OAAO;GACL,eAAe,eAAe,EAAE,CAAC;GACjC,aAAa,eAAe,eAAe,SAAS,EAAE,CAAC;GACvD;EACF;CACF;AACF"}

package/dist/compaction-helpers-wUz6M3us.d.ts

@@ -1,621 +0,0 @@
-import { ToolSet } from "ai";
-
-//#region src/experimental/memory/session/types.d.ts
-/**
- * Minimal message part shape used by Session internals.
- * Vercel AI SDK's `UIMessagePart` is structurally compatible.
- */
-interface SessionMessagePart {
-  type: string;
-  text?: string;
-  reasoning?: string;
-  toolCallId?: string;
-  toolName?: string;
-  input?: unknown;
-  output?: unknown;
-  state?: string;
-  result?: unknown;
-}
-interface SessionTokenCounterInput {
-  /** Messages returned by `session.getHistory()` for the active branch. */
-  messages: SessionMessage[];
-  /** Frozen system prompt managed by the Session context system. */
-  systemPrompt: string;
-  /** Loaded context blocks that were used to build `systemPrompt`. */
-  contextBlocks: ContextBlock[];
-}
-type SessionTokenCounter = (
-  input: SessionTokenCounterInput
-) => number | Promise<number>;
-interface CompactAfterOptions {
-  /**
-   * Override the token estimate used by auto-compaction and status broadcasts.
-   *
-   * The default is a Workers-safe heuristic over message parts plus the
-   * Session-managed frozen system prompt. Callers that have model-reported
-   * usage or a tokenizer can provide a more precise counter here.
-   */
-  tokenCounter?: SessionTokenCounter;
-}
-/**
- * Context the Session passes to the registered compaction function. Lets the
- * same authoritative token accounting drive BOTH the "should we compact?"
- * (`compactAfter`) and "what should we compact?" (boundary) decisions, so a
- * consumer that wires a `tokenCounter` once doesn't hit the failure mode where
- * compaction fires every turn but silently no-ops because the boundary logic
- * used a different (under-counting) estimate.
- */
-interface CompactContext {
-  /** The Session's token counter (from `compactAfter`/options), if configured. */
-  tokenCounter?: SessionTokenCounter;
-}
-type CompactionErrorHandler = (error: unknown) => void | Promise<void>;
-/**
- * Minimal message shape used by Session internals.
- * Vercel AI SDK's `UIMessage` is structurally compatible — you can pass
- * `UIMessage` objects directly without conversion.
- */
-interface SessionMessage {
-  id: string;
-  role: string;
-  parts: SessionMessagePart[];
-  createdAt?: Date;
-}
-/**
- * Options for creating a Session.
- */
-interface SessionOptions {
-  /** Context blocks for the system prompt. */
-  context?: ContextConfig[];
-  /** Provider for persisting the frozen system prompt. */
-  promptStore?: WritableContextProvider;
-  /** Custom token counter for auto-compaction/status estimates. */
-  tokenCounter?: SessionTokenCounter;
-  /** Called when automatic compaction fails after a threshold trigger. */
-  onCompactionError?: CompactionErrorHandler;
-}
-//#endregion
-//#region src/experimental/memory/session/provider.d.ts
-interface SearchResult {
-  id: string;
-  role: string;
-  content: string;
-  createdAt?: string;
-  sessionId?: string;
-}
-interface StoredCompaction {
-  id: string;
-  summary: string;
-  fromMessageId: string;
-  toMessageId: string;
-  createdAt: string;
-}
-/** Per-row info for the active branch path, root → leaf order. */
-interface HistoryRowStat {
-  id: string;
-  /** Stored message role (e.g. "user" / "assistant"). */
-  role: string;
-  /** Serialized content size of the stored row in bytes. */
-  bytes: number;
-}
-/** Result of a byte-budgeted history read. */
-interface RecentHistoryResult {
-  /**
-   * The most recent messages on the active branch path whose summed stored
-   * content size fits `maxContentBytes`, root → leaf order, with compaction
-   * overlays applied within the window. The window always covers at least
-   * the leaf row (and `minRecentMessages` rows when requested), but rows
-   * whose stored content fails to parse are skipped — so a corrupt leaf can
-   * yield fewer messages than the window covers.
-   */
-  messages: SessionMessage[];
-  /** True when older messages were left out to satisfy the byte budget. */
-  truncated: boolean;
-  /** Summed stored content size of the FULL path, in bytes. */
-  totalContentBytes: number;
-}
-/**
- * Session storage provider.
- * Messages are tree-structured via parentId for branching.
- */
-interface SessionProvider {
-  getMessage(
-    id: string
-  ): SessionMessage | null | Promise<SessionMessage | null>;
-  /**
-   * Get conversation as a path from root to leaf.
-   * Applies compaction overlays. If leafId is null, uses the latest leaf.
-   */
-  getHistory(
-    leafId?: string | null
-  ): SessionMessage[] | Promise<SessionMessage[]>;
-  getLatestLeaf(): SessionMessage | null | Promise<SessionMessage | null>;
-  getBranches(messageId: string): SessionMessage[] | Promise<SessionMessage[]>;
-  getPathLength(leafId?: string | null): number | Promise<number>;
-  /**
-   * Optional: byte-budgeted read of the most recent messages on the active
-   * branch path. Lets hosts hydrate a bounded window instead of the full
-   * transcript, so wake-time memory scales with the budget rather than total
-   * session history (#1710). Providers that don't implement it fall back to
-   * a full `getHistory()` read in `Session.getRecentHistory()`.
-   *
-   * `minRecentMessages` (default 1) is a floor on the window size: the most
-   * recent N rows are always included even when they exceed the byte budget.
-   * Hosts use this to guarantee the window never shrinks below the recent
-   * span their model context assembly expects (rows are individually capped
-   * at write time, so the floor keeps memory bounded).
-   */
-  getRecentHistory?(
-    leafId: string | null | undefined,
-    maxContentBytes: number,
-    minRecentMessages?: number
-  ): RecentHistoryResult | Promise<RecentHistoryResult>;
-  /**
-   * Optional: per-row stored sizes for the active branch path (root → leaf),
-   * WITHOUT loading message content. Lets hosts find oversized rows (e.g.
-   * inline base64 media) and process them one at a time with bounded memory.
-   */
-  getHistoryRowStats?(
-    leafId?: string | null
-  ): HistoryRowStat[] | Promise<HistoryRowStat[]>;
-  /**
-   * Append a message.
-   *
-   * `parentId` semantics:
-   *   - `undefined` / omitted → auto-detect: attach to the current latest leaf.
-   *   - `null`                → create a root message with no parent.
-   *   - string                → attach to the given parent id (provider may
-   *                            fall back to root if the parent doesn't
-   *                            belong to this session).
-   *
-   * Idempotent — appending the same `message.id` twice is a no-op.
-   */
-  appendMessage(
-    message: SessionMessage,
-    parentId?: string | null
-  ): void | Promise<void>;
-  updateMessage(message: SessionMessage): void | Promise<void>;
-  deleteMessages(messageIds: string[]): void | Promise<void>;
-  clearMessages(): void | Promise<void>;
-  addCompaction(
-    summary: string,
-    fromMessageId: string,
-    toMessageId: string
-  ): StoredCompaction | Promise<StoredCompaction>;
-  getCompactions(): StoredCompaction[] | Promise<StoredCompaction[]>;
-  searchMessages?(
-    query: string,
-    limit?: number
-  ): SearchResult[] | Promise<SearchResult[]>;
-}
-//#endregion
-//#region src/experimental/memory/session/providers/agent.d.ts
-interface SqlProvider {
-  sql<T = Record<string, string | number | boolean | null>>(
-    strings: TemplateStringsArray,
-    ...values: (string | number | boolean | null)[]
-  ): T[];
-}
-declare class AgentSessionProvider implements SessionProvider {
-  private agent;
-  private initialized;
-  private sessionId;
-  /**
-   * Cached id of the active branch tip (latest leaf). `undefined` means "not
-   * cached" (cold, or last lookup found the session empty).
-   *
-   * Finding the tip from scratch is an anti-join over every row in the
-   * session (`latestLeafRow`), which is O(rows). It runs on every hydration
-   * AND every auto-parent append, so on a long transcript it dominates the
-   * read cost of a wake. The tip is maintained in place on append/delete/
-   * clear, and a cached id is re-validated on read with an O(1) existence +
-   * still-childless check before it's trusted — so the cache self-heals if
-   * something else mutates the cached tip: a deleted tip or a tip that gained
-   * a child fails the check and triggers a single recompute. Direct SQL or a
-   * second provider instance that creates a newer leaf without touching the
-   * cached tip is outside the supported writer model and will be observed on
-   * the next cold lookup. The full scan therefore never runs more often than
-   * the original unconditional version did. Reads are synchronous and the DO
-   * is single-threaded, so no locking is needed.
-   */
-  private activeLeafId;
-  /**
-   * @param agent - Agent or any object with a `sql` tagged template method
-   * @param sessionId - Optional session ID to isolate multiple sessions in the same DO.
-   *                    Messages are filtered by session_id within shared tables.
-   */
-  constructor(agent: SqlProvider, sessionId?: string);
-  private ensureTable;
-  getMessage(id: string): SessionMessage | null;
-  getHistory(leafId?: string | null): SessionMessage[];
-  getRecentHistory(
-    leafId: string | null | undefined,
-    maxContentBytes: number,
-    minRecentMessages?: number
-  ): RecentHistoryResult;
-  getHistoryRowStats(leafId?: string | null): HistoryRowStat[];
-  getLatestLeaf(): SessionMessage | null;
-  getBranches(messageId: string): SessionMessage[];
-  getPathLength(leafId?: string | null): number;
-  appendMessage(message: SessionMessage, parentId?: string | null): void;
-  updateMessage(message: SessionMessage): void;
-  deleteMessages(messageIds: string[]): void;
-  clearMessages(): void;
-  addCompaction(
-    summary: string,
-    fromMessageId: string,
-    toMessageId: string
-  ): StoredCompaction;
-  getCompactions(): StoredCompaction[];
-  searchMessages(query: string, limit?: number): SearchResult[];
-  private latestLeafRow;
-  private leafRowById;
-  /**
-   * The active branch path as (id, role, content size) rows, root → leaf.
-   *
-   * Recurses over (id, parent_id) only. Carrying `content` through the
-   * recursive queue AND the ORDER BY sorter materializes the entire
-   * transcript several times over inside SQLite's allocator, which in
-   * workerd shares the isolate's memory budget with the JS heap — large
-   * media-heavy sessions then fail with SQLITE_NOMEM on wake (#1710).
-   * Content is fetched separately in bounded chunks (`messagesByPathStats`).
-   */
-  private pathRowStats;
-  /**
-   * Fetch and parse message content for an ordered list of path rows.
-   *
-   * Content is read in chunks bounded by both row count and cumulative
-   * stored bytes (no ORDER BY — SQLite streams rows without materializing
-   * the result set) and reassembled in path order. Rows that fail to parse
-   * are skipped, matching previous behavior.
-   */
-  private messagesByPathStats;
-  private indexFTS;
-  private deleteFTS;
-  private applyCompactions;
-  private parse;
-  private parseRows;
-}
-//#endregion
-//#region src/experimental/memory/session/search.d.ts
-/**
- * Storage interface for searchable context.
- *
- * - `get()` returns a summary of indexed content (rendered into system prompt)
- * - `search(query)` full-text search (via search_context tool)
- * - `set(key, content)` indexes content under a key (via set_context tool)
- */
-interface SearchProvider extends ContextProvider {
-  search(query: string): Promise<string | null>;
-  set?(key: string, content: string): Promise<void>;
-}
-/**
- * Check if a provider is a SearchProvider (has a `search` method).
- */
-declare function isSearchProvider(
-  provider: unknown
-): provider is SearchProvider;
-/**
- * SearchProvider backed by Durable Object SQLite with FTS5.
- *
- * - `get()` returns a count of indexed entries
- * - `search(query)` full-text search using FTS5
- * - `set(key, content)` indexes or replaces content under a key
- *
- * Each instance uses a namespaced FTS5 table to avoid collisions
- * with the session message search.
- *
- * @example
- * ```ts
- * Session.create(this)
- *   .withContext("knowledge", {
- *     provider: new AgentSearchProvider(this)
- *   })
- * ```
- */
-declare class AgentSearchProvider implements SearchProvider {
-  private agent;
-  private label;
-  private initialized;
-  constructor(agent: SqlProvider);
-  init(label: string): void;
-  private ensureTable;
-  get(): Promise<string | null>;
-  search(query: string): Promise<string | null>;
-  set(key: string, content: string): Promise<void>;
-  private deleteFTS;
-}
-//#endregion
-//#region src/experimental/memory/session/skills.d.ts
-/**
- * Storage interface for skill collections.
- *
- * - `get()` returns metadata listing (rendered into system prompt)
- * - `load(key)` fetches full content (via load_context tool)
- * - `set(key, content, description?)` writes an entry (via set_context tool)
- */
-interface SkillProvider extends ContextProvider {
-  load(key: string): Promise<string | null>;
-  set?(key: string, content: string, description?: string): Promise<void>;
-}
-/**
- * Check if a provider is a SkillProvider (has a `load` method).
- */
-declare function isSkillProvider(provider: unknown): provider is SkillProvider;
-/**
- * SkillProvider backed by an R2 bucket.
- *
- * - `get()` returns a metadata listing of all skills (key + description)
- * - `load(key)` fetches a skill's full content
- * - `set(key, content, description?)` writes a skill
- *
- * Descriptions are pulled from R2 custom metadata (`description` key).
- * If a prefix is provided, it is prepended on storage operations and
- * stripped from keys in metadata. `keys`, when provided, is matched against
- * these prefix-relative keys.
- *
- * @example
- * ```ts
- * const skills = new R2SkillProvider(env.SKILLS_BUCKET, {
- *   prefix: "skills/",
- *   keys: ["code-review", "debugging"]
- * });
- * ```
- */
-declare class R2SkillProvider implements SkillProvider {
-  private bucket;
-  private prefix;
-  private keys;
-  constructor(
-    bucket: R2Bucket,
-    options?: {
-      prefix?: string;
-      keys?: string[];
-    }
-  );
-  get(): Promise<string | null>;
-  load(key: string): Promise<string | null>;
-  set(key: string, content: string, description?: string): Promise<void>;
-  private allowsKey;
-}
-//#endregion
-//#region src/experimental/memory/session/context.d.ts
-/**
- * Base storage interface for a context block.
- * A provider with only `get()` is readonly.
- */
-interface ContextProvider {
-  get(): Promise<string | null>;
-  /** Called by the context system to provide the block label before first use. */
-  init?(label: string): void;
-}
-/**
- * Writable context provider — extends ContextProvider with `set()`.
- * Blocks backed by this provider are writable via the `set_context` tool.
- */
-interface WritableContextProvider extends ContextProvider {
-  set(content: string): Promise<void>;
-}
-/**
- * Check if a provider is writable (has a `set` method).
- */
-declare function isWritableProvider(
-  provider: unknown
-): provider is WritableContextProvider;
-/**
- * Configuration for a context block.
- */
-interface ContextConfig {
-  /** Block label — used as key and in tool descriptions */
-  label: string;
-  /** Human-readable description (shown to AI in tool) */
-  description?: string;
-  /** Maximum tokens allowed. Enforced on set. */
-  maxTokens?: number;
-  /** Storage provider. Determines block behavior:
-   *  - ContextProvider (get only) → readonly
-   *  - WritableContextProvider (get+set) → writable via set_context
-   *  - SkillProvider (get+load+set?) → on-demand via load_context
-   *  - SearchProvider (get+search+set?) → searchable via search_context
-   *  If omitted, auto-wired to writable SQLite when using builder. */
-  provider?:
-    | ContextProvider
-    | WritableContextProvider
-    | SkillProvider
-    | SearchProvider;
-}
-/**
- * A loaded context block with computed token count.
- */
-interface ContextBlock {
-  label: string;
-  description?: string;
-  content: string;
-  tokens: number;
-  maxTokens?: number;
-  /** True if provider is writable (has set) */
-  writable: boolean;
-  /** True if backed by a SkillProvider */
-  isSkill: boolean;
-  /** True if backed by a SearchProvider */
-  isSearchable: boolean;
-}
-//#endregion
-//#region src/experimental/memory/utils/compaction-helpers.d.ts
-type CompactTokenCounter = (
-  messages: SessionMessage[]
-) => number | Promise<number>;
-/** Prefix for all compaction messages (overlays and summaries) */
-declare const COMPACTION_PREFIX = "compaction_";
-/** Check if a message is a compaction message */
-declare function isCompactionMessage(msg: SessionMessage): boolean;
-/**
- * Align a boundary index forward to avoid splitting tool call/result groups.
- * If the boundary falls between an assistant message with tool calls and its
- * tool results, move it forward past the results.
- */
-declare function alignBoundaryForward(
-  messages: SessionMessage[],
-  idx: number
-): number;
-/**
- * Align a boundary index backward to avoid splitting tool call/result groups.
- * If the boundary falls in the middle of tool results, move it backward to
- * include the assistant message that made the calls.
- */
-declare function alignBoundaryBackward(
-  messages: SessionMessage[],
-  idx: number
-): number;
-/**
- * Find the compression end boundary using a token budget for the tail.
- * Walks backward from the end, accumulating tokens until budget is reached.
- * Returns the index where compression should stop (everything from this
- * index onward is protected).
- *
- * @param messages All messages
- * @param headEnd Index where the protected head ends (compression starts here)
- * @param tailTokenBudget Maximum tokens to keep in the tail
- * @param minTailMessages Minimum messages to protect in the tail (fallback)
- */
-declare function findTailCutByTokens(
-  messages: SessionMessage[],
-  headEnd: number,
-  tailTokenBudget?: number,
-  minTailMessages?: number
-): number;
-/**
- * Fix orphaned tool call/result pairs after compaction.
- *
- * Two failure modes:
- * 1. Tool result references a call_id whose assistant tool_call was removed
- *    → Remove the orphaned result
- * 2. Assistant has tool_calls whose results were dropped
- *    → Add stub results so the API doesn't error
- *
- * @param messages Messages after compaction
- * @returns Sanitized messages with no orphaned pairs
- */
-declare function sanitizeToolPairs(
-  messages: SessionMessage[]
-): SessionMessage[];
-/**
- * Compute a summary token budget based on the content being compressed.
- * 20% of the compressed content, clamped to 2K-8K tokens.
- */
-declare function computeSummaryBudget(messages: SessionMessage[]): number;
-/**
- * Build a prompt for LLM summarization of compressed messages.
- *
- * @param messages Messages to summarize
- * @param previousSummary Previous summary for iterative updates (or null for first compaction)
- * @param budget Target token count for the summary
- */
-declare function buildSummaryPrompt(
-  messages: SessionMessage[],
-  previousSummary: string | null,
-  budget: number
-): string;
-/**
- * Result of a compaction function — describes the overlay to store.
- */
-interface CompactResult {
-  /** First message ID in the compacted range */
-  fromMessageId: string;
-  /** Last message ID in the compacted range */
-  toMessageId: string;
-  /** Summary text to store as the overlay */
-  summary: string;
-}
-interface CompactOptions {
-  /**
-   * Function to call the LLM for summarization.
-   * Takes a user prompt string, returns the LLM's text response.
-   */
-  summarize: (prompt: string) => Promise<string>;
-  /** Number of head messages to protect (default: 2) */
-  protectHead?: number;
-  /** Token budget for tail protection (default: 20000) */
-  tailTokenBudget?: number;
-  /** Minimum tail messages to protect (default: 2) */
-  minTailMessages?: number;
-  /**
-   * Optional counter for tail-budget decisions. Use this when a tokenizer or
-   * model-reported accounting is available; otherwise the Workers-safe
-   * heuristic is used.
-   */
-  tokenCounter?: CompactTokenCounter;
-}
-/**
- * Reference compaction implementation.
- *
- * Implements the full hermes-style compaction algorithm:
- * 1. Protect head messages (first N)
- * 2. Protect tail by token budget (walk backward)
- * 3. Align boundaries to tool call groups
- * 4. Summarize middle section with LLM (structured format)
- * 5. Sanitize orphaned tool pairs
- * 6. Iterative summary updates on subsequent compactions
- *
- * @example
- * ```typescript
- * import { createCompactFunction } from "agents/experimental/memory/utils";
- *
- * const session = new Session(provider, {
- *   compaction: {
- *     tokenThreshold: 100000,
- *     fn: createCompactFunction({
- *       summarize: (prompt) => generateText({ model, prompt }).then(r => r.text)
- *     })
- *   }
- * });
- * ```
- */
-declare function createCompactFunction(
-  opts: CompactOptions
-): (
-  messages: SessionMessage[],
-  context?: CompactContext
-) => Promise<CompactResult | null>;
-//#endregion
-export {
-  StoredCompaction as A,
-  isSearchProvider as C,
-  RecentHistoryResult as D,
-  HistoryRowStat as E,
-  SessionMessagePart as F,
-  SessionOptions as I,
-  SessionTokenCounter as L,
-  CompactContext as M,
-  CompactionErrorHandler as N,
-  SearchResult as O,
-  SessionMessage as P,
-  SessionTokenCounterInput as R,
-  SearchProvider as S,
-  SqlProvider as T,
-  isWritableProvider as _,
-  alignBoundaryBackward as a,
-  isSkillProvider as b,
-  computeSummaryBudget as c,
-  isCompactionMessage as d,
-  sanitizeToolPairs as f,
-  WritableContextProvider as g,
-  ContextProvider as h,
-  CompactTokenCounter as i,
-  CompactAfterOptions as j,
-  SessionProvider as k,
-  createCompactFunction as l,
-  ContextConfig as m,
-  CompactOptions as n,
-  alignBoundaryForward as o,
-  ContextBlock as p,
-  CompactResult as r,
-  buildSummaryPrompt as s,
-  COMPACTION_PREFIX as t,
-  findTailCutByTokens as u,
-  R2SkillProvider as v,
-  AgentSessionProvider as w,
-  AgentSearchProvider as x,
-  SkillProvider as y
-};
-//# sourceMappingURL=compaction-helpers-wUz6M3us.d.ts.map