@warlock.js/ai 4.2.11 → 4.4.0

package/esm/mock/mock-router.d.mts

@@ -0,0 +1,63 @@
+import { RouteContext } from "../contracts/supervisor/route-context.type.mjs";
+import { Next } from "../contracts/supervisor/next.type.mjs";
+
+//#region ../@warlock.js/ai/src/mock/mock-router.d.ts
+/**
+ * A canned routing decision for {@link mockRouter}. Either a literal
+ * {@link Next} value (intent key, fan-out array, or the `END`
+ * sentinel) or a predicate that derives the decision from the live
+ * {@link RouteContext} — the latter lets a test branch on accumulated
+ * state without scripting an exact per-iteration sequence.
+ */
+type MockRouterDecision<TState = Record<string, unknown>> = Next | ((context: RouteContext<TState>) => Next);
+/**
+ * Behavior when the canned decision queue is exhausted before the
+ * supervisor terminates on its own.
+ *
+ * - `"end"` (default) — return `END`, terminating the run cleanly. The
+ *   common case: script the interesting turns, let the run stop.
+ * - `"throw"` — throw, surfacing the over-run as a test failure. Use
+ *   when every iteration must be accounted for.
+ * - `"repeat"` — replay the last decision for every further iteration.
+ *   Useful for "keep routing to the same intent until evaluate is
+ *   satisfied" scenarios.
+ */
+type MockRouterExhaustion = "end" | "throw" | "repeat";
+/**
+ * Options for {@link mockRouter}.
+ */
+type MockRouterOptions = {
+  /** What to do once the decision queue is exhausted. Default `"end"`. */onExhausted?: MockRouterExhaustion;
+};
+/**
+ * Build a deterministic `route` callback that replays a canned
+ * sequence of routing decisions — one per supervisor iteration — for
+ * testing supervisors without an LLM router.
+ *
+ * Drop the returned callback into `ai.supervisor({ route: mockRouter([...]) })`
+ * in place of an LLM `router`. The Nth iteration consumes the Nth
+ * decision; a function decision is evaluated against the live
+ * `RouteContext`. When the queue runs out, behavior follows
+ * `options.onExhausted` (default: terminate with `END`).
+ *
+ * Pairs with the `toRouteTo` / `toConverge` matchers to assert the
+ * resulting report tree.
+ *
+ * @example
+ * const supervisor = ai.supervisor({
+ *   name: "draft-then-review",
+ *   intents: { writer, critic },
+ *   route: mockRouter(["writer", "critic", END]),
+ * });
+ *
+ * @example
+ * // Branch on accumulated state, repeat the last decision until done.
+ * route: mockRouter(
+ *   ["research", (ctx) => (ctx.state.summary ? END : "research")],
+ *   { onExhausted: "repeat" },
+ * );
+ */
+declare function mockRouter<TState = Record<string, unknown>>(decisions: MockRouterDecision<TState>[], options?: MockRouterOptions): (context: RouteContext<TState>) => Next;
+//#endregion
+export { MockRouterDecision, MockRouterExhaustion, MockRouterOptions, mockRouter };
+//# sourceMappingURL=mock-router.d.mts.map

package/esm/mock/mock-router.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mock-router.d.mts","names":[],"sources":["../../../../../../../@warlock.js/ai/src/mock/mock-router.ts"],"mappings":";;;;;;AAWA;;;;;KAAY,kBAAA,UAA4B,MAAA,qBACpC,IAAA,KACE,OAAA,EAAS,YAAA,CAAa,MAAA,MAAY,IAAA;;;;;;;;;;;;;KAc5B,oBAAA;AAAZ;;;AAAA,KAKY,iBAAA;EALoB,wEAO9B,WAAA,GAAc,oBAAoB;AAAA;;;AAAA;AA+BpC;;;;;;;;;;;;;;;;;;;;;;;;AAG0C;iBAH1B,UAAA,UAAoB,MAAA,mBAClC,SAAA,EAAW,kBAAA,CAAmB,MAAA,KAC9B,OAAA,GAAS,iBAAA,IACP,OAAA,EAAS,YAAA,CAAa,MAAA,MAAY,IAAA"}

package/esm/mock/mock-router.mjs

@@ -0,0 +1,58 @@
+import { END } from "../contracts/end.type.mjs";
+
+//#region ../@warlock.js/ai/src/mock/mock-router.ts
+/**
+* Build a deterministic `route` callback that replays a canned
+* sequence of routing decisions — one per supervisor iteration — for
+* testing supervisors without an LLM router.
+*
+* Drop the returned callback into `ai.supervisor({ route: mockRouter([...]) })`
+* in place of an LLM `router`. The Nth iteration consumes the Nth
+* decision; a function decision is evaluated against the live
+* `RouteContext`. When the queue runs out, behavior follows
+* `options.onExhausted` (default: terminate with `END`).
+*
+* Pairs with the `toRouteTo` / `toConverge` matchers to assert the
+* resulting report tree.
+*
+* @example
+* const supervisor = ai.supervisor({
+*   name: "draft-then-review",
+*   intents: { writer, critic },
+*   route: mockRouter(["writer", "critic", END]),
+* });
+*
+* @example
+* // Branch on accumulated state, repeat the last decision until done.
+* route: mockRouter(
+*   ["research", (ctx) => (ctx.state.summary ? END : "research")],
+*   { onExhausted: "repeat" },
+* );
+*/
+function mockRouter(decisions, options = {}) {
+	const onExhausted = options.onExhausted ?? "end";
+	let cursor = 0;
+	return (context) => {
+		if (cursor < decisions.length) {
+			const decision = decisions[cursor];
+			cursor++;
+			return resolveDecision(decision, context);
+		}
+		if (onExhausted === "throw") throw new Error(`mockRouter exhausted after ${decisions.length} decision(s) at iteration ${context.iteration}`);
+		if (onExhausted === "repeat" && decisions.length > 0) return resolveDecision(decisions[decisions.length - 1], context);
+		return END;
+	};
+}
+/**
+* Resolve a single decision entry into a concrete {@link Next} —
+* invoking the predicate form against the live context, or returning
+* the literal form verbatim.
+*/
+function resolveDecision(decision, context) {
+	if (typeof decision === "function") return decision(context);
+	return decision;
+}
+
+//#endregion
+export { mockRouter };
+//# sourceMappingURL=mock-router.mjs.map

package/esm/mock/mock-router.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"mock-router.mjs","names":[],"sources":["../../../../../../../@warlock.js/ai/src/mock/mock-router.ts"],"sourcesContent":["import { END } from \"../contracts/end.type\";\nimport type { Next } from \"../contracts/supervisor/next.type\";\nimport type { RouteContext } from \"../contracts/supervisor/route-context.type\";\n\n/**\n * A canned routing decision for {@link mockRouter}. Either a literal\n * {@link Next} value (intent key, fan-out array, or the `END`\n * sentinel) or a predicate that derives the decision from the live\n * {@link RouteContext} — the latter lets a test branch on accumulated\n * state without scripting an exact per-iteration sequence.\n */\nexport type MockRouterDecision<TState = Record<string, unknown>> =\n  | Next\n  | ((context: RouteContext<TState>) => Next);\n\n/**\n * Behavior when the canned decision queue is exhausted before the\n * supervisor terminates on its own.\n *\n * - `\"end\"` (default) — return `END`, terminating the run cleanly. The\n *   common case: script the interesting turns, let the run stop.\n * - `\"throw\"` — throw, surfacing the over-run as a test failure. Use\n *   when every iteration must be accounted for.\n * - `\"repeat\"` — replay the last decision for every further iteration.\n *   Useful for \"keep routing to the same intent until evaluate is\n *   satisfied\" scenarios.\n */\nexport type MockRouterExhaustion = \"end\" | \"throw\" | \"repeat\";\n\n/**\n * Options for {@link mockRouter}.\n */\nexport type MockRouterOptions = {\n  /** What to do once the decision queue is exhausted. Default `\"end\"`. */\n  onExhausted?: MockRouterExhaustion;\n};\n\n/**\n * Build a deterministic `route` callback that replays a canned\n * sequence of routing decisions — one per supervisor iteration — for\n * testing supervisors without an LLM router.\n *\n * Drop the returned callback into `ai.supervisor({ route: mockRouter([...]) })`\n * in place of an LLM `router`. The Nth iteration consumes the Nth\n * decision; a function decision is evaluated against the live\n * `RouteContext`. When the queue runs out, behavior follows\n * `options.onExhausted` (default: terminate with `END`).\n *\n * Pairs with the `toRouteTo` / `toConverge` matchers to assert the\n * resulting report tree.\n *\n * @example\n * const supervisor = ai.supervisor({\n *   name: \"draft-then-review\",\n *   intents: { writer, critic },\n *   route: mockRouter([\"writer\", \"critic\", END]),\n * });\n *\n * @example\n * // Branch on accumulated state, repeat the last decision until done.\n * route: mockRouter(\n *   [\"research\", (ctx) => (ctx.state.summary ? END : \"research\")],\n *   { onExhausted: \"repeat\" },\n * );\n */\nexport function mockRouter<TState = Record<string, unknown>>(\n  decisions: MockRouterDecision<TState>[],\n  options: MockRouterOptions = {},\n): (context: RouteContext<TState>) => Next {\n  const onExhausted = options.onExhausted ?? \"end\";\n  let cursor = 0;\n\n  return (context: RouteContext<TState>): Next => {\n    if (cursor < decisions.length) {\n      const decision = decisions[cursor];\n      cursor++;\n\n      return resolveDecision(decision, context);\n    }\n\n    if (onExhausted === \"throw\") {\n      throw new Error(\n        `mockRouter exhausted after ${decisions.length} decision(s) at iteration ${context.iteration}`,\n      );\n    }\n\n    if (onExhausted === \"repeat\" && decisions.length > 0) {\n      return resolveDecision(decisions[decisions.length - 1], context);\n    }\n\n    return END;\n  };\n}\n\n/**\n * Resolve a single decision entry into a concrete {@link Next} —\n * invoking the predicate form against the live context, or returning\n * the literal form verbatim.\n */\nfunction resolveDecision<TState>(\n  decision: MockRouterDecision<TState>,\n  context: RouteContext<TState>,\n): Next {\n  if (typeof decision === \"function\") {\n    return decision(context);\n  }\n\n  return decision;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiEA,SAAgB,WACd,WACA,UAA6B,CAAC,GACW;CACzC,MAAM,cAAc,QAAQ,eAAe;CAC3C,IAAI,SAAS;CAEb,QAAQ,YAAwC;EAC9C,IAAI,SAAS,UAAU,QAAQ;GAC7B,MAAM,WAAW,UAAU;GAC3B;GAEA,OAAO,gBAAgB,UAAU,OAAO;EAC1C;EAEA,IAAI,gBAAgB,SAClB,MAAM,IAAI,MACR,8BAA8B,UAAU,OAAO,4BAA4B,QAAQ,WACrF;EAGF,IAAI,gBAAgB,YAAY,UAAU,SAAS,GACjD,OAAO,gBAAgB,UAAU,UAAU,SAAS,IAAI,OAAO;EAGjE,OAAO;CACT;AACF;;;;;;AAOA,SAAS,gBACP,UACA,SACM;CACN,IAAI,OAAO,aAAa,YACtB,OAAO,SAAS,OAAO;CAGzB,OAAO;AACT"}

package/esm/model/fallback-model.d.mts

@@ -0,0 +1,45 @@
+import { ModelContract } from "../contracts/model.contract.mjs";
+import { FallbackModelContract, FallbackModelOptions } from "../contracts/fallback-model.contract.mjs";
+
+//#region ../@warlock.js/ai/src/model/fallback-model.d.ts
+/**
+ * A `ModelContract` that wraps an ordered list of models and tries each
+ * in turn, advancing to the next only when the current one fails with a
+ * matching (transient) provider error.
+ *
+ * **Role.** A drop-in `ModelContract` for resilience: hand it to any
+ * agent / workflow / supervisor in place of a single model and provider
+ * outages, rate-limits, and timeouts transparently fail over to a
+ * backup. Non-transient failures (bad key, oversized prompt, blocked
+ * content) re-throw immediately rather than wastefully retrying.
+ *
+ * **What it owns / doesn't own.** Owns the ordered model list, the
+ * retry decision, and per-call usage aggregation across attempted
+ * models. Does NOT own retry/backoff timing (it advances instantly to
+ * the next model — pair it with a backoff middleware if you want delay)
+ * nor any provider I/O of its own; every call is delegated to a wrapped
+ * model.
+ *
+ * **Streaming fall-over caveat.** `stream()` can only fail over while no
+ * chunk has been emitted yet. Once the first `delta` / `tool-call`
+ * reaches the consumer, the partial output cannot be un-sent, so a
+ * mid-stream failure propagates instead of restarting on the next
+ * model.
+ *
+ * @example
+ * const model = fallbackModel([
+ *   ai.openai.model({ name: "gpt-4o" }),
+ *   ai.anthropic.model({ name: "claude-3-5-sonnet" }),
+ * ]);
+ * const agent = ai.agent({ model });
+ *
+ * @example
+ * // custom retry predicate
+ * const model = fallbackModel([primary, backup], {
+ *   retryOn: (error) => error instanceof ProviderError,
+ * });
+ */
+declare function fallbackModel(models: ModelContract[], options?: FallbackModelOptions): FallbackModelContract;
+//#endregion
+export { fallbackModel };
+//# sourceMappingURL=fallback-model.d.mts.map

package/esm/model/fallback-model.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fallback-model.d.mts","names":[],"sources":["../../../../../../../@warlock.js/ai/src/model/fallback-model.ts"],"mappings":";;;;;;AAuEA;;;;;;;;;;;;;;AAGwB;;;;;;;;;;;;;;;;;;;;;iBAHR,aAAA,CACd,MAAA,EAAQ,aAAA,IACR,OAAA,GAAU,oBAAA,GACT,qBAAA"}

package/esm/model/fallback-model.mjs

@@ -0,0 +1,218 @@
+import { AIError } from "../errors/ai-error.mjs";
+import { accumulateCost } from "../utils/compute-cost.mjs";
+
+//#region ../@warlock.js/ai/src/model/fallback-model.ts
+/**
+* Error codes treated as transient — and therefore worth falling over
+* to the next model — when the caller does not supply an explicit
+* `retryOn`. Covers provider rate-limits, timeouts, and the generic
+* `PROVIDER_ERROR` catch-all that adapters throw for 5xx / unknown
+* network failures. Deliberately omits auth, invalid-request,
+* context-length, and content-filter: those fail identically on every
+* downstream model, so retrying only burns budget.
+*/
+const DEFAULT_RETRYABLE_CODES = [
+	"PROVIDER_RATE_LIMIT",
+	"PROVIDER_TIMEOUT",
+	"PROVIDER_ERROR"
+];
+/**
+* A `ModelContract` that wraps an ordered list of models and tries each
+* in turn, advancing to the next only when the current one fails with a
+* matching (transient) provider error.
+*
+* **Role.** A drop-in `ModelContract` for resilience: hand it to any
+* agent / workflow / supervisor in place of a single model and provider
+* outages, rate-limits, and timeouts transparently fail over to a
+* backup. Non-transient failures (bad key, oversized prompt, blocked
+* content) re-throw immediately rather than wastefully retrying.
+*
+* **What it owns / doesn't own.** Owns the ordered model list, the
+* retry decision, and per-call usage aggregation across attempted
+* models. Does NOT own retry/backoff timing (it advances instantly to
+* the next model — pair it with a backoff middleware if you want delay)
+* nor any provider I/O of its own; every call is delegated to a wrapped
+* model.
+*
+* **Streaming fall-over caveat.** `stream()` can only fail over while no
+* chunk has been emitted yet. Once the first `delta` / `tool-call`
+* reaches the consumer, the partial output cannot be un-sent, so a
+* mid-stream failure propagates instead of restarting on the next
+* model.
+*
+* @example
+* const model = fallbackModel([
+*   ai.openai.model({ name: "gpt-4o" }),
+*   ai.anthropic.model({ name: "claude-3-5-sonnet" }),
+* ]);
+* const agent = ai.agent({ model });
+*
+* @example
+* // custom retry predicate
+* const model = fallbackModel([primary, backup], {
+*   retryOn: (error) => error instanceof ProviderError,
+* });
+*/
+function fallbackModel(models, options) {
+	if (models.length === 0) throw new AIError("PROVIDER_INVALID_REQUEST", "fallbackModel() requires at least one model in the chain.", void 0, "validation");
+	return new FallbackModel(models, resolveShouldRetry(options?.retryOn));
+}
+/**
+* Build the chain-advancement predicate from the caller's `retryOn`.
+* An array becomes a code membership test against an `AIError.code`; a
+* function is used verbatim; absence falls back to the transient
+* default set.
+*/
+function resolveShouldRetry(retryOn) {
+	if (typeof retryOn === "function") return retryOn;
+	const codes = retryOn ?? DEFAULT_RETRYABLE_CODES;
+	return (error) => {
+		return error instanceof AIError && codes.includes(error.code);
+	};
+}
+/**
+* Add a successful call's usage into a running aggregate, mirroring the
+* agent's trip accumulation: scalar token counts sum, optional channels
+* sum only when present, and cost merges via `accumulateCost` so an
+* unpriced model never erases a priced sibling's cost.
+*/
+function aggregateUsage(total, next) {
+	total.input += next.input;
+	total.output += next.output;
+	total.total += next.total;
+	if (next.cachedTokens !== void 0) total.cachedTokens = (total.cachedTokens ?? 0) + next.cachedTokens;
+	if (next.reasoningTokens !== void 0) total.reasoningTokens = (total.reasoningTokens ?? 0) + next.reasoningTokens;
+	if (next.cacheWriteTokens !== void 0) total.cacheWriteTokens = (total.cacheWriteTokens ?? 0) + next.cacheWriteTokens;
+	total.cost = accumulateCost(total.cost, next.cost);
+}
+/**
+* Internal `ModelContract` implementation backing {@link fallbackModel}.
+*
+* Long-lived (its identity, capabilities, and pricing front the primary
+* model for the wrapper's whole lifetime) so it is a class rather than a
+* closure. Per-call mutable state (the usage aggregate, the attempt log)
+* lives in {@link FallbackRun}, instantiated fresh on every
+* `complete()` / `stream()` so concurrent calls never share bookkeeping.
+*/
+var FallbackModel = class {
+	constructor(models, shouldRetry) {
+		this.models = models;
+		this.shouldRetry = shouldRetry;
+		this.latestAttempts = [];
+		const primary = models[0];
+		this.name = primary.name;
+		this.provider = primary.provider;
+		this.capabilities = primary.capabilities;
+		this.pricing = primary.pricing;
+	}
+	/**
+	* Models that failed with a chain-advancing error during the most
+	* recent `complete()` / `stream()` call, in attempt order. Empty when
+	* the primary model succeeded outright. Overwritten on each call.
+	*/
+	get lastAttempts() {
+		return this.latestAttempts;
+	}
+	async complete(messages, options) {
+		const run = new FallbackRun(this.models, this.shouldRetry);
+		const response = await run.complete(messages, options);
+		this.latestAttempts = run.attempts;
+		return response;
+	}
+	stream(messages, options) {
+		return new FallbackRun(this.models, this.shouldRetry).stream(messages, options, (attempts) => {
+			this.latestAttempts = attempts;
+		});
+	}
+};
+/**
+* Per-call execution of the fallback chain. Holds the usage aggregate
+* and the attempt log for a single `complete()` / `stream()` invocation
+* so the long-lived {@link FallbackModel} stays free of shared mutable
+* state across concurrent calls.
+*/
+var FallbackRun = class {
+	constructor(models, shouldRetry) {
+		this.models = models;
+		this.shouldRetry = shouldRetry;
+		this.attempts = [];
+		this.usage = {
+			input: 0,
+			output: 0,
+			total: 0
+		};
+	}
+	/**
+	* Try each model's `complete()` in order. On a chain-advancing error,
+	* record the attempt and move to the next; on the last model (or a
+	* non-retryable error) re-throw the underlying error verbatim so the
+	* caller still sees a typed `AIError` with its original code.
+	*/
+	async complete(messages, options) {
+		for (let index = 0; index < this.models.length; index++) {
+			const model = this.models[index];
+			const isLast = index === this.models.length - 1;
+			try {
+				const response = await model.complete(messages, options);
+				aggregateUsage(this.usage, response.usage);
+				return {
+					...response,
+					usage: this.usage
+				};
+			} catch (error) {
+				if (isLast || !this.shouldRetry(error)) throw error;
+				this.recordAttempt(model, error);
+			}
+		}
+		throw new AIError("PROVIDER_ERROR", "fallbackModel() exhausted its chain without producing a response.", void 0, "provider");
+	}
+	/**
+	* Try each model's `stream()` in order. Fall-over is only attempted
+	* while no chunk has been emitted yet for the current model — once the
+	* consumer has seen a `delta` / `tool-call`, a mid-stream failure
+	* propagates instead of restarting (partial output cannot be un-sent).
+	* The aggregated usage replaces the `done` chunk's usage so the caller
+	* sees the chain total.
+	*/
+	async *stream(messages, options, onSettle) {
+		try {
+			for (let index = 0; index < this.models.length; index++) {
+				const model = this.models[index];
+				const isLast = index === this.models.length - 1;
+				let emitted = false;
+				try {
+					for await (const chunk of model.stream(messages, options)) {
+						if (chunk.type === "done") {
+							aggregateUsage(this.usage, chunk.usage);
+							yield {
+								...chunk,
+								usage: this.usage
+							};
+							return;
+						}
+						emitted = true;
+						yield chunk;
+					}
+					return;
+				} catch (error) {
+					if (emitted || isLast || !this.shouldRetry(error)) throw error;
+					this.recordAttempt(model, error);
+				}
+			}
+			throw new AIError("PROVIDER_ERROR", "fallbackModel() exhausted its chain without producing a response.", void 0, "provider");
+		} finally {
+			onSettle(this.attempts);
+		}
+	}
+	recordAttempt(model, error) {
+		this.attempts.push({
+			modelName: model.name,
+			provider: model.provider,
+			error
+		});
+	}
+};
+
+//#endregion
+export { fallbackModel };
+//# sourceMappingURL=fallback-model.mjs.map

package/esm/model/fallback-model.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fallback-model.mjs","names":[],"sources":["../../../../../../../@warlock.js/ai/src/model/fallback-model.ts"],"sourcesContent":["import type {\n  FallbackAttempt,\n  FallbackModelContract,\n  FallbackModelOptions,\n  FallbackRetryPredicate,\n} from \"../contracts/fallback-model.contract\";\nimport type { Message } from \"../contracts/conversation-message.type\";\nimport type {\n  ModelCallOptions,\n  ModelCapabilities,\n  ModelContract,\n  ModelResponse,\n  ModelStreamChunk,\n} from \"../contracts/model.contract\";\nimport type { Usage } from \"../contracts/result/usage.type\";\nimport { AIError } from \"../errors/ai-error\";\nimport type { AIErrorCode } from \"../errors/error-code.type\";\nimport { accumulateCost } from \"../utils/compute-cost\";\n\n/**\n * Error codes treated as transient — and therefore worth falling over\n * to the next model — when the caller does not supply an explicit\n * `retryOn`. Covers provider rate-limits, timeouts, and the generic\n * `PROVIDER_ERROR` catch-all that adapters throw for 5xx / unknown\n * network failures. Deliberately omits auth, invalid-request,\n * context-length, and content-filter: those fail identically on every\n * downstream model, so retrying only burns budget.\n */\nconst DEFAULT_RETRYABLE_CODES: readonly AIErrorCode[] = [\n  \"PROVIDER_RATE_LIMIT\",\n  \"PROVIDER_TIMEOUT\",\n  \"PROVIDER_ERROR\",\n];\n\n/**\n * A `ModelContract` that wraps an ordered list of models and tries each\n * in turn, advancing to the next only when the current one fails with a\n * matching (transient) provider error.\n *\n * **Role.** A drop-in `ModelContract` for resilience: hand it to any\n * agent / workflow / supervisor in place of a single model and provider\n * outages, rate-limits, and timeouts transparently fail over to a\n * backup. Non-transient failures (bad key, oversized prompt, blocked\n * content) re-throw immediately rather than wastefully retrying.\n *\n * **What it owns / doesn't own.** Owns the ordered model list, the\n * retry decision, and per-call usage aggregation across attempted\n * models. Does NOT own retry/backoff timing (it advances instantly to\n * the next model — pair it with a backoff middleware if you want delay)\n * nor any provider I/O of its own; every call is delegated to a wrapped\n * model.\n *\n * **Streaming fall-over caveat.** `stream()` can only fail over while no\n * chunk has been emitted yet. Once the first `delta` / `tool-call`\n * reaches the consumer, the partial output cannot be un-sent, so a\n * mid-stream failure propagates instead of restarting on the next\n * model.\n *\n * @example\n * const model = fallbackModel([\n *   ai.openai.model({ name: \"gpt-4o\" }),\n *   ai.anthropic.model({ name: \"claude-3-5-sonnet\" }),\n * ]);\n * const agent = ai.agent({ model });\n *\n * @example\n * // custom retry predicate\n * const model = fallbackModel([primary, backup], {\n *   retryOn: (error) => error instanceof ProviderError,\n * });\n */\nexport function fallbackModel(\n  models: ModelContract[],\n  options?: FallbackModelOptions,\n): FallbackModelContract {\n  if (models.length === 0) {\n    throw new AIError(\n      \"PROVIDER_INVALID_REQUEST\",\n      \"fallbackModel() requires at least one model in the chain.\",\n      undefined,\n      \"validation\",\n    );\n  }\n\n  return new FallbackModel(models, resolveShouldRetry(options?.retryOn));\n}\n\n/**\n * Build the chain-advancement predicate from the caller's `retryOn`.\n * An array becomes a code membership test against an `AIError.code`; a\n * function is used verbatim; absence falls back to the transient\n * default set.\n */\nfunction resolveShouldRetry(\n  retryOn: FallbackModelOptions[\"retryOn\"],\n): FallbackRetryPredicate {\n  if (typeof retryOn === \"function\") {\n    return retryOn;\n  }\n\n  const codes: readonly AIErrorCode[] = retryOn ?? DEFAULT_RETRYABLE_CODES;\n\n  return (error: unknown): boolean => {\n    return error instanceof AIError && codes.includes(error.code);\n  };\n}\n\n/**\n * Add a successful call's usage into a running aggregate, mirroring the\n * agent's trip accumulation: scalar token counts sum, optional channels\n * sum only when present, and cost merges via `accumulateCost` so an\n * unpriced model never erases a priced sibling's cost.\n */\nfunction aggregateUsage(total: Usage, next: Usage): void {\n  total.input += next.input;\n  total.output += next.output;\n  total.total += next.total;\n\n  if (next.cachedTokens !== undefined) {\n    total.cachedTokens = (total.cachedTokens ?? 0) + next.cachedTokens;\n  }\n\n  if (next.reasoningTokens !== undefined) {\n    total.reasoningTokens = (total.reasoningTokens ?? 0) + next.reasoningTokens;\n  }\n\n  if (next.cacheWriteTokens !== undefined) {\n    total.cacheWriteTokens = (total.cacheWriteTokens ?? 0) + next.cacheWriteTokens;\n  }\n\n  total.cost = accumulateCost(total.cost, next.cost);\n}\n\n/**\n * Internal `ModelContract` implementation backing {@link fallbackModel}.\n *\n * Long-lived (its identity, capabilities, and pricing front the primary\n * model for the wrapper's whole lifetime) so it is a class rather than a\n * closure. Per-call mutable state (the usage aggregate, the attempt log)\n * lives in {@link FallbackRun}, instantiated fresh on every\n * `complete()` / `stream()` so concurrent calls never share bookkeeping.\n */\nclass FallbackModel implements FallbackModelContract {\n  public readonly name: string;\n  public readonly provider: string;\n  public readonly capabilities?: ModelCapabilities;\n  public readonly pricing?: ModelContract[\"pricing\"];\n\n  private latestAttempts: FallbackAttempt[] = [];\n\n  public constructor(\n    private readonly models: ModelContract[],\n    private readonly shouldRetry: FallbackRetryPredicate,\n  ) {\n    const primary = models[0]!;\n\n    this.name = primary.name;\n    this.provider = primary.provider;\n    this.capabilities = primary.capabilities;\n    this.pricing = primary.pricing;\n  }\n\n  /**\n   * Models that failed with a chain-advancing error during the most\n   * recent `complete()` / `stream()` call, in attempt order. Empty when\n   * the primary model succeeded outright. Overwritten on each call.\n   */\n  public get lastAttempts(): FallbackAttempt[] {\n    return this.latestAttempts;\n  }\n\n  public async complete(\n    messages: Message[],\n    options?: ModelCallOptions,\n  ): Promise<ModelResponse> {\n    const run = new FallbackRun(this.models, this.shouldRetry);\n    const response = await run.complete(messages, options);\n\n    this.latestAttempts = run.attempts;\n\n    return response;\n  }\n\n  public stream(\n    messages: Message[],\n    options?: ModelCallOptions,\n  ): AsyncIterable<ModelStreamChunk> {\n    const run = new FallbackRun(this.models, this.shouldRetry);\n\n    return run.stream(messages, options, (attempts) => {\n      this.latestAttempts = attempts;\n    });\n  }\n}\n\n/**\n * Per-call execution of the fallback chain. Holds the usage aggregate\n * and the attempt log for a single `complete()` / `stream()` invocation\n * so the long-lived {@link FallbackModel} stays free of shared mutable\n * state across concurrent calls.\n */\nclass FallbackRun {\n  public readonly attempts: FallbackAttempt[] = [];\n\n  private readonly usage: Usage = { input: 0, output: 0, total: 0 };\n\n  public constructor(\n    private readonly models: ModelContract[],\n    private readonly shouldRetry: FallbackRetryPredicate,\n  ) {}\n\n  /**\n   * Try each model's `complete()` in order. On a chain-advancing error,\n   * record the attempt and move to the next; on the last model (or a\n   * non-retryable error) re-throw the underlying error verbatim so the\n   * caller still sees a typed `AIError` with its original code.\n   */\n  public async complete(\n    messages: Message[],\n    options?: ModelCallOptions,\n  ): Promise<ModelResponse> {\n    for (let index = 0; index < this.models.length; index++) {\n      const model = this.models[index]!;\n      const isLast = index === this.models.length - 1;\n\n      try {\n        const response = await model.complete(messages, options);\n\n        aggregateUsage(this.usage, response.usage);\n\n        return { ...response, usage: this.usage };\n      } catch (error) {\n        if (isLast || !this.shouldRetry(error)) {\n          throw error;\n        }\n\n        this.recordAttempt(model, error);\n      }\n    }\n\n    throw new AIError(\n      \"PROVIDER_ERROR\",\n      \"fallbackModel() exhausted its chain without producing a response.\",\n      undefined,\n      \"provider\",\n    );\n  }\n\n  /**\n   * Try each model's `stream()` in order. Fall-over is only attempted\n   * while no chunk has been emitted yet for the current model — once the\n   * consumer has seen a `delta` / `tool-call`, a mid-stream failure\n   * propagates instead of restarting (partial output cannot be un-sent).\n   * The aggregated usage replaces the `done` chunk's usage so the caller\n   * sees the chain total.\n   */\n  public async *stream(\n    messages: Message[],\n    options: ModelCallOptions | undefined,\n    onSettle: (attempts: FallbackAttempt[]) => void,\n  ): AsyncIterable<ModelStreamChunk> {\n    try {\n      for (let index = 0; index < this.models.length; index++) {\n        const model = this.models[index]!;\n        const isLast = index === this.models.length - 1;\n        let emitted = false;\n\n        try {\n          for await (const chunk of model.stream(messages, options)) {\n            if (chunk.type === \"done\") {\n              aggregateUsage(this.usage, chunk.usage);\n\n              yield { ...chunk, usage: this.usage };\n              return;\n            }\n\n            emitted = true;\n\n            yield chunk;\n          }\n\n          return;\n        } catch (error) {\n          if (emitted || isLast || !this.shouldRetry(error)) {\n            throw error;\n          }\n\n          this.recordAttempt(model, error);\n        }\n      }\n\n      throw new AIError(\n        \"PROVIDER_ERROR\",\n        \"fallbackModel() exhausted its chain without producing a response.\",\n        undefined,\n        \"provider\",\n      );\n    } finally {\n      onSettle(this.attempts);\n    }\n  }\n\n  private recordAttempt(model: ModelContract, error: unknown): void {\n    this.attempts.push({\n      modelName: model.name,\n      provider: model.provider,\n      error,\n    });\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AA4BA,MAAM,0BAAkD;CACtD;CACA;CACA;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,SAAgB,cACd,QACA,SACuB;CACvB,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,QACR,4BACA,6DACA,QACA,YACF;CAGF,OAAO,IAAI,cAAc,QAAQ,mBAAmB,SAAS,OAAO,CAAC;AACvE;;;;;;;AAQA,SAAS,mBACP,SACwB;CACxB,IAAI,OAAO,YAAY,YACrB,OAAO;CAGT,MAAM,QAAgC,WAAW;CAEjD,QAAQ,UAA4B;EAClC,OAAO,iBAAiB,WAAW,MAAM,SAAS,MAAM,IAAI;CAC9D;AACF;;;;;;;AAQA,SAAS,eAAe,OAAc,MAAmB;CACvD,MAAM,SAAS,KAAK;CACpB,MAAM,UAAU,KAAK;CACrB,MAAM,SAAS,KAAK;CAEpB,IAAI,KAAK,iBAAiB,QACxB,MAAM,gBAAgB,MAAM,gBAAgB,KAAK,KAAK;CAGxD,IAAI,KAAK,oBAAoB,QAC3B,MAAM,mBAAmB,MAAM,mBAAmB,KAAK,KAAK;CAG9D,IAAI,KAAK,qBAAqB,QAC5B,MAAM,oBAAoB,MAAM,oBAAoB,KAAK,KAAK;CAGhE,MAAM,OAAO,eAAe,MAAM,MAAM,KAAK,IAAI;AACnD;;;;;;;;;;AAWA,IAAM,gBAAN,MAAqD;CAQnD,AAAO,YACL,AAAiB,QACjB,AAAiB,aACjB;EAFiB;EACA;wBAJyB,CAAC;EAM3C,MAAM,UAAU,OAAO;EAEvB,KAAK,OAAO,QAAQ;EACpB,KAAK,WAAW,QAAQ;EACxB,KAAK,eAAe,QAAQ;EAC5B,KAAK,UAAU,QAAQ;CACzB;;;;;;CAOA,IAAW,eAAkC;EAC3C,OAAO,KAAK;CACd;CAEA,MAAa,SACX,UACA,SACwB;EACxB,MAAM,MAAM,IAAI,YAAY,KAAK,QAAQ,KAAK,WAAW;EACzD,MAAM,WAAW,MAAM,IAAI,SAAS,UAAU,OAAO;EAErD,KAAK,iBAAiB,IAAI;EAE1B,OAAO;CACT;CAEA,AAAO,OACL,UACA,SACiC;EAGjC,OAAO,IAFS,YAAY,KAAK,QAAQ,KAAK,WAErC,CAAC,CAAC,OAAO,UAAU,UAAU,aAAa;GACjD,KAAK,iBAAiB;EACxB,CAAC;CACH;AACF;;;;;;;AAQA,IAAM,cAAN,MAAkB;CAKhB,AAAO,YACL,AAAiB,QACjB,AAAiB,aACjB;EAFiB;EACA;kBAN2B,CAAC;eAEf;GAAE,OAAO;GAAG,QAAQ;GAAG,OAAO;EAAE;CAK7D;;;;;;;CAQH,MAAa,SACX,UACA,SACwB;EACxB,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,OAAO,QAAQ,SAAS;GACvD,MAAM,QAAQ,KAAK,OAAO;GAC1B,MAAM,SAAS,UAAU,KAAK,OAAO,SAAS;GAE9C,IAAI;IACF,MAAM,WAAW,MAAM,MAAM,SAAS,UAAU,OAAO;IAEvD,eAAe,KAAK,OAAO,SAAS,KAAK;IAEzC,OAAO;KAAE,GAAG;KAAU,OAAO,KAAK;IAAM;GAC1C,SAAS,OAAO;IACd,IAAI,UAAU,CAAC,KAAK,YAAY,KAAK,GACnC,MAAM;IAGR,KAAK,cAAc,OAAO,KAAK;GACjC;EACF;EAEA,MAAM,IAAI,QACR,kBACA,qEACA,QACA,UACF;CACF;;;;;;;;;CAUA,OAAc,OACZ,UACA,SACA,UACiC;EACjC,IAAI;GACF,KAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,OAAO,QAAQ,SAAS;IACvD,MAAM,QAAQ,KAAK,OAAO;IAC1B,MAAM,SAAS,UAAU,KAAK,OAAO,SAAS;IAC9C,IAAI,UAAU;IAEd,IAAI;KACF,WAAW,MAAM,SAAS,MAAM,OAAO,UAAU,OAAO,GAAG;MACzD,IAAI,MAAM,SAAS,QAAQ;OACzB,eAAe,KAAK,OAAO,MAAM,KAAK;OAEtC,MAAM;QAAE,GAAG;QAAO,OAAO,KAAK;OAAM;OACpC;MACF;MAEA,UAAU;MAEV,MAAM;KACR;KAEA;IACF,SAAS,OAAO;KACd,IAAI,WAAW,UAAU,CAAC,KAAK,YAAY,KAAK,GAC9C,MAAM;KAGR,KAAK,cAAc,OAAO,KAAK;IACjC;GACF;GAEA,MAAM,IAAI,QACR,kBACA,qEACA,QACA,UACF;EACF,UAAU;GACR,SAAS,KAAK,QAAQ;EACxB;CACF;CAEA,AAAQ,cAAc,OAAsB,OAAsB;EAChE,KAAK,SAAS,KAAK;GACjB,WAAW,MAAM;GACjB,UAAU,MAAM;GAChB;EACF,CAAC;CACH;AACF"}

package/esm/model/index.d.mts

@@ -0,0 +1,2 @@
+import { FallbackAttempt, FallbackModelContract, FallbackModelOptions, FallbackRetryPredicate } from "../contracts/fallback-model.contract.mjs";
+import { fallbackModel } from "./fallback-model.mjs";

package/esm/model/index.mjs

@@ -0,0 +1,3 @@
+import { fallbackModel } from "./fallback-model.mjs";
+
+export {  };

package/esm/node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.mjs

@@ -0,0 +1,78 @@
+//#region ../@warlock.js/node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.mjs
+var comma = ",".charCodeAt(0);
+var semicolon = ";".charCodeAt(0);
+var chars = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+var intToChar = new Uint8Array(64);
+var charToInt = new Uint8Array(128);
+for (let i = 0; i < chars.length; i++) {
+	const c = chars.charCodeAt(i);
+	intToChar[i] = c;
+	charToInt[c] = i;
+}
+function encodeInteger(builder, num, relative) {
+	let delta = num - relative;
+	delta = delta < 0 ? -delta << 1 | 1 : delta << 1;
+	do {
+		let clamped = delta & 31;
+		delta >>>= 5;
+		if (delta > 0) clamped |= 32;
+		builder.write(intToChar[clamped]);
+	} while (delta > 0);
+	return num;
+}
+var bufLength = 1024 * 16;
+var td = typeof TextDecoder !== "undefined" ? /* @__PURE__ */ new TextDecoder() : typeof Buffer !== "undefined" ? { decode(buf) {
+	return Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength).toString();
+} } : { decode(buf) {
+	let out = "";
+	for (let i = 0; i < buf.length; i++) out += String.fromCharCode(buf[i]);
+	return out;
+} };
+var StringWriter = class {
+	constructor() {
+		this.pos = 0;
+		this.out = "";
+		this.buffer = new Uint8Array(bufLength);
+	}
+	write(v) {
+		const { buffer } = this;
+		buffer[this.pos++] = v;
+		if (this.pos === bufLength) {
+			this.out += td.decode(buffer);
+			this.pos = 0;
+		}
+	}
+	flush() {
+		const { buffer, out, pos } = this;
+		return pos > 0 ? out + td.decode(buffer.subarray(0, pos)) : out;
+	}
+};
+function encode(decoded) {
+	const writer = new StringWriter();
+	let sourcesIndex = 0;
+	let sourceLine = 0;
+	let sourceColumn = 0;
+	let namesIndex = 0;
+	for (let i = 0; i < decoded.length; i++) {
+		const line = decoded[i];
+		if (i > 0) writer.write(semicolon);
+		if (line.length === 0) continue;
+		let genColumn = 0;
+		for (let j = 0; j < line.length; j++) {
+			const segment = line[j];
+			if (j > 0) writer.write(comma);
+			genColumn = encodeInteger(writer, segment[0], genColumn);
+			if (segment.length === 1) continue;
+			sourcesIndex = encodeInteger(writer, segment[1], sourcesIndex);
+			sourceLine = encodeInteger(writer, segment[2], sourceLine);
+			sourceColumn = encodeInteger(writer, segment[3], sourceColumn);
+			if (segment.length === 4) continue;
+			namesIndex = encodeInteger(writer, segment[4], namesIndex);
+		}
+	}
+	return writer.flush();
+}
+
+//#endregion
+export { encode };
+//# sourceMappingURL=sourcemap-codec.mjs.map

package/esm/node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"sourcemap-codec.mjs","names":[],"sources":["../../../../../../../../../../@warlock.js/node_modules/@jridgewell/sourcemap-codec/dist/sourcemap-codec.mjs"],"sourcesContent":["// src/vlq.ts\nvar comma = \",\".charCodeAt(0);\nvar semicolon = \";\".charCodeAt(0);\nvar chars = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\";\nvar intToChar = new Uint8Array(64);\nvar charToInt = new Uint8Array(128);\nfor (let i = 0; i < chars.length; i++) {\n  const c = chars.charCodeAt(i);\n  intToChar[i] = c;\n  charToInt[c] = i;\n}\nfunction decodeInteger(reader, relative) {\n  let value = 0;\n  let shift = 0;\n  let integer = 0;\n  do {\n    const c = reader.next();\n    integer = charToInt[c];\n    value |= (integer & 31) << shift;\n    shift += 5;\n  } while (integer & 32);\n  const shouldNegate = value & 1;\n  value >>>= 1;\n  if (shouldNegate) {\n    value = -2147483648 | -value;\n  }\n  return relative + value;\n}\nfunction encodeInteger(builder, num, relative) {\n  let delta = num - relative;\n  delta = delta < 0 ? -delta << 1 | 1 : delta << 1;\n  do {\n    let clamped = delta & 31;\n    delta >>>= 5;\n    if (delta > 0) clamped |= 32;\n    builder.write(intToChar[clamped]);\n  } while (delta > 0);\n  return num;\n}\nfunction hasMoreVlq(reader, max) {\n  if (reader.pos >= max) return false;\n  return reader.peek() !== comma;\n}\n\n// src/strings.ts\nvar bufLength = 1024 * 16;\nvar td = typeof TextDecoder !== \"undefined\" ? /* @__PURE__ */ new TextDecoder() : typeof Buffer !== \"undefined\" ? {\n  decode(buf) {\n    const out = Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength);\n    return out.toString();\n  }\n} : {\n  decode(buf) {\n    let out = \"\";\n    for (let i = 0; i < buf.length; i++) {\n      out += String.fromCharCode(buf[i]);\n    }\n    return out;\n  }\n};\nvar StringWriter = class {\n  constructor() {\n    this.pos = 0;\n    this.out = \"\";\n    this.buffer = new Uint8Array(bufLength);\n  }\n  write(v) {\n    const { buffer } = this;\n    buffer[this.pos++] = v;\n    if (this.pos === bufLength) {\n      this.out += td.decode(buffer);\n      this.pos = 0;\n    }\n  }\n  flush() {\n    const { buffer, out, pos } = this;\n    return pos > 0 ? out + td.decode(buffer.subarray(0, pos)) : out;\n  }\n};\nvar StringReader = class {\n  constructor(buffer) {\n    this.pos = 0;\n    this.buffer = buffer;\n  }\n  next() {\n    return this.buffer.charCodeAt(this.pos++);\n  }\n  peek() {\n    return this.buffer.charCodeAt(this.pos);\n  }\n  indexOf(char) {\n    const { buffer, pos } = this;\n    const idx = buffer.indexOf(char, pos);\n    return idx === -1 ? buffer.length : idx;\n  }\n};\n\n// src/scopes.ts\nvar EMPTY = [];\nfunction decodeOriginalScopes(input) {\n  const { length } = input;\n  const reader = new StringReader(input);\n  const scopes = [];\n  const stack = [];\n  let line = 0;\n  for (; reader.pos < length; reader.pos++) {\n    line = decodeInteger(reader, line);\n    const column = decodeInteger(reader, 0);\n    if (!hasMoreVlq(reader, length)) {\n      const last = stack.pop();\n      last[2] = line;\n      last[3] = column;\n      continue;\n    }\n    const kind = decodeInteger(reader, 0);\n    const fields = decodeInteger(reader, 0);\n    const hasName = fields & 1;\n    const scope = hasName ? [line, column, 0, 0, kind, decodeInteger(reader, 0)] : [line, column, 0, 0, kind];\n    let vars = EMPTY;\n    if (hasMoreVlq(reader, length)) {\n      vars = [];\n      do {\n        const varsIndex = decodeInteger(reader, 0);\n        vars.push(varsIndex);\n      } while (hasMoreVlq(reader, length));\n    }\n    scope.vars = vars;\n    scopes.push(scope);\n    stack.push(scope);\n  }\n  return scopes;\n}\nfunction encodeOriginalScopes(scopes) {\n  const writer = new StringWriter();\n  for (let i = 0; i < scopes.length; ) {\n    i = _encodeOriginalScopes(scopes, i, writer, [0]);\n  }\n  return writer.flush();\n}\nfunction _encodeOriginalScopes(scopes, index, writer, state) {\n  const scope = scopes[index];\n  const { 0: startLine, 1: startColumn, 2: endLine, 3: endColumn, 4: kind, vars } = scope;\n  if (index > 0) writer.write(comma);\n  state[0] = encodeInteger(writer, startLine, state[0]);\n  encodeInteger(writer, startColumn, 0);\n  encodeInteger(writer, kind, 0);\n  const fields = scope.length === 6 ? 1 : 0;\n  encodeInteger(writer, fields, 0);\n  if (scope.length === 6) encodeInteger(writer, scope[5], 0);\n  for (const v of vars) {\n    encodeInteger(writer, v, 0);\n  }\n  for (index++; index < scopes.length; ) {\n    const next = scopes[index];\n    const { 0: l, 1: c } = next;\n    if (l > endLine || l === endLine && c >= endColumn) {\n      break;\n    }\n    index = _encodeOriginalScopes(scopes, index, writer, state);\n  }\n  writer.write(comma);\n  state[0] = encodeInteger(writer, endLine, state[0]);\n  encodeInteger(writer, endColumn, 0);\n  return index;\n}\nfunction decodeGeneratedRanges(input) {\n  const { length } = input;\n  const reader = new StringReader(input);\n  const ranges = [];\n  const stack = [];\n  let genLine = 0;\n  let definitionSourcesIndex = 0;\n  let definitionScopeIndex = 0;\n  let callsiteSourcesIndex = 0;\n  let callsiteLine = 0;\n  let callsiteColumn = 0;\n  let bindingLine = 0;\n  let bindingColumn = 0;\n  do {\n    const semi = reader.indexOf(\";\");\n    let genColumn = 0;\n    for (; reader.pos < semi; reader.pos++) {\n      genColumn = decodeInteger(reader, genColumn);\n      if (!hasMoreVlq(reader, semi)) {\n        const last = stack.pop();\n        last[2] = genLine;\n        last[3] = genColumn;\n        continue;\n      }\n      const fields = decodeInteger(reader, 0);\n      const hasDefinition = fields & 1;\n      const hasCallsite = fields & 2;\n      const hasScope = fields & 4;\n      let callsite = null;\n      let bindings = EMPTY;\n      let range;\n      if (hasDefinition) {\n        const defSourcesIndex = decodeInteger(reader, definitionSourcesIndex);\n        definitionScopeIndex = decodeInteger(\n          reader,\n          definitionSourcesIndex === defSourcesIndex ? definitionScopeIndex : 0\n        );\n        definitionSourcesIndex = defSourcesIndex;\n        range = [genLine, genColumn, 0, 0, defSourcesIndex, definitionScopeIndex];\n      } else {\n        range = [genLine, genColumn, 0, 0];\n      }\n      range.isScope = !!hasScope;\n      if (hasCallsite) {\n        const prevCsi = callsiteSourcesIndex;\n        const prevLine = callsiteLine;\n        callsiteSourcesIndex = decodeInteger(reader, callsiteSourcesIndex);\n        const sameSource = prevCsi === callsiteSourcesIndex;\n        callsiteLine = decodeInteger(reader, sameSource ? callsiteLine : 0);\n        callsiteColumn = decodeInteger(\n          reader,\n          sameSource && prevLine === callsiteLine ? callsiteColumn : 0\n        );\n        callsite = [callsiteSourcesIndex, callsiteLine, callsiteColumn];\n      }\n      range.callsite = callsite;\n      if (hasMoreVlq(reader, semi)) {\n        bindings = [];\n        do {\n          bindingLine = genLine;\n          bindingColumn = genColumn;\n          const expressionsCount = decodeInteger(reader, 0);\n          let expressionRanges;\n          if (expressionsCount < -1) {\n            expressionRanges = [[decodeInteger(reader, 0)]];\n            for (let i = -1; i > expressionsCount; i--) {\n              const prevBl = bindingLine;\n              bindingLine = decodeInteger(reader, bindingLine);\n              bindingColumn = decodeInteger(reader, bindingLine === prevBl ? bindingColumn : 0);\n              const expression = decodeInteger(reader, 0);\n              expressionRanges.push([expression, bindingLine, bindingColumn]);\n            }\n          } else {\n            expressionRanges = [[expressionsCount]];\n          }\n          bindings.push(expressionRanges);\n        } while (hasMoreVlq(reader, semi));\n      }\n      range.bindings = bindings;\n      ranges.push(range);\n      stack.push(range);\n    }\n    genLine++;\n    reader.pos = semi + 1;\n  } while (reader.pos < length);\n  return ranges;\n}\nfunction encodeGeneratedRanges(ranges) {\n  if (ranges.length === 0) return \"\";\n  const writer = new StringWriter();\n  for (let i = 0; i < ranges.length; ) {\n    i = _encodeGeneratedRanges(ranges, i, writer, [0, 0, 0, 0, 0, 0, 0]);\n  }\n  return writer.flush();\n}\nfunction _encodeGeneratedRanges(ranges, index, writer, state) {\n  const range = ranges[index];\n  const {\n    0: startLine,\n    1: startColumn,\n    2: endLine,\n    3: endColumn,\n    isScope,\n    callsite,\n    bindings\n  } = range;\n  if (state[0] < startLine) {\n    catchupLine(writer, state[0], startLine);\n    state[0] = startLine;\n    state[1] = 0;\n  } else if (index > 0) {\n    writer.write(comma);\n  }\n  state[1] = encodeInteger(writer, range[1], state[1]);\n  const fields = (range.length === 6 ? 1 : 0) | (callsite ? 2 : 0) | (isScope ? 4 : 0);\n  encodeInteger(writer, fields, 0);\n  if (range.length === 6) {\n    const { 4: sourcesIndex, 5: scopesIndex } = range;\n    if (sourcesIndex !== state[2]) {\n      state[3] = 0;\n    }\n    state[2] = encodeInteger(writer, sourcesIndex, state[2]);\n    state[3] = encodeInteger(writer, scopesIndex, state[3]);\n  }\n  if (callsite) {\n    const { 0: sourcesIndex, 1: callLine, 2: callColumn } = range.callsite;\n    if (sourcesIndex !== state[4]) {\n      state[5] = 0;\n      state[6] = 0;\n    } else if (callLine !== state[5]) {\n      state[6] = 0;\n    }\n    state[4] = encodeInteger(writer, sourcesIndex, state[4]);\n    state[5] = encodeInteger(writer, callLine, state[5]);\n    state[6] = encodeInteger(writer, callColumn, state[6]);\n  }\n  if (bindings) {\n    for (const binding of bindings) {\n      if (binding.length > 1) encodeInteger(writer, -binding.length, 0);\n      const expression = binding[0][0];\n      encodeInteger(writer, expression, 0);\n      let bindingStartLine = startLine;\n      let bindingStartColumn = startColumn;\n      for (let i = 1; i < binding.length; i++) {\n        const expRange = binding[i];\n        bindingStartLine = encodeInteger(writer, expRange[1], bindingStartLine);\n        bindingStartColumn = encodeInteger(writer, expRange[2], bindingStartColumn);\n        encodeInteger(writer, expRange[0], 0);\n      }\n    }\n  }\n  for (index++; index < ranges.length; ) {\n    const next = ranges[index];\n    const { 0: l, 1: c } = next;\n    if (l > endLine || l === endLine && c >= endColumn) {\n      break;\n    }\n    index = _encodeGeneratedRanges(ranges, index, writer, state);\n  }\n  if (state[0] < endLine) {\n    catchupLine(writer, state[0], endLine);\n    state[0] = endLine;\n    state[1] = 0;\n  } else {\n    writer.write(comma);\n  }\n  state[1] = encodeInteger(writer, endColumn, state[1]);\n  return index;\n}\nfunction catchupLine(writer, lastLine, line) {\n  do {\n    writer.write(semicolon);\n  } while (++lastLine < line);\n}\n\n// src/sourcemap-codec.ts\nfunction decode(mappings) {\n  const { length } = mappings;\n  const reader = new StringReader(mappings);\n  const decoded = [];\n  let genColumn = 0;\n  let sourcesIndex = 0;\n  let sourceLine = 0;\n  let sourceColumn = 0;\n  let namesIndex = 0;\n  do {\n    const semi = reader.indexOf(\";\");\n    const line = [];\n    let sorted = true;\n    let lastCol = 0;\n    genColumn = 0;\n    while (reader.pos < semi) {\n      let seg;\n      genColumn = decodeInteger(reader, genColumn);\n      if (genColumn < lastCol) sorted = false;\n      lastCol = genColumn;\n      if (hasMoreVlq(reader, semi)) {\n        sourcesIndex = decodeInteger(reader, sourcesIndex);\n        sourceLine = decodeInteger(reader, sourceLine);\n        sourceColumn = decodeInteger(reader, sourceColumn);\n        if (hasMoreVlq(reader, semi)) {\n          namesIndex = decodeInteger(reader, namesIndex);\n          seg = [genColumn, sourcesIndex, sourceLine, sourceColumn, namesIndex];\n        } else {\n          seg = [genColumn, sourcesIndex, sourceLine, sourceColumn];\n        }\n      } else {\n        seg = [genColumn];\n      }\n      line.push(seg);\n      reader.pos++;\n    }\n    if (!sorted) sort(line);\n    decoded.push(line);\n    reader.pos = semi + 1;\n  } while (reader.pos <= length);\n  return decoded;\n}\nfunction sort(line) {\n  line.sort(sortComparator);\n}\nfunction sortComparator(a, b) {\n  return a[0] - b[0];\n}\nfunction encode(decoded) {\n  const writer = new StringWriter();\n  let sourcesIndex = 0;\n  let sourceLine = 0;\n  let sourceColumn = 0;\n  let namesIndex = 0;\n  for (let i = 0; i < decoded.length; i++) {\n    const line = decoded[i];\n    if (i > 0) writer.write(semicolon);\n    if (line.length === 0) continue;\n    let genColumn = 0;\n    for (let j = 0; j < line.length; j++) {\n      const segment = line[j];\n      if (j > 0) writer.write(comma);\n      genColumn = encodeInteger(writer, segment[0], genColumn);\n      if (segment.length === 1) continue;\n      sourcesIndex = encodeInteger(writer, segment[1], sourcesIndex);\n      sourceLine = encodeInteger(writer, segment[2], sourceLine);\n      sourceColumn = encodeInteger(writer, segment[3], sourceColumn);\n      if (segment.length === 4) continue;\n      namesIndex = encodeInteger(writer, segment[4], namesIndex);\n    }\n  }\n  return writer.flush();\n}\nexport {\n  decode,\n  decodeGeneratedRanges,\n  decodeOriginalScopes,\n  encode,\n  encodeGeneratedRanges,\n  encodeOriginalScopes\n};\n//# sourceMappingURL=sourcemap-codec.mjs.map\n"],"x_google_ignoreList":[0],"mappings":";AACA,IAAI,QAAQ,IAAI,WAAW,CAAC;AAC5B,IAAI,YAAY,IAAI,WAAW,CAAC;AAChC,IAAI,QAAQ;AACZ,IAAI,YAAY,IAAI,WAAW,EAAE;AACjC,IAAI,YAAY,IAAI,WAAW,GAAG;AAClC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;CACrC,MAAM,IAAI,MAAM,WAAW,CAAC;CAC5B,UAAU,KAAK;CACf,UAAU,KAAK;AACjB;AAkBA,SAAS,cAAc,SAAS,KAAK,UAAU;CAC7C,IAAI,QAAQ,MAAM;CAClB,QAAQ,QAAQ,IAAI,CAAC,SAAS,IAAI,IAAI,SAAS;CAC/C,GAAG;EACD,IAAI,UAAU,QAAQ;EACtB,WAAW;EACX,IAAI,QAAQ,GAAG,WAAW;EAC1B,QAAQ,MAAM,UAAU,QAAQ;CAClC,SAAS,QAAQ;CACjB,OAAO;AACT;AAOA,IAAI,YAAY,OAAO;AACvB,IAAI,KAAK,OAAO,gBAAgB,8BAA8B,IAAI,YAAY,IAAI,OAAO,WAAW,cAAc,EAChH,OAAO,KAAK;CAEV,OADY,OAAO,KAAK,IAAI,QAAQ,IAAI,YAAY,IAAI,UAC/C,CAAC,CAAC,SAAS;AACtB,EACF,IAAI,EACF,OAAO,KAAK;CACV,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAC9B,OAAO,OAAO,aAAa,IAAI,EAAE;CAEnC,OAAO;AACT,EACF;AACA,IAAI,eAAe,MAAM;CACvB,cAAc;EACZ,KAAK,MAAM;EACX,KAAK,MAAM;EACX,KAAK,SAAS,IAAI,WAAW,SAAS;CACxC;CACA,MAAM,GAAG;EACP,MAAM,EAAE,WAAW;EACnB,OAAO,KAAK,SAAS;EACrB,IAAI,KAAK,QAAQ,WAAW;GAC1B,KAAK,OAAO,GAAG,OAAO,MAAM;GAC5B,KAAK,MAAM;EACb;CACF;CACA,QAAQ;EACN,MAAM,EAAE,QAAQ,KAAK,QAAQ;EAC7B,OAAO,MAAM,IAAI,MAAM,GAAG,OAAO,OAAO,SAAS,GAAG,GAAG,CAAC,IAAI;CAC9D;AACF;AAuTA,SAAS,OAAO,SAAS;CACvB,MAAM,SAAS,IAAI,aAAa;CAChC,IAAI,eAAe;CACnB,IAAI,aAAa;CACjB,IAAI,eAAe;CACnB,IAAI,aAAa;CACjB,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;EACvC,MAAM,OAAO,QAAQ;EACrB,IAAI,IAAI,GAAG,OAAO,MAAM,SAAS;EACjC,IAAI,KAAK,WAAW,GAAG;EACvB,IAAI,YAAY;EAChB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;GACpC,MAAM,UAAU,KAAK;GACrB,IAAI,IAAI,GAAG,OAAO,MAAM,KAAK;GAC7B,YAAY,cAAc,QAAQ,QAAQ,IAAI,SAAS;GACvD,IAAI,QAAQ,WAAW,GAAG;GAC1B,eAAe,cAAc,QAAQ,QAAQ,IAAI,YAAY;GAC7D,aAAa,cAAc,QAAQ,QAAQ,IAAI,UAAU;GACzD,eAAe,cAAc,QAAQ,QAAQ,IAAI,YAAY;GAC7D,IAAI,QAAQ,WAAW,GAAG;GAC1B,aAAa,cAAc,QAAQ,QAAQ,IAAI,UAAU;EAC3D;CACF;CACA,OAAO,OAAO,MAAM;AACtB"}