@mcp-abap-adt/llm-agent 26.0.0 → 28.0.0

package/dist/interfaces/failure-strategy.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"failure-strategy.js","sourceRoot":"","sources":["../../src/interfaces/failure-strategy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AA6B5D;;;;;;GAMG;AACH,MAAM,OAAO,aAAa;IACf,IAAI,GAAG,gBAAgB,CAAC;IAEjC,MAAM;QACJ,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;IACzD,CAAC;CACF;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,OAAO,gBAAgB;IAClB,IAAI,GAAG,oBAAoB,CAAC;IACpB,QAAQ,CAAS;IACjB,WAAW,CAAS;IACpB,QAAQ,CAAsB;IAC9B,cAAc,CAAoB;IAEnD,YAAY,OASX;QACC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;QACvC,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,EAAE,CAAC;IACrD,CAAC;IAED,MAAM,CAAC,EACL,MAAM,EACN,OAAO,EACP,SAAS,EACT,KAAK,GACU;QACf,IAAI,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC5B,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;QACzD,CAAC;QACD,MAAM,cAAc,GAAG,SAAS;YAC9B,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC;YACzB,CAAC,CAAC,MAAM,KAAK,SAAS;gBACpB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;gBAC3B,CAAC,CAAC,uEAAuE;oBACvE,sEAAsE;oBACtE,qEAAqE;oBACrE,iBAAiB,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,OAAO;gBACL,MAAM,EAAE,CAAC;gBACT,KAAK,EAAE,KAAK;gBACZ,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,eAAe;aACnD,CAAC;QACJ,CAAC;QACD,oEAAoE;QACpE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACxE,CAAC;IAEO,WAAW,CAAC,KAAc;QAChC,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACnD,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACpE,CAAC;CACF"}

package/dist/llm/rate-limit.d.ts

@@ -1,165 +0,0 @@
-/**
- * Shared rate-limit handling for every LLM provider.
- *
- * None of the providers handled HTTP 429 (issue #282). Each one let the status
- * collapse into an error message, so consumers were reduced to matching the
- * substring "429" in prose to decide whether to retry.
- *
- * The policy lives here rather than in a provider because the providers differ
- * in SDK but not in the shape of the problem: a shared quota, a documented
- * `Retry-After`, and a herd of concurrent callers that will all rediscover the
- * same limit unless something holds them back together.
- *
- * SAP AI Core states the rules this implements
- * (help.sap.com, Rate Limit Management):
- *
- *   Do not retry immediately after a 429. Use exponential backoff with jitter
- *   to prevent thundering-herd behavior. If the response includes a
- *   `Retry-After` header, use its value as the wait interval. Limit retries by
- *   using a maximum cap (for example, 5 retries or 60 seconds total wait).
- *
- * The same rules fit Anthropic and OpenAI, which return 429 with `Retry-After`
- * as ordinary HTTP. Ollama is local and never rate-limited; it simply never
- * enters this path.
- */
-export interface RateLimitPolicy {
-    /** Set false to pass every error straight through. */
-    enabled: boolean;
-    /** Total attempts INCLUDING the first. 1 disables retrying without disabling the gate. */
-    maxAttempts: number;
-    /** Give up once the accumulated waiting would exceed this. */
-    maxTotalWaitMs: number;
-    /** First backoff step when the server names no time of its own. */
-    baseDelayMs: number;
-    /** Ceiling for one computed step, before jitter. */
-    maxDelayMs: number;
-}
-export declare const DEFAULT_RATE_LIMIT_POLICY: RateLimitPolicy;
-/** An error annotated by this module, so consumers read a fact instead of prose. */
-export interface RateLimitedError extends Error {
-    rateLimited: true;
-    /** What the server asked for, when it asked. */
-    retryAfterSeconds?: number;
-    /** How many attempts were spent before giving up. */
-    attempts: number;
-}
-export declare function isRateLimitedError(e: unknown): e is RateLimitedError;
-/**
- * One shared pause per quota.
- *
- * A rate limit belongs to the quota, not to the request that happened to
- * discover it. When one call is told to wait, every other call against the same
- * quota is already over the limit too — letting each find that out for itself
- * means N more rejected requests and N more penalties, which is how a limit
- * that should last one window lasts several.
- *
- * Keyed because limits are per model: one model being throttled says nothing
- * about another.
- */
-export declare class RateLimitGate {
-    private notBefore;
-    /** Hold every caller until the named time. Never shortens an existing hold. */
-    penalise(ms: number, now?: number): void;
-    /** Milliseconds still to wait, or 0. */
-    remaining(now?: number): number;
-    clear(): void;
-    /**
-     * Wait out any active hold.
-     *
-     * Re-checked after every wake, because the hold is not fixed at the moment
-     * this caller started waiting: another caller's 429 extends it, and a sleeper
-     * timed against the old deadline would wake early and spend a request on a
-     * quota the server has since said is still closed.
-     *
-     * The wait is jittered per caller: without that, everyone released by one
-     * penalty wakes in the same millisecond and rebuilds the herd the penalty was
-     * meant to break up.
-     */
-    waitUntilOpen(signal?: AbortSignal, maxWaitMs?: number): Promise<void>;
-}
-/**
- * Keys are open-ended — a per-request model override mints a new one — so the
- * registry is pruned rather than left to grow for the life of the process.
- * Only entries that are both open and long idle are dropped: a held gate is
- * doing its job, and a recently used one may still be someone's in-flight call.
- */
-export declare const GATE_IDLE_TTL_MS: number;
-/**
- * How many quotas the registry keeps. Enforced by evicting gates that are both
- * open and unheld, so a process with more than this many pauses or in-flight
- * calls at once can exceed it — those gates are load-bearing. Evicting an idle
- * one costs nothing: it carries no deadline, and the next call mints an
- * equivalent.
- */
-export declare const GATE_LIMIT = 500;
-/** The gate for one quota. Shared across every provider instance in the process. */
-export declare function gateFor(key: string): RateLimitGate;
-/**
- * Hold a gate for the length of one call, and keep it in the registry meanwhile.
- *
- * Being open is not the same as being unused. A request is in flight for as
- * long as it takes the server to answer, and until that answer arrives the gate
- * it belongs to has no pause on it. Evicted in that window, the call would go on
- * to penalise an object the registry no longer knows: the pause would be real
- * and invisible, and the next caller would be handed a fresh open gate and sent
- * straight into a quota that had just closed. Worse than no gate at all, since
- * the penalty is paid and nothing is bought with it.
- *
- * Release in a `finally`. Releasing twice is harmless.
- */
-export declare function leaseRateLimitGate(key: string): {
-    gate: RateLimitGate;
-    release: () => void;
-};
-/**
- * Reclaim gates that are open and long idle. Exported so a long-lived host can
- * run it on a timer, and so the reclaim can be tested at a chosen `now` without
- * waiting ten minutes. It frees only what is certainly stale; the size bound is
- * enforced separately, by `reclaimGates`.
- */
-export declare function pruneRateLimitGates(now?: number): void;
-/** How many quotas are currently tracked. Diagnostics and tests. */
-export declare function rateLimitGateCount(): number;
-/** Test seam — drops every gate. */
-export declare function resetRateLimitGates(): void;
-export interface RateLimitRetryOptions {
-    /** Identifies the quota being spent. Limits are per model, so include it. */
-    key: string;
-    policy?: Partial<RateLimitPolicy>;
-    /** Does this error mean "too many requests"? */
-    isRateLimited: (error: unknown) => boolean;
-    /** What the server asked us to wait, in seconds, if it said. */
-    retryAfterSeconds?: (error: unknown) => number | undefined;
-    signal?: AbortSignal;
-    onRetry?: (info: {
-        attempt: number;
-        delayMs: number;
-        retryAfterSeconds?: number;
-    }) => void;
-}
-/**
- * Run `fn`, respecting the shared pause and retrying a rate limit.
- *
- * Any error that is not a rate limit is rethrown untouched and immediately —
- * this is not a general-purpose retry, and turning a genuine failure into four
- * more of them would be worse than the failure.
- */
-export declare function runWithRateLimitRetry<T>(fn: () => Promise<T>, opts: RateLimitRetryOptions): Promise<T>;
-/**
- * The rate-limit marker on an error or anywhere in its `cause` chain.
- *
- * Layers above the provider rewrap errors — the ILlm adapter turns anything
- * thrown into an `LlmError` — so the marker is rarely still on the outermost
- * object by the time a retry decorator inspects it. Bounded by depth and a
- * visited set, like `extractStatusCode`, so a cyclic chain cannot hang.
- */
-export declare function findRateLimit(err: unknown): RateLimitedError | undefined;
-/**
- * Carry the rate-limit facts onto a provider's own error.
- *
- * Every provider catches its transport error and rethrows something friendlier.
- * That is fine for a message and fatal for a fact: the 429 would be lost at the
- * exact boundary where the consumer needs it. This moves the facts across.
- */
-export declare function preserveRateLimit<E extends Error>(original: unknown, wrapped: E): E;
-//# sourceMappingURL=rate-limit.d.ts.map

package/dist/llm/rate-limit.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"rate-limit.d.ts","sourceRoot":"","sources":["../../src/llm/rate-limit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAIH,MAAM,WAAW,eAAe;IAC9B,sDAAsD;IACtD,OAAO,EAAE,OAAO,CAAC;IACjB,0FAA0F;IAC1F,WAAW,EAAE,MAAM,CAAC;IACpB,8DAA8D;IAC9D,cAAc,EAAE,MAAM,CAAC;IACvB,mEAAmE;IACnE,WAAW,EAAE,MAAM,CAAC;IACpB,oDAAoD;IACpD,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,eAAO,MAAM,yBAAyB,EAAE,eAMvC,CAAC;AAEF,oFAAoF;AACpF,MAAM,WAAW,gBAAiB,SAAQ,KAAK;IAC7C,WAAW,EAAE,IAAI,CAAC;IAClB,gDAAgD;IAChD,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,qDAAqD;IACrD,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,IAAI,gBAAgB,CAMpE;AA8BD;;;;;;;;;;;GAWG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,SAAS,CAAK;IAEtB,+EAA+E;IAC/E,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,GAAE,MAAmB,GAAG,IAAI;IAIpD,wCAAwC;IACxC,SAAS,CAAC,GAAG,GAAE,MAAmB,GAAG,MAAM;IAI3C,KAAK,IAAI,IAAI;IAIb;;;;;;;;;;;OAWG;IACG,aAAa,CACjB,MAAM,CAAC,EAAE,WAAW,EACpB,SAAS,SAA2B,GACnC,OAAO,CAAC,IAAI,CAAC;CAiBjB;AAWD;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,QAAc,CAAC;AAC5C;;;;;;GAMG;AACH,eAAO,MAAM,UAAU,MAAM,CAAC;AAE9B,oFAAoF;AACpF,wBAAgB,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,aAAa,CAelD;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG;IAC/C,IAAI,EAAE,aAAa,CAAC;IACpB,OAAO,EAAE,MAAM,IAAI,CAAC;CACrB,CAgBA;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,GAAE,MAAmB,GAAG,IAAI,CAMlE;AAsCD,oEAAoE;AACpE,wBAAgB,kBAAkB,IAAI,MAAM,CAE3C;AAED,oCAAoC;AACpC,wBAAgB,mBAAmB,IAAI,IAAI,CAE1C;AAED,MAAM,WAAW,qBAAqB;IACpC,6EAA6E;IAC7E,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,CAAC,EAAE,OAAO,CAAC,eAAe,CAAC,CAAC;IAClC,gDAAgD;IAChD,aAAa,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,OAAO,CAAC;IAC3C,gEAAgE;IAChE,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,OAAO,KAAK,MAAM,GAAG,SAAS,CAAC;IAC3D,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB,OAAO,CAAC,EAAE,CAAC,IAAI,EAAE;QACf,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;QAChB,iBAAiB,CAAC,EAAE,MAAM,CAAC;KAC5B,KAAK,IAAI,CAAC;CACZ;AAED;;;;;;GAMG;AACH,wBAAsB,qBAAqB,CAAC,CAAC,EAC3C,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACpB,IAAI,EAAE,qBAAqB,GAC1B,OAAO,CAAC,CAAC,CAAC,CAUZ;AAuFD;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,OAAO,GAAG,gBAAgB,GAAG,SAAS,CAWxE;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,SAAS,KAAK,EAC/C,QAAQ,EAAE,OAAO,EACjB,OAAO,EAAE,CAAC,GACT,CAAC,CASH"}

package/dist/llm/rate-limit.js

@@ -1,394 +0,0 @@
-/**
- * Shared rate-limit handling for every LLM provider.
- *
- * None of the providers handled HTTP 429 (issue #282). Each one let the status
- * collapse into an error message, so consumers were reduced to matching the
- * substring "429" in prose to decide whether to retry.
- *
- * The policy lives here rather than in a provider because the providers differ
- * in SDK but not in the shape of the problem: a shared quota, a documented
- * `Retry-After`, and a herd of concurrent callers that will all rediscover the
- * same limit unless something holds them back together.
- *
- * SAP AI Core states the rules this implements
- * (help.sap.com, Rate Limit Management):
- *
- *   Do not retry immediately after a 429. Use exponential backoff with jitter
- *   to prevent thundering-herd behavior. If the response includes a
- *   `Retry-After` header, use its value as the wait interval. Limit retries by
- *   using a maximum cap (for example, 5 retries or 60 seconds total wait).
- *
- * The same rules fit Anthropic and OpenAI, which return 429 with `Retry-After`
- * as ordinary HTTP. Ollama is local and never rate-limited; it simply never
- * enters this path.
- */
-import { DefaultWaitStrategy } from '../interfaces/wait-strategy.js';
-export const DEFAULT_RATE_LIMIT_POLICY = {
-    enabled: true,
-    maxAttempts: 5,
-    maxTotalWaitMs: 60_000,
-    baseDelayMs: 1_000,
-    maxDelayMs: 20_000,
-};
-export function isRateLimitedError(e) {
-    return (typeof e === 'object' &&
-        e !== null &&
-        e.rateLimited === true);
-}
-const waiter = new DefaultWaitStrategy();
-/**
- * Sleep, or throw if the signal aborts.
- *
- * Delegated to the shared wait strategy rather than hand-rolled: the listener
- * bookkeeping is where a sleep like this goes wrong. One added per backoff and
- * never removed accumulates on a request- or session-scoped signal until Node
- * warns about the leak — a defect this repository has already fixed once, in
- * the retry decorators. Fixed in one place, it stays fixed for every waiter.
- */
-const sleep = async (ms, signal) => {
-    const aborted = () => signal?.reason ?? new Error('Aborted');
-    if (signal?.aborted)
-        throw aborted();
-    if ((await waiter.wait(ms, signal)) === 'aborted')
-        throw aborted();
-};
-/**
- * Per-caller spread on waking, so everyone released by one penalty does not
- * wake in the same millisecond and rebuild the herd the penalty broke up.
- *
- * It is added to a wait, never to a budget: a wait capped at exactly the budget
- * simply loses the spread, which costs nothing — a caller whose budget ends
- * with the pause is leaving either way.
- */
-const WAKE_SPREAD_MS = 250;
-/**
- * One shared pause per quota.
- *
- * A rate limit belongs to the quota, not to the request that happened to
- * discover it. When one call is told to wait, every other call against the same
- * quota is already over the limit too — letting each find that out for itself
- * means N more rejected requests and N more penalties, which is how a limit
- * that should last one window lasts several.
- *
- * Keyed because limits are per model: one model being throttled says nothing
- * about another.
- */
-export class RateLimitGate {
-    notBefore = 0;
-    /** Hold every caller until the named time. Never shortens an existing hold. */
-    penalise(ms, now = Date.now()) {
-        this.notBefore = Math.max(this.notBefore, now + ms);
-    }
-    /** Milliseconds still to wait, or 0. */
-    remaining(now = Date.now()) {
-        return Math.max(0, this.notBefore - now);
-    }
-    clear() {
-        this.notBefore = 0;
-    }
-    /**
-     * Wait out any active hold.
-     *
-     * Re-checked after every wake, because the hold is not fixed at the moment
-     * this caller started waiting: another caller's 429 extends it, and a sleeper
-     * timed against the old deadline would wake early and spend a request on a
-     * quota the server has since said is still closed.
-     *
-     * The wait is jittered per caller: without that, everyone released by one
-     * penalty wakes in the same millisecond and rebuilds the herd the penalty was
-     * meant to break up.
-     */
-    async waitUntilOpen(signal, maxWaitMs = Number.POSITIVE_INFINITY) {
-        const deadline = Date.now() + maxWaitMs;
-        for (;;) {
-            const left = this.remaining();
-            if (left <= 0)
-                return;
-            const budget = deadline - Date.now();
-            // Out of the caller's budget with the gate still shut. It is told, not
-            // held: `remaining()` still reports the hold, and the caller decides.
-            if (budget <= 0)
-                return;
-            // A timer that lands a hair early is simply waited out again on the next
-            // turn, which is why the cap needs no padding to be safe.
-            await sleep(Math.min(left + Math.random() * WAKE_SPREAD_MS, budget), signal);
-        }
-    }
-}
-const gates = new Map();
-/**
- * Keys are open-ended — a per-request model override mints a new one — so the
- * registry is pruned rather than left to grow for the life of the process.
- * Only entries that are both open and long idle are dropped: a held gate is
- * doing its job, and a recently used one may still be someone's in-flight call.
- */
-export const GATE_IDLE_TTL_MS = 10 * 60_000;
-/**
- * How many quotas the registry keeps. Enforced by evicting gates that are both
- * open and unheld, so a process with more than this many pauses or in-flight
- * calls at once can exceed it — those gates are load-bearing. Evicting an idle
- * one costs nothing: it carries no deadline, and the next call mints an
- * equivalent.
- */
-export const GATE_LIMIT = 500;
-/** The gate for one quota. Shared across every provider instance in the process. */
-export function gateFor(key) {
-    const now = Date.now();
-    const existing = gates.get(key);
-    if (existing) {
-        existing.lastUsed = now;
-        return existing.gate;
-    }
-    if (gates.size >= GATE_LIMIT)
-        reclaimGates(now);
-    const entry = {
-        gate: new RateLimitGate(),
-        lastUsed: now,
-        leases: 0,
-    };
-    gates.set(key, entry);
-    return entry.gate;
-}
-/**
- * Hold a gate for the length of one call, and keep it in the registry meanwhile.
- *
- * Being open is not the same as being unused. A request is in flight for as
- * long as it takes the server to answer, and until that answer arrives the gate
- * it belongs to has no pause on it. Evicted in that window, the call would go on
- * to penalise an object the registry no longer knows: the pause would be real
- * and invisible, and the next caller would be handed a fresh open gate and sent
- * straight into a quota that had just closed. Worse than no gate at all, since
- * the penalty is paid and nothing is bought with it.
- *
- * Release in a `finally`. Releasing twice is harmless.
- */
-export function leaseRateLimitGate(key) {
-    const gate = gateFor(key);
-    // By identity, not by key: `resetRateLimitGates` may have replaced the entry
-    // by the time this is released, and that entry's count is not ours to touch.
-    const entry = gates.get(key);
-    if (entry)
-        entry.leases += 1;
-    let released = false;
-    return {
-        gate,
-        release: () => {
-            if (released || !entry)
-                return;
-            released = true;
-            entry.leases -= 1;
-            entry.lastUsed = Date.now();
-        },
-    };
-}
-/**
- * Reclaim gates that are open and long idle. Exported so a long-lived host can
- * run it on a timer, and so the reclaim can be tested at a chosen `now` without
- * waiting ten minutes. It frees only what is certainly stale; the size bound is
- * enforced separately, by `reclaimGates`.
- */
-export function pruneRateLimitGates(now = Date.now()) {
-    for (const [key, entry] of gates) {
-        if (isEvictable(entry, now) && now - entry.lastUsed > GATE_IDLE_TTL_MS) {
-            gates.delete(key);
-        }
-    }
-}
-/**
- * Safe to forget: nobody is waiting behind it, and no call is holding it.
- *
- * An open, unleased gate carries no state at all — the next call mints an
- * equivalent one and loses nothing.
- */
-function isEvictable(entry, now) {
-    return entry.leases === 0 && entry.gate.remaining(now) === 0;
-}
-/**
- * Hold the registry at `GATE_LIMIT`.
- *
- * Age alone is not a bound: a burst of per-request model overrides mints keys
- * far faster than the ten-minute idle rule retires them, and the map grows for
- * as long as the burst lasts. So once the stale entries are gone, the least
- * recently used OPEN gates go too, oldest first, until the registry is back
- * under the limit.
- *
- * Only idle gates are evicted: not one holding a pause, which IS the pause, and
- * not one a call is still holding, which may be about to become a pause.
- */
-function reclaimGates(now) {
-    pruneRateLimitGates(now);
-    if (gates.size < GATE_LIMIT)
-        return;
-    const evictable = [...gates]
-        .filter(([, entry]) => isEvictable(entry, now))
-        .sort((a, b) => a[1].lastUsed - b[1].lastUsed);
-    for (const [key] of evictable) {
-        if (gates.size < GATE_LIMIT)
-            return;
-        gates.delete(key);
-    }
-}
-/** How many quotas are currently tracked. Diagnostics and tests. */
-export function rateLimitGateCount() {
-    return gates.size;
-}
-/** Test seam — drops every gate. */
-export function resetRateLimitGates() {
-    gates.clear();
-}
-/**
- * Run `fn`, respecting the shared pause and retrying a rate limit.
- *
- * Any error that is not a rate limit is rethrown untouched and immediately —
- * this is not a general-purpose retry, and turning a genuine failure into four
- * more of them would be worse than the failure.
- */
-export async function runWithRateLimitRetry(fn, opts) {
-    const policy = { ...DEFAULT_RATE_LIMIT_POLICY, ...opts.policy };
-    if (!policy.enabled)
-        return fn();
-    const { gate, release } = leaseRateLimitGate(opts.key);
-    try {
-        return await attemptWithGate(fn, opts, policy, gate);
-    }
-    finally {
-        release();
-    }
-}
-async function attemptWithGate(fn, opts, policy, gate) {
-    let attempt = 0;
-    let waited = 0;
-    for (;;) {
-        // Waiting at the gate is waiting. Uncounted it was free, so a caller with a
-        // ten-millisecond budget could sit out a minute-long pause another caller
-        // had earned, its declared budget saying nothing about the time it spent.
-        // Decided before the wait, never during it: a hold longer than what is left
-        // of the budget is refused outright rather than half-served.
-        const hold = gate.remaining();
-        if (hold > 0) {
-            const budgetLeft = policy.maxTotalWaitMs - waited;
-            if (hold > budgetLeft)
-                throw outOfBudgetAtGate(hold, attempt);
-            const before = Date.now();
-            // Capped as well as pre-checked: a pause that fits when the wait starts
-            // can be extended past the budget by someone else's 429 while it runs.
-            // The cap is the budget exactly. Padding it to protect the wake spread
-            // would make the budget the one thing it must not be — approximate.
-            await gate.waitUntilOpen(opts.signal, budgetLeft);
-            waited += Date.now() - before;
-            const stillShut = gate.remaining();
-            if (stillShut > 0)
-                throw outOfBudgetAtGate(stillShut, attempt);
-        }
-        try {
-            return await fn();
-        }
-        catch (error) {
-            if (!opts.isRateLimited(error))
-                throw error;
-            attempt += 1;
-            const retryAfter = opts.retryAfterSeconds?.(error);
-            const served = retryAfter !== undefined && Number.isFinite(retryAfter);
-            // The server's own number wins. A computed guess is for when it stays
-            // silent — it is an estimate of something the server already knows.
-            const wait = served
-                ? retryAfter * 1000
-                : jittered(policy.baseDelayMs * 2 ** (attempt - 1), policy.maxDelayMs);
-            // Hold everyone else too, and hold them whether or not THIS caller has
-            // budget left to retry. The pause describes the quota, not one request:
-            // giving up with the gate open sends every other caller straight back
-            // into a limit the server just said was closed.
-            //
-            // The gate is given the interval alone. This caller then serves its own
-            // backoff there, on the next turn of the loop, rather than sleeping
-            // beside it: two mechanisms waiting out one pause double-count it, and
-            // the leftover milliseconds between them decide outcomes at the margin.
-            // The per-caller spread that keeps the released callers from waking
-            // together lives in `waitUntilOpen`, where the waiting is done.
-            gate.penalise(wait);
-            const outOfAttempts = attempt >= policy.maxAttempts;
-            const outOfTime = waited + wait > policy.maxTotalWaitMs;
-            if (outOfAttempts || outOfTime) {
-                throw annotate(error, attempt, retryAfter);
-            }
-            opts.onRetry?.({
-                attempt,
-                delayMs: wait,
-                retryAfterSeconds: retryAfter,
-            });
-        }
-    }
-}
-/**
- * Full jitter: a random point in [0, computed], not computed ± a nudge.
- *
- * Scaling a shared delay by a factor near 1 keeps the herd together; drawing
- * from the whole interval is what actually spreads it.
- */
-function jittered(computed, maxDelayMs) {
-    return Math.random() * Math.min(computed, maxDelayMs);
-}
-const MAX_CAUSE_DEPTH = 5;
-/**
- * The rate-limit marker on an error or anywhere in its `cause` chain.
- *
- * Layers above the provider rewrap errors — the ILlm adapter turns anything
- * thrown into an `LlmError` — so the marker is rarely still on the outermost
- * object by the time a retry decorator inspects it. Bounded by depth and a
- * visited set, like `extractStatusCode`, so a cyclic chain cannot hang.
- */
-export function findRateLimit(err) {
-    const visited = new Set();
-    let cur = err;
-    for (let depth = 0; depth < MAX_CAUSE_DEPTH; depth++) {
-        if (typeof cur !== 'object' || cur === null || visited.has(cur))
-            return undefined;
-        visited.add(cur);
-        if (isRateLimitedError(cur))
-            return cur;
-        cur = cur.cause;
-    }
-    return undefined;
-}
-/**
- * Carry the rate-limit facts onto a provider's own error.
- *
- * Every provider catches its transport error and rethrows something friendlier.
- * That is fine for a message and fatal for a fact: the 429 would be lost at the
- * exact boundary where the consumer needs it. This moves the facts across.
- */
-export function preserveRateLimit(original, wrapped) {
-    if (!isRateLimitedError(original))
-        return wrapped;
-    const w = wrapped;
-    w.rateLimited = true;
-    w.attempts = original.attempts;
-    if (original.retryAfterSeconds !== undefined) {
-        w.retryAfterSeconds = original.retryAfterSeconds;
-    }
-    return w;
-}
-/**
- * The shared pause outlasts what this caller said it would wait.
- *
- * There is no server error to annotate here — the request was never sent,
- * because sending it into a quota known to be closed is the one thing the gate
- * exists to prevent. It is still a rate limit, and says so, carrying what is
- * left of the pause so the consumer can decide.
- */
-function outOfBudgetAtGate(remainingMs, attempts) {
-    const e = new Error('rate limited: the pause on this quota outlasts the configured wait budget');
-    e.rateLimited = true;
-    e.attempts = attempts;
-    e.retryAfterSeconds = remainingMs / 1000;
-    return e;
-}
-function annotate(error, attempts, retryAfterSeconds) {
-    const e = (error instanceof Error ? error : new Error(String(error)));
-    e.rateLimited = true;
-    e.attempts = attempts;
-    if (retryAfterSeconds !== undefined)
-        e.retryAfterSeconds = retryAfterSeconds;
-    return e;
-}
-//# sourceMappingURL=rate-limit.js.map

package/dist/llm/rate-limit.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rate-limit.js","sourceRoot":"","sources":["../../src/llm/rate-limit.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,gCAAgC,CAAC;AAerE,MAAM,CAAC,MAAM,yBAAyB,GAAoB;IACxD,OAAO,EAAE,IAAI;IACb,WAAW,EAAE,CAAC;IACd,cAAc,EAAE,MAAM;IACtB,WAAW,EAAE,KAAK;IAClB,UAAU,EAAE,MAAM;CACnB,CAAC;AAWF,MAAM,UAAU,kBAAkB,CAAC,CAAU;IAC3C,OAAO,CACL,OAAO,CAAC,KAAK,QAAQ;QACrB,CAAC,KAAK,IAAI;QACT,CAA+B,CAAC,WAAW,KAAK,IAAI,CACtD,CAAC;AACJ,CAAC;AAED,MAAM,MAAM,GAAG,IAAI,mBAAmB,EAAE,CAAC;AAEzC;;;;;;;;GAQG;AACH,MAAM,KAAK,GAAG,KAAK,EAAE,EAAU,EAAE,MAAoB,EAAiB,EAAE;IACtE,MAAM,OAAO,GAAG,GAAU,EAAE,CACzB,MAAM,EAAE,MAA4B,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;IAChE,IAAI,MAAM,EAAE,OAAO;QAAE,MAAM,OAAO,EAAE,CAAC;IACrC,IAAI,CAAC,MAAM,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,KAAK,SAAS;QAAE,MAAM,OAAO,EAAE,CAAC;AACrE,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,cAAc,GAAG,GAAG,CAAC;AAE3B;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,aAAa;IAChB,SAAS,GAAG,CAAC,CAAC;IAEtB,+EAA+E;IAC/E,QAAQ,CAAC,EAAU,EAAE,MAAc,IAAI,CAAC,GAAG,EAAE;QAC3C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;IACtD,CAAC;IAED,wCAAwC;IACxC,SAAS,CAAC,MAAc,IAAI,CAAC,GAAG,EAAE;QAChC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK;QACH,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,aAAa,CACjB,MAAoB,EACpB,SAAS,GAAG,MAAM,CAAC,iBAAiB;QAEpC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,SAAS,CAAC;YACR,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9B,IAAI,IAAI,IAAI,CAAC;gBAAE,OAAO;YACtB,MAAM,MAAM,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACrC,uEAAuE;YACvE,sEAAsE;YACtE,IAAI,MAAM,IAAI,CAAC;gBAAE,OAAO;YACxB,yEAAyE;YACzE,0DAA0D;YAC1D,MAAM,KAAK,CACT,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,cAAc,EAAE,MAAM,CAAC,EACvD,MAAM,CACP,CAAC;QACJ,CAAC;IACH,CAAC;CACF;AASD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;AAE3C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,GAAG,MAAM,CAAC;AAC5C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,GAAG,CAAC;AAE9B,oFAAoF;AACpF,MAAM,UAAU,OAAO,CAAC,GAAW;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChC,IAAI,QAAQ,EAAE,CAAC;QACb,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;QACxB,OAAO,QAAQ,CAAC,IAAI,CAAC;IACvB,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,IAAI,UAAU;QAAE,YAAY,CAAC,GAAG,CAAC,CAAC;IAChD,MAAM,KAAK,GAAc;QACvB,IAAI,EAAE,IAAI,aAAa,EAAE;QACzB,QAAQ,EAAE,GAAG;QACb,MAAM,EAAE,CAAC;KACV,CAAC;IACF,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACtB,OAAO,KAAK,CAAC,IAAI,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAW;IAI5C,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC1B,6EAA6E;IAC7E,6EAA6E;IAC7E,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,KAAK;QAAE,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;IAC7B,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,OAAO;QACL,IAAI;QACJ,OAAO,EAAE,GAAG,EAAE;YACZ,IAAI,QAAQ,IAAI,CAAC,KAAK;gBAAE,OAAO;YAC/B,QAAQ,GAAG,IAAI,CAAC;YAChB,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC9B,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAAc,IAAI,CAAC,GAAG,EAAE;IAC1D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;QACjC,IAAI,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,GAAG,gBAAgB,EAAE,CAAC;YACvE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,WAAW,CAAC,KAAgB,EAAE,GAAW;IAChD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC/D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,YAAY,CAAC,GAAW;IAC/B,mBAAmB,CAAC,GAAG,CAAC,CAAC;IACzB,IAAI,KAAK,CAAC,IAAI,GAAG,UAAU;QAAE,OAAO;IAEpC,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;SAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAEjD,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;QAC9B,IAAI,KAAK,CAAC,IAAI,GAAG,UAAU;YAAE,OAAO;QACpC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACpB,CAAC;AACH,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,kBAAkB;IAChC,OAAO,KAAK,CAAC,IAAI,CAAC;AACpB,CAAC;AAED,oCAAoC;AACpC,MAAM,UAAU,mBAAmB;IACjC,KAAK,CAAC,KAAK,EAAE,CAAC;AAChB,CAAC;AAkBD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,EAAoB,EACpB,IAA2B;IAE3B,MAAM,MAAM,GAAG,EAAE,GAAG,yBAAyB,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAChE,IAAI,CAAC,MAAM,CAAC,OAAO;QAAE,OAAO,EAAE,EAAE,CAAC;IAEjC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvD,IAAI,CAAC;QACH,OAAO,MAAM,eAAe,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACvD,CAAC;YAAS,CAAC;QACT,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,KAAK,UAAU,eAAe,CAC5B,EAAoB,EACpB,IAA2B,EAC3B,MAAuB,EACvB,IAAmB;IAEnB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,SAAS,CAAC;QACR,4EAA4E;QAC5E,0EAA0E;QAC1E,0EAA0E;QAC1E,4EAA4E;QAC5E,6DAA6D;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC9B,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,UAAU,GAAG,MAAM,CAAC,cAAc,GAAG,MAAM,CAAC;YAClD,IAAI,IAAI,GAAG,UAAU;gBAAE,MAAM,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC1B,wEAAwE;YACxE,uEAAuE;YACvE,uEAAuE;YACvE,oEAAoE;YACpE,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YAClD,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC;YAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,SAAS,GAAG,CAAC;gBAAE,MAAM,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACjE,CAAC;QAED,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;gBAAE,MAAM,KAAK,CAAC;YAE5C,OAAO,IAAI,CAAC,CAAC;YACb,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC,KAAK,CAAC,CAAC;YACnD,MAAM,MAAM,GAAG,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAEvE,sEAAsE;YACtE,oEAAoE;YACpE,MAAM,IAAI,GAAG,MAAM;gBACjB,CAAC,CAAE,UAAqB,GAAG,IAAI;gBAC/B,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAEzE,uEAAuE;YACvE,wEAAwE;YACxE,sEAAsE;YACtE,gDAAgD;YAChD,EAAE;YACF,wEAAwE;YACxE,oEAAoE;YACpE,uEAAuE;YACvE,wEAAwE;YACxE,oEAAoE;YACpE,gEAAgE;YAChE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAEpB,MAAM,aAAa,GAAG,OAAO,IAAI,MAAM,CAAC,WAAW,CAAC;YACpD,MAAM,SAAS,GAAG,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC,cAAc,CAAC;YACxD,IAAI,aAAa,IAAI,SAAS,EAAE,CAAC;gBAC/B,MAAM,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;YAC7C,CAAC;YAED,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,OAAO;gBACP,OAAO,EAAE,IAAI;gBACb,iBAAiB,EAAE,UAAU;aAC9B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,QAAgB,EAAE,UAAkB;IACpD,OAAO,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;AACxD,CAAC;AAED,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,GAAY;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;IACnC,IAAI,GAAG,GAAY,GAAG,CAAC;IACvB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,eAAe,EAAE,KAAK,EAAE,EAAE,CAAC;QACrD,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAC7D,OAAO,SAAS,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,kBAAkB,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;QACxC,GAAG,GAAI,GAA2B,CAAC,KAAK,CAAC;IAC3C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAiB,EACjB,OAAU;IAEV,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC;QAAE,OAAO,OAAO,CAAC;IAClD,MAAM,CAAC,GAAG,OAAwC,CAAC;IACnD,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC;IACrB,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC;IAC/B,IAAI,QAAQ,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;QAC7C,CAAC,CAAC,iBAAiB,GAAG,QAAQ,CAAC,iBAAiB,CAAC;IACnD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,iBAAiB,CACxB,WAAmB,EACnB,QAAgB;IAEhB,MAAM,CAAC,GAAG,IAAI,KAAK,CACjB,2EAA2E,CACxD,CAAC;IACtB,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC;IACrB,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;IACtB,CAAC,CAAC,iBAAiB,GAAG,WAAW,GAAG,IAAI,CAAC;IACzC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,QAAQ,CACf,KAAc,EACd,QAAgB,EAChB,iBAA0B;IAE1B,MAAM,CAAC,GAAG,CACR,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CACtC,CAAC;IACtB,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC;IACrB,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;IACtB,IAAI,iBAAiB,KAAK,SAAS;QAAE,CAAC,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;IAC7E,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/resilience/status.d.ts

@@ -1,29 +0,0 @@
-/**
- * Resolving an HTTP status from a thrown value.
- *
- * A leaf module on purpose: it imports nothing, so both the retry decorators
- * and the strategies in `interfaces/` can share one classification without a
- * cycle between the two layers. Which statuses are worth repeating is a
- * decision and lives in a strategy; what status this error carries is a fact
- * and lives here.
- */
-/**
- * Resolve an HTTP status from an unknown thrown value: own status/statusCode,
- * then the same walking `cause`, bounded by depth and a visited set so a cyclic
- * chain cannot hang. Returns undefined when no numeric status is present.
- */
-export declare function extractStatusCode(err: unknown): number | undefined;
-/**
- * Whether a thrown value matches one of a set of HTTP status codes.
- *
- * A structured status (own `status`/`statusCode`, or the same on `cause`) is
- * authoritative. Only when none is present does it fall back to the message,
- * and there it matches on **word boundaries** — a bare `includes('429')` also
- * fires on `4290`, an id, or a byte count, turning a hard error into a
- * multi-second backoff stall.
- *
- * Shared by the embedder decorator and the LLM failure strategy so the
- * classification cannot drift between them.
- */
-export declare function isRetryableStatus(err: unknown, retryOn: readonly number[]): boolean;
-//# sourceMappingURL=status.d.ts.map

package/dist/resilience/status.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"status.d.ts","sourceRoot":"","sources":["../../src/resilience/status.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS,CAgBlE;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,iBAAiB,CAC/B,GAAG,EAAE,OAAO,EACZ,OAAO,EAAE,SAAS,MAAM,EAAE,GACzB,OAAO,CAKT"}

package/dist/resilience/status.js

@@ -1,51 +0,0 @@
-/**
- * Resolving an HTTP status from a thrown value.
- *
- * A leaf module on purpose: it imports nothing, so both the retry decorators
- * and the strategies in `interfaces/` can share one classification without a
- * cycle between the two layers. Which statuses are worth repeating is a
- * decision and lives in a strategy; what status this error carries is a fact
- * and lives here.
- */
-const MAX_CAUSE_DEPTH = 5;
-/**
- * Resolve an HTTP status from an unknown thrown value: own status/statusCode,
- * then the same walking `cause`, bounded by depth and a visited set so a cyclic
- * chain cannot hang. Returns undefined when no numeric status is present.
- */
-export function extractStatusCode(err) {
-    const visited = new Set();
-    let cur = err;
-    for (let depth = 0; depth < MAX_CAUSE_DEPTH; depth++) {
-        if (typeof cur !== 'object' || cur === null || visited.has(cur))
-            return;
-        visited.add(cur);
-        const rec = cur;
-        if (typeof rec.status === 'number')
-            return rec.status;
-        if (typeof rec.statusCode === 'number')
-            return rec.statusCode;
-        cur = rec.cause;
-    }
-    return undefined;
-}
-/**
- * Whether a thrown value matches one of a set of HTTP status codes.
- *
- * A structured status (own `status`/`statusCode`, or the same on `cause`) is
- * authoritative. Only when none is present does it fall back to the message,
- * and there it matches on **word boundaries** — a bare `includes('429')` also
- * fires on `4290`, an id, or a byte count, turning a hard error into a
- * multi-second backoff stall.
- *
- * Shared by the embedder decorator and the LLM failure strategy so the
- * classification cannot drift between them.
- */
-export function isRetryableStatus(err, retryOn) {
-    const status = extractStatusCode(err);
-    if (status !== undefined)
-        return retryOn.includes(status);
-    const msg = err instanceof Error ? err.message : String(err);
-    return retryOn.some((code) => new RegExp(`\\b${code}\\b`).test(msg));
-}
-//# sourceMappingURL=status.js.map