@strands-agents/sdk 1.14.0 → 1.16.0

package/dist/src/models/routing/router.d.ts

@@ -0,0 +1,161 @@
+import { Model } from '../model.js';
+import type { Plugin } from '../../plugins/plugin.js';
+import type { InvocationState, LocalAgent } from '../../types/agent.js';
+import type { CandidateInput, RoutingStrategy } from './strategy.js';
+/** Construction data for a {@link RoutingCandidate}. */
+export interface RoutingCandidateOptions {
+    /** Concrete model or opaque nested router. */
+    readonly model: Model | ModelRouter;
+    /** Optional strategy-facing name. */
+    readonly name?: string;
+    /** Optional strategy-facing description. */
+    readonly description?: string;
+}
+/**
+ * A model or opaque model group with an optional name and description.
+ *
+ * Base instances are frozen automatically. Subclasses must freeze themselves after initializing additional fields.
+ */
+export declare class RoutingCandidate {
+    /** Concrete model or opaque nested router. */
+    readonly model: Model | ModelRouter;
+    /** Optional strategy-facing name. */
+    readonly name?: string;
+    /** Optional strategy-facing description. */
+    readonly description?: string;
+    /**
+     * Create an immutable routing candidate.
+     *
+     * @param options - Candidate model, name, and description
+     */
+    constructor(options: RoutingCandidateOptions);
+}
+/** Options for constructing a {@link ModelRouter}. */
+export interface ModelRouterOptions {
+    /** Strategy responsible for every routing decision. */
+    readonly strategy?: RoutingStrategy;
+    /** Maximum successful candidate switches per invocation. */
+    readonly maxSwitches?: number;
+}
+/**
+ * Routes each agent invocation among an immutable set of candidate models.
+ *
+ * The default {@link FallbackStrategy} prefers the candidate with the fewest recorded failures and
+ * breaks ties by declaration order. `maxSwitches` bounds successful candidate changes per invocation.
+ *
+ * @example
+ * ```typescript
+ * const router = new ModelRouter([
+ *   new RoutingCandidate({ model: primary, name: 'primary' }),
+ *   new RoutingCandidate({ model: fallback, name: 'fallback' }),
+ * ])
+ * const agent = new Agent({ model: router })
+ * ```
+ */
+export declare class ModelRouter implements Plugin {
+    readonly name = "strands:model-router";
+    private readonly _candidates;
+    private readonly _strategy;
+    private readonly _maxSwitches?;
+    private readonly _attachedAgents;
+    private readonly _initializedAgents;
+    /**
+     * Create a model router.
+     *
+     * @param models - Candidate models, nested routers, or candidate wrappers
+     * @param options - Routing strategy and switch cap
+     * @throws TypeError if models or the strategy are invalid
+     * @throws Error if candidates are empty, duplicated, named alike, stateful, or `maxSwitches` is not a non-negative integer
+     */
+    constructor(models: readonly CandidateInput[], options?: ModelRouterOptions);
+    /** Normalized candidates in declaration order. */
+    get candidates(): readonly RoutingCandidate[];
+    /** First declared candidate resolved without consulting a strategy. */
+    get defaultModel(): Model;
+    /**
+     * Attach this router as an agent's configured model.
+     *
+     * @internal
+     * @param agent - Agent configured with this router
+     */
+    attachToAgent(agent: LocalAgent): void;
+    /**
+     * Register routing middleware and lifecycle hooks.
+     *
+     * @param agent - Agent using this router as its model
+     * @throws Error if attached as an ordinary plugin rather than as the model
+     */
+    initAgent(agent: LocalAgent): void;
+    /**
+     * Return the current routed model after hooks may have changed the selection.
+     *
+     * @internal
+     * @param agent - Agent making the model call
+     * @param invocationState - Live invocation state
+     * @returns Current routed model, or `undefined` before selection
+     */
+    getRoutedModel(agent: LocalAgent, invocationState: InvocationState): Model | undefined;
+    /** Apply the per-invocation selection to the model call, opening one on the first call. */
+    private _selectionMiddleware;
+    /** Make the opening choice and store its state in the invocation state under this pair's key. */
+    private _openAndCache;
+    /**
+     * Choose and resolve the candidate to start on.
+     *
+     * A decline serves the default model. A strategy that throws, and a candidate that will not resolve
+     * to a model, both propagate.
+     */
+    private _open;
+    /** Ask the strategy for a candidate and validate the answer. */
+    private _ask;
+    /** Return the candidate, throwing if the strategy broke its contract. */
+    private _validated;
+    /**
+     * Resolve a candidate to a concrete model, recursing into a nested router's selection.
+     *
+     * A nested router is asked with its own candidates and no attempts, so it contributes one candidate
+     * and never advances internally.
+     */
+    private _resolve;
+    /** Resolve this router's chosen candidate, or its default model if the strategy declines. */
+    private _selectModel;
+    /** Strategy class name, for logs that explain a routing decision. */
+    private get _strategyName();
+    /** Record the outcome and, after an unclaimed failure, apply the strategy's next choice. */
+    private _onModelResult;
+    /**
+     * Switch to the strategy's next candidate, returning whether the call should be retried.
+     *
+     * A usable new candidate is switched to. A strategy that throws, declines, or names a candidate the
+     * round already used leaves the model's error to surface. A candidate that will not resolve is
+     * unusable rather than unlucky, so it takes its slot in the round and the strategy is asked once
+     * more. Each pass either switches or consumes a slot, so the round stays bounded by the candidate
+     * count.
+     */
+    private _advance;
+    /**
+     * Build a {@link RoutingContext} over this router's candidates.
+     *
+     * Every ask goes through here, so the request a strategy sees is always a copy: the agent's messages
+     * and the registry's own tool specs are never handed over directly. Mirrors the copy the agent loop
+     * makes for each model call.
+     */
+    private _routingContext;
+    /** Drop this agent's routing state so it never spans invocations. */
+    private _clearState;
+    /** Return the routing state stored under this pair's key, ignoring any foreign value. */
+    private _getState;
+    /**
+     * Scope routing state to one agent/router pair.
+     *
+     * One invocation state can serve several agents, and one router several agents, so neither identity
+     * alone is a sufficient key. `agentId` cannot serve either: it is caller-supplied and defaults, so
+     * two agents sharing a router could collide. Object identity is unique among live agents, and the
+     * state is cleared at both ends of an invocation, so a recycled entry cannot match a live one.
+     *
+     * The key carries no per-invocation component, so isolation between concurrent invocations relies on
+     * the agent allowing only one at a time, which is its default.
+     */
+    private _stateKey;
+}
+//# sourceMappingURL=router.d.ts.map

package/dist/src/models/routing/router.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.d.ts","sourceRoot":"","sources":["../../../../src/models/routing/router.ts"],"names":[],"mappings":"AAyBA,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAInC,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAA;AAErD,OAAO,KAAK,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAA;AAEvE,OAAO,KAAK,EAAE,cAAc,EAAkC,eAAe,EAAE,MAAM,eAAe,CAAA;AAEpG,wDAAwD;AACxD,MAAM,WAAW,uBAAuB;IACtC,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAAA;IACnC,qCAAqC;IACrC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;IACtB,4CAA4C;IAC5C,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAC9B;AAED;;;;GAIG;AACH,qBAAa,gBAAgB;IAC3B,8CAA8C;IAC9C,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,WAAW,CAAA;IACnC,qCAAqC;IACrC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;IACtB,4CAA4C;IAC5C,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;IAE7B;;;;OAIG;gBACS,OAAO,EAAE,uBAAuB;CAM7C;AAED,sDAAsD;AACtD,MAAM,WAAW,kBAAkB;IACjC,uDAAuD;IACvD,QAAQ,CAAC,QAAQ,CAAC,EAAE,eAAe,CAAA;IACnC,4DAA4D;IAC5D,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAC9B;AAwBD;;;;;;;;;;;;;;GAcG;AACH,qBAAa,WAAY,YAAW,MAAM;IACxC,QAAQ,CAAC,IAAI,0BAAyB;IACtC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAA6B;IACzD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAiB;IAC3C,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAQ;IACtC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAA4B;IAC5D,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAA4B;IAE/D;;;;;;;OAOG;gBACS,MAAM,EAAE,SAAS,cAAc,EAAE,EAAE,OAAO,GAAE,kBAAuB;IAkB/E,kDAAkD;IAClD,IAAI,UAAU,IAAI,SAAS,gBAAgB,EAAE,CAE5C;IAED,uEAAuE;IACvE,IAAI,YAAY,IAAI,KAAK,CAGxB;IAED;;;;;OAKG;IACH,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI;IAKtC;;;;;OAKG;IACH,SAAS,CAAC,KAAK,EAAE,UAAU,GAAG,IAAI;IAiBlC;;;;;;;OAOG;IACH,cAAc,CAAC,KAAK,EAAE,UAAU,EAAE,eAAe,EAAE,eAAe,GAAG,KAAK,GAAG,SAAS;IAItF,2FAA2F;YAC7E,oBAAoB;IAclC,iGAAiG;YACnF,aAAa;IAW3B;;;;;OAKG;YACW,KAAK;IAWnB,gEAAgE;YAClD,IAAI;IAIlB,yEAAyE;IACzE,OAAO,CAAC,UAAU;IAWlB;;;;;OAKG;YACW,QAAQ;IAatB,6FAA6F;YAC/E,YAAY;IAM1B,qEAAqE;IACrE,OAAO,KAAK,aAAa,GAExB;IAED,4FAA4F;YAC9E,cAAc;IAsB5B;;;;;;;;OAQG;YACW,QAAQ;IAuDtB;;;;;;OAMG;IACH,OAAO,CAAC,eAAe;IAkBvB,qEAAqE;IACrE,OAAO,CAAC,WAAW;IAKnB,yFAAyF;IACzF,OAAO,CAAC,SAAS;IAKjB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,SAAS;CAGlB"}

package/dist/src/models/routing/router.js

@@ -0,0 +1,474 @@
+/**
+ * Model routing primitives.
+ *
+ * A {@link ModelRouter} asks its {@link RoutingStrategy} before the first model call and after
+ * unclaimed failures until routing stops. Returning `undefined` from the opening selection uses the
+ * first candidate's concrete default model; returning it after a failure preserves the pending error.
+ *
+ * A failure round uses each candidate at most once. A successful call starts a new round with that
+ * candidate already counted as used. Nested routers are opaque candidates: they make one selection
+ * with an empty attempt history and do not perform internal failover for the outer router.
+ *
+ * `agent.model` remains the first candidate's concrete model. Opening selection runs in model input
+ * middleware after continuation input is incorporated, so the opening before-model hook reports that
+ * default while {@link AfterModelCallEvent} reports the effective routed model. Token estimation also
+ * uses the default model, so prefer candidates with comparable context windows and tokenizers. If a
+ * candidate fails after emitting part of a streamed response, consumers see that partial output
+ * followed by the replacement model's full response.
+ *
+ * The API is provisional and may change before it is finalized.
+ */
+import { CancelledError, normalizeError } from '../../errors.js';
+import { AfterInvocationEvent, AfterModelCallEvent, BeforeInvocationEvent } from '../../hooks/events.js';
+import { HookOrder } from '../../hooks/types.js';
+import { logger } from '../../logging/logger.js';
+import { InvokeModelStage } from '../../middleware/stages.js';
+import { Model } from '../model.js';
+import { cloneSystemPrompt } from '../../types/messages.js';
+import { deepCopy } from '../../types/json.js';
+import { FallbackStrategy } from './fallback-strategy.js';
+/**
+ * A model or opaque model group with an optional name and description.
+ *
+ * Base instances are frozen automatically. Subclasses must freeze themselves after initializing additional fields.
+ */
+export class RoutingCandidate {
+    /** Concrete model or opaque nested router. */
+    model;
+    /** Optional strategy-facing name. */
+    name;
+    /** Optional strategy-facing description. */
+    description;
+    /**
+     * Create an immutable routing candidate.
+     *
+     * @param options - Candidate model, name, and description
+     */
+    constructor(options) {
+        this.model = options.model;
+        if (options.name !== undefined)
+            this.name = options.name;
+        if (options.description !== undefined)
+            this.description = options.description;
+        if (new.target === RoutingCandidate)
+            Object.freeze(this);
+    }
+}
+/** Per-invocation candidate, attempt history, and switch accounting. */
+class RoutingState {
+    candidate;
+    model;
+    attempts = [];
+    switchedTo;
+    switches = 0;
+    constructor(candidate, model) {
+        this.candidate = candidate;
+        this.model = model;
+        // The opening candidate counts as used for this round.
+        this.switchedTo = new Set([candidate]);
+    }
+}
+const ROUTING_KEY_PREFIX = 'strands:modelRouting';
+/** Lazily minted per-object identity numbers (the `id()` equivalent for state keys), weakly held. */
+const OBJECT_IDS = new WeakMap();
+let nextObjectId = 1;
+/**
+ * Routes each agent invocation among an immutable set of candidate models.
+ *
+ * The default {@link FallbackStrategy} prefers the candidate with the fewest recorded failures and
+ * breaks ties by declaration order. `maxSwitches` bounds successful candidate changes per invocation.
+ *
+ * @example
+ * ```typescript
+ * const router = new ModelRouter([
+ *   new RoutingCandidate({ model: primary, name: 'primary' }),
+ *   new RoutingCandidate({ model: fallback, name: 'fallback' }),
+ * ])
+ * const agent = new Agent({ model: router })
+ * ```
+ */
+export class ModelRouter {
+    name = 'strands:model-router';
+    _candidates;
+    _strategy;
+    _maxSwitches;
+    _attachedAgents = new WeakSet();
+    _initializedAgents = new WeakSet();
+    /**
+     * Create a model router.
+     *
+     * @param models - Candidate models, nested routers, or candidate wrappers
+     * @param options - Routing strategy and switch cap
+     * @throws TypeError if models or the strategy are invalid
+     * @throws Error if candidates are empty, duplicated, named alike, stateful, or `maxSwitches` is not a non-negative integer
+     */
+    constructor(models, options = {}) {
+        if (options.strategy !== undefined && !isRoutingStrategy(options.strategy)) {
+            throw new TypeError('strategy must implement RoutingStrategy: a select(context) method');
+        }
+        if (options.maxSwitches !== undefined && (!Number.isInteger(options.maxSwitches) || options.maxSwitches < 0)) {
+            throw new Error('maxSwitches must be a non-negative integer');
+        }
+        const candidates = normalize(models);
+        if (candidates.length === 0)
+            throw new Error('ModelRouter requires at least one candidate model');
+        rejectStateful(candidates);
+        rejectDuplicates(candidates);
+        this._candidates = Object.freeze(candidates);
+        this._strategy = options.strategy ?? new FallbackStrategy();
+        if (options.maxSwitches !== undefined)
+            this._maxSwitches = options.maxSwitches;
+    }
+    /** Normalized candidates in declaration order. */
+    get candidates() {
+        return this._candidates;
+    }
+    /** First declared candidate resolved without consulting a strategy. */
+    get defaultModel() {
+        const model = this._candidates[0].model;
+        return model instanceof ModelRouter ? model.defaultModel : model;
+    }
+    /**
+     * Attach this router as an agent's configured model.
+     *
+     * @internal
+     * @param agent - Agent configured with this router
+     */
+    attachToAgent(agent) {
+        this._attachedAgents.add(agent);
+        this.initAgent(agent);
+    }
+    /**
+     * Register routing middleware and lifecycle hooks.
+     *
+     * @param agent - Agent using this router as its model
+     * @throws Error if attached as an ordinary plugin rather than as the model
+     */
+    initAgent(agent) {
+        if (!this._attachedAgents.has(agent)) {
+            throw new Error('ModelRouter must be passed through Agent({ model }), not plugins');
+        }
+        if (this._initializedAgents.has(agent))
+            return;
+        this._initializedAgents.add(agent);
+        agent.addMiddleware(InvokeModelStage.Input, (context) => this._selectionMiddleware(context));
+        agent.addHook(AfterModelCallEvent, (event) => this._onModelResult(event), { order: HookOrder.MODEL_ROUTING });
+        agent.addHook(AfterInvocationEvent, (event) => this._clearState(event.agent, event.invocationState), {
+            order: HookOrder.SDK_LAST,
+        });
+        agent.addHook(BeforeInvocationEvent, (event) => this._clearState(event.agent, event.invocationState), {
+            order: HookOrder.SDK_FIRST,
+        });
+    }
+    /**
+     * Return the current routed model after hooks may have changed the selection.
+     *
+     * @internal
+     * @param agent - Agent making the model call
+     * @param invocationState - Live invocation state
+     * @returns Current routed model, or `undefined` before selection
+     */
+    getRoutedModel(agent, invocationState) {
+        return this._getState(agent, invocationState)?.model;
+    }
+    /** Apply the per-invocation selection to the model call, opening one on the first call. */
+    async _selectionMiddleware(context) {
+        let state = this._getState(context.agent, context.invocationState);
+        if (state === undefined) {
+            const routingContext = this._routingContext([...context.messages], context.systemPrompt, [...context.toolSpecs], context.invocationState);
+            state = await this._openAndCache(context.agent, context.invocationState, routingContext);
+        }
+        return { ...context, model: state.model };
+    }
+    /** Make the opening choice and store its state in the invocation state under this pair's key. */
+    async _openAndCache(agent, invocationState, context) {
+        const [candidate, model] = await this._open(context);
+        const state = new RoutingState(candidate, model);
+        invocationState[this._stateKey(agent)] = state;
+        return state;
+    }
+    /**
+     * Choose and resolve the candidate to start on.
+     *
+     * A decline serves the default model. A strategy that throws, and a candidate that will not resolve
+     * to a model, both propagate.
+     */
+    async _open(context) {
+        const candidate = await this._ask(context);
+        if (candidate === undefined) {
+            logger.info(`strategy=<${this._strategyName}> | strategy declined the opening choice, using the default model`);
+            return [this._candidates[0], this.defaultModel];
+        }
+        logger.info(`strategy=<${this._strategyName}>, candidate=<${candidateLabel(candidate)}> | candidate selected`);
+        return [candidate, await this._resolve(candidate, context)];
+    }
+    /** Ask the strategy for a candidate and validate the answer. */
+    async _ask(context) {
+        return this._validated(await this._strategy.select(context), context);
+    }
+    /** Return the candidate, throwing if the strategy broke its contract. */
+    _validated(candidate, context) {
+        if (candidate === undefined)
+            return undefined;
+        if (!(candidate instanceof RoutingCandidate)) {
+            throw new TypeError(`strategy.select must return a RoutingCandidate or undefined; got ${typeName(candidate)}`);
+        }
+        if (!context.candidates.some((configured) => configured === candidate)) {
+            throw new Error('strategy.select must return a candidate from context.candidates');
+        }
+        return candidate;
+    }
+    /**
+     * Resolve a candidate to a concrete model, recursing into a nested router's selection.
+     *
+     * A nested router is asked with its own candidates and no attempts, so it contributes one candidate
+     * and never advances internally.
+     */
+    async _resolve(candidate, context) {
+        if (!(candidate.model instanceof ModelRouter))
+            return candidate.model;
+        return candidate.model._selectModel(candidate.model._routingContext(context.messages, context.systemPrompt, context.toolSpecs, context.invocationState, []));
+    }
+    /** Resolve this router's chosen candidate, or its default model if the strategy declines. */
+    async _selectModel(context) {
+        const candidate = await this._ask(context);
+        if (candidate === undefined)
+            return this.defaultModel;
+        return this._resolve(candidate, context);
+    }
+    /** Strategy class name, for logs that explain a routing decision. */
+    get _strategyName() {
+        return this._strategy.constructor.name;
+    }
+    /** Record the outcome and, after an unclaimed failure, apply the strategy's next choice. */
+    async _onModelResult(event) {
+        const state = this._getState(event.agent, event.invocationState);
+        if (state === undefined)
+            return;
+        if (event.error instanceof CancelledError)
+            return;
+        if (event.stopData !== undefined) {
+            state.attempts.push(makeAttempt(state.candidate));
+            // The candidate that succeeded opens the next round, counting as used like any opening choice.
+            state.switchedTo = new Set([state.candidate]);
+            return;
+        }
+        if (event.retry || event.error === undefined)
+            return;
+        state.attempts.push(makeAttempt(state.candidate, event.error));
+        if (this._maxSwitches !== undefined && state.switches >= this._maxSwitches) {
+            logger.warn(`maxSwitches=<${this._maxSwitches}> | switch cap reached, leaving the error to surface`);
+            return;
+        }
+        if (await this._advance(event, state))
+            event.retry = true;
+    }
+    /**
+     * Switch to the strategy's next candidate, returning whether the call should be retried.
+     *
+     * A usable new candidate is switched to. A strategy that throws, declines, or names a candidate the
+     * round already used leaves the model's error to surface. A candidate that will not resolve is
+     * unusable rather than unlucky, so it takes its slot in the round and the strategy is asked once
+     * more. Each pass either switches or consumes a slot, so the round stays bounded by the candidate
+     * count.
+     */
+    async _advance(event, state) {
+        while (true) {
+            const context = this._routingContext(event.agent.messages, event.agent.systemPrompt, event.agent.toolRegistry.list().map((tool) => tool.toolSpec), event.invocationState, state.attempts);
+            let candidate;
+            try {
+                // Validated inside the try: a model error is already pending, so a broken answer must not
+                // replace it. The opening choice has nothing pending and lets the error surface.
+                candidate = this._validated(await this._strategy.select(context), context);
+            }
+            catch (error) {
+                logger.warn(`strategy=<${this._strategyName}>, error=<${String(error)}> | routing failed, leaving the error to surface`);
+                return false;
+            }
+            if (candidate === undefined)
+                return false;
+            // A round uses each candidate at most once, so a strategy that cycles cannot keep resetting
+            // the retry budget.
+            if (state.switchedTo.has(candidate)) {
+                logger.info(`candidate=<${candidateLabel(candidate)}> | already used this round, leaving the error to surface`);
+                return false;
+            }
+            let model;
+            try {
+                model = await this._resolve(candidate, context);
+            }
+            catch (error) {
+                const resolutionError = normalizeError(error);
+                logger.warn(`candidate=<${candidateLabel(candidate)}>, error=<${resolutionError}> | candidate could not be resolved, asking again`);
+                // Recorded so a strategy reading attempts stops offering it, and slot-burned so termination
+                // does not depend on the strategy doing that.
+                state.attempts.push(makeAttempt(candidate, resolutionError));
+                state.switchedTo.add(candidate);
+                continue;
+            }
+            logger.info(`from_candidate=<${candidateLabel(state.candidate)}>, to_candidate=<${candidateLabel(candidate)}>, error=<${event.error?.constructor.name}> | model call failed, switching candidate`);
+            state.candidate = candidate;
+            state.model = model;
+            state.switchedTo.add(candidate);
+            state.switches += 1;
+            return true;
+        }
+    }
+    /**
+     * Build a {@link RoutingContext} over this router's candidates.
+     *
+     * Every ask goes through here, so the request a strategy sees is always a copy: the agent's messages
+     * and the registry's own tool specs are never handed over directly. Mirrors the copy the agent loop
+     * makes for each model call.
+     */
+    _routingContext(messages, systemPrompt, toolSpecs, invocationState, attempts = []) {
+        const context = {
+            messages: messages.map((message) => message.clone()),
+            ...(systemPrompt !== undefined && { systemPrompt: cloneSystemPrompt(systemPrompt) }),
+            toolSpecs: deepCopy(toolSpecs),
+            candidates: this._candidates,
+            invocationState,
+            attempts: Object.freeze([...attempts]),
+        };
+        return Object.freeze(context);
+    }
+    /** Drop this agent's routing state so it never spans invocations. */
+    _clearState(agent, invocationState) {
+        const key = this._stateKey(agent);
+        if (this._getState(agent, invocationState) !== undefined)
+            delete invocationState[key];
+    }
+    /** Return the routing state stored under this pair's key, ignoring any foreign value. */
+    _getState(agent, invocationState) {
+        const value = invocationState[this._stateKey(agent)];
+        return value instanceof RoutingState ? value : undefined;
+    }
+    /**
+     * Scope routing state to one agent/router pair.
+     *
+     * One invocation state can serve several agents, and one router several agents, so neither identity
+     * alone is a sufficient key. `agentId` cannot serve either: it is caller-supplied and defaults, so
+     * two agents sharing a router could collide. Object identity is unique among live agents, and the
+     * state is cleared at both ends of an invocation, so a recycled entry cannot match a live one.
+     *
+     * The key carries no per-invocation component, so isolation between concurrent invocations relies on
+     * the agent allowing only one at a time, which is its default.
+     */
+    _stateKey(agent) {
+        return `${ROUTING_KEY_PREFIX}:${objectId(agent).toString(16)}:${objectId(this).toString(16)}`;
+    }
+}
+/** Freeze a routing attempt, omitting `exception` for a success. */
+function makeAttempt(candidate, exception) {
+    return Object.freeze({ candidate, ...(exception !== undefined && { exception }) });
+}
+/** Return a stable identity number for the object, minting one on first use. */
+function objectId(value) {
+    let identity = OBJECT_IDS.get(value);
+    if (identity === undefined) {
+        identity = nextObjectId;
+        nextObjectId += 1;
+        OBJECT_IDS.set(value, identity);
+    }
+    return identity;
+}
+/** Coerce the input array into {@link RoutingCandidate} objects, validating candidate types. */
+function normalize(models) {
+    if (!Array.isArray(models))
+        throw new TypeError('models must be a sequence of candidates');
+    return models.map(asCandidate);
+}
+/** Wrap a candidate input in a {@link RoutingCandidate}, validating its model type. */
+function asCandidate(item) {
+    const candidate = item instanceof RoutingCandidate ? item : new RoutingCandidate({ model: item });
+    if (!(candidate.model instanceof Model) && !(candidate.model instanceof ModelRouter)) {
+        throw new TypeError(`candidate must be a Model or ModelRouter; got ${typeName(candidate.model)}`);
+    }
+    return candidate;
+}
+/** Reject any stateful candidate model. */
+function rejectStateful(candidates) {
+    for (const candidate of candidates) {
+        if (candidate.model instanceof Model && candidate.model.stateful) {
+            throw new Error(`candidate=<${candidateLabel(candidate)}> is stateful; routing among stateful models is not supported`);
+        }
+    }
+}
+/**
+ * Reject repeated candidates, repeated models, or colliding names.
+ *
+ * Strategies track health per candidate, so one model behind two candidates would get two failure
+ * budgets and never be demoted. The model check reaches through a nested router; names stay per level,
+ * since a strategy only chooses among the candidates it is shown.
+ */
+function rejectDuplicates(candidates) {
+    const seenCandidates = new Set();
+    const seenModels = new Set();
+    const seenNames = new Set();
+    for (const candidate of candidates) {
+        if (seenCandidates.has(candidate))
+            throw new Error('duplicate RoutingCandidate instance');
+        seenCandidates.add(candidate);
+        for (const model of reachableModels(candidate)) {
+            if (seenModels.has(model)) {
+                throw new Error(`candidate=<${candidateLabel(candidate)}> repeats a model already routed to; construct a separate instance so each candidate has its own health`);
+            }
+            seenModels.add(model);
+        }
+        if (candidate.name === undefined)
+            continue;
+        if (seenNames.has(candidate.name))
+            throw new Error(`duplicate candidate name=<${candidate.name}>`);
+        seenNames.add(candidate.name);
+    }
+}
+/** Yield every concrete model this candidate can run, descending into a nested router. */
+function* reachableModels(candidate) {
+    if (candidate.model instanceof ModelRouter) {
+        for (const nested of candidate.model.candidates)
+            yield* reachableModels(nested);
+    }
+    else {
+        yield candidate.model;
+    }
+}
+/** Return the candidate's name, or its provider and model id when it has none. */
+function candidateLabel(candidate) {
+    if (candidate.name !== undefined && candidate.name.length > 0)
+        return candidate.name;
+    return candidate.model instanceof Model ? modelLabel(candidate.model) : candidate.model.constructor.name;
+}
+/**
+ * Label a model by provider and model id.
+ *
+ * Labels are built eagerly, as log arguments and by the construction guards, so one must never fail a
+ * routed call or mask a construction error.
+ */
+function modelLabel(model) {
+    const provider = model.constructor.name;
+    try {
+        const modelId = model.getConfig()?.modelId;
+        return modelId ? `${provider}/${modelId}` : provider;
+    }
+    catch {
+        return provider;
+    }
+}
+/** Check whether the value structurally implements {@link RoutingStrategy}. */
+function isRoutingStrategy(strategy) {
+    return isObject(strategy) && 'select' in strategy && typeof strategy.select === 'function';
+}
+function isObject(value) {
+    return typeof value === 'object' && value !== null;
+}
+/** Describe a value's type for error messages. */
+function typeName(value) {
+    if (value === null)
+        return 'null';
+    if (value === undefined)
+        return 'undefined';
+    if (typeof value === 'object')
+        return value.constructor?.name ?? 'object';
+    return typeof value;
+}
+//# sourceMappingURL=router.js.map

package/dist/src/models/routing/router.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"router.js","sourceRoot":"","sources":["../../../../src/models/routing/router.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAA;AAChE,OAAO,EAAE,oBAAoB,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAA;AACxG,OAAO,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAA;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAA;AAChD,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAA;AAC7D,OAAO,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACnC,OAAO,EAAE,iBAAiB,EAAmC,MAAM,yBAAyB,CAAA;AAC5F,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAA;AAK9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AAazD;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IAC3B,8CAA8C;IACrC,KAAK,CAAqB;IACnC,qCAAqC;IAC5B,IAAI,CAAS;IACtB,4CAA4C;IACnC,WAAW,CAAS;IAE7B;;;;OAIG;IACH,YAAY,OAAgC;QAC1C,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAA;QAC1B,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAA;QACxD,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS;YAAE,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QAC7E,IAAI,GAAG,CAAC,MAAM,KAAK,gBAAgB;YAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC1D,CAAC;CACF;AAUD,wEAAwE;AACxE,MAAM,YAAY;IAChB,SAAS,CAAkB;IAC3B,KAAK,CAAO;IACH,QAAQ,GAAqB,EAAE,CAAA;IACxC,UAAU,CAAuB;IACjC,QAAQ,GAAG,CAAC,CAAA;IAEZ,YAAY,SAA2B,EAAE,KAAY;QACnD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;QAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;QAClB,uDAAuD;QACvD,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAA;IACxC,CAAC;CACF;AAED,MAAM,kBAAkB,GAAG,sBAAsB,CAAA;AAEjD,qGAAqG;AACrG,MAAM,UAAU,GAAG,IAAI,OAAO,EAAkB,CAAA;AAChD,IAAI,YAAY,GAAG,CAAC,CAAA;AAEpB;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,WAAW;IACb,IAAI,GAAG,sBAAsB,CAAA;IACrB,WAAW,CAA6B;IACxC,SAAS,CAAiB;IAC1B,YAAY,CAAS;IACrB,eAAe,GAAG,IAAI,OAAO,EAAc,CAAA;IAC3C,kBAAkB,GAAG,IAAI,OAAO,EAAc,CAAA;IAE/D;;;;;;;OAOG;IACH,YAAY,MAAiC,EAAE,UAA8B,EAAE;QAC7E,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3E,MAAM,IAAI,SAAS,CAAC,mEAAmE,CAAC,CAAA;QAC1F,CAAC;QACD,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC,EAAE,CAAC;YAC7G,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;QAC/D,CAAC;QAED,MAAM,UAAU,GAAG,SAAS,CAAC,MAAM,CAAC,CAAA;QACpC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAA;QACjG,cAAc,CAAC,UAAU,CAAC,CAAA;QAC1B,gBAAgB,CAAC,UAAU,CAAC,CAAA;QAE5B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;QAC5C,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,QAAQ,IAAI,IAAI,gBAAgB,EAAE,CAAA;QAC3D,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS;YAAE,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,WAAW,CAAA;IAChF,CAAC;IAED,kDAAkD;IAClD,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAA;IACzB,CAAC;IAED,uEAAuE;IACvE,IAAI,YAAY;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,KAAK,CAAA;QACxC,OAAO,KAAK,YAAY,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAA;IAClE,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,KAAiB;QAC7B,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAC/B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;IACvB,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,KAAiB;QACzB,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,kEAAkE,CAAC,CAAA;QACrF,CAAC;QACD,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAM;QAC9C,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAElC,KAAK,CAAC,aAAa,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAA;QAC5F,KAAK,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,aAAa,EAAE,CAAC,CAAA;QAC7G,KAAK,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,EAAE;YACnG,KAAK,EAAE,SAAS,CAAC,QAAQ;SAC1B,CAAC,CAAA;QACF,KAAK,CAAC,OAAO,CAAC,qBAAqB,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,EAAE;YACpG,KAAK,EAAE,SAAS,CAAC,SAAS;SAC3B,CAAC,CAAA;IACJ,CAAC;IAED;;;;;;;OAOG;IACH,cAAc,CAAC,KAAiB,EAAE,eAAgC;QAChE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,EAAE,KAAK,CAAA;IACtD,CAAC;IAED,2FAA2F;IACnF,KAAK,CAAC,oBAAoB,CAAC,OAA2B;QAC5D,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,eAAe,CAAC,CAAA;QAClE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,IAAI,CAAC,eAAe,CACzC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,EACrB,OAAO,CAAC,YAAY,EACpB,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,EACtB,OAAO,CAAC,eAAe,CACxB,CAAA;YACD,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,eAAe,EAAE,cAAc,CAAC,CAAA;QAC1F,CAAC;QACD,OAAO,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAwB,CAAA;IACjE,CAAC;IAED,iGAAiG;IACzF,KAAK,CAAC,aAAa,CACzB,KAAiB,EACjB,eAAgC,EAChC,OAAuB;QAEvB,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;QACpD,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,SAAS,EAAE,KAAK,CAAC,CAAA;QAChD,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAA;QAC9C,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,KAAK,CAAC,OAAuB;QACzC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC1C,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,mEAAmE,CAAC,CAAA;YAC/G,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,YAAY,CAAC,CAAA;QAClD,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,aAAa,iBAAiB,cAAc,CAAC,SAAS,CAAC,wBAAwB,CAAC,CAAA;QAC9G,OAAO,CAAC,SAAS,EAAE,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAA;IAC7D,CAAC;IAED,gEAAgE;IACxD,KAAK,CAAC,IAAI,CAAC,OAAuB;QACxC,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAA;IACvE,CAAC;IAED,yEAAyE;IACjE,UAAU,CAAC,SAAkB,EAAE,OAAuB;QAC5D,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,SAAS,CAAA;QAC7C,IAAI,CAAC,CAAC,SAAS,YAAY,gBAAgB,CAAC,EAAE,CAAC;YAC7C,MAAM,IAAI,SAAS,CAAC,oEAAoE,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;QAChH,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,KAAK,SAAS,CAAC,EAAE,CAAC;YACvE,MAAM,IAAI,KAAK,CAAC,iEAAiE,CAAC,CAAA;QACpF,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,QAAQ,CAAC,SAA2B,EAAE,OAAuB;QACzE,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,YAAY,WAAW,CAAC;YAAE,OAAO,SAAS,CAAC,KAAK,CAAA;QACrE,OAAO,SAAS,CAAC,KAAK,CAAC,YAAY,CACjC,SAAS,CAAC,KAAK,CAAC,eAAe,CAC7B,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,YAAY,EACpB,OAAO,CAAC,SAAS,EACjB,OAAO,CAAC,eAAe,EACvB,EAAE,CACH,CACF,CAAA;IACH,CAAC;IAED,6FAA6F;IACrF,KAAK,CAAC,YAAY,CAAC,OAAuB;QAChD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC1C,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,YAAY,CAAA;QACrD,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IAC1C,CAAC;IAED,qEAAqE;IACrE,IAAY,aAAa;QACvB,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAA;IACxC,CAAC;IAED,4FAA4F;IACpF,KAAK,CAAC,cAAc,CAAC,KAA0B;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAA;QAChE,IAAI,KAAK,KAAK,SAAS;YAAE,OAAM;QAE/B,IAAI,KAAK,CAAC,KAAK,YAAY,cAAc;YAAE,OAAM;QACjD,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAA;YACjD,+FAA+F;YAC/F,KAAK,CAAC,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAA;YAC7C,OAAM;QACR,CAAC;QACD,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;YAAE,OAAM;QAEpD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;QAC9D,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC3E,MAAM,CAAC,IAAI,CAAC,gBAAgB,IAAI,CAAC,YAAY,sDAAsD,CAAC,CAAA;YACpG,OAAM;QACR,CAAC;QAED,IAAI,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,KAAK,CAAC,KAAK,GAAG,IAAI,CAAA;IAC3D,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,QAAQ,CAAC,KAA0B,EAAE,KAAmB;QACpE,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAClC,KAAK,CAAC,KAAK,CAAC,QAAQ,EACpB,KAAK,CAAC,KAAK,CAAC,YAAY,EACxB,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAC5D,KAAK,CAAC,eAAe,EACrB,KAAK,CAAC,QAAQ,CACf,CAAA;YAED,IAAI,SAAuC,CAAA;YAC3C,IAAI,CAAC;gBACH,0FAA0F;gBAC1F,iFAAiF;gBACjF,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAA;YAC5E,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CACT,aAAa,IAAI,CAAC,aAAa,aAAa,MAAM,CAAC,KAAK,CAAC,kDAAkD,CAC5G,CAAA;gBACD,OAAO,KAAK,CAAA;YACd,CAAC;YACD,IAAI,SAAS,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAA;YACzC,4FAA4F;YAC5F,oBAAoB;YACpB,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACpC,MAAM,CAAC,IAAI,CAAC,cAAc,cAAc,CAAC,SAAS,CAAC,2DAA2D,CAAC,CAAA;gBAC/G,OAAO,KAAK,CAAA;YACd,CAAC;YAED,IAAI,KAAY,CAAA;YAChB,IAAI,CAAC;gBACH,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;YACjD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,eAAe,GAAG,cAAc,CAAC,KAAK,CAAC,CAAA;gBAC7C,MAAM,CAAC,IAAI,CACT,cAAc,cAAc,CAAC,SAAS,CAAC,aAAa,eAAe,mDAAmD,CACvH,CAAA;gBACD,4FAA4F;gBAC5F,8CAA8C;gBAC9C,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAA;gBAC5D,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;gBAC/B,SAAQ;YACV,CAAC;YAED,MAAM,CAAC,IAAI,CACT,mBAAmB,cAAc,CAAC,KAAK,CAAC,SAAS,CAAC,oBAAoB,cAAc,CAAC,SAAS,CAAC,aAAa,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,4CAA4C,CACtL,CAAA;YACD,KAAK,CAAC,SAAS,GAAG,SAAS,CAAA;YAC3B,KAAK,CAAC,KAAK,GAAG,KAAK,CAAA;YACnB,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YAC/B,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAA;YACnB,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,eAAe,CACrB,QAA4B,EAC5B,YAAsC,EACtC,SAA8B,EAC9B,eAAgC,EAChC,WAAsC,EAAE;QAExC,MAAM,OAAO,GAAmB;YAC9B,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACpD,GAAG,CAAC,YAAY,KAAK,SAAS,IAAI,EAAE,YAAY,EAAE,iBAAiB,CAAC,YAAY,CAAC,EAAE,CAAC;YACpF,SAAS,EAAE,QAAQ,CAAC,SAAS,CAA0B;YACvD,UAAU,EAAE,IAAI,CAAC,WAAW;YAC5B,eAAe;YACf,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;SACvC,CAAA;QACD,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAC/B,CAAC;IAED,qEAAqE;IAC7D,WAAW,CAAC,KAAiB,EAAE,eAAgC;QACrE,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QACjC,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,KAAK,SAAS;YAAE,OAAO,eAAe,CAAC,GAAG,CAAC,CAAA;IACvF,CAAC;IAED,yFAAyF;IACjF,SAAS,CAAC,KAAiB,EAAE,eAAgC;QACnE,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAA;QACpD,OAAO,KAAK,YAAY,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAA;IAC1D,CAAC;IAED;;;;;;;;;;OAUG;IACK,SAAS,CAAC,KAAiB;QACjC,OAAO,GAAG,kBAAkB,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAA;IAC/F,CAAC;CACF;AAED,oEAAoE;AACpE,SAAS,WAAW,CAAC,SAA2B,EAAE,SAAiB;IACjE,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,KAAK,SAAS,IAAI,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAA;AACpF,CAAC;AAED,gFAAgF;AAChF,SAAS,QAAQ,CAAC,KAAa;IAC7B,IAAI,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACpC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,QAAQ,GAAG,YAAY,CAAA;QACvB,YAAY,IAAI,CAAC,CAAA;QACjB,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IACjC,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED,gGAAgG;AAChG,SAAS,SAAS,CAAC,MAAe;IAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,SAAS,CAAC,yCAAyC,CAAC,CAAA;IAC1F,OAAO,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;AAChC,CAAC;AAED,uFAAuF;AACvF,SAAS,WAAW,CAAC,IAAa;IAChC,MAAM,SAAS,GAAG,IAAI,YAAY,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC,EAAE,KAAK,EAAE,IAAa,EAAE,CAAC,CAAA;IAC1G,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,YAAY,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,KAAK,YAAY,WAAW,CAAC,EAAE,CAAC;QACrF,MAAM,IAAI,SAAS,CAAC,iDAAiD,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;IACnG,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,2CAA2C;AAC3C,SAAS,cAAc,CAAC,UAAuC;IAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,SAAS,CAAC,KAAK,YAAY,KAAK,IAAI,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACjE,MAAM,IAAI,KAAK,CACb,cAAc,cAAc,CAAC,SAAS,CAAC,+DAA+D,CACvG,CAAA;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAS,gBAAgB,CAAC,UAAuC;IAC/D,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAA;IAClD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAS,CAAA;IACnC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAA;IAEnC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;QACzF,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;QAE7B,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/C,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CACb,cAAc,cAAc,CAAC,SAAS,CAAC,yGAAyG,CACjJ,CAAA;YACH,CAAC;YACD,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACvB,CAAC;QAED,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS;YAAE,SAAQ;QAC1C,IAAI,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,SAAS,CAAC,IAAI,GAAG,CAAC,CAAA;QAClG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IAC/B,CAAC;AACH,CAAC;AAED,0FAA0F;AAC1F,QAAQ,CAAC,CAAC,eAAe,CAAC,SAA2B;IACnD,IAAI,SAAS,CAAC,KAAK,YAAY,WAAW,EAAE,CAAC;QAC3C,KAAK,MAAM,MAAM,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU;YAAE,KAAK,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAA;IACjF,CAAC;SAAM,CAAC;QACN,MAAM,SAAS,CAAC,KAAK,CAAA;IACvB,CAAC;AACH,CAAC;AAED,kFAAkF;AAClF,SAAS,cAAc,CAAC,SAA2B;IACjD,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC,IAAI,CAAA;IACpF,OAAO,SAAS,CAAC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAA;AAC1G,CAAC;AAED;;;;;GAKG;AACH,SAAS,UAAU,CAAC,KAAY;IAC9B,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC,IAAI,CAAA;IACvC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,KAAK,CAAC,SAAS,EAAE,EAAE,OAAO,CAAA;QAC1C,OAAO,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAA;IACtD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,QAAQ,CAAA;IACjB,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,SAAS,iBAAiB,CAAC,QAAiB;IAC1C,OAAO,QAAQ,CAAC,QAAQ,CAAC,IAAI,QAAQ,IAAI,QAAQ,IAAI,OAAO,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAA;AAC5F,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc;IAC9B,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAA;AACpD,CAAC;AAED,kDAAkD;AAClD,SAAS,QAAQ,CAAC,KAAc;IAC9B,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAA;IACjC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,WAAW,CAAA;IAC3C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,WAAW,EAAE,IAAI,IAAI,QAAQ,CAAA;IACzE,OAAO,OAAO,KAAK,CAAA;AACrB,CAAC"}