@tangle-network/agent-runtime 0.193.1 → 0.194.0

package/dist/util-mCNUeboW.js

@@ -1,419 +0,0 @@
-//#region src/runtime/util.ts
-/**
-* Best-effort sandbox delete. Skips instances without a `delete` (test fakes);
-* swallows errors (the platform reaps on expiry). Returns `false` when delete
-* threw, `true` otherwise, so callers can surface a leak if they choose.
-*/
-async function deleteBoxSafe(box) {
-	if (!box || typeof box.delete !== "function") return true;
-	try {
-		await box.delete();
-		return true;
-	} catch {
-		return false;
-	}
-}
-/** Short base36 id for trace correlation. Not cryptographic, not collision-free. */
-function randomSuffix(len = 8) {
-	return Math.random().toString(36).slice(2, 2 + len);
-}
-/** Collision-resistant id for sandbox naming (find-by-name recovery must be unique). */
-function randomUuid() {
-	return crypto.randomUUID();
-}
-/** Construct an AbortError. Downstream code pattern-matches on `err.name`. */
-function abortError() {
-	const err = /* @__PURE__ */ new Error("aborted");
-	err.name = "AbortError";
-	return err;
-}
-/** Throw an AbortError. */
-function throwAbort() {
-	throw abortError();
-}
-/** Throw if the signal is already aborted; otherwise no-op. */
-function throwIfAborted(signal) {
-	if (signal?.aborted) throw abortError();
-}
-/** True for any error whose `name` is `AbortError` (the cross-kernel abort contract). */
-function isAbortError(err) {
-	return err instanceof Error && err.name === "AbortError";
-}
-/**
-* Sleep that resolves early on abort and always clears its timer so it never
-* keeps the event loop alive. Resolves (does not reject) on abort — callers
-* re-check the signal explicitly after the sleep.
-*/
-function sleep(ms, signal) {
-	return new Promise((resolve) => {
-		if (signal?.aborted) {
-			resolve();
-			return;
-		}
-		let onAbort;
-		const timer = setTimeout(() => {
-			if (onAbort && signal) signal.removeEventListener("abort", onAbort);
-			resolve();
-		}, ms);
-		if (signal) {
-			onAbort = () => {
-				clearTimeout(timer);
-				resolve();
-			};
-			signal.addEventListener("abort", onAbort, { once: true });
-		}
-	});
-}
-/**
-* Race a promise against a timeout. Resolves with the value if it settles in
-* time, otherwise resolves with `undefined`. Always clears the timer.
-*/
-function withTimeout(promise, ms) {
-	return new Promise((resolve) => {
-		const timer = setTimeout(() => resolve(void 0), ms);
-		promise.then((value) => {
-			clearTimeout(timer);
-			resolve(value);
-		}, () => {
-			clearTimeout(timer);
-			resolve(void 0);
-		});
-	});
-}
-/**
-* `JSON.stringify` with a `String()` fallback on throw (cyclic / non-JSON).
-* Strings pass through unstringified so a preview of a string output is the
-* string itself, not a quoted re-encoding.
-*/
-function stringifySafe(value, opts = {}) {
-	let s;
-	try {
-		if (typeof value === "string") s = value;
-		else s = (opts.pretty ? JSON.stringify(value, null, 2) : JSON.stringify(value)) ?? String(value);
-	} catch {
-		s = String(value);
-	}
-	if (opts.max !== void 0 && s.length > opts.max) return `${s.slice(0, opts.max)}…`;
-	return s;
-}
-/** A fresh zero token-usage accumulator. */
-function zeroTokenUsage() {
-	return {
-		input: 0,
-		output: 0
-	};
-}
-/**
-* Sum the catalog-priced part of a dollar total across spends, as a field to spread.
-*
-* Returns nothing when no input carried one. A fold of pure provider receipts must not gain a
-* `usdEstimated: 0`, which would read as "this runtime checked and priced none" on a path that
-* never prices at all.
-*/
-function usdEstimatedOf(...spends) {
-	let total = 0;
-	let priced = false;
-	for (const spend of spends) {
-		if (spend.usdEstimated === void 0) continue;
-		priced = true;
-		total += spend.usdEstimated;
-	}
-	return priced ? { usdEstimated: total } : {};
-}
-/** A conserved spend with every channel at zero and no completeness claim on it. */
-function zeroSpend() {
-	return {
-		iterations: 0,
-		tokens: zeroTokenUsage(),
-		usd: 0,
-		ms: 0
-	};
-}
-/**
-* The spend of work that HAPPENED and reported no usage receipt.
-*
-* Not the same value as {@link zeroSpend} even though both carry `{0,0}` tokens and `$0`. A bare
-* zero asserts a MEASUREMENT — "this ran and cost nothing" — and every consumer downstream reads it
-* that way: the pool keeps reporting `readout().tokensKnown === true`, the journal totals stay
-* clean, the OTEL span records a priced zero, and a caller's token-denominated ceiling can never
-* fire no matter how much the work really burned. A ceiling that cannot fire is worse than no
-* ceiling, because it reads as protection.
-*
-* `tokensKnown` is the marker the substrate already threads end to end for exactly this case
-* (`budget.ts`, `otel-spans.ts`, `spawn-journal.ts`, `supervisor.ts`): the work is recorded, the
-* zero is labelled a floor rather than a total, and every rollup that touches it reports its
-* balance as a ceiling rather than a measurement. Use this — never a bare zero — whenever a runtime
-* cannot see what its worker spent.
-*
-* The same rule applies to dollars. A dollar-capped run must refuse an executor whose billed spend
-* is unknowable; `budgetExempt` does not authorize Runtime to relabel unknown spend as a measured
-* zero. Callers that require dollar accounting must use a backend with a trusted billing receipt.
-*/
-function unmeteredSpend(ms) {
-	return {
-		iterations: 0,
-		tokens: zeroTokenUsage(),
-		tokensKnown: false,
-		usd: 0,
-		usdKnown: false,
-		ms
-	};
-}
-/** Copy a conserved spend without dropping a completeness marker or the catalog-priced part. */
-function cloneSpend(spend) {
-	return {
-		iterations: spend.iterations,
-		tokens: cloneTokenUsage(spend.tokens),
-		...spend.tokensKnown === false ? { tokensKnown: false } : {},
-		usd: spend.usd,
-		...spend.usdKnown === false ? { usdKnown: false } : {},
-		...spend.usdEstimated !== void 0 ? { usdEstimated: spend.usdEstimated } : {},
-		ms: spend.ms,
-		...boxMinutesOf(spend)
-	};
-}
-/**
-* Sum two conserved spends per channel. Tokens and dollars never fold into each other, an
-* incomplete input keeps the sum incomplete on that channel, and the catalog-priced part of the
-* dollar total is summed separately so `usd - usdEstimated` still names what a provider billed.
-*/
-function addSpend(a, b) {
-	const tokens = cloneTokenUsage(a.tokens);
-	addTokenUsage(tokens, b.tokens);
-	return {
-		iterations: a.iterations + b.iterations,
-		tokens,
-		...a.tokensKnown === false || b.tokensKnown === false ? { tokensKnown: false } : {},
-		usd: a.usd + b.usd,
-		...a.usdKnown === false || b.usdKnown === false ? { usdKnown: false } : {},
-		...usdEstimatedOf(a, b),
-		ms: a.ms + b.ms,
-		...boxMinutesOf(a, b),
-		...tokensProvenanceOf(a, b)
-	};
-}
-/**
-* Fold the token-provenance channel across spends, as a field to spread.
-*
-* Returns nothing when no contributor stated one, because ABSENT already means "the executor's own
-* live stream", which is what every path reported before a harness store was readable. A
-* contributor that stated one and a contributor that did not therefore disagree, and the sum is
-* `'mixed'` — the honest answer for a tree whose spend came from two kinds of receipt.
-*/
-function tokensProvenanceOf(...spends) {
-	let folded;
-	let sawStated = false;
-	for (const spend of spends) {
-		const stated = spend.tokensProvenance ?? "stream-receipt";
-		if (spend.tokensProvenance !== void 0) sawStated = true;
-		folded = folded === void 0 || folded === stated ? stated : "mixed";
-	}
-	return !sawStated || folded === void 0 || folded === "stream-receipt" ? {} : { tokensProvenance: folded };
-}
-/**
-* Fold the platform box-time channel across spends, as a field to spread.
-*
-* Returns nothing when no input carried the channel, so a fold over router or cli-bridge work —
-* which runs no box at all — never gains a `boxMinutesProvenance: 'uncaptured'` that would claim
-* a box ran and went unmetered.
-*
-* Three rules, one per field:
-*  - `boxMinutes` sums the numbers that are present, and stays ABSENT when none is. A missing
-*    measurement never enters the sum as a zero.
-*  - `boxMinutesKnown` is sticky-false, like `tokensKnown`: one contributor that could not state
-*    its box time makes the whole sum a floor.
-*  - `boxMinutesProvenance` degrades. `'observed'` survives only when every contributor that
-*    carried a number was observed; one derived number makes the sum `'estimated'`; no number at
-*    all is `'uncaptured'`.
-*/
-function boxMinutesOf(...spends) {
-	const present = spends.filter((spend) => spend.boxMinutesProvenance !== void 0);
-	if (present.length === 0) return {};
-	let minutes = 0;
-	let sawNumber = false;
-	let known = true;
-	let observedOnly = true;
-	for (const spend of present) {
-		if (typeof spend.boxMinutes === "number" && Number.isFinite(spend.boxMinutes)) {
-			minutes += spend.boxMinutes;
-			sawNumber = true;
-			if (spend.boxMinutesProvenance !== "observed") observedOnly = false;
-		}
-		if (spend.boxMinutesKnown !== true) known = false;
-	}
-	return {
-		...sawNumber ? { boxMinutes: roundBoxMinutes(minutes) } : {},
-		boxMinutesKnown: known,
-		boxMinutesProvenance: sawNumber ? observedOnly ? "observed" : "estimated" : "uncaptured"
-	};
-}
-/**
-* Box minutes at four decimals — a tenth of a second.
-*
-* Fine enough that a box alive for two seconds reports `0.0333` instead of a zero that would read
-* as a measured free box, and coarse enough that summing floats does not print
-* `1.5000000000000002`.
-*/
-function roundBoxMinutes(minutes) {
-	return Number(minutes.toFixed(4));
-}
-/** Copy a token subtotal without dropping optional provider cache telemetry. */
-function cloneTokenUsage(usage) {
-	const cacheBreakdownUnknown = usage.cacheBreakdownKnown === false || usage.input > 0 && !hasClassifiedCacheBreakdown(usage);
-	return {
-		input: usage.input,
-		output: usage.output,
-		...usage.tokensKnown === false ? { tokensKnown: false } : {},
-		...usage.freshInput !== void 0 ? { freshInput: usage.freshInput } : {},
-		...usage.cacheRead !== void 0 ? { cacheRead: usage.cacheRead } : {},
-		...usage.cacheWrite !== void 0 ? { cacheWrite: usage.cacheWrite } : {},
-		...cacheBreakdownUnknown ? { cacheBreakdownKnown: false } : {}
-	};
-}
-/** True only when every positive prompt token has a consistent cache classification. */
-function hasCompleteCacheBreakdown(usage) {
-	if (usage.cacheBreakdownKnown === false) return false;
-	return hasClassifiedCacheBreakdown(usage);
-}
-function hasClassifiedCacheBreakdown(usage) {
-	if (usage.input === 0) return true;
-	if (usage.freshInput === void 0 || usage.cacheRead === void 0 || usage.cacheWrite === void 0) return false;
-	return usage.freshInput + usage.cacheRead + usage.cacheWrite === usage.input;
-}
-/**
-* The token charge for one observation: every token counted ONCE, at the moment it first enters
-* the context — `input − cacheRead + output`.
-*
-* `input` is a rolled-up prompt total that re-counts a cached prefix on every turn that reads it,
-* so charging `input` makes a 100K prefix read 40 times cost 4.1M for content authored once. A
-* cache read is content that was already charged when it was written, so it is the one class the
-* charge subtracts. Under a complete split the result is exactly `freshInput + cacheWrite`. No
-* price weight is involved: this counts work, and money is a separate channel.
-*
-* The subtraction form is what makes the charge ADDITIVE. `input` and `cacheRead` both accumulate
-* through `addTokenUsage`, so the charge on an aggregate equals the sum of the charges on the
-* records that built it — including an aggregate that mixes classified and unclassified turns,
-* where the unclassified remainder is charged in full and only the reported cache reads are
-* credited. A form that read `freshInput + cacheWrite` directly loses that: one unclassified turn
-* would drop the whole aggregate to `input + output` and over-charge every classified turn with it.
-*
-* The one arithmetic guarantee: a set of classes that does not FIT inside the prompt total it
-* partitions credits nothing, so the charge is never below `output` and a class that overflows its
-* own total buys no tokens. It is not a guarantee against a provider that reports a cache read it
-* never served — that provider can under-report `input` just as easily, and the token channel is an
-* accounting unit, not a trust boundary. Prompt tokens the provider left unclassified are charged
-* in full, so a spend with no readable split charges an upper bound on newly-presented work rather
-* than a measurement, and every caller that enforces a ceiling must report the difference
-* (`BudgetPool` does it through `readout().cacheBreakdownKnown`).
-*/
-function chargedTokens(usage) {
-	return usage.input - creditedCacheRead(usage) + usage.output;
-}
-/** `cacheRead` if the reported classes fit inside `input`, else nothing. */
-function creditedCacheRead(usage) {
-	const { cacheRead } = usage;
-	if (cacheRead === void 0) return 0;
-	return classifiedTotal(usage, cacheRead) > usage.input ? 0 : cacheRead;
-}
-function classifiedTotal(usage, cacheRead) {
-	return (usage.freshInput ?? 0) + cacheRead + (usage.cacheWrite ?? 0);
-}
-/**
-* Translate one provider prompt-cache report into the prompt token classes `addTokenUsage` folds
-* and `chargedTokens` credits.
-*
-* The input is the open `promptCache` record an `llm_call` carries, keyed by the `PromptCacheUsage`
-* vocabulary (`readTokens`, `writeTokens`). Providers report that vocabulary unevenly, and the
-* three outcomes are different facts that must not collapse into one another:
-*
-*  - **Nothing reported** — no classes and no marker. The caller's own unknown handling decides,
-*    because a provider that says nothing about caching has not said the split is unknowable.
-*  - **Read and write both reported, and fitting inside `input`** — a complete partition, so
-*    `freshInput` is the remainder and the split is known.
-*  - **One counter reported, or classes that overflow `input`** — the counters that ARE measured
-*    pass through and `cacheBreakdownKnown` is false. A read with no write counter (OpenAI reports
-*    no write) still credits the read it measured, while declaring the rest unclassified so the
-*    charge stays a declared upper bound. An overflowing claim buys nothing: it cannot be a
-*    partition of a total it exceeds.
-*
-* A counter the provider did not report stays absent. A zero would claim the provider measured no
-* cache, which is a different fact from a provider that did not report.
-*/
-function promptCacheTokenClasses(input, promptCache) {
-	if (promptCache === void 0) return {};
-	const read = tokenCount(promptCache.readTokens);
-	const write = tokenCount(promptCache.writeTokens);
-	if (read === void 0 && write === void 0) return {};
-	if (input === void 0 || (read ?? 0) + (write ?? 0) > input) return { cacheBreakdownKnown: false };
-	if (read !== void 0 && write !== void 0) return {
-		freshInput: input - read - write,
-		cacheRead: read,
-		cacheWrite: write
-	};
-	return {
-		...read !== void 0 ? { cacheRead: read } : {},
-		...write !== void 0 ? { cacheWrite: write } : {},
-		cacheBreakdownKnown: false
-	};
-}
-function tokenCount(value) {
-	return typeof value === "number" && Number.isSafeInteger(value) && value >= 0 ? value : void 0;
-}
-/**
-* Add the observed subtotal into `acc`; token and cache incompleteness are sticky.
-*
-* A delta whose classes do not FIT inside its own `input` contributes its prompt total and NO
-* classes. Folding them in would hide the overflow: the accumulator's larger `input` can absorb a
-* class total that overflowed the one delta that reported it, and `chargedTokens` would then credit
-* at the aggregate a cache read it refuses at the record. That is the one way the charge could come
-* out below the sum of the charges on the records that built it.
-*/
-function addTokenUsage(acc, delta) {
-	acc.input += delta.input ?? 0;
-	acc.output += delta.output ?? 0;
-	if (delta.tokensKnown === false) acc.tokensKnown = false;
-	const input = delta.input ?? 0;
-	const fits = classifiedTotal(delta, delta.cacheRead ?? 0) <= input;
-	if (fits) {
-		if (delta.freshInput !== void 0) acc.freshInput = (acc.freshInput ?? 0) + delta.freshInput;
-		if (delta.cacheRead !== void 0) acc.cacheRead = (acc.cacheRead ?? 0) + delta.cacheRead;
-		if (delta.cacheWrite !== void 0) acc.cacheWrite = (acc.cacheWrite ?? 0) + delta.cacheWrite;
-	}
-	const classified = fits && delta.freshInput !== void 0 && delta.cacheRead !== void 0 && delta.cacheWrite !== void 0 && delta.freshInput + delta.cacheRead + delta.cacheWrite === input;
-	if (delta.cacheBreakdownKnown === false || input > 0 && !classified) acc.cacheBreakdownKnown = false;
-}
-/**
-* Map `items` through `fn` with at most `limit` calls in flight at once,
-* preserving input order in the result. On the first `fn` rejection no NEW
-* items are picked up; already-in-flight calls are awaited, then the first
-* error is rethrown. `limit` is clamped to ≥ 1.
-*
-* Used where a burst of provisioning (e.g. forking N child boxes) must respect
-* the loop's concurrency bound instead of firing all N at once.
-*/
-async function mapWithConcurrency(items, limit, fn) {
-	const bound = Math.max(1, Math.floor(limit));
-	const results = new Array(items.length);
-	let next = 0;
-	let failed = false;
-	const worker = async () => {
-		while (!failed) {
-			const i = next;
-			next += 1;
-			if (i >= items.length) return;
-			try {
-				results[i] = await fn(items[i], i);
-			} catch (err) {
-				failed = true;
-				throw err;
-			}
-		}
-	};
-	const workerCount = Math.min(bound, items.length);
-	await Promise.all(Array.from({ length: workerCount }, () => worker()));
-	return results;
-}
-//#endregion
-export { throwIfAborted as _, cloneTokenUsage as a, zeroSpend as b, isAbortError as c, randomSuffix as d, randomUuid as f, throwAbort as g, stringifySafe as h, cloneSpend as i, mapWithConcurrency as l, sleep as m, addTokenUsage as n, deleteBoxSafe as o, roundBoxMinutes as p, chargedTokens as r, hasCompleteCacheBreakdown as s, addSpend as t, promptCacheTokenClasses as u, unmeteredSpend as v, zeroTokenUsage as x, withTimeout as y };
-
-//# sourceMappingURL=util-mCNUeboW.js.map

package/dist/util-mCNUeboW.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"util-mCNUeboW.js","names":[],"sources":["../src/runtime/util.ts"],"sourcesContent":["/**\n *\n * Internal loop-kernel utilities shared across the kernel, drivers, and the\n * sandbox-acquire layer. Not part of the public barrel surface.\n *\n * @experimental\n */\n\nimport type { SandboxInstance } from '@tangle-network/sandbox'\nimport type { Spend, TokenUsageProvenance } from './supervise/types'\nimport type { LoopTokenUsage } from './types'\n\n/**\n * Best-effort sandbox delete. Skips instances without a `delete` (test fakes);\n * swallows errors (the platform reaps on expiry). Returns `false` when delete\n * threw, `true` otherwise, so callers can surface a leak if they choose.\n */\nexport async function deleteBoxSafe(box: SandboxInstance | undefined): Promise<boolean> {\n  if (!box || typeof (box as { delete?: unknown }).delete !== 'function') return true\n  try {\n    await box.delete()\n    return true\n  } catch {\n    return false\n  }\n}\n\n/** Short base36 id for trace correlation. Not cryptographic, not collision-free. */\nexport function randomSuffix(len = 8): string {\n  return Math.random()\n    .toString(36)\n    .slice(2, 2 + len)\n}\n\n/** Collision-resistant id for sandbox naming (find-by-name recovery must be unique). */\nexport function randomUuid(): string {\n  return crypto.randomUUID()\n}\n\n/** Construct an AbortError. Downstream code pattern-matches on `err.name`. */\nexport function abortError(): Error {\n  const err = new Error('aborted')\n  err.name = 'AbortError'\n  return err\n}\n\n/** Throw an AbortError. */\nexport function throwAbort(): never {\n  throw abortError()\n}\n\n/** Throw if the signal is already aborted; otherwise no-op. */\nexport function throwIfAborted(signal: AbortSignal | undefined): void {\n  if (signal?.aborted) throw abortError()\n}\n\n/** True for any error whose `name` is `AbortError` (the cross-kernel abort contract). */\nexport function isAbortError(err: unknown): boolean {\n  return err instanceof Error && err.name === 'AbortError'\n}\n\n/**\n * Sleep that resolves early on abort and always clears its timer so it never\n * keeps the event loop alive. Resolves (does not reject) on abort — callers\n * re-check the signal explicitly after the sleep.\n */\nexport function sleep(ms: number, signal?: AbortSignal): Promise<void> {\n  return new Promise((resolve) => {\n    if (signal?.aborted) {\n      resolve()\n      return\n    }\n    let onAbort: (() => void) | undefined\n    const timer = setTimeout(() => {\n      if (onAbort && signal) signal.removeEventListener('abort', onAbort)\n      resolve()\n    }, ms)\n    if (signal) {\n      onAbort = () => {\n        clearTimeout(timer)\n        resolve()\n      }\n      signal.addEventListener('abort', onAbort, { once: true })\n    }\n  })\n}\n\n/**\n * Race a promise against a timeout. Resolves with the value if it settles in\n * time, otherwise resolves with `undefined`. Always clears the timer.\n */\nexport function withTimeout<T>(promise: Promise<T>, ms: number): Promise<T | undefined> {\n  return new Promise<T | undefined>((resolve) => {\n    const timer = setTimeout(() => resolve(undefined), ms)\n    promise.then(\n      (value) => {\n        clearTimeout(timer)\n        resolve(value)\n      },\n      () => {\n        clearTimeout(timer)\n        resolve(undefined)\n      },\n    )\n  })\n}\n\ninterface StringifyOptions {\n  /** Pretty-print with 2-space indent. Default false (compact). */\n  pretty?: boolean\n  /** Truncate to this many chars, appending `…`. Default unbounded. */\n  max?: number\n}\n\n/**\n * `JSON.stringify` with a `String()` fallback on throw (cyclic / non-JSON).\n * Strings pass through unstringified so a preview of a string output is the\n * string itself, not a quoted re-encoding.\n */\nexport function stringifySafe(value: unknown, opts: StringifyOptions = {}): string {\n  let s: string\n  try {\n    if (typeof value === 'string') {\n      s = value\n    } else {\n      const json = opts.pretty ? JSON.stringify(value, null, 2) : JSON.stringify(value)\n      s = json ?? String(value)\n    }\n  } catch {\n    s = String(value)\n  }\n  if (opts.max !== undefined && s.length > opts.max) return `${s.slice(0, opts.max)}…`\n  return s\n}\n\n/** A fresh zero token-usage accumulator. */\nexport function zeroTokenUsage(): LoopTokenUsage {\n  return { input: 0, output: 0 }\n}\n\n/**\n * Sum the catalog-priced part of a dollar total across spends, as a field to spread.\n *\n * Returns nothing when no input carried one. A fold of pure provider receipts must not gain a\n * `usdEstimated: 0`, which would read as \"this runtime checked and priced none\" on a path that\n * never prices at all.\n */\nexport function usdEstimatedOf(...spends: ReadonlyArray<{ usdEstimated?: number }>): {\n  usdEstimated?: number\n} {\n  let total = 0\n  let priced = false\n  for (const spend of spends) {\n    if (spend.usdEstimated === undefined) continue\n    priced = true\n    total += spend.usdEstimated\n  }\n  return priced ? { usdEstimated: total } : {}\n}\n\n/** A conserved spend with every channel at zero and no completeness claim on it. */\nexport function zeroSpend(): Spend {\n  return { iterations: 0, tokens: zeroTokenUsage(), usd: 0, ms: 0 }\n}\n\n/**\n * The spend of work that HAPPENED and reported no usage receipt.\n *\n * Not the same value as {@link zeroSpend} even though both carry `{0,0}` tokens and `$0`. A bare\n * zero asserts a MEASUREMENT — \"this ran and cost nothing\" — and every consumer downstream reads it\n * that way: the pool keeps reporting `readout().tokensKnown === true`, the journal totals stay\n * clean, the OTEL span records a priced zero, and a caller's token-denominated ceiling can never\n * fire no matter how much the work really burned. A ceiling that cannot fire is worse than no\n * ceiling, because it reads as protection.\n *\n * `tokensKnown` is the marker the substrate already threads end to end for exactly this case\n * (`budget.ts`, `otel-spans.ts`, `spawn-journal.ts`, `supervisor.ts`): the work is recorded, the\n * zero is labelled a floor rather than a total, and every rollup that touches it reports its\n * balance as a ceiling rather than a measurement. Use this — never a bare zero — whenever a runtime\n * cannot see what its worker spent.\n *\n * The same rule applies to dollars. A dollar-capped run must refuse an executor whose billed spend\n * is unknowable; `budgetExempt` does not authorize Runtime to relabel unknown spend as a measured\n * zero. Callers that require dollar accounting must use a backend with a trusted billing receipt.\n */\nexport function unmeteredSpend(ms: number): Spend {\n  return {\n    iterations: 0,\n    tokens: zeroTokenUsage(),\n    tokensKnown: false,\n    usd: 0,\n    usdKnown: false,\n    ms,\n  }\n}\n\n/** Copy a conserved spend without dropping a completeness marker or the catalog-priced part. */\nexport function cloneSpend(spend: Spend): Spend {\n  return {\n    iterations: spend.iterations,\n    tokens: cloneTokenUsage(spend.tokens),\n    ...(spend.tokensKnown === false ? { tokensKnown: false } : {}),\n    usd: spend.usd,\n    ...(spend.usdKnown === false ? { usdKnown: false } : {}),\n    ...(spend.usdEstimated !== undefined ? { usdEstimated: spend.usdEstimated } : {}),\n    ms: spend.ms,\n    ...boxMinutesOf(spend),\n  }\n}\n\n/**\n * Sum two conserved spends per channel. Tokens and dollars never fold into each other, an\n * incomplete input keeps the sum incomplete on that channel, and the catalog-priced part of the\n * dollar total is summed separately so `usd - usdEstimated` still names what a provider billed.\n */\nexport function addSpend(a: Spend, b: Spend): Spend {\n  const tokens = cloneTokenUsage(a.tokens)\n  addTokenUsage(tokens, b.tokens)\n  return {\n    iterations: a.iterations + b.iterations,\n    tokens,\n    ...(a.tokensKnown === false || b.tokensKnown === false ? { tokensKnown: false } : {}),\n    usd: a.usd + b.usd,\n    ...(a.usdKnown === false || b.usdKnown === false ? { usdKnown: false } : {}),\n    ...usdEstimatedOf(a, b),\n    ms: a.ms + b.ms,\n    ...boxMinutesOf(a, b),\n    ...tokensProvenanceOf(a, b),\n  }\n}\n\n/**\n * Fold the token-provenance channel across spends, as a field to spread.\n *\n * Returns nothing when no contributor stated one, because ABSENT already means \"the executor's own\n * live stream\", which is what every path reported before a harness store was readable. A\n * contributor that stated one and a contributor that did not therefore disagree, and the sum is\n * `'mixed'` — the honest answer for a tree whose spend came from two kinds of receipt.\n */\nfunction tokensProvenanceOf(...spends: ReadonlyArray<Spend>): {\n  tokensProvenance?: TokenUsageProvenance\n} {\n  let folded: TokenUsageProvenance | undefined\n  let sawStated = false\n  for (const spend of spends) {\n    const stated = spend.tokensProvenance ?? 'stream-receipt'\n    if (spend.tokensProvenance !== undefined) sawStated = true\n    folded = folded === undefined || folded === stated ? stated : 'mixed'\n  }\n  return !sawStated || folded === undefined || folded === 'stream-receipt'\n    ? {}\n    : { tokensProvenance: folded }\n}\n\n/**\n * Fold the platform box-time channel across spends, as a field to spread.\n *\n * Returns nothing when no input carried the channel, so a fold over router or cli-bridge work —\n * which runs no box at all — never gains a `boxMinutesProvenance: 'uncaptured'` that would claim\n * a box ran and went unmetered.\n *\n * Three rules, one per field:\n *  - `boxMinutes` sums the numbers that are present, and stays ABSENT when none is. A missing\n *    measurement never enters the sum as a zero.\n *  - `boxMinutesKnown` is sticky-false, like `tokensKnown`: one contributor that could not state\n *    its box time makes the whole sum a floor.\n *  - `boxMinutesProvenance` degrades. `'observed'` survives only when every contributor that\n *    carried a number was observed; one derived number makes the sum `'estimated'`; no number at\n *    all is `'uncaptured'`.\n */\nfunction boxMinutesOf(...spends: ReadonlyArray<Spend>): {\n  boxMinutes?: number\n  boxMinutesKnown?: boolean\n  boxMinutesProvenance?: 'observed' | 'estimated' | 'uncaptured'\n} {\n  const present = spends.filter((spend) => spend.boxMinutesProvenance !== undefined)\n  if (present.length === 0) return {}\n  let minutes = 0\n  let sawNumber = false\n  let known = true\n  let observedOnly = true\n  for (const spend of present) {\n    if (typeof spend.boxMinutes === 'number' && Number.isFinite(spend.boxMinutes)) {\n      minutes += spend.boxMinutes\n      sawNumber = true\n      if (spend.boxMinutesProvenance !== 'observed') observedOnly = false\n    }\n    if (spend.boxMinutesKnown !== true) known = false\n  }\n  return {\n    ...(sawNumber ? { boxMinutes: roundBoxMinutes(minutes) } : {}),\n    boxMinutesKnown: known,\n    boxMinutesProvenance: sawNumber ? (observedOnly ? 'observed' : 'estimated') : 'uncaptured',\n  }\n}\n\n/**\n * Box minutes at four decimals — a tenth of a second.\n *\n * Fine enough that a box alive for two seconds reports `0.0333` instead of a zero that would read\n * as a measured free box, and coarse enough that summing floats does not print\n * `1.5000000000000002`.\n */\nexport function roundBoxMinutes(minutes: number): number {\n  return Number(minutes.toFixed(4))\n}\n\n/** Copy a token subtotal without dropping optional provider cache telemetry. */\nexport function cloneTokenUsage(usage: LoopTokenUsage): LoopTokenUsage {\n  const cacheBreakdownUnknown =\n    usage.cacheBreakdownKnown === false || (usage.input > 0 && !hasClassifiedCacheBreakdown(usage))\n  return {\n    input: usage.input,\n    output: usage.output,\n    ...(usage.tokensKnown === false ? { tokensKnown: false as const } : {}),\n    ...(usage.freshInput !== undefined ? { freshInput: usage.freshInput } : {}),\n    ...(usage.cacheRead !== undefined ? { cacheRead: usage.cacheRead } : {}),\n    ...(usage.cacheWrite !== undefined ? { cacheWrite: usage.cacheWrite } : {}),\n    ...(cacheBreakdownUnknown ? { cacheBreakdownKnown: false as const } : {}),\n  }\n}\n\n/** True only when every positive prompt token has a consistent cache classification. */\nexport function hasCompleteCacheBreakdown(usage: LoopTokenUsage): boolean {\n  if (usage.cacheBreakdownKnown === false) return false\n  return hasClassifiedCacheBreakdown(usage)\n}\n\nfunction hasClassifiedCacheBreakdown(usage: LoopTokenUsage): boolean {\n  if (usage.input === 0) return true\n  if (\n    usage.freshInput === undefined ||\n    usage.cacheRead === undefined ||\n    usage.cacheWrite === undefined\n  ) {\n    return false\n  }\n  return usage.freshInput + usage.cacheRead + usage.cacheWrite === usage.input\n}\n\n/**\n * The token charge for one observation: every token counted ONCE, at the moment it first enters\n * the context — `input − cacheRead + output`.\n *\n * `input` is a rolled-up prompt total that re-counts a cached prefix on every turn that reads it,\n * so charging `input` makes a 100K prefix read 40 times cost 4.1M for content authored once. A\n * cache read is content that was already charged when it was written, so it is the one class the\n * charge subtracts. Under a complete split the result is exactly `freshInput + cacheWrite`. No\n * price weight is involved: this counts work, and money is a separate channel.\n *\n * The subtraction form is what makes the charge ADDITIVE. `input` and `cacheRead` both accumulate\n * through `addTokenUsage`, so the charge on an aggregate equals the sum of the charges on the\n * records that built it — including an aggregate that mixes classified and unclassified turns,\n * where the unclassified remainder is charged in full and only the reported cache reads are\n * credited. A form that read `freshInput + cacheWrite` directly loses that: one unclassified turn\n * would drop the whole aggregate to `input + output` and over-charge every classified turn with it.\n *\n * The one arithmetic guarantee: a set of classes that does not FIT inside the prompt total it\n * partitions credits nothing, so the charge is never below `output` and a class that overflows its\n * own total buys no tokens. It is not a guarantee against a provider that reports a cache read it\n * never served — that provider can under-report `input` just as easily, and the token channel is an\n * accounting unit, not a trust boundary. Prompt tokens the provider left unclassified are charged\n * in full, so a spend with no readable split charges an upper bound on newly-presented work rather\n * than a measurement, and every caller that enforces a ceiling must report the difference\n * (`BudgetPool` does it through `readout().cacheBreakdownKnown`).\n */\nexport function chargedTokens(usage: LoopTokenUsage): number {\n  return usage.input - creditedCacheRead(usage) + usage.output\n}\n\n/** `cacheRead` if the reported classes fit inside `input`, else nothing. */\nfunction creditedCacheRead(usage: LoopTokenUsage): number {\n  const { cacheRead } = usage\n  if (cacheRead === undefined) return 0\n  return classifiedTotal(usage, cacheRead) > usage.input ? 0 : cacheRead\n}\n\nfunction classifiedTotal(usage: Partial<LoopTokenUsage>, cacheRead: number): number {\n  return (usage.freshInput ?? 0) + cacheRead + (usage.cacheWrite ?? 0)\n}\n\n/**\n * The only two members this reads out of a provider prompt-cache report, named rather than taken as\n * an open record: both the typed `PromptCacheUsage` and the open `promptCache` an `llm_call` carries\n * satisfy it, and each value is validated before it is credited.\n */\nexport interface PromptCacheCounters {\n  readonly readTokens?: unknown\n  readonly writeTokens?: unknown\n}\n\n/** The prompt-cache token classes of one observation, as `LoopTokenUsage` members. */\nexport type PromptCacheTokenClasses = Pick<\n  LoopTokenUsage,\n  'freshInput' | 'cacheRead' | 'cacheWrite' | 'cacheBreakdownKnown'\n>\n\n/**\n * Translate one provider prompt-cache report into the prompt token classes `addTokenUsage` folds\n * and `chargedTokens` credits.\n *\n * The input is the open `promptCache` record an `llm_call` carries, keyed by the `PromptCacheUsage`\n * vocabulary (`readTokens`, `writeTokens`). Providers report that vocabulary unevenly, and the\n * three outcomes are different facts that must not collapse into one another:\n *\n *  - **Nothing reported** — no classes and no marker. The caller's own unknown handling decides,\n *    because a provider that says nothing about caching has not said the split is unknowable.\n *  - **Read and write both reported, and fitting inside `input`** — a complete partition, so\n *    `freshInput` is the remainder and the split is known.\n *  - **One counter reported, or classes that overflow `input`** — the counters that ARE measured\n *    pass through and `cacheBreakdownKnown` is false. A read with no write counter (OpenAI reports\n *    no write) still credits the read it measured, while declaring the rest unclassified so the\n *    charge stays a declared upper bound. An overflowing claim buys nothing: it cannot be a\n *    partition of a total it exceeds.\n *\n * A counter the provider did not report stays absent. A zero would claim the provider measured no\n * cache, which is a different fact from a provider that did not report.\n */\nexport function promptCacheTokenClasses(\n  input: number | undefined,\n  promptCache: PromptCacheCounters | undefined,\n): PromptCacheTokenClasses {\n  if (promptCache === undefined) return {}\n  const read = tokenCount(promptCache.readTokens)\n  const write = tokenCount(promptCache.writeTokens)\n  if (read === undefined && write === undefined) return {}\n  if (input === undefined || (read ?? 0) + (write ?? 0) > input) {\n    return { cacheBreakdownKnown: false }\n  }\n  if (read !== undefined && write !== undefined) {\n    return { freshInput: input - read - write, cacheRead: read, cacheWrite: write }\n  }\n  return {\n    ...(read !== undefined ? { cacheRead: read } : {}),\n    ...(write !== undefined ? { cacheWrite: write } : {}),\n    cacheBreakdownKnown: false,\n  }\n}\n\nfunction tokenCount(value: unknown): number | undefined {\n  return typeof value === 'number' && Number.isSafeInteger(value) && value >= 0 ? value : undefined\n}\n\n/**\n * Add the observed subtotal into `acc`; token and cache incompleteness are sticky.\n *\n * A delta whose classes do not FIT inside its own `input` contributes its prompt total and NO\n * classes. Folding them in would hide the overflow: the accumulator's larger `input` can absorb a\n * class total that overflowed the one delta that reported it, and `chargedTokens` would then credit\n * at the aggregate a cache read it refuses at the record. That is the one way the charge could come\n * out below the sum of the charges on the records that built it.\n */\nexport function addTokenUsage(acc: LoopTokenUsage, delta: Partial<LoopTokenUsage>): void {\n  acc.input += delta.input ?? 0\n  acc.output += delta.output ?? 0\n  if (delta.tokensKnown === false) acc.tokensKnown = false\n\n  const input = delta.input ?? 0\n  const fits = classifiedTotal(delta, delta.cacheRead ?? 0) <= input\n  if (fits) {\n    if (delta.freshInput !== undefined) acc.freshInput = (acc.freshInput ?? 0) + delta.freshInput\n    if (delta.cacheRead !== undefined) acc.cacheRead = (acc.cacheRead ?? 0) + delta.cacheRead\n    if (delta.cacheWrite !== undefined) acc.cacheWrite = (acc.cacheWrite ?? 0) + delta.cacheWrite\n  }\n\n  const classified =\n    fits &&\n    delta.freshInput !== undefined &&\n    delta.cacheRead !== undefined &&\n    delta.cacheWrite !== undefined &&\n    delta.freshInput + delta.cacheRead + delta.cacheWrite === input\n  // A provider that reports prompt input without all three classes leaves the\n  // split unknown. Do not let an earlier complete turn make the aggregate look\n  // complete after a later unclassified positive-input turn.\n  if (delta.cacheBreakdownKnown === false || (input > 0 && !classified)) {\n    acc.cacheBreakdownKnown = false\n  }\n}\n\n/**\n * Map `items` through `fn` with at most `limit` calls in flight at once,\n * preserving input order in the result. On the first `fn` rejection no NEW\n * items are picked up; already-in-flight calls are awaited, then the first\n * error is rethrown. `limit` is clamped to ≥ 1.\n *\n * Used where a burst of provisioning (e.g. forking N child boxes) must respect\n * the loop's concurrency bound instead of firing all N at once.\n */\nexport async function mapWithConcurrency<T, R>(\n  items: readonly T[],\n  limit: number,\n  fn: (item: T, index: number) => Promise<R>,\n): Promise<R[]> {\n  const bound = Math.max(1, Math.floor(limit))\n  const results = new Array<R>(items.length)\n  let next = 0\n  let failed = false\n  const worker = async (): Promise<void> => {\n    while (!failed) {\n      const i = next\n      next += 1\n      if (i >= items.length) return\n      try {\n        results[i] = await fn(items[i] as T, i)\n      } catch (err) {\n        failed = true\n        throw err\n      }\n    }\n  }\n  const workerCount = Math.min(bound, items.length)\n  await Promise.all(Array.from({ length: workerCount }, () => worker()))\n  return results\n}\n"],"mappings":";;;;;;AAiBA,eAAsB,cAAc,KAAoD;CACtF,IAAI,CAAC,OAAO,OAAQ,IAA6B,WAAW,YAAY,OAAO;CAC/E,IAAI;EACF,MAAM,IAAI,OAAO;EACjB,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;AAGA,SAAgB,aAAa,MAAM,GAAW;CAC5C,OAAO,KAAK,OAAO,CAAC,CACjB,SAAS,EAAE,CAAC,CACZ,MAAM,GAAG,IAAI,GAAG;AACrB;;AAGA,SAAgB,aAAqB;CACnC,OAAO,OAAO,WAAW;AAC3B;;AAGA,SAAgB,aAAoB;CAClC,MAAM,sBAAM,IAAI,MAAM,SAAS;CAC/B,IAAI,OAAO;CACX,OAAO;AACT;;AAGA,SAAgB,aAAoB;CAClC,MAAM,WAAW;AACnB;;AAGA,SAAgB,eAAe,QAAuC;CACpE,IAAI,QAAQ,SAAS,MAAM,WAAW;AACxC;;AAGA,SAAgB,aAAa,KAAuB;CAClD,OAAO,eAAe,SAAS,IAAI,SAAS;AAC9C;;;;;;AAOA,SAAgB,MAAM,IAAY,QAAqC;CACrE,OAAO,IAAI,SAAS,YAAY;EAC9B,IAAI,QAAQ,SAAS;GACnB,QAAQ;GACR;EACF;EACA,IAAI;EACJ,MAAM,QAAQ,iBAAiB;GAC7B,IAAI,WAAW,QAAQ,OAAO,oBAAoB,SAAS,OAAO;GAClE,QAAQ;EACV,GAAG,EAAE;EACL,IAAI,QAAQ;GACV,gBAAgB;IACd,aAAa,KAAK;IAClB,QAAQ;GACV;GACA,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;EAC1D;CACF,CAAC;AACH;;;;;AAMA,SAAgB,YAAe,SAAqB,IAAoC;CACtF,OAAO,IAAI,SAAwB,YAAY;EAC7C,MAAM,QAAQ,iBAAiB,QAAQ,KAAA,CAAS,GAAG,EAAE;EACrD,QAAQ,MACL,UAAU;GACT,aAAa,KAAK;GAClB,QAAQ,KAAK;EACf,SACM;GACJ,aAAa,KAAK;GAClB,QAAQ,KAAA,CAAS;EACnB,CACF;CACF,CAAC;AACH;;;;;;AAcA,SAAgB,cAAc,OAAgB,OAAyB,CAAC,GAAW;CACjF,IAAI;CACJ,IAAI;EACF,IAAI,OAAO,UAAU,UACnB,IAAI;OAGJ,KADa,KAAK,SAAS,KAAK,UAAU,OAAO,MAAM,CAAC,IAAI,KAAK,UAAU,KAAK,MACpE,OAAO,KAAK;CAE5B,QAAQ;EACN,IAAI,OAAO,KAAK;CAClB;CACA,IAAI,KAAK,QAAQ,KAAA,KAAa,EAAE,SAAS,KAAK,KAAK,OAAO,GAAG,EAAE,MAAM,GAAG,KAAK,GAAG,EAAE;CAClF,OAAO;AACT;;AAGA,SAAgB,iBAAiC;CAC/C,OAAO;EAAE,OAAO;EAAG,QAAQ;CAAE;AAC/B;;;;;;;;AASA,SAAgB,eAAe,GAAG,QAEhC;CACA,IAAI,QAAQ;CACZ,IAAI,SAAS;CACb,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,MAAM,iBAAiB,KAAA,GAAW;EACtC,SAAS;EACT,SAAS,MAAM;CACjB;CACA,OAAO,SAAS,EAAE,cAAc,MAAM,IAAI,CAAC;AAC7C;;AAGA,SAAgB,YAAmB;CACjC,OAAO;EAAE,YAAY;EAAG,QAAQ,eAAe;EAAG,KAAK;EAAG,IAAI;CAAE;AAClE;;;;;;;;;;;;;;;;;;;;;AAsBA,SAAgB,eAAe,IAAmB;CAChD,OAAO;EACL,YAAY;EACZ,QAAQ,eAAe;EACvB,aAAa;EACb,KAAK;EACL,UAAU;EACV;CACF;AACF;;AAGA,SAAgB,WAAW,OAAqB;CAC9C,OAAO;EACL,YAAY,MAAM;EAClB,QAAQ,gBAAgB,MAAM,MAAM;EACpC,GAAI,MAAM,gBAAgB,QAAQ,EAAE,aAAa,MAAM,IAAI,CAAC;EAC5D,KAAK,MAAM;EACX,GAAI,MAAM,aAAa,QAAQ,EAAE,UAAU,MAAM,IAAI,CAAC;EACtD,GAAI,MAAM,iBAAiB,KAAA,IAAY,EAAE,cAAc,MAAM,aAAa,IAAI,CAAC;EAC/E,IAAI,MAAM;EACV,GAAG,aAAa,KAAK;CACvB;AACF;;;;;;AAOA,SAAgB,SAAS,GAAU,GAAiB;CAClD,MAAM,SAAS,gBAAgB,EAAE,MAAM;CACvC,cAAc,QAAQ,EAAE,MAAM;CAC9B,OAAO;EACL,YAAY,EAAE,aAAa,EAAE;EAC7B;EACA,GAAI,EAAE,gBAAgB,SAAS,EAAE,gBAAgB,QAAQ,EAAE,aAAa,MAAM,IAAI,CAAC;EACnF,KAAK,EAAE,MAAM,EAAE;EACf,GAAI,EAAE,aAAa,SAAS,EAAE,aAAa,QAAQ,EAAE,UAAU,MAAM,IAAI,CAAC;EAC1E,GAAG,eAAe,GAAG,CAAC;EACtB,IAAI,EAAE,KAAK,EAAE;EACb,GAAG,aAAa,GAAG,CAAC;EACpB,GAAG,mBAAmB,GAAG,CAAC;CAC5B;AACF;;;;;;;;;AAUA,SAAS,mBAAmB,GAAG,QAE7B;CACA,IAAI;CACJ,IAAI,YAAY;CAChB,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,SAAS,MAAM,oBAAoB;EACzC,IAAI,MAAM,qBAAqB,KAAA,GAAW,YAAY;EACtD,SAAS,WAAW,KAAA,KAAa,WAAW,SAAS,SAAS;CAChE;CACA,OAAO,CAAC,aAAa,WAAW,KAAA,KAAa,WAAW,mBACpD,CAAC,IACD,EAAE,kBAAkB,OAAO;AACjC;;;;;;;;;;;;;;;;;AAkBA,SAAS,aAAa,GAAG,QAIvB;CACA,MAAM,UAAU,OAAO,QAAQ,UAAU,MAAM,yBAAyB,KAAA,CAAS;CACjF,IAAI,QAAQ,WAAW,GAAG,OAAO,CAAC;CAClC,IAAI,UAAU;CACd,IAAI,YAAY;CAChB,IAAI,QAAQ;CACZ,IAAI,eAAe;CACnB,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,OAAO,MAAM,eAAe,YAAY,OAAO,SAAS,MAAM,UAAU,GAAG;GAC7E,WAAW,MAAM;GACjB,YAAY;GACZ,IAAI,MAAM,yBAAyB,YAAY,eAAe;EAChE;EACA,IAAI,MAAM,oBAAoB,MAAM,QAAQ;CAC9C;CACA,OAAO;EACL,GAAI,YAAY,EAAE,YAAY,gBAAgB,OAAO,EAAE,IAAI,CAAC;EAC5D,iBAAiB;EACjB,sBAAsB,YAAa,eAAe,aAAa,cAAe;CAChF;AACF;;;;;;;;AASA,SAAgB,gBAAgB,SAAyB;CACvD,OAAO,OAAO,QAAQ,QAAQ,CAAC,CAAC;AAClC;;AAGA,SAAgB,gBAAgB,OAAuC;CACrE,MAAM,wBACJ,MAAM,wBAAwB,SAAU,MAAM,QAAQ,KAAK,CAAC,4BAA4B,KAAK;CAC/F,OAAO;EACL,OAAO,MAAM;EACb,QAAQ,MAAM;EACd,GAAI,MAAM,gBAAgB,QAAQ,EAAE,aAAa,MAAe,IAAI,CAAC;EACrE,GAAI,MAAM,eAAe,KAAA,IAAY,EAAE,YAAY,MAAM,WAAW,IAAI,CAAC;EACzE,GAAI,MAAM,cAAc,KAAA,IAAY,EAAE,WAAW,MAAM,UAAU,IAAI,CAAC;EACtE,GAAI,MAAM,eAAe,KAAA,IAAY,EAAE,YAAY,MAAM,WAAW,IAAI,CAAC;EACzE,GAAI,wBAAwB,EAAE,qBAAqB,MAAe,IAAI,CAAC;CACzE;AACF;;AAGA,SAAgB,0BAA0B,OAAgC;CACxE,IAAI,MAAM,wBAAwB,OAAO,OAAO;CAChD,OAAO,4BAA4B,KAAK;AAC1C;AAEA,SAAS,4BAA4B,OAAgC;CACnE,IAAI,MAAM,UAAU,GAAG,OAAO;CAC9B,IACE,MAAM,eAAe,KAAA,KACrB,MAAM,cAAc,KAAA,KACpB,MAAM,eAAe,KAAA,GAErB,OAAO;CAET,OAAO,MAAM,aAAa,MAAM,YAAY,MAAM,eAAe,MAAM;AACzE;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,cAAc,OAA+B;CAC3D,OAAO,MAAM,QAAQ,kBAAkB,KAAK,IAAI,MAAM;AACxD;;AAGA,SAAS,kBAAkB,OAA+B;CACxD,MAAM,EAAE,cAAc;CACtB,IAAI,cAAc,KAAA,GAAW,OAAO;CACpC,OAAO,gBAAgB,OAAO,SAAS,IAAI,MAAM,QAAQ,IAAI;AAC/D;AAEA,SAAS,gBAAgB,OAAgC,WAA2B;CAClF,QAAQ,MAAM,cAAc,KAAK,aAAa,MAAM,cAAc;AACpE;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgB,wBACd,OACA,aACyB;CACzB,IAAI,gBAAgB,KAAA,GAAW,OAAO,CAAC;CACvC,MAAM,OAAO,WAAW,YAAY,UAAU;CAC9C,MAAM,QAAQ,WAAW,YAAY,WAAW;CAChD,IAAI,SAAS,KAAA,KAAa,UAAU,KAAA,GAAW,OAAO,CAAC;CACvD,IAAI,UAAU,KAAA,MAAc,QAAQ,MAAM,SAAS,KAAK,OACtD,OAAO,EAAE,qBAAqB,MAAM;CAEtC,IAAI,SAAS,KAAA,KAAa,UAAU,KAAA,GAClC,OAAO;EAAE,YAAY,QAAQ,OAAO;EAAO,WAAW;EAAM,YAAY;CAAM;CAEhF,OAAO;EACL,GAAI,SAAS,KAAA,IAAY,EAAE,WAAW,KAAK,IAAI,CAAC;EAChD,GAAI,UAAU,KAAA,IAAY,EAAE,YAAY,MAAM,IAAI,CAAC;EACnD,qBAAqB;CACvB;AACF;AAEA,SAAS,WAAW,OAAoC;CACtD,OAAO,OAAO,UAAU,YAAY,OAAO,cAAc,KAAK,KAAK,SAAS,IAAI,QAAQ,KAAA;AAC1F;;;;;;;;;;AAWA,SAAgB,cAAc,KAAqB,OAAsC;CACvF,IAAI,SAAS,MAAM,SAAS;CAC5B,IAAI,UAAU,MAAM,UAAU;CAC9B,IAAI,MAAM,gBAAgB,OAAO,IAAI,cAAc;CAEnD,MAAM,QAAQ,MAAM,SAAS;CAC7B,MAAM,OAAO,gBAAgB,OAAO,MAAM,aAAa,CAAC,KAAK;CAC7D,IAAI,MAAM;EACR,IAAI,MAAM,eAAe,KAAA,GAAW,IAAI,cAAc,IAAI,cAAc,KAAK,MAAM;EACnF,IAAI,MAAM,cAAc,KAAA,GAAW,IAAI,aAAa,IAAI,aAAa,KAAK,MAAM;EAChF,IAAI,MAAM,eAAe,KAAA,GAAW,IAAI,cAAc,IAAI,cAAc,KAAK,MAAM;CACrF;CAEA,MAAM,aACJ,QACA,MAAM,eAAe,KAAA,KACrB,MAAM,cAAc,KAAA,KACpB,MAAM,eAAe,KAAA,KACrB,MAAM,aAAa,MAAM,YAAY,MAAM,eAAe;CAI5D,IAAI,MAAM,wBAAwB,SAAU,QAAQ,KAAK,CAAC,YACxD,IAAI,sBAAsB;AAE9B;;;;;;;;;;AAWA,eAAsB,mBACpB,OACA,OACA,IACc;CACd,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,CAAC;CAC3C,MAAM,UAAU,IAAI,MAAS,MAAM,MAAM;CACzC,IAAI,OAAO;CACX,IAAI,SAAS;CACb,MAAM,SAAS,YAA2B;EACxC,OAAO,CAAC,QAAQ;GACd,MAAM,IAAI;GACV,QAAQ;GACR,IAAI,KAAK,MAAM,QAAQ;GACvB,IAAI;IACF,QAAQ,KAAK,MAAM,GAAG,MAAM,IAAS,CAAC;GACxC,SAAS,KAAK;IACZ,SAAS;IACT,MAAM;GACR;EACF;CACF;CACA,MAAM,cAAc,KAAK,IAAI,OAAO,MAAM,MAAM;CAChD,MAAM,QAAQ,IAAI,MAAM,KAAK,EAAE,QAAQ,YAAY,SAAS,OAAO,CAAC,CAAC;CACrE,OAAO;AACT"}