acp-kernel 0.0.82-pr.233.214 → 0.0.82-pr.250.209
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/{chunk-VPRKYTHW.js → chunk-L6QNVRC3.js} +71 -59
- package/dist/chunk-L6QNVRC3.js.map +1 -0
- package/dist/index.d.ts +2 -2
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +10 -26
- package/dist/index.js.map +1 -1
- package/dist/nudge-text.d.ts +14 -1
- package/dist/nudge-text.d.ts.map +1 -1
- package/dist/panel/index.js +1 -1
- package/dist/prompts.d.ts +5 -0
- package/dist/prompts.d.ts.map +1 -1
- package/dist/prune.d.ts +0 -15
- package/dist/prune.d.ts.map +1 -1
- package/dist/sync.d.ts.map +1 -1
- package/package.json +1 -1
- package/dist/chunk-VPRKYTHW.js.map +0 -1
|
@@ -169,17 +169,19 @@ function resolvePrompts(overrides, options = {}) {
|
|
|
169
169
|
}
|
|
170
170
|
|
|
171
171
|
// src/nudge-text.ts
|
|
172
|
-
function efficiencyNote(prompts, sections) {
|
|
172
|
+
function efficiencyNote(prompts, sections, includeGuidance) {
|
|
173
173
|
if (sections.efficiencyNote !== void 0) return sections.efficiencyNote;
|
|
174
|
-
|
|
174
|
+
const note = "This is an efficiency nudge to compress early and keep context lean \u2014 not an overflow warning. A separate, stronger alert will appear if the context is actually full.";
|
|
175
|
+
return includeGuidance ? `${note}
|
|
175
176
|
|
|
176
|
-
${prompts.compressPhilosophy}
|
|
177
|
+
${prompts.compressPhilosophy}` : note;
|
|
177
178
|
}
|
|
178
|
-
function emergencyHeader(prompts, sections) {
|
|
179
|
+
function emergencyHeader(prompts, sections, includeGuidance) {
|
|
179
180
|
if (sections.emergencyHeader !== void 0) return sections.emergencyHeader;
|
|
180
|
-
|
|
181
|
+
const header = "\u26A0\uFE0F Context limit reached \u2014 compress now. Prioritize consumed tool outputs.";
|
|
182
|
+
return includeGuidance ? `${header}
|
|
181
183
|
|
|
182
|
-
${prompts.compressPhilosophy}
|
|
184
|
+
${prompts.compressPhilosophy}` : header;
|
|
183
185
|
}
|
|
184
186
|
function formatK(n) {
|
|
185
187
|
if (n >= 1e3) return `${(n / 1e3).toFixed(1)}K`;
|
|
@@ -316,10 +318,21 @@ function tierGuidance(tier, sections) {
|
|
|
316
318
|
return tier === 2 ? DEFAULT_T2_GUIDANCE : DEFAULT_T3_GUIDANCE;
|
|
317
319
|
}
|
|
318
320
|
function compact(parts) {
|
|
319
|
-
|
|
320
|
-
|
|
321
|
+
const out = [];
|
|
322
|
+
let pendingBlank = false;
|
|
323
|
+
for (const p of parts) {
|
|
324
|
+
if (p === "") {
|
|
325
|
+
pendingBlank = true;
|
|
326
|
+
continue;
|
|
327
|
+
}
|
|
328
|
+
if (pendingBlank && out.length > 0) out.push("");
|
|
329
|
+
pendingBlank = false;
|
|
330
|
+
out.push(p);
|
|
331
|
+
}
|
|
332
|
+
return out;
|
|
321
333
|
}
|
|
322
|
-
function renderNudgeText(decision, prompts = defaultPrompts,
|
|
334
|
+
function renderNudgeText(decision, prompts = defaultPrompts, options = {}) {
|
|
335
|
+
const includeGuidance = options.includeGuidance ?? true;
|
|
323
336
|
const breakdownStr = formatBreakdown(decision.contextBreakdown);
|
|
324
337
|
const rangesStr = formatRanges(decision.compressibleRanges, decision.protectedRanges ?? []);
|
|
325
338
|
const blockMapStr = formatBlockMap(decision.activeBlockSpans ?? []);
|
|
@@ -332,61 +345,60 @@ function renderNudgeText(decision, prompts = defaultPrompts, sections = {}) {
|
|
|
332
345
|
const endId = targets[targets.length - 1]?.blockId ?? "b5";
|
|
333
346
|
const voice = isEmergency ? "emergency" : "gentle";
|
|
334
347
|
const triggerLine = isEmergency ? `[EMERGENCY \u2014 TIER ${decision.tier} ${isT2 ? "DISTILLATION" : "CONDENSATION"}] Context limit reached \u2014 distill NOW into a denser summary to reclaim tokens.` : `[TIER ${decision.tier} ${isT2 ? "DISTILLATION" : "CONDENSATION"} TRIGGER]`;
|
|
335
|
-
const guidance = tierGuidance(isT2 ? 2 : 3,
|
|
336
|
-
const head = efficiencyNote(prompts,
|
|
337
|
-
|
|
338
|
-
|
|
339
|
-
|
|
340
|
-
|
|
341
|
-
|
|
342
|
-
|
|
343
|
-
|
|
344
|
-
|
|
345
|
-
|
|
346
|
-
|
|
347
|
-
|
|
348
|
-
|
|
349
|
-
|
|
350
|
-
|
|
351
|
-
isT2 ? prompts.tier2DistillRules : prompts.tier3CondenseRules
|
|
352
|
-
]).join("\n")
|
|
353
|
-
};
|
|
348
|
+
const guidance = tierGuidance(isT2 ? 2 : 3, options);
|
|
349
|
+
const head = efficiencyNote(prompts, options, includeGuidance);
|
|
350
|
+
const parts2 = [
|
|
351
|
+
...head === null ? [] : [head],
|
|
352
|
+
"",
|
|
353
|
+
breakdownStr,
|
|
354
|
+
"",
|
|
355
|
+
triggerLine,
|
|
356
|
+
...guidance === null ? [] : [guidance],
|
|
357
|
+
blockList,
|
|
358
|
+
`Example: compress({ content: [{ startId: "${startId}", endId: "${endId}", summary: "..." }] })`
|
|
359
|
+
];
|
|
360
|
+
if (includeGuidance) {
|
|
361
|
+
parts2.push("", prompts.howToCompressRules, "", isT2 ? prompts.tier2DistillRules : prompts.tier3CondenseRules);
|
|
362
|
+
}
|
|
363
|
+
return { voice, text: compact(parts2).join("\n") };
|
|
354
364
|
}
|
|
355
365
|
if (isEmergency) {
|
|
356
|
-
const head = emergencyHeader(prompts,
|
|
357
|
-
|
|
358
|
-
|
|
359
|
-
text: compact([
|
|
360
|
-
...head === null ? [] : [head],
|
|
361
|
-
"",
|
|
362
|
-
breakdownStr,
|
|
363
|
-
"",
|
|
364
|
-
prompts.howToCompressRules,
|
|
365
|
-
"",
|
|
366
|
-
`{ "topic": "...", "content": [{ "startId": "<ID>", "endId": "<ID>", "summary": "..." }] }`,
|
|
367
|
-
"Only use IDs from visible messages above. Compress older work first.",
|
|
368
|
-
"",
|
|
369
|
-
rangesStr,
|
|
370
|
-
...blockMapStr ? ["", blockMapStr] : []
|
|
371
|
-
]).join("\n")
|
|
372
|
-
};
|
|
373
|
-
}
|
|
374
|
-
const gentleHead = efficiencyNote(prompts, sections);
|
|
375
|
-
return {
|
|
376
|
-
voice: "gentle",
|
|
377
|
-
text: compact([
|
|
378
|
-
...gentleHead === null ? [] : [gentleHead],
|
|
366
|
+
const head = emergencyHeader(prompts, options, includeGuidance);
|
|
367
|
+
const parts2 = [
|
|
368
|
+
...head === null ? [] : [head],
|
|
379
369
|
"",
|
|
380
|
-
breakdownStr
|
|
370
|
+
breakdownStr
|
|
371
|
+
];
|
|
372
|
+
if (includeGuidance) {
|
|
373
|
+
parts2.push("", prompts.howToCompressRules);
|
|
374
|
+
}
|
|
375
|
+
parts2.push(
|
|
381
376
|
"",
|
|
382
|
-
|
|
377
|
+
`{ "topic": "...", "content": [{ "startId": "<ID>", "endId": "<ID>", "summary": "..." }] }`,
|
|
378
|
+
"Only use IDs from visible messages above. Compress older work first.",
|
|
383
379
|
"",
|
|
384
380
|
rangesStr,
|
|
385
|
-
...blockMapStr ? ["", blockMapStr] : []
|
|
386
|
-
|
|
387
|
-
|
|
388
|
-
|
|
389
|
-
|
|
381
|
+
...blockMapStr ? ["", blockMapStr] : []
|
|
382
|
+
);
|
|
383
|
+
return { voice: "emergency", text: compact(parts2).join("\n") };
|
|
384
|
+
}
|
|
385
|
+
const gentleHead = efficiencyNote(prompts, options, includeGuidance);
|
|
386
|
+
const parts = [
|
|
387
|
+
...gentleHead === null ? [] : [gentleHead],
|
|
388
|
+
"",
|
|
389
|
+
breakdownStr
|
|
390
|
+
];
|
|
391
|
+
if (includeGuidance) {
|
|
392
|
+
parts.push("", prompts.howToCompressRules);
|
|
393
|
+
}
|
|
394
|
+
parts.push(
|
|
395
|
+
"",
|
|
396
|
+
rangesStr,
|
|
397
|
+
...blockMapStr ? ["", blockMapStr] : [],
|
|
398
|
+
"",
|
|
399
|
+
`\u{1F4A1} Compress all ranges in one call (pass multiple content entries: \`content: [{...}, {...}]\`).`
|
|
400
|
+
);
|
|
401
|
+
return { voice: "gentle", text: compact(parts).join("\n") };
|
|
390
402
|
}
|
|
391
403
|
|
|
392
404
|
// src/viable.ts
|
|
@@ -434,4 +446,4 @@ export {
|
|
|
434
446
|
VIABLE_RANGE_MIN_TOKENS,
|
|
435
447
|
viableRanges
|
|
436
448
|
};
|
|
437
|
-
//# sourceMappingURL=chunk-
|
|
449
|
+
//# sourceMappingURL=chunk-L6QNVRC3.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"sources":["../src/tokenize.ts","../src/compression-rules.ts","../src/prompts.ts","../src/nudge-text.ts","../src/viable.ts","../src/truncate.ts"],"sourcesContent":["import { createRequire } from \"node:module\";\n\nconst require = createRequire(import.meta.url);\n\nexport function defaultCountTokens(text: string): number {\n if (!text) return 0;\n // CJK chars tokenize ~1:1 (chars/4 badly underestimates them). Count them\n // directly, then estimate the non-CJK remainder with chars/4 so digits,\n // punctuation, and symbols in code/JSON are not dropped to zero.\n const cjk = text.match(/[\\u4e00-\\u9fff\\u3040-\\u30ff\\uac00-\\ud7af]/g);\n const cjkCount = cjk?.length ?? 0;\n return cjkCount + Math.ceil((text.length - cjkCount) / 4);\n}\n\nexport function estimateMessageTokens(text: string | undefined): number {\n return defaultCountTokens(text ?? \"\");\n}\n\n/** Guarded contribution of a host-projected thinking payload to the metered\n * message size. Non-finite or non-positive values are treated as absent (0),\n * so a bad host value can never poison the accounting. */\nexport function thinkingTokenValue(thinking: number | undefined): number {\n return typeof thinking === \"number\" &&\n Number.isFinite(thinking) &&\n thinking > 0\n ? thinking\n : 0;\n}\n\n/** Total metered size of a core message: visible text plus any host-projected\n * thinking payload (CoreMessage.thinkingTokens). Every per-message counting\n * site (range recommendations, block compressedTokens, status reports, context\n * breakdown) goes through this so all surfaces share one caliber. */\nexport function countMessageTokens(\n message: { text?: string; thinkingTokens?: number },\n countTokens: TokenCountFn = defaultCountTokens,\n): number {\n return (\n countTokens(message.text ?? \"\") + thinkingTokenValue(message.thinkingTokens)\n );\n}\n\nexport function estimateTokensFast(text: string): number {\n if (!text) return 0;\n return Math.ceil(text.length / 4);\n}\n\nexport type TokenCountFn = (text: string) => number;\n\nconst BPE_SIZE_GUARD = 100_000;\n\nexport function createBpeTokenizer(): TokenCountFn {\n try {\n const mod = require(\"@anthropic-ai/tokenizer\");\n const bpeCount = mod.countTokens ?? mod.default?.countTokens;\n if (typeof bpeCount !== \"function\") return defaultCountTokens;\n return (text: string) => {\n if (text.length > BPE_SIZE_GUARD) return defaultCountTokens(text);\n try {\n return bpeCount(text);\n } catch {\n return defaultCountTokens(text);\n }\n };\n } catch {\n return defaultCountTokens;\n }\n}\n","/**\n * Compression rule texts — VERBATIM copy from context-compress-algorithms (MIT, ours).\n * These were tuned over months of production use.\n *\n * 2026-09-06 amendment (owner-approved; billion-context-pi#309 incident): write-side\n * quote-fidelity rules merged INTO the tuned text. Verbatim user quotes now require\n * a message ref; recorded task state is labeled as history; unicode written directly.\n * Motivation: session 01a071dc blocks b60/b61 stored a fabricated\n * `user verbatim '合并了 下一个'` as a live \"CURRENT TASK\", causing loop relapses.\n */\n\nexport const COMPRESS_PHILOSOPHY = `Compression Philosophy:\n- All compression serves the primary task, but be frugal.\n- Context capacity is precious. Save context by compressing consumed outputs, not by avoiding tools.\n- Compress by need, not by percentage.\n- Work from summaries, not raw tool outputs. All listed ranges (user prompts, tool outputs, code, logs, exploration, intermediate steps) should be compressed to summary format — the ONLY exceptions are protected content, content the current step is actively using, or critical content you cannot reconstruct.`;\n\nexport const HOW_TO_COMPRESS_RULES = `HOW TO COMPRESS\n\nWhen you call \\`compress\\`, the summary you write becomes the only record of the replaced conversation. Make it self-contained and complete: every user request, experiment purpose, and work task in the range must be accurately captured. A later reader (or you, after decompressing) should be able to continue the task WITHOUT needing the original. The summary records the PAST as of this block's creation: label recorded task state as history (\"TASK AS OF THIS BLOCK: ...\") — never as a live instruction, so a later reader treats it as settled context, not something to re-execute. Write plain text with real unicode characters; never copy \\\\uXXXX escape sequences or JSON-escaped fragments out of tool output.\n\nKEEP VERBATIM — never paraphrase or abbreviate these:\n- Full file paths with line numbers, directory prefix on every mention (\\`lib/hooks.ts:347\\`, \\`src/index.ts:12-18\\`, \\`gatenet_v3/model.py:45\\`). Never abbreviate to a bare filename (\\`hooks.ts\\`, \\`model.py\\`) — they are ambiguous and cannot be grepped or decompressed-to later.\n- Function, class, and type signatures (exact names, params, return types) AND critical code lines that encode logic — the line that IS the finding, not just the function name (e.g. \\`kv_keys += define_gate * a_key[i](emb)\\` is more useful than \"see model_kvnet.py\").\n- Error messages and stack traces (exact text — you need the literal string to grep for it later).\n- Key details from reports and analyses — not just the conclusion. Keep the comparison numbers and the mechanism, not \"X is worse\" alone (write \"1.76× PPL gap because KV store is static\", not \"KVNet underperforms\").\n- Decisions and their rationale (\"chose X over Y because Z\" — the \"because\" is load-bearing; without it the decision looks arbitrary).\n- Constraints discovered (\"must support Node 22\", \"no new dependencies\", \"AGENTS.md forbids \\`as any\\`\").\n- Exact values: versions, config keys, thresholds, magic numbers.\n- User intent — quote short user messages verbatim ONLY WITH their message ref, e.g. \\`User said (m00132): \"ship it tonight\"\\`. Without a verifiable ref, paraphrase (\\`user previously asked (paraphrased): ...\\`) — this is the one exception to the verbatim rule above; never present a reconstructed or half-remembered phrase as a verbatim quote. When the message is too long to quote, preserve intent with extra care: do not change scope, constraints, priorities, acceptance criteria, or requested outcomes. Quotes are historical records, never current directives. Losing these changes the task itself.\n- The user's overall goal and any changes to it — the big-picture objective plus how it evolved during the compressed range. Each summary must reflect the goal as it stood at the end of the range, including pivots (e.g., \"initially: fix bug X → pivoted to: refactor module Y after discovering root cause\"). Losing the goal or its evolution makes all subsequent work appear unmotivated.\n- Purpose behind each significant action — preserve not just what was done but why: the hypothesis behind each experiment, the question behind each exploration, the task goal behind each work action. Without purpose, the summary reads as disconnected technical steps with no through-line.\n- Open questions and unresolved TODOs — losing these changes what work appears to remain.\n- Message refs of key anchors (\\`m00420\\`, \\`m00510–m00520\\`) — they let you or a later reader jump back via decompress to the exact original.\n\nDROP — extract the signal, discard the vessel:\n- Verbose logs (build/test/\\`npm\\` output) once you have captured the error line or the result.\n- Duplicate file reads once the needed content is recorded.\n- Consumed exploration — search hits, agent return values, successful tool outputs — once you have extracted the facts you need (same rule as dead-ends, but nothing went wrong; the content is simply spent).\n- Dead-end exploration — but PRESERVE the lesson in one line: \"tried X, failed because Y\".\n- Back-and-forth discussion and self-corrections once the final position is captured (keep the outcome, drop the journey to it).\n- Repeated status checks (\\`git status\\`, \\`ls\\`) once state is known.\n\nFor each significant item you DROP (scripts, reports, large analyses, long tool outputs), add a one-line CONTENT description of what it covers — not where it lives. Bad: \"probe script at /path/probe_kvnet.py\". Good: \"probe_kvnet.py: tests n-gram baseline, generation quality, long-range dependency, position sensitivity, op pipeline, QUERY attention.\" This lets a later decompress target the right block by relevance, not by guessing locations.\n\nPRIORITY — when the summary must be compact, preserve in this order:\n1. User's overall goal, goal evolution, intent, and hard constraints (losing these changes the task).\n2. Decisions and rationale.\n3. Exact technical artifacts: paths, signatures, errors, values.\n4. Conclusions and key findings.\n5. Lessons learned: what failed and why.\n\nWrite dense, scannable bullets — not narrative prose. If the range spans distinct concerns (request → findings → decision), group bullets under short thematic headers so a reader can scan to the part they need. Every line must earn its place. Do not mimic the style of existing summaries in context; follow these rules.`;\n\nexport const TIER2_DISTILL_RULES = `TIER 2 COMPRESSION — DISTILLATION\n\nYou are compressing historical summaries (not raw conversation). These summaries have already captured the details. Your job is to DISTILL them: extract only what matters for future work, discard the process.\n\nKEEP — these are the only things that survive distillation:\n- Decisions and their rationale (\"chose X over Y because Z\" — the \"because\" is load-bearing).\n- Final outcomes: version numbers shipped, PR numbers merged/closed, bugs fixed or deferred.\n- Key lessons: what failed and why (\"tried X, failed because Y\"). These prevent repeating mistakes.\n- Critical constraints discovered (\"must support Node 22\", \"AGENTS.md forbids as any\").\n- Design decisions with architectural impact (\"chose compress-as-anchor over synthetic messages because prefix cache\").\n- User quotes and task state only as attributed history: keep the source ref with any user quote; never carry a tier-1 \"CURRENT TASK\" claim forward as a live directive — relabel it \"TASK AS OF THIS BLOCK\".\n- Whether content is OBSOLETE or SUPERSEDED — mark with one line: \"[SUPERSEDED by PR #NNN]\" or \"[OBSOLETE: deleted in vX.Y.Z]\". Do NOT keep the obsolete content's details — just the marker and reason.\n- Function/class/type names and module paths that are the SUBJECT of the work — e.g., \"fixed filterCompressedRanges in prune.ts\", \"added SessionStateRegistry in state.ts\". Not exact line numbers or full signatures — just enough to LOCATE the code without searching.\n- Exploration findings: if a block was exploratory with no decision, keep the CONCLUSION in one line (\"explored X, not viable because Y\"). Do not keep the exploration process.\n\nDROP — these were useful during the work but are no longer needed:\n- Exact line numbers, diffs, verbose function signatures, full code listings.\n- Build/deploy process details, test execution steps.\n- Review process details (who reviewed, what rounds, test counts).\n- Verbose logs, command output, intermediate debugging steps.\n\nFORMAT:\n- Start each distilled block with a source header line:\n \\`Source: bN+bM+... (XK→YK tok, Zx). [original topic]\\`\n Example: \\`Source: b5+b7 (56K+44K→268 tok, 375x). [Tool-result recap + publish]\\`\n- 3-5 bullet points per source block, each a self-contained fact.\n- Dense, scannable — no narrative prose.\n- Start with the outcome, not the process: \"v1.13.0 shipped (7 PRs bundled)\" not \"implemented 7 PRs then reviewed then merged\".\n- Cross-block synthesis: if multiple source blocks cover the same topic (same PR, same feature, same bug), MERGE them into a single group of bullets. Do not repeat the same fact from different blocks — keep it once under the most relevant source header.\n\nSIZE TARGET: 50-150 tokens per source block (excluding the header). If you can't fit it in 150 tokens, you're keeping too much process. If a block has nothing worth keeping (pure noise), output just the header followed by \"[no actionable content].\"`;\n\nexport const TIER3_CONDENSE_RULES = `TIER 3 COMPRESSION — ULTRA-CONDENSATION\n\nYou are compressing distilled summaries (Tier 2) into ultra-condensed facts (Tier 3). The distilled summaries already contain only decisions and outcomes. Your job is to reduce them to bare factual references.\n\nPRIORITY — when a source block has more facts than the size target allows, keep in this order:\n1. Shipped outcomes (versions released, PRs merged) — these are permanent record.\n2. Open work (PRs/issues still pending) — these may need follow-up.\n3. Key decisions with architectural impact (\"chose X over Y because Z\").\n4. Critical constraints (\"must support Node 22\").\nDrop everything else. Tier 3 is a lookup index, not a knowledge base.\n\nFORMAT:\n- Start with a source header line:\n \\`Source: bN+bM+... (XK→YK tok, Zx). [original topic]\\`\n- Output 1-3 facts per source block. Each fact is a single line: subject + outcome.\n- No explanations, no rationale, no process — just the fact.\n- Format: \"[PR/Issue/Version] — [outcome in ≤8 words]\"\n- Merge related facts from different source blocks if they concern the same topic.\n\nEXAMPLES:\n- \"v1.13.0 shipped — quality gate + GC fix (7 PRs)\"\n- \"PR #196 merged — preserve-first-user (supersedes #169)\"\n- \"Bug 1214 fixed — compress consumed all user messages\"\n- \"Chose compress-as-anchor — prefix cache benefit over synthetic injection\"\n- \"Constraint: AGENTS.md forbids as any — never suppress types\"\n\nDROP:\n- Multi-sentence context. If a fact needs >1 sentence, it's too detailed for Tier 3.\n- Lessons learned (\"tried X, failed because Y\") — drop UNLESS the failure is likely to recur and the block is <30 days old.\n- Design rationale details — keep the decision, drop the \"because\" unless it's a critical constraint.\n- Anything marked [OBSOLETE] or [SUPERSEDED] — drop entirely, note \"[N blocks obsolete]\" in the summary.\n\nSIZE TARGET: 30-60 tokens per source block (including header). For a batch of N source blocks, total output ≈ N × 40 tokens. If a source block has only one trivial fact, output just the header + one line.`;\n","import {\n COMPRESS_PHILOSOPHY,\n HOW_TO_COMPRESS_RULES,\n TIER2_DISTILL_RULES,\n TIER3_CONDENSE_RULES,\n} from \"./compression-rules.js\";\n\n/**\n * Overridable prompt text consumed by the kernel's nudge renderer and, via the\n * adapter, the system prompt. Every field here is LOAD-BEARING: these rules\n * were tuned over months of production use and are quality-critical. Overriding\n * them can degrade summary quality (loss of paths / signatures / decisions →\n * broken retrieval), so {@link resolvePrompts} requires `{ acknowledgeRisk: true }`.\n *\n * Surface-level text (summary section headers, status-report chrome, tool\n * descriptions) is intentionally NOT part of this interface — it is owned by\n * the adapter or a later \"prompt-set format\" layer and is safe to customize\n * freely. See DESIGN.md for the load-bearing vs surface classification.\n */\nexport interface Prompts {\n /** Core compression philosophy. Embedded in the system prompt + every nudge. */\n compressPhilosophy: string;\n /** Rules the model follows when writing a tier-1 summary. */\n howToCompressRules: string;\n /** Rules for tier-2 distillation of existing summaries. */\n tier2DistillRules: string;\n /** Rules for tier-3 ultra-condensation of distilled summaries. */\n tier3CondenseRules: string;\n}\n\n/**\n * The kernel's canonical prompt values (verbatim from compression-rules.ts).\n * Frozen so a buggy caller cannot mutate the shared singleton and corrupt\n * every other consumer of {@link defaultPrompts}.\n */\nexport const defaultPrompts: Prompts = Object.freeze({\n compressPhilosophy: COMPRESS_PHILOSOPHY,\n howToCompressRules: HOW_TO_COMPRESS_RULES,\n tier2DistillRules: TIER2_DISTILL_RULES,\n tier3CondenseRules: TIER3_CONDENSE_RULES,\n}) as Prompts;\n\nexport interface ResolvePromptsOptions {\n /**\n * Must be `true` to override any prompt field. Every {@link Prompts} field is\n * load-bearing; overriding without acknowledging the quality risk is a\n * programming error and throws.\n */\n acknowledgeRisk?: boolean;\n}\n\n/**\n * Merge prompt overrides onto the kernel defaults. All fields are load-bearing,\n * so ANY override requires `{ acknowledgeRisk: true }`.\n *\n * Only `string`-valued overrides take effect: an explicit `undefined`/`null` or\n * a wrong type is silently dropped (never clobbers a good default), so a\n * malformed partial never degrades the canonical rules. Resolve once at host\n * startup, then pass the resulting {@link Prompts} to {@link renderNudgeText}\n * and to the adapter's system-prompt composition so both layers stay consistent.\n *\n * To keep guidance in the system prompt but drop it from every nudge (hosts that\n * deliver these texts once at startup), do NOT override fields here — that would\n * change both surfaces at once. Pass `{ includeGuidance: false }` to\n * {@link renderNudgeText} instead; the system-prompt path is unaffected by it.\n */\nexport function resolvePrompts(\n overrides?: Partial<Prompts>,\n options: ResolvePromptsOptions = {},\n): Prompts {\n const clean: Partial<Prompts> = {};\n if (overrides) {\n for (const [key, value] of Object.entries(overrides)) {\n if (typeof value === \"string\") {\n (clean as Record<string, unknown>)[key] = value;\n }\n }\n }\n const keys = Object.keys(clean) as (keyof Prompts)[];\n if (keys.length > 0 && !options.acknowledgeRisk) {\n throw new Error(\n `resolvePrompts: overriding compression rules requires { acknowledgeRisk: true }. ` +\n `Overridden keys: ${keys.join(\", \")}. These rules are quality-critical (tuned over months of production use); ` +\n `changing them can degrade summary quality and break retrieval (summaries may lose paths, signatures, decisions).`,\n );\n }\n return { ...defaultPrompts, ...clean };\n}\n","import type { NudgeDecision, CompressibleRange, ProtectedRange, ContextBreakdown, CompressionBlock, BlockSpan } from \"./types.js\";\nimport { defaultPrompts } from \"./prompts.js\";\nimport type { Prompts } from \"./prompts.js\";\n\nexport type NudgeVoice = \"gentle\" | \"emergency\";\n\nexport interface NudgePromptSections {\n efficiencyNote?: string | null;\n emergencyHeader?: string | null;\n t2Guidance?: string | null;\n t3Guidance?: string | null;\n}\n\nexport interface RenderedNudge {\n voice: NudgeVoice;\n text: string;\n}\n\nexport interface RenderNudgeOptions extends NudgePromptSections {\n /**\n * Embed the load-bearing guidance texts (compressPhilosophy, howToCompressRules,\n * and the active tier's distill/condense rules) in the nudge body. Defaults to\n * true, so existing callers render byte-identical output. Set to false when the\n * host already delivers these same texts once via its system prompt or tool\n * descriptions — re-billing them on every injection is pure repetition. Only\n * the four guidance texts are dropped; per-injection dynamic content\n * (breakdown, trigger line, ranges, tier target blocks) survives. An explicit\n * section override above always wins verbatim, independently of this flag.\n */\n includeGuidance?: boolean;\n}\n\nfunction efficiencyNote(prompts: Prompts, sections: NudgePromptSections, includeGuidance: boolean): string | null {\n if (sections.efficiencyNote !== undefined) return sections.efficiencyNote;\n const note = \"This is an efficiency nudge to compress early and keep context lean — not an overflow warning. A separate, stronger alert will appear if the context is actually full.\";\n return includeGuidance ? `${note}\\n\\n${prompts.compressPhilosophy}` : note;\n}\n\nfunction emergencyHeader(prompts: Prompts, sections: NudgePromptSections, includeGuidance: boolean): string | null {\n if (sections.emergencyHeader !== undefined) return sections.emergencyHeader;\n const header = \"⚠️ Context limit reached — compress now. Prioritize consumed tool outputs.\";\n return includeGuidance ? `${header}\\n\\n${prompts.compressPhilosophy}` : header;\n}\n\nfunction formatK(n: number): string {\n if (n >= 1000) return `${(n / 1000).toFixed(1)}K`;\n return `${n}`;\n}\n\nfunction formatBreakdown(bd?: ContextBreakdown): string {\n if (!bd) return \"\";\n const parts: string[] = [];\n if (bd.system > 0) parts.push(`${formatK(bd.system)} system`);\n if (bd.tool > 0) parts.push(`${formatK(bd.tool)} tool`);\n if (bd.summaries > 0) parts.push(`${formatK(bd.summaries)} summaries`);\n if (bd.code > 0) parts.push(`${formatK(bd.code)} code`);\n if (bd.text > 0) parts.push(`${formatK(bd.text)} text`);\n const growth = bd.growth > 0 ? `\\n+${formatK(bd.growth)} since last nudge` : \"\";\n return `Context breakdown: ${parts.join(\" | \")}${growth}`;\n}\n\n\n\nfunction formatTierTargetBlocks(blocks: CompressionBlock[]): string {\n if (blocks.length === 0) {\n return \"Target blocks: (none — no tier blocks found)\";\n }\n const lines = blocks.map((b) => {\n const summaryTokens = Math.ceil((b.summary ?? \"\").length / 4);\n const topic = b.topic ? ` \"${b.topic}\"` : \"\";\n return ` ${b.blockId} ${b.effectiveMessageIds.length} msgs ${formatK(b.compressedTokens)}→${formatK(summaryTokens)}${topic}`;\n });\n return `Target ${blocks[0]!.tier === 1 ? \"tier-1\" : \"tier-2\"} blocks to distill (${blocks.length}):\\n${lines.join(\"\\n\")}`;\n}\n\nconst BLOCK_MAP_MAX_SHOWN = 8;\n\nfunction formatBlockMap(spans: BlockSpan[]): string {\n if (spans.length === 0) return \"\";\n const hidden = Math.max(0, spans.length - BLOCK_MAP_MAX_SHOWN);\n const shown = hidden > 0 ? spans.slice(-BLOCK_MAP_MAX_SHOWN) : spans;\n const items = shown.map(\n (s) => `${s.blockId}=${s.startRef}–${s.endRef}${s.tier > 1 ? ` t${s.tier}` : \"\"}`,\n );\n const prefix = hidden > 0 ? `…+${hidden} older · ` : \"\";\n return `Active blocks (${spans.length}): ${prefix}${items.join(\" · \")}`;\n}\n\nexport function formatRanges(compressible: CompressibleRange[], protectedRanges: ProtectedRange[]): string {\n if (compressible.length === 0 && protectedRanges.length === 0) {\n return \"[No specific ranges detected — compress any consumed content.]\";\n }\n\n // Merge compressible + protected into a single oldest-first list, mirroring\n // opencode-acp's formatCompressibleRanges. Splitting them into two sections\n // lost the time order and hid overlaps; a range can be partly compressible\n // and partly protected, which only the merged view shows correctly.\n interface Merged {\n startRef: string; endRef: string; startNum: number; endNum: number;\n startPos: number; endPos: number;\n count: number; tokens: number; userMsgs: number;\n compressibleTokens: number; compressibleCount: number;\n protectedTokens: number; protectedCount: number; protectedTools: string[];\n toolPct: number; textPct: number; dangerous: boolean;\n }\n const refNum = (ref: string): number => {\n const m = ref.match(/\\d+/);\n return m ? parseInt(m[0], 10) : 0;\n };\n const entries: Merged[] = [];\n for (const r of compressible) {\n entries.push({\n startRef: r.startRef, endRef: r.endRef, startNum: refNum(r.startRef), endNum: refNum(r.endRef),\n startPos: r.startIndex ?? refNum(r.startRef), endPos: r.endIndex ?? refNum(r.endRef),\n count: r.count, tokens: r.tokens, userMsgs: r.userMsgs ?? 0, toolPct: r.toolPct, textPct: r.textPct,\n compressibleTokens: r.tokens, compressibleCount: r.count,\n protectedTokens: 0, protectedCount: 0, protectedTools: [], dangerous: r.dangerous ?? false,\n });\n }\n for (const r of protectedRanges) {\n entries.push({\n startRef: r.startRef, endRef: r.endRef, startNum: refNum(r.startRef), endNum: refNum(r.endRef),\n startPos: r.startIndex ?? refNum(r.startRef), endPos: r.endIndex ?? refNum(r.endRef),\n count: r.count, tokens: r.tokens, userMsgs: 0, toolPct: 0, textPct: 0,\n compressibleTokens: 0, compressibleCount: 0,\n protectedTokens: r.tokens, protectedCount: r.count, protectedTools: [...r.tools], dangerous: false,\n });\n }\n // Order/merge by POSITION, never ref number: refs can be non-monotonic vs array\n // order (subagent interleaving / mid-array summary nodes), and ref-number merging\n // then yields endpoints resolveBoundaries collapses to a tiny slice (#887).\n entries.sort((a, b) => a.startPos - b.startPos || a.startNum - b.startNum);\n // Merge positionally adjacent/overlapping ranges (gap ≤ 1 slot).\n const merged: Merged[] = [];\n for (const e of entries) {\n const last = merged[merged.length - 1];\n if (last && e.startPos <= last.endPos + 1) {\n last.endRef = e.endRef;\n last.endNum = Math.max(last.endNum, e.endNum);\n last.endPos = Math.max(last.endPos, e.endPos);\n last.count += e.count;\n last.tokens += e.tokens;\n last.userMsgs += e.userMsgs;\n last.compressibleTokens += e.compressibleTokens;\n last.compressibleCount += e.compressibleCount;\n last.protectedTokens += e.protectedTokens;\n last.protectedCount += e.protectedCount;\n if (e.dangerous) last.dangerous = true;\n for (const t of e.protectedTools) {\n if (!last.protectedTools.includes(t)) last.protectedTools.push(t);\n }\n } else {\n merged.push({ ...e });\n }\n }\n const userNote = (n: number): string =>\n n > 0 ? ` · ${n} user msg${n > 1 ? \"s\" : \"\"}` : \"\";\n const lines = merged.map((e) => {\n const suffix = e.dangerous && e.compressibleTokens > 0 ? \" ⚠️ NOT recommended unless you are certain.\" : \"\";\n if (e.protectedTokens > 0 && e.compressibleTokens === 0) {\n return ` ${e.startRef}–${e.endRef} ${e.count} msgs ${formatK(e.tokens)} [PROTECTED: ${e.protectedTools.join(\", \")} — not compressible]${suffix}`;\n }\n if (e.protectedTokens > 0 && e.compressibleTokens > 0) {\n return ` ${e.startRef}–${e.endRef} ${e.count} msgs ${formatK(e.tokens)} [${formatK(e.compressibleTokens)} compressible | ${formatK(e.protectedTokens)} protected: ${e.protectedTools.join(\", \")}]${userNote(e.userMsgs)}${suffix}`;\n }\n return ` ${e.startRef}–${e.endRef} ${e.count} msgs ${formatK(e.tokens)} [tool ${e.toolPct}% | text ${e.textPct}%]${userNote(e.userMsgs)}${suffix}`;\n });\n return `Compressible ranges (${merged.length}, oldest first):\\n${lines.join(\"\\n\")}`;\n}\n\nconst DEFAULT_T2_GUIDANCE = `Your tier-1 compression summaries have accumulated. Distill them into a single denser tier-2 summary. Use block IDs as boundaries (startId and endId as bN). Any raw (uncompressed) messages sitting between the boundary blocks are absorbed into the tier-2 block as well — apply HOW TO COMPRESS to those raw messages and the TIER 2 distillation rules to the existing summaries, so the whole span is covered and nothing is lost.`;\n\nconst DEFAULT_T3_GUIDANCE = `Your tier-2 compression summaries have accumulated. Condense them further into a tier-3 ultra-condensed summary. Use block IDs as boundaries (startId and endId as bN). Any raw (uncompressed) messages sitting between the boundary blocks are absorbed into the tier-3 block as well — apply HOW TO COMPRESS to those raw messages and the TIER 3 condensation rules to the existing summaries, so the whole span is covered and nothing is lost.`;\n\nfunction tierGuidance(tier: 2 | 3, sections: NudgePromptSections): string | null {\n const value = tier === 2 ? sections.t2Guidance : sections.t3Guidance;\n if (value !== undefined) return value;\n return tier === 2 ? DEFAULT_T2_GUIDANCE : DEFAULT_T3_GUIDANCE;\n}\n\nfunction compact(parts: string[]): string[] {\n const out: string[] = [];\n let pendingBlank = false;\n for (const p of parts) {\n if (p === \"\") {\n pendingBlank = true;\n continue;\n }\n if (pendingBlank && out.length > 0) out.push(\"\");\n pendingBlank = false;\n out.push(p);\n }\n return out;\n}\n\nexport function renderNudgeText(\n decision: NudgeDecision,\n prompts: Prompts = defaultPrompts,\n options: RenderNudgeOptions = {},\n): RenderedNudge {\n const includeGuidance = options.includeGuidance ?? true;\n const breakdownStr = formatBreakdown(decision.contextBreakdown);\n const rangesStr = formatRanges(decision.compressibleRanges, decision.protectedRanges ?? []);\n const blockMapStr = formatBlockMap(decision.activeBlockSpans ?? []);\n const isEmergency = !!decision.breakdown?.emergencyOverride || !!decision.breakdown?.overLimit;\n\n if (decision.tier !== null && decision.tier >= 2) {\n const isT2 = decision.tier === 2;\n const targets = decision.tierTargetBlocks ?? [];\n const blockList = formatTierTargetBlocks(targets);\n const startId = targets[0]?.blockId ?? \"b1\";\n const endId = targets[targets.length - 1]?.blockId ?? \"b5\";\n const voice: NudgeVoice = isEmergency ? \"emergency\" : \"gentle\";\n const triggerLine = isEmergency\n ? `[EMERGENCY — TIER ${decision.tier} ${isT2 ? \"DISTILLATION\" : \"CONDENSATION\"}] Context limit reached — distill NOW into a denser summary to reclaim tokens.`\n : `[TIER ${decision.tier} ${isT2 ? \"DISTILLATION\" : \"CONDENSATION\"} TRIGGER]`;\n const guidance = tierGuidance(isT2 ? 2 : 3, options);\n const head = efficiencyNote(prompts, options, includeGuidance);\n const parts: string[] = [\n ...(head === null ? [] : [head]),\n \"\",\n breakdownStr,\n \"\",\n triggerLine,\n ...(guidance === null ? [] : [guidance]),\n blockList,\n `Example: compress({ content: [{ startId: \"${startId}\", endId: \"${endId}\", summary: \"...\" }] })`,\n ];\n if (includeGuidance) {\n parts.push(\"\", prompts.howToCompressRules, \"\", isT2 ? prompts.tier2DistillRules : prompts.tier3CondenseRules);\n }\n return { voice, text: compact(parts).join(\"\\n\") };\n }\n\n if (isEmergency) {\n const head = emergencyHeader(prompts, options, includeGuidance);\n const parts: string[] = [\n ...(head === null ? [] : [head]),\n \"\",\n breakdownStr,\n ];\n if (includeGuidance) {\n parts.push(\"\", prompts.howToCompressRules);\n }\n parts.push(\n \"\",\n `{ \"topic\": \"...\", \"content\": [{ \"startId\": \"<ID>\", \"endId\": \"<ID>\", \"summary\": \"...\" }] }`,\n \"Only use IDs from visible messages above. Compress older work first.\",\n \"\",\n rangesStr,\n ...(blockMapStr ? [\"\", blockMapStr] : []),\n );\n return { voice: \"emergency\", text: compact(parts).join(\"\\n\") };\n }\n\n const gentleHead = efficiencyNote(prompts, options, includeGuidance);\n const parts: string[] = [\n ...(gentleHead === null ? [] : [gentleHead]),\n \"\",\n breakdownStr,\n ];\n if (includeGuidance) {\n parts.push(\"\", prompts.howToCompressRules);\n }\n parts.push(\n \"\",\n rangesStr,\n ...(blockMapStr ? [\"\", blockMapStr] : []),\n \"\",\n `💡 Compress all ranges in one call (pass multiple content entries: \\`content: [{...}, {...}]\\`).`,\n );\n return { voice: \"gentle\", text: compact(parts).join(\"\\n\") };\n}\n","/** Minimum size for a compressible range to be worth recommending. Ranges\n * below this are fragmented leftovers (a 16-token ack, a one-line tool\n * result): the model cannot write a meaningful >=50-char summary for them,\n * and a batched compress call that includes one gets atomically rejected\n * (the kernel validates the whole batch). Observed in the wild: a 14-range\n * recommendation list containing a 16-token range → every batch attempt\n * failed with \"Summary too short\". Apply on every surface that recommends\n * ranges: the injected nudge, acp_status, and the /acp panel. */\nexport const VIABLE_RANGE_MIN_TOKENS = 200;\n\nexport function viableRanges<T extends { tokens: number }>(ranges: T[]): T[] {\n return ranges.filter((r) => r.tokens >= VIABLE_RANGE_MIN_TOKENS);\n}\n","// UTF-16-safe truncation. A plain slice can land between the two code units\n// of an astral character (emoji, CJK ext-B+), stranding a lone surrogate:\n// JSON.stringify escapes it (\\ud83e), and gateways that re-encode request\n// bodies to strict UTF-8 then throw UnicodeEncodeError on every retry\n// (ranxianglei/billion-context#816) — a deterministic poison that never heals.\n\nfunction isHighSurrogate(c: number): boolean {\n return c >= 0xd800 && c <= 0xdbff;\n}\n\nfunction isLowSurrogate(c: number): boolean {\n return c >= 0xdc00 && c <= 0xdfff;\n}\n\n/** At most maxUnits code units; never ends on a stranded high surrogate. */\nexport function clampPrefix(text: string, maxUnits: number): string {\n const cut = Math.min(maxUnits, text.length);\n if (cut > 0 && isHighSurrogate(text.charCodeAt(cut - 1))) return text.slice(0, cut - 1);\n return text.slice(0, cut);\n}\n\n/** A [start, end) window with both edges snapped off surrogate pairs. */\nexport function clampWindow(text: string, start: number, end: number): string {\n let s = Math.max(0, Math.min(start, text.length));\n let e = Math.min(text.length, Math.max(s, end));\n if (s > 0 && isLowSurrogate(text.charCodeAt(s))) s += 1;\n if (e > s && isHighSurrogate(text.charCodeAt(e - 1))) e -= 1;\n return text.slice(s, Math.max(s, e));\n}\n"],"mappings":";AAAA,SAAS,qBAAqB;AAE9B,IAAMA,WAAU,cAAc,YAAY,GAAG;AAEtC,SAAS,mBAAmB,MAAsB;AACvD,MAAI,CAAC,KAAM,QAAO;AAIlB,QAAM,MAAM,KAAK,MAAM,4CAA4C;AACnE,QAAM,WAAW,KAAK,UAAU;AAChC,SAAO,WAAW,KAAK,MAAM,KAAK,SAAS,YAAY,CAAC;AAC1D;AASO,SAAS,mBAAmB,UAAsC;AACvE,SAAO,OAAO,aAAa,YACzB,OAAO,SAAS,QAAQ,KACxB,WAAW,IACT,WACA;AACN;AAMO,SAAS,mBACd,SACA,cAA4B,oBACpB;AACR,SACE,YAAY,QAAQ,QAAQ,EAAE,IAAI,mBAAmB,QAAQ,cAAc;AAE/E;AAEO,SAAS,mBAAmB,MAAsB;AACvD,MAAI,CAAC,KAAM,QAAO;AAClB,SAAO,KAAK,KAAK,KAAK,SAAS,CAAC;AAClC;AAIA,IAAM,iBAAiB;AAEhB,SAAS,qBAAmC;AACjD,MAAI;AACF,UAAM,MAAMC,SAAQ,yBAAyB;AAC7C,UAAM,WAAW,IAAI,eAAe,IAAI,SAAS;AACjD,QAAI,OAAO,aAAa,WAAY,QAAO;AAC3C,WAAO,CAAC,SAAiB;AACvB,UAAI,KAAK,SAAS,eAAgB,QAAO,mBAAmB,IAAI;AAChE,UAAI;AACF,eAAO,SAAS,IAAI;AAAA,MACtB,QAAQ;AACN,eAAO,mBAAmB,IAAI;AAAA,MAChC;AAAA,IACF;AAAA,EACF,QAAQ;AACN,WAAO;AAAA,EACT;AACF;;;ACxDO,IAAM,sBAAsB;AAAA;AAAA;AAAA;AAAA;AAM5B,IAAM,wBAAwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAqC9B,IAAM,sBAAsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAgC5B,IAAM,uBAAuB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;ACnD7B,IAAM,iBAA0B,OAAO,OAAO;AAAA,EACnD,oBAAoB;AAAA,EACpB,oBAAoB;AAAA,EACpB,mBAAmB;AAAA,EACnB,oBAAoB;AACtB,CAAC;AA0BM,SAAS,eACd,WACA,UAAiC,CAAC,GACzB;AACT,QAAM,QAA0B,CAAC;AACjC,MAAI,WAAW;AACb,eAAW,CAAC,KAAK,KAAK,KAAK,OAAO,QAAQ,SAAS,GAAG;AACpD,UAAI,OAAO,UAAU,UAAU;AAC7B,QAAC,MAAkC,GAAG,IAAI;AAAA,MAC5C;AAAA,IACF;AAAA,EACF;AACA,QAAM,OAAO,OAAO,KAAK,KAAK;AAC9B,MAAI,KAAK,SAAS,KAAK,CAAC,QAAQ,iBAAiB;AAC/C,UAAM,IAAI;AAAA,MACR,qGACsB,KAAK,KAAK,IAAI,CAAC;AAAA,IAEvC;AAAA,EACF;AACA,SAAO,EAAE,GAAG,gBAAgB,GAAG,MAAM;AACvC;;;ACvDA,SAAS,eAAe,SAAkB,UAA+B,iBAAyC;AAChH,MAAI,SAAS,mBAAmB,OAAW,QAAO,SAAS;AAC3D,QAAM,OAAO;AACb,SAAO,kBAAkB,GAAG,IAAI;AAAA;AAAA,EAAO,QAAQ,kBAAkB,KAAK;AACxE;AAEA,SAAS,gBAAgB,SAAkB,UAA+B,iBAAyC;AACjH,MAAI,SAAS,oBAAoB,OAAW,QAAO,SAAS;AAC5D,QAAM,SAAS;AACf,SAAO,kBAAkB,GAAG,MAAM;AAAA;AAAA,EAAO,QAAQ,kBAAkB,KAAK;AAC1E;AAEA,SAAS,QAAQ,GAAmB;AAClC,MAAI,KAAK,IAAM,QAAO,IAAI,IAAI,KAAM,QAAQ,CAAC,CAAC;AAC9C,SAAO,GAAG,CAAC;AACb;AAEA,SAAS,gBAAgB,IAA+B;AACtD,MAAI,CAAC,GAAI,QAAO;AAChB,QAAM,QAAkB,CAAC;AACzB,MAAI,GAAG,SAAS,EAAG,OAAM,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC,SAAS;AAC5D,MAAI,GAAG,OAAO,EAAG,OAAM,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,OAAO;AACtD,MAAI,GAAG,YAAY,EAAG,OAAM,KAAK,GAAG,QAAQ,GAAG,SAAS,CAAC,YAAY;AACrE,MAAI,GAAG,OAAO,EAAG,OAAM,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,OAAO;AACtD,MAAI,GAAG,OAAO,EAAG,OAAM,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,OAAO;AACtD,QAAM,SAAS,GAAG,SAAS,IAAI;AAAA,GAAM,QAAQ,GAAG,MAAM,CAAC,sBAAsB;AAC7E,SAAO,sBAAsB,MAAM,KAAK,KAAK,CAAC,GAAG,MAAM;AACzD;AAIA,SAAS,uBAAuB,QAAoC;AAClE,MAAI,OAAO,WAAW,GAAG;AACvB,WAAO;AAAA,EACT;AACA,QAAM,QAAQ,OAAO,IAAI,CAAC,MAAM;AAC9B,UAAM,gBAAgB,KAAK,MAAM,EAAE,WAAW,IAAI,SAAS,CAAC;AAC5D,UAAM,QAAQ,EAAE,QAAQ,MAAM,EAAE,KAAK,MAAM;AAC3C,WAAO,KAAK,EAAE,OAAO,KAAK,EAAE,oBAAoB,MAAM,UAAU,QAAQ,EAAE,gBAAgB,CAAC,SAAI,QAAQ,aAAa,CAAC,GAAG,KAAK;AAAA,EAC/H,CAAC;AACD,SAAO,UAAU,OAAO,CAAC,EAAG,SAAS,IAAI,WAAW,QAAQ,uBAAuB,OAAO,MAAM;AAAA,EAAO,MAAM,KAAK,IAAI,CAAC;AACzH;AAEA,IAAM,sBAAsB;AAE5B,SAAS,eAAe,OAA4B;AAClD,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAM,SAAS,KAAK,IAAI,GAAG,MAAM,SAAS,mBAAmB;AAC7D,QAAM,QAAQ,SAAS,IAAI,MAAM,MAAM,CAAC,mBAAmB,IAAI;AAC/D,QAAM,QAAQ,MAAM;AAAA,IAClB,CAAC,MAAM,GAAG,EAAE,OAAO,IAAI,EAAE,QAAQ,SAAI,EAAE,MAAM,GAAG,EAAE,OAAO,IAAI,KAAK,EAAE,IAAI,KAAK,EAAE;AAAA,EACjF;AACA,QAAM,SAAS,SAAS,IAAI,UAAK,MAAM,iBAAc;AACrD,SAAO,kBAAkB,MAAM,MAAM,MAAM,MAAM,GAAG,MAAM,KAAK,QAAK,CAAC;AACvE;AAEO,SAAS,aAAa,cAAmC,iBAA2C;AACzG,MAAI,aAAa,WAAW,KAAK,gBAAgB,WAAW,GAAG;AAC7D,WAAO;AAAA,EACT;AAcA,QAAM,SAAS,CAAC,QAAwB;AACtC,UAAM,IAAI,IAAI,MAAM,KAAK;AACzB,WAAO,IAAI,SAAS,EAAE,CAAC,GAAG,EAAE,IAAI;AAAA,EAClC;AACA,QAAM,UAAoB,CAAC;AAC3B,aAAW,KAAK,cAAc;AAC5B,YAAQ,KAAK;AAAA,MACX,UAAU,EAAE;AAAA,MAAU,QAAQ,EAAE;AAAA,MAAQ,UAAU,OAAO,EAAE,QAAQ;AAAA,MAAG,QAAQ,OAAO,EAAE,MAAM;AAAA,MAC7F,UAAU,EAAE,cAAc,OAAO,EAAE,QAAQ;AAAA,MAAG,QAAQ,EAAE,YAAY,OAAO,EAAE,MAAM;AAAA,MACnF,OAAO,EAAE;AAAA,MAAO,QAAQ,EAAE;AAAA,MAAQ,UAAU,EAAE,YAAY;AAAA,MAAG,SAAS,EAAE;AAAA,MAAS,SAAS,EAAE;AAAA,MAC5F,oBAAoB,EAAE;AAAA,MAAQ,mBAAmB,EAAE;AAAA,MACnD,iBAAiB;AAAA,MAAG,gBAAgB;AAAA,MAAG,gBAAgB,CAAC;AAAA,MAAG,WAAW,EAAE,aAAa;AAAA,IACvF,CAAC;AAAA,EACH;AACA,aAAW,KAAK,iBAAiB;AAC/B,YAAQ,KAAK;AAAA,MACX,UAAU,EAAE;AAAA,MAAU,QAAQ,EAAE;AAAA,MAAQ,UAAU,OAAO,EAAE,QAAQ;AAAA,MAAG,QAAQ,OAAO,EAAE,MAAM;AAAA,MAC7F,UAAU,EAAE,cAAc,OAAO,EAAE,QAAQ;AAAA,MAAG,QAAQ,EAAE,YAAY,OAAO,EAAE,MAAM;AAAA,MACnF,OAAO,EAAE;AAAA,MAAO,QAAQ,EAAE;AAAA,MAAQ,UAAU;AAAA,MAAG,SAAS;AAAA,MAAG,SAAS;AAAA,MACpE,oBAAoB;AAAA,MAAG,mBAAmB;AAAA,MAC1C,iBAAiB,EAAE;AAAA,MAAQ,gBAAgB,EAAE;AAAA,MAAO,gBAAgB,CAAC,GAAG,EAAE,KAAK;AAAA,MAAG,WAAW;AAAA,IAC/F,CAAC;AAAA,EACH;AAIA,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,QAAQ;AAEzE,QAAM,SAAmB,CAAC;AAC1B,aAAW,KAAK,SAAS;AACvB,UAAM,OAAO,OAAO,OAAO,SAAS,CAAC;AACrC,QAAI,QAAQ,EAAE,YAAY,KAAK,SAAS,GAAG;AACzC,WAAK,SAAS,EAAE;AAChB,WAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,EAAE,MAAM;AAC5C,WAAK,SAAS,KAAK,IAAI,KAAK,QAAQ,EAAE,MAAM;AAC5C,WAAK,SAAS,EAAE;AAChB,WAAK,UAAU,EAAE;AACjB,WAAK,YAAY,EAAE;AACnB,WAAK,sBAAsB,EAAE;AAC7B,WAAK,qBAAqB,EAAE;AAC5B,WAAK,mBAAmB,EAAE;AAC1B,WAAK,kBAAkB,EAAE;AACzB,UAAI,EAAE,UAAW,MAAK,YAAY;AAClC,iBAAW,KAAK,EAAE,gBAAgB;AAChC,YAAI,CAAC,KAAK,eAAe,SAAS,CAAC,EAAG,MAAK,eAAe,KAAK,CAAC;AAAA,MAClE;AAAA,IACF,OAAO;AACL,aAAO,KAAK,EAAE,GAAG,EAAE,CAAC;AAAA,IACtB;AAAA,EACF;AACA,QAAM,WAAW,CAAC,MAChB,IAAI,IAAI,SAAM,CAAC,YAAY,IAAI,IAAI,MAAM,EAAE,KAAK;AAClD,QAAM,QAAQ,OAAO,IAAI,CAAC,MAAM;AAC9B,UAAM,SAAS,EAAE,aAAa,EAAE,qBAAqB,IAAI,2DAAiD;AAC1G,QAAI,EAAE,kBAAkB,KAAK,EAAE,uBAAuB,GAAG;AACvD,aAAO,KAAK,EAAE,QAAQ,SAAI,EAAE,MAAM,KAAK,EAAE,KAAK,UAAU,QAAQ,EAAE,MAAM,CAAC,gBAAgB,EAAE,eAAe,KAAK,IAAI,CAAC,4BAAuB,MAAM;AAAA,IACnJ;AACA,QAAI,EAAE,kBAAkB,KAAK,EAAE,qBAAqB,GAAG;AACrD,aAAO,KAAK,EAAE,QAAQ,SAAI,EAAE,MAAM,KAAK,EAAE,KAAK,UAAU,QAAQ,EAAE,MAAM,CAAC,KAAK,QAAQ,EAAE,kBAAkB,CAAC,mBAAmB,QAAQ,EAAE,eAAe,CAAC,eAAe,EAAE,eAAe,KAAK,IAAI,CAAC,IAAI,SAAS,EAAE,QAAQ,CAAC,GAAG,MAAM;AAAA,IACrO;AACA,WAAO,KAAK,EAAE,QAAQ,SAAI,EAAE,MAAM,KAAK,EAAE,KAAK,UAAU,QAAQ,EAAE,MAAM,CAAC,UAAU,EAAE,OAAO,YAAY,EAAE,OAAO,KAAK,SAAS,EAAE,QAAQ,CAAC,GAAG,MAAM;AAAA,EACrJ,CAAC;AACD,SAAO,wBAAwB,OAAO,MAAM;AAAA,EAAqB,MAAM,KAAK,IAAI,CAAC;AACnF;AAEA,IAAM,sBAAsB;AAE5B,IAAM,sBAAsB;AAE5B,SAAS,aAAa,MAAa,UAA8C;AAC/E,QAAM,QAAQ,SAAS,IAAI,SAAS,aAAa,SAAS;AAC1D,MAAI,UAAU,OAAW,QAAO;AAChC,SAAO,SAAS,IAAI,sBAAsB;AAC5C;AAEA,SAAS,QAAQ,OAA2B;AAC1C,QAAM,MAAgB,CAAC;AACvB,MAAI,eAAe;AACnB,aAAW,KAAK,OAAO;AACrB,QAAI,MAAM,IAAI;AACZ,qBAAe;AACf;AAAA,IACF;AACA,QAAI,gBAAgB,IAAI,SAAS,EAAG,KAAI,KAAK,EAAE;AAC/C,mBAAe;AACf,QAAI,KAAK,CAAC;AAAA,EACZ;AACA,SAAO;AACT;AAEO,SAAS,gBACd,UACA,UAAmB,gBACnB,UAA8B,CAAC,GAChB;AACf,QAAM,kBAAkB,QAAQ,mBAAmB;AACnD,QAAM,eAAe,gBAAgB,SAAS,gBAAgB;AAC9D,QAAM,YAAY,aAAa,SAAS,oBAAoB,SAAS,mBAAmB,CAAC,CAAC;AAC1F,QAAM,cAAc,eAAe,SAAS,oBAAoB,CAAC,CAAC;AAClE,QAAM,cAAc,CAAC,CAAC,SAAS,WAAW,qBAAqB,CAAC,CAAC,SAAS,WAAW;AAErF,MAAI,SAAS,SAAS,QAAQ,SAAS,QAAQ,GAAG;AAChD,UAAM,OAAO,SAAS,SAAS;AAC/B,UAAM,UAAU,SAAS,oBAAoB,CAAC;AAC9C,UAAM,YAAY,uBAAuB,OAAO;AAChD,UAAM,UAAU,QAAQ,CAAC,GAAG,WAAW;AACvC,UAAM,QAAQ,QAAQ,QAAQ,SAAS,CAAC,GAAG,WAAW;AACtD,UAAM,QAAoB,cAAc,cAAc;AACtD,UAAM,cAAc,cAChB,0BAAqB,SAAS,IAAI,IAAI,OAAO,iBAAiB,cAAc,wFAC5E,SAAS,SAAS,IAAI,IAAI,OAAO,iBAAiB,cAAc;AACpE,UAAM,WAAW,aAAa,OAAO,IAAI,GAAG,OAAO;AACnD,UAAM,OAAO,eAAe,SAAS,SAAS,eAAe;AAC7D,UAAMC,SAAkB;AAAA,MACtB,GAAI,SAAS,OAAO,CAAC,IAAI,CAAC,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,aAAa,OAAO,CAAC,IAAI,CAAC,QAAQ;AAAA,MACtC;AAAA,MACA,6CAA6C,OAAO,cAAc,KAAK;AAAA,IACzE;AACA,QAAI,iBAAiB;AACnB,MAAAA,OAAM,KAAK,IAAI,QAAQ,oBAAoB,IAAI,OAAO,QAAQ,oBAAoB,QAAQ,kBAAkB;AAAA,IAC9G;AACA,WAAO,EAAE,OAAO,MAAM,QAAQA,MAAK,EAAE,KAAK,IAAI,EAAE;AAAA,EAClD;AAEA,MAAI,aAAa;AACf,UAAM,OAAO,gBAAgB,SAAS,SAAS,eAAe;AAC9D,UAAMA,SAAkB;AAAA,MACtB,GAAI,SAAS,OAAO,CAAC,IAAI,CAAC,IAAI;AAAA,MAC9B;AAAA,MACA;AAAA,IACF;AACA,QAAI,iBAAiB;AACnB,MAAAA,OAAM,KAAK,IAAI,QAAQ,kBAAkB;AAAA,IAC3C;AACA,IAAAA,OAAM;AAAA,MACJ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,GAAI,cAAc,CAAC,IAAI,WAAW,IAAI,CAAC;AAAA,IACzC;AACA,WAAO,EAAE,OAAO,aAAa,MAAM,QAAQA,MAAK,EAAE,KAAK,IAAI,EAAE;AAAA,EAC/D;AAEA,QAAM,aAAa,eAAe,SAAS,SAAS,eAAe;AACnE,QAAM,QAAkB;AAAA,IACtB,GAAI,eAAe,OAAO,CAAC,IAAI,CAAC,UAAU;AAAA,IAC1C;AAAA,IACA;AAAA,EACF;AACA,MAAI,iBAAiB;AACnB,UAAM,KAAK,IAAI,QAAQ,kBAAkB;AAAA,EAC3C;AACA,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA,GAAI,cAAc,CAAC,IAAI,WAAW,IAAI,CAAC;AAAA,IACvC;AAAA,IACA;AAAA,EACF;AACA,SAAO,EAAE,OAAO,UAAU,MAAM,QAAQ,KAAK,EAAE,KAAK,IAAI,EAAE;AAC5D;;;ACxQO,IAAM,0BAA0B;AAEhC,SAAS,aAA2C,QAAkB;AAC3E,SAAO,OAAO,OAAO,CAAC,MAAM,EAAE,UAAU,uBAAuB;AACjE;;;ACNA,SAAS,gBAAgB,GAAoB;AACzC,SAAO,KAAK,SAAU,KAAK;AAC/B;AAEA,SAAS,eAAe,GAAoB;AACxC,SAAO,KAAK,SAAU,KAAK;AAC/B;AAGO,SAAS,YAAY,MAAc,UAA0B;AAChE,QAAM,MAAM,KAAK,IAAI,UAAU,KAAK,MAAM;AAC1C,MAAI,MAAM,KAAK,gBAAgB,KAAK,WAAW,MAAM,CAAC,CAAC,EAAG,QAAO,KAAK,MAAM,GAAG,MAAM,CAAC;AACtF,SAAO,KAAK,MAAM,GAAG,GAAG;AAC5B;AAGO,SAAS,YAAY,MAAc,OAAe,KAAqB;AAC1E,MAAI,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,KAAK,MAAM,CAAC;AAChD,MAAI,IAAI,KAAK,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG,GAAG,CAAC;AAC9C,MAAI,IAAI,KAAK,eAAe,KAAK,WAAW,CAAC,CAAC,EAAG,MAAK;AACtD,MAAI,IAAI,KAAK,gBAAgB,KAAK,WAAW,IAAI,CAAC,CAAC,EAAG,MAAK;AAC3D,SAAO,KAAK,MAAM,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;AACvC;","names":["require","require","parts"]}
|
package/dist/index.d.ts
CHANGED
|
@@ -5,13 +5,13 @@ export { createInitialState, allocateBlockId, allocateRunId, blockById, activeBl
|
|
|
5
5
|
export { defaultConfig, validateConfig } from "./config.js";
|
|
6
6
|
export * from "./compress-tools.js";
|
|
7
7
|
export { assignRefs, highestUsedIndex, emptyRefMap, indexToRef, refToIndex, refForRaw, rawForRef, BLOCKED_REF, } from "./refs.js";
|
|
8
|
-
export { prune,
|
|
8
|
+
export { prune, SUMMARY_HEADER, summaryMessageId, isSummaryMessageId, isRenderedSummaryMessage, } from "./prune.js";
|
|
9
9
|
export { syncBlocks } from "./sync.js";
|
|
10
10
|
export { resolveBoundaries, parseBoundary, BoundaryNotFoundError, visibleBlockAnchor, blockVisibleInRange, } from "./boundaries.js";
|
|
11
11
|
export { defaultCountTokens, estimateTokensFast, createBpeTokenizer, countMessageTokens, } from "./tokenize.js";
|
|
12
12
|
export type { TokenCountFn } from "./tokenize.js";
|
|
13
13
|
export { renderNudgeText, formatRanges } from "./nudge-text.js";
|
|
14
|
-
export type { NudgeVoice, RenderedNudge, NudgePromptSections, } from "./nudge-text.js";
|
|
14
|
+
export type { NudgeVoice, RenderedNudge, NudgePromptSections, RenderNudgeOptions, } from "./nudge-text.js";
|
|
15
15
|
export { resolveBlockSpan, activeBlockSpans, formatCreatedBlocks, } from "./block-map.js";
|
|
16
16
|
export { COMPRESS_PHILOSOPHY, HOW_TO_COMPRESS_RULES, TIER2_DISTILL_RULES, TIER3_CONDENSE_RULES, } from "./compression-rules.js";
|
|
17
17
|
export { defaultPrompts, resolvePrompts } from "./prompts.js";
|
package/dist/index.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,YAAY,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,GAChB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5D,cAAc,qBAAqB,CAAC;AACpC,OAAO,EACL,UAAU,EACV,gBAAgB,EAChB,WAAW,EACX,UAAU,EACV,UAAU,EACV,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,WAAW,CAAC;AACnB,OAAO,EACL,KAAK,EACL,
|
|
1
|
+
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,YAAY,EACV,KAAK,EACL,eAAe,EACf,gBAAgB,EAChB,qBAAqB,GACtB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,kBAAkB,EAClB,eAAe,EACf,aAAa,EACb,SAAS,EACT,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,GAChB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5D,cAAc,qBAAqB,CAAC;AACpC,OAAO,EACL,UAAU,EACV,gBAAgB,EAChB,WAAW,EACX,UAAU,EACV,UAAU,EACV,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,WAAW,CAAC;AACnB,OAAO,EACL,KAAK,EACL,cAAc,EACd,gBAAgB,EAChB,kBAAkB,EAClB,wBAAwB,GACzB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACvC,OAAO,EACL,iBAAiB,EACjB,aAAa,EACb,qBAAqB,EACrB,kBAAkB,EAClB,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,eAAe,CAAC;AACvB,YAAY,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAChE,YAAY,EACV,UAAU,EACV,aAAa,EACb,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,mBAAmB,EACnB,qBAAqB,EACrB,mBAAmB,EACnB,oBAAoB,GACrB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9D,YAAY,EAAE,OAAO,EAAE,qBAAqB,EAAE,MAAM,cAAc,CAAC;AACnE,OAAO,EACL,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,GACtB,MAAM,qBAAqB,CAAC;AAC7B,YAAY,EACV,eAAe,EACf,sBAAsB,EACtB,mBAAmB,EACnB,WAAW,EACX,WAAW,GACZ,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,WAAW,EACX,QAAQ,EACR,oBAAoB,EACpB,aAAa,EACb,mBAAmB,EACnB,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,cAAc,EACd,WAAW,EACX,IAAI,EACJ,UAAU,EACV,YAAY,GACb,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,YAAY,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC3E,OAAO,EACL,eAAe,EACf,6BAA6B,EAC7B,kBAAkB,EAClB,eAAe,EACf,2BAA2B,EAC3B,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AACzB,YAAY,EACV,iBAAiB,EACjB,sBAAsB,EACtB,qBAAqB,GACtB,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC5D,YAAY,EAAE,mBAAmB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AACzE,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,eAAe,EACf,iBAAiB,EACjB,sBAAsB,GACvB,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EACV,WAAW,EACX,SAAS,EACT,kBAAkB,EAClB,YAAY,EACZ,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,gBAAgB,EAChB,eAAe,EACf,kBAAkB,EAClB,WAAW,EACX,wBAAwB,GACzB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC1E,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAChF,OAAO,EAAE,yBAAyB,EAAE,MAAM,oBAAoB,CAAC;AAC/D,YAAY,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,kBAAkB,GACnB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACL,oBAAoB,EACpB,qBAAqB,EACrB,mBAAmB,EACnB,iBAAiB,EACjB,uBAAuB,EACvB,iBAAiB,EACjB,oBAAoB,EACpB,mBAAmB,EACnB,gBAAgB,EAChB,WAAW,GACZ,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,WAAW,EACX,aAAa,EACb,YAAY,EACZ,yBAAyB,GAC1B,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,cAAc,EACd,mBAAmB,EACnB,kBAAkB,EAClB,SAAS,EACT,cAAc,EACd,iBAAiB,EACjB,OAAO,EACP,UAAU,EACV,UAAU,EACV,oBAAoB,EACpB,eAAe,GAChB,MAAM,YAAY,CAAC;AACpB,YAAY,EACV,UAAU,EACV,aAAa,EACb,gBAAgB,EAChB,gBAAgB,GACjB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,uBAAuB,EAAE,MAAM,cAAc,CAAC;AACvD,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAChE,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,YAAY,EACV,wBAAwB,EACxB,iBAAiB,EACjB,mBAAmB,GACpB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,oBAAoB,GACrB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AACvD,OAAO,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACjE,YAAY,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EACL,YAAY,EACZ,iBAAiB,EACjB,SAAS,EACT,WAAW,GACZ,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,gBAAgB,EAChB,YAAY,EACZ,WAAW,EACX,cAAc,GACf,MAAM,aAAa,CAAC;AACrB,YAAY,EACV,YAAY,EACZ,aAAa,EACb,eAAe,EACf,oBAAoB,EACpB,kBAAkB,EAClB,SAAS,EACT,aAAa,EACb,WAAW,EACX,WAAW,EACX,WAAW,EACX,YAAY,GACb,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,iBAAiB,EACjB,oBAAoB,EACpB,uBAAuB,EACvB,kBAAkB,EAClB,oBAAoB,GACrB,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,sBAAsB,EACtB,wBAAwB,EACxB,kBAAkB,EAClB,gBAAgB,EAChB,KAAK,eAAe,GACrB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACL,WAAW,EACX,MAAM,EACN,KAAK,YAAY,EACjB,KAAK,eAAe,EACpB,KAAK,MAAM,EACX,KAAK,WAAW,GACjB,MAAM,eAAe,CAAC;AACvB,cAAc,mBAAmB,CAAC;AAElC,OAAO,EAAE,uBAAuB,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC"}
|
package/dist/index.js
CHANGED
|
@@ -16,7 +16,7 @@ import {
|
|
|
16
16
|
resolvePrompts,
|
|
17
17
|
thinkingTokenValue,
|
|
18
18
|
viableRanges
|
|
19
|
-
} from "./chunk-
|
|
19
|
+
} from "./chunk-L6QNVRC3.js";
|
|
20
20
|
import {
|
|
21
21
|
activeBlocks,
|
|
22
22
|
advanceSurvival,
|
|
@@ -111,45 +111,33 @@ function summaryMessageId(blockId) {
|
|
|
111
111
|
function isSummaryMessageId(id) {
|
|
112
112
|
return id.startsWith(SUMMARY_ID_PREFIX);
|
|
113
113
|
}
|
|
114
|
-
function baseIdOf(id) {
|
|
115
|
-
const hash = id.indexOf("#");
|
|
116
|
-
return hash > 0 ? id.substring(0, hash) : id;
|
|
117
|
-
}
|
|
118
|
-
function isCovered(id, coveredBases) {
|
|
119
|
-
return coveredBases.has(baseIdOf(id));
|
|
120
|
-
}
|
|
121
114
|
function isRenderedSummaryMessage(message) {
|
|
122
115
|
return isSummaryMessageId(message.id) && message.role === "system" && message.contentType === "text";
|
|
123
116
|
}
|
|
124
117
|
function prune(messages, state, options = {}) {
|
|
125
118
|
const covered = coveredMessageIds(state);
|
|
126
119
|
if (covered.size === 0) return [...messages];
|
|
127
|
-
const coveredBases = /* @__PURE__ */ new Set();
|
|
128
|
-
for (const id of covered) coveredBases.add(baseIdOf(id));
|
|
129
120
|
const inject = options.injectSummaries ?? true;
|
|
130
121
|
const firstUserIndex = messages.findIndex(
|
|
131
122
|
(message) => message.role === "user"
|
|
132
123
|
);
|
|
133
|
-
const
|
|
124
|
+
const indexById = /* @__PURE__ */ new Map();
|
|
134
125
|
const summaryIndexById = /* @__PURE__ */ new Map();
|
|
135
126
|
messages.forEach((message, index) => {
|
|
136
|
-
|
|
137
|
-
const existing = baseIndexById.get(base);
|
|
138
|
-
if (existing === void 0 || index < existing)
|
|
139
|
-
baseIndexById.set(base, index);
|
|
127
|
+
indexById.set(message.id, index);
|
|
140
128
|
if (isRenderedSummaryMessage(message))
|
|
141
129
|
summaryIndexById.set(message.id, index);
|
|
142
130
|
});
|
|
143
|
-
const anchors = inject ? collectSummaryAnchors(state,
|
|
131
|
+
const anchors = inject ? collectSummaryAnchors(state, indexById, summaryIndexById) : [];
|
|
144
132
|
return stripOrphanedReasoning(
|
|
145
133
|
stripOrphanedToolResults(
|
|
146
134
|
stripOrphanedToolCalls(
|
|
147
|
-
rebuildMessages(messages,
|
|
135
|
+
rebuildMessages(messages, covered, firstUserIndex, anchors)
|
|
148
136
|
)
|
|
149
137
|
)
|
|
150
138
|
);
|
|
151
139
|
}
|
|
152
|
-
function collectSummaryAnchors(state,
|
|
140
|
+
function collectSummaryAnchors(state, indexById, summaryIndexById) {
|
|
153
141
|
const anchors = [];
|
|
154
142
|
for (const block of activeBlocks(state)) {
|
|
155
143
|
const existingIndex = summaryIndexById.get(summaryMessageId(block.blockId));
|
|
@@ -164,7 +152,7 @@ function collectSummaryAnchors(state, baseIndexById, summaryIndexById) {
|
|
|
164
152
|
}
|
|
165
153
|
let earliest = null;
|
|
166
154
|
for (const id of block.effectiveMessageIds) {
|
|
167
|
-
const index =
|
|
155
|
+
const index = indexById.get(id);
|
|
168
156
|
if (index !== void 0 && (earliest === null || index < earliest)) {
|
|
169
157
|
earliest = index;
|
|
170
158
|
}
|
|
@@ -209,7 +197,7 @@ function pairSafeAnchorIndex(messages, index) {
|
|
|
209
197
|
}
|
|
210
198
|
return safe;
|
|
211
199
|
}
|
|
212
|
-
function rebuildMessages(messages,
|
|
200
|
+
function rebuildMessages(messages, covered, firstUserIndex, anchors) {
|
|
213
201
|
const safeAnchors = anchors.map((anchor) => ({
|
|
214
202
|
...anchor,
|
|
215
203
|
insertAt: pairSafeAnchorIndex(messages, anchor.insertAt)
|
|
@@ -227,7 +215,7 @@ function rebuildMessages(messages, coveredBases, firstUserIndex, anchors) {
|
|
|
227
215
|
result.push(messages[index]);
|
|
228
216
|
continue;
|
|
229
217
|
}
|
|
230
|
-
if (
|
|
218
|
+
if (covered.has(messages[index].id)) continue;
|
|
231
219
|
if (isRenderedSummaryMessage(messages[index]) && anchoredSummaryIds.has(messages[index].id))
|
|
232
220
|
continue;
|
|
233
221
|
result.push(messages[index]);
|
|
@@ -293,8 +281,6 @@ function stripOrphanedReasoning(messages) {
|
|
|
293
281
|
// src/sync.ts
|
|
294
282
|
function syncBlocks(messages, state) {
|
|
295
283
|
const presentIds = new Set(messages.map((message) => message.id));
|
|
296
|
-
const presentBases = /* @__PURE__ */ new Set();
|
|
297
|
-
for (const message of messages) presentBases.add(baseIdOf(message.id));
|
|
298
284
|
const deactivated = [];
|
|
299
285
|
const result = {
|
|
300
286
|
blocks: state.blocks.map((block) => ({
|
|
@@ -344,7 +330,7 @@ function syncBlocks(messages, state) {
|
|
|
344
330
|
continue;
|
|
345
331
|
}
|
|
346
332
|
block.active = true;
|
|
347
|
-
const stillPresent = block.effectiveMessageIds.some((id) =>
|
|
333
|
+
const stillPresent = block.effectiveMessageIds.some((id) => presentIds.has(id)) || presentIds.has(summaryMessageId(block.blockId));
|
|
348
334
|
if (!stillPresent) {
|
|
349
335
|
block.active = false;
|
|
350
336
|
deactivated.push(block.blockId);
|
|
@@ -5714,7 +5700,6 @@ export {
|
|
|
5714
5700
|
applyMessageFilters,
|
|
5715
5701
|
applySectionOverrides,
|
|
5716
5702
|
assignRefs,
|
|
5717
|
-
baseIdOf,
|
|
5718
5703
|
blockById,
|
|
5719
5704
|
blockDocs,
|
|
5720
5705
|
blockVisibleInRange,
|
|
@@ -5769,7 +5754,6 @@ export {
|
|
|
5769
5754
|
highestUsedIndex,
|
|
5770
5755
|
indexToRef,
|
|
5771
5756
|
isAbsorbCandidate,
|
|
5772
|
-
isCovered,
|
|
5773
5757
|
isMessageLatestProtected,
|
|
5774
5758
|
isMessageProtected,
|
|
5775
5759
|
isRenderedSummaryMessage,
|