@smooai/smooth-operator-core 0.1.1 → 0.9.0

package/dist/llmProvider.d.ts

@@ -1,106 +0,0 @@
-/**
- * An `LlmProvider` seam over the LLM call so the agentic loop can be unit-tested
- * deterministically, without a live model or network.
- *
- * The agent already takes an injected OpenAI-compatible chat client
- * ({@link ChatClientLike}). This module *formalizes* that as the provider seam —
- * `LlmProvider` is an alias of `ChatClientLike`, so the existing `SmoothAgent`
- * constructor is unchanged and backward compatible (the real `openai` SDK still
- * satisfies it).
- *
- * It also ships a reusable, exported {@link MockLlmProvider} that replaces the
- * ad-hoc fake clients the tests rolled by hand. The mock:
- *
- * - is constructed with a script of responses — plain text, tool-call responses,
- *   and errors;
- * - returns them in FIFO order across calls;
- * - records each request (the messages + tool specs it was given) so a test can
- *   assert on what the agent sent.
- *
- * This mirrors the BEHAVIOR of the Rust reference's `MockLlmClient`
- * (`rust/smooth-operator-core/src/llm_provider.rs`). The mock implements both the
- * non-streaming `create` seam (used by {@link SmoothAgent.run}) and the streaming
- * `createStream` seam (used by {@link SmoothAgent.runStream}): it replays the SAME
- * FIFO script as chunked deltas — text split into a few pieces, tool-call
- * `arguments` split across two chunks to exercise the accumulator, and a final
- * chunk carrying usage. Structured-output lands when that feature lands here.
- */
-import type { ChatChunk, ChatClientLike } from './agent.js';
-/** The LLM call surface the agent loop depends on. Identical to {@link ChatClientLike}. */
-export type LlmProvider = ChatClientLike;
-/** An OpenAI-shaped assistant message — the `choices[0].message` the agent reads. */
-export interface ScriptedMessage {
-    content: string | null;
-    tool_calls?: Array<{
-        id: string;
-        function: {
-            name: string;
-            arguments: string;
-        };
-    }> | null;
-}
-/** Build a plain-text scripted response (no tool calls). */
-export declare function textResponse(content: string): ScriptedMessage;
-/** Build a scripted response that requests a single tool call. */
-export declare function toolCallResponse(id: string, name: string, args: string): ScriptedMessage;
-/** One request the mock received, captured for assertions. */
-export interface RecordedCall {
-    /** The full request body passed to `chat.completions.create`. */
-    body: Record<string, unknown>;
-    /** The messages passed on this call. */
-    messages: Array<Record<string, unknown>>;
-    /** The tool specs offered to the model, if any. */
-    tools?: Array<Record<string, unknown>>;
-}
-/** Optional token usage to attach to a scripted response (the model/gateway reports it). */
-export interface ScriptedUsage {
-    prompt_tokens?: number;
-    completion_tokens?: number;
-}
-/**
- * A deterministic {@link LlmProvider} for tests. Script the responses it should
- * return (FIFO), drive your code, then assert on {@link MockLlmProvider.calls}.
- *
- * Construct empty and build up fluently (`pushText` / `pushToolCall` / `pushError`),
- * or pass an initial script of {@link ScriptedMessage}s.
- *
- * @example
- * const mock = new MockLlmProvider();
- * mock.pushText('hello there');
- * const agent = new SmoothAgent(mock, {});
- * const result = await agent.run('hi');
- * expect(result.text).toBe('hello there');
- * expect(mock.callCount).toBe(1);
- */
-export declare class MockLlmProvider implements ChatClientLike {
-    private readonly script;
-    private readonly recorded;
-    constructor(script?: ScriptedMessage[]);
-    /** Queue a raw OpenAI-shaped assistant message (with optional usage) for the next call. */
-    pushResponse(message: ScriptedMessage, usage?: ScriptedUsage): this;
-    /** Queue a plain-text response (with optional usage) for the next call. */
-    pushText(content: string, usage?: ScriptedUsage): this;
-    /** Queue a single-tool-call response (with optional usage) for the next call. */
-    pushToolCall(id: string, name: string, args: string, usage?: ScriptedUsage): this;
-    /** Queue an error to be thrown on the next call. */
-    pushError(message: string): this;
-    /** Every request the mock has received so far, in order. */
-    get calls(): readonly RecordedCall[];
-    /** Number of requests received. */
-    get callCount(): number;
-    /** The most recent request, if any. */
-    get lastCall(): RecordedCall | undefined;
-    private record;
-    readonly chat: {
-        completions: {
-            create: (body: Record<string, unknown>) => Promise<{
-                choices: {
-                    message: ScriptedMessage;
-                }[];
-                usage: ScriptedUsage | null;
-            }>;
-            createStream: (body: Record<string, unknown>) => AsyncIterable<ChatChunk>;
-        };
-    };
-}
-//# sourceMappingURL=llmProvider.d.ts.map

package/dist/llmProvider.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"llmProvider.d.ts","sourceRoot":"","sources":["../src/llmProvider.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5D,2FAA2F;AAC3F,MAAM,MAAM,WAAW,GAAG,cAAc,CAAC;AAEzC,qFAAqF;AACrF,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,UAAU,CAAC,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,SAAS,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CAAC,GAAG,IAAI,CAAC;CAC5F;AAED,4DAA4D;AAC5D,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,eAAe,CAE7D;AAED,kEAAkE;AAClE,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,eAAe,CAExF;AAED,8DAA8D;AAC9D,MAAM,WAAW,YAAY;IACzB,iEAAiE;IACjE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC9B,wCAAwC;IACxC,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IACzC,mDAAmD;IACnD,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CAC1C;AAED,4FAA4F;AAC5F,MAAM,WAAW,aAAa;IAC1B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,iBAAiB,CAAC,EAAE,MAAM,CAAC;CAC9B;AAKD;;;;;;;;;;;;;;GAcG;AACH,qBAAa,eAAgB,YAAW,cAAc;IAClD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAiB;IACxC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAsB;gBAEnC,MAAM,GAAE,eAAe,EAAO;IAM1C,2FAA2F;IAC3F,YAAY,CAAC,OAAO,EAAE,eAAe,EAAE,KAAK,CAAC,EAAE,aAAa,GAAG,IAAI;IAKnE,2EAA2E;IAC3E,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,aAAa,GAAG,IAAI;IAItD,iFAAiF;IACjF,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,aAAa,GAAG,IAAI;IAIjF,oDAAoD;IACpD,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;IAOhC,4DAA4D;IAC5D,IAAI,KAAK,IAAI,SAAS,YAAY,EAAE,CAEnC;IAED,mCAAmC;IACnC,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,uCAAuC;IACvC,IAAI,QAAQ,IAAI,YAAY,GAAG,SAAS,CAEvC;IAID,OAAO,CAAC,MAAM;IAQd,QAAQ,CAAC,IAAI;;2BAEgB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;;;;;;iCAcvB,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAG,aAAa,CAAC,SAAS,CAAC;;MAiC7E;CACL"}

package/dist/llmProvider.js

@@ -1,160 +0,0 @@
-/**
- * An `LlmProvider` seam over the LLM call so the agentic loop can be unit-tested
- * deterministically, without a live model or network.
- *
- * The agent already takes an injected OpenAI-compatible chat client
- * ({@link ChatClientLike}). This module *formalizes* that as the provider seam —
- * `LlmProvider` is an alias of `ChatClientLike`, so the existing `SmoothAgent`
- * constructor is unchanged and backward compatible (the real `openai` SDK still
- * satisfies it).
- *
- * It also ships a reusable, exported {@link MockLlmProvider} that replaces the
- * ad-hoc fake clients the tests rolled by hand. The mock:
- *
- * - is constructed with a script of responses — plain text, tool-call responses,
- *   and errors;
- * - returns them in FIFO order across calls;
- * - records each request (the messages + tool specs it was given) so a test can
- *   assert on what the agent sent.
- *
- * This mirrors the BEHAVIOR of the Rust reference's `MockLlmClient`
- * (`rust/smooth-operator-core/src/llm_provider.rs`). The mock implements both the
- * non-streaming `create` seam (used by {@link SmoothAgent.run}) and the streaming
- * `createStream` seam (used by {@link SmoothAgent.runStream}): it replays the SAME
- * FIFO script as chunked deltas — text split into a few pieces, tool-call
- * `arguments` split across two chunks to exercise the accumulator, and a final
- * chunk carrying usage. Structured-output lands when that feature lands here.
- */
-/** Build a plain-text scripted response (no tool calls). */
-export function textResponse(content) {
-    return { content };
-}
-/** Build a scripted response that requests a single tool call. */
-export function toolCallResponse(id, name, args) {
-    return { content: null, tool_calls: [{ id, function: { name, arguments: args } }] };
-}
-/**
- * A deterministic {@link LlmProvider} for tests. Script the responses it should
- * return (FIFO), drive your code, then assert on {@link MockLlmProvider.calls}.
- *
- * Construct empty and build up fluently (`pushText` / `pushToolCall` / `pushError`),
- * or pass an initial script of {@link ScriptedMessage}s.
- *
- * @example
- * const mock = new MockLlmProvider();
- * mock.pushText('hello there');
- * const agent = new SmoothAgent(mock, {});
- * const result = await agent.run('hi');
- * expect(result.text).toBe('hello there');
- * expect(mock.callCount).toBe(1);
- */
-export class MockLlmProvider {
-    script = [];
-    recorded = [];
-    constructor(script = []) {
-        this.script = script.map((message) => ({ kind: 'message', message }));
-    }
-    // ── scripting (fluent: each returns this) ────────────────────────────────
-    /** Queue a raw OpenAI-shaped assistant message (with optional usage) for the next call. */
-    pushResponse(message, usage) {
-        this.script.push({ kind: 'message', message, usage });
-        return this;
-    }
-    /** Queue a plain-text response (with optional usage) for the next call. */
-    pushText(content, usage) {
-        return this.pushResponse(textResponse(content), usage);
-    }
-    /** Queue a single-tool-call response (with optional usage) for the next call. */
-    pushToolCall(id, name, args, usage) {
-        return this.pushResponse(toolCallResponse(id, name, args), usage);
-    }
-    /** Queue an error to be thrown on the next call. */
-    pushError(message) {
-        this.script.push({ kind: 'error', message });
-        return this;
-    }
-    // ── recordings ───────────────────────────────────────────────────────────
-    /** Every request the mock has received so far, in order. */
-    get calls() {
-        return this.recorded;
-    }
-    /** Number of requests received. */
-    get callCount() {
-        return this.recorded.length;
-    }
-    /** The most recent request, if any. */
-    get lastCall() {
-        return this.recorded[this.recorded.length - 1];
-    }
-    // ── the ChatClientLike surface ───────────────────────────────────────────
-    record(body) {
-        this.recorded.push({
-            body,
-            messages: body.messages ?? [],
-            tools: body.tools,
-        });
-    }
-    chat = {
-        completions: {
-            create: async (body) => {
-                this.record(body);
-                const outcome = this.script.shift();
-                if (outcome?.kind === 'error')
-                    throw new Error(outcome.message);
-                // Empty script: a benign terminal text response so loops don't hang.
-                const message = outcome?.message ?? { content: '' };
-                const usage = outcome?.kind === 'message' ? outcome.usage : undefined;
-                return { choices: [{ message }], usage: usage ?? null };
-            },
-            // Streaming seam: replays the SAME FIFO script as chunked deltas. Text is
-            // split into a few pieces (so consumers see multiple `text` events); a
-            // tool call's `arguments` is split across two chunks (so the agent's
-            // accumulator is exercised); a final empty-delta chunk carries usage.
-            createStream: (body) => {
-                this.record(body);
-                const outcome = this.script.shift();
-                const message = outcome?.kind === 'message' ? outcome.message : { content: '' };
-                const usage = outcome?.kind === 'message' ? outcome.usage : undefined;
-                const error = outcome?.kind === 'error' ? outcome.message : undefined;
-                async function* gen() {
-                    if (error)
-                        throw new Error(error);
-                    // Text content → 2-3 deltas.
-                    const content = message.content ?? '';
-                    for (const piece of splitIntoChunks(content, 3)) {
-                        if (piece)
-                            yield { choices: [{ delta: { content: piece } }] };
-                    }
-                    // Tool calls → opening chunk (id + name + first arg half), then a
-                    // second chunk with the rest of the arguments. Exercises the
-                    // index-keyed accumulator on the agent side.
-                    for (const [index, tc] of (message.tool_calls ?? []).entries()) {
-                        const args = tc.function.arguments ?? '';
-                        const mid = Math.floor(args.length / 2);
-                        yield {
-                            choices: [{ delta: { tool_calls: [{ index, id: tc.id, function: { name: tc.function.name, arguments: args.slice(0, mid) } }] } }],
-                        };
-                        yield {
-                            choices: [{ delta: { tool_calls: [{ index, function: { arguments: args.slice(mid) } }] } }],
-                        };
-                    }
-                    // Final chunk carries usage (gateways send it on the last chunk).
-                    yield { choices: [{ delta: {} }], usage: usage ? { prompt_tokens: usage.prompt_tokens ?? 0, completion_tokens: usage.completion_tokens ?? 0 } : null };
-                }
-                return gen();
-            },
-        },
-    };
-}
-/** Split `s` into up to `n` roughly-equal non-empty pieces (≥2 when long enough). */
-function splitIntoChunks(s, n) {
-    if (s.length === 0)
-        return [];
-    const parts = Math.min(n, Math.max(1, s.length));
-    const size = Math.ceil(s.length / parts);
-    const out = [];
-    for (let i = 0; i < s.length; i += size)
-        out.push(s.slice(i, i + size));
-    return out;
-}
-//# sourceMappingURL=llmProvider.js.map

package/dist/llmProvider.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"llmProvider.js","sourceRoot":"","sources":["../src/llmProvider.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAaH,4DAA4D;AAC5D,MAAM,UAAU,YAAY,CAAC,OAAe;IACxC,OAAO,EAAE,OAAO,EAAE,CAAC;AACvB,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,gBAAgB,CAAC,EAAU,EAAE,IAAY,EAAE,IAAY;IACnE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;AACxF,CAAC;AAqBD;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,eAAe;IACP,MAAM,GAAc,EAAE,CAAC;IACvB,QAAQ,GAAmB,EAAE,CAAC;IAE/C,YAAY,SAA4B,EAAE;QACtC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,4EAA4E;IAE5E,2FAA2F;IAC3F,YAAY,CAAC,OAAwB,EAAE,KAAqB;QACxD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,2EAA2E;IAC3E,QAAQ,CAAC,OAAe,EAAE,KAAqB;QAC3C,OAAO,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC;IAC3D,CAAC;IAED,iFAAiF;IACjF,YAAY,CAAC,EAAU,EAAE,IAAY,EAAE,IAAY,EAAE,KAAqB;QACtE,OAAO,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;IACtE,CAAC;IAED,oDAAoD;IACpD,SAAS,CAAC,OAAe;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,4EAA4E;IAE5E,4DAA4D;IAC5D,IAAI,KAAK;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAED,mCAAmC;IACnC,IAAI,SAAS;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAChC,CAAC;IAED,uCAAuC;IACvC,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,4EAA4E;IAEpE,MAAM,CAAC,IAA6B;QACxC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;YACf,IAAI;YACJ,QAAQ,EAAG,IAAI,CAAC,QAA2C,IAAI,EAAE;YACjE,KAAK,EAAE,IAAI,CAAC,KAAmD;SAClE,CAAC,CAAC;IACP,CAAC;IAEQ,IAAI,GAAG;QACZ,WAAW,EAAE;YACT,MAAM,EAAE,KAAK,EAAE,IAA6B,EAAE,EAAE;gBAC5C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAClB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;gBACpC,IAAI,OAAO,EAAE,IAAI,KAAK,OAAO;oBAAE,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAChE,qEAAqE;gBACrE,MAAM,OAAO,GAAoB,OAAO,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;gBACrE,MAAM,KAAK,GAAG,OAAO,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;gBACtE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;YAC5D,CAAC;YAED,0EAA0E;YAC1E,uEAAuE;YACvE,qEAAqE;YACrE,sEAAsE;YACtE,YAAY,EAAE,CAAC,IAA6B,EAA4B,EAAE;gBACtE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAClB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;gBACpC,MAAM,OAAO,GAAoB,OAAO,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;gBACjG,MAAM,KAAK,GAAG,OAAO,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;gBACtE,MAAM,KAAK,GAAG,OAAO,EAAE,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;gBAEtE,KAAK,SAAS,CAAC,CAAC,GAAG;oBACf,IAAI,KAAK;wBAAE,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC;oBAClC,6BAA6B;oBAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC;oBACtC,KAAK,MAAM,KAAK,IAAI,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC;wBAC9C,IAAI,KAAK;4BAAE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC;oBAClE,CAAC;oBACD,kEAAkE;oBAClE,6DAA6D;oBAC7D,6CAA6C;oBAC7C,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;wBAC7D,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,SAAS,IAAI,EAAE,CAAC;wBACzC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACxC,MAAM;4BACF,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;yBACpI,CAAC;wBACF,MAAM;4BACF,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;yBAC9F,CAAC;oBACN,CAAC;oBACD,kEAAkE;oBAClE,MAAM,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,KAAK,CAAC,aAAa,IAAI,CAAC,EAAE,iBAAiB,EAAE,KAAK,CAAC,iBAAiB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC3J,CAAC;gBACD,OAAO,GAAG,EAAE,CAAC;YACjB,CAAC;SACJ;KACJ,CAAC;CACL;AAED,qFAAqF;AACrF,SAAS,eAAe,CAAC,CAAS,EAAE,CAAS;IACzC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IACzC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACxE,OAAO,GAAG,CAAC;AACf,CAAC"}

package/dist/memory.d.ts

@@ -1,23 +0,0 @@
-/**
- * Long-term memory — facts the agent carries across conversations.
- *
- * Phase-1 sibling of the reference engines' memory. Distinct from checkpointing
- * (which persists a single conversation's messages): `Memory` is a durable pool of
- * standalone facts the agent recalls into context on any turn, keyed by relevance
- * to the current message. `InMemoryMemory` is the zero-dependency default (lexical
- * recall); a vector-backed memory drops in behind the interface.
- */
-export interface MemoryEntry {
-    text: string;
-}
-export interface Memory {
-    remember(text: string): void;
-    recall(query: string, topK?: number): MemoryEntry[];
-}
-/** A process-local memory pool with lexical-overlap recall. */
-export declare class InMemoryMemory implements Memory {
-    private readonly entries;
-    remember(text: string): void;
-    recall(query: string, topK?: number): MemoryEntry[];
-}
-//# sourceMappingURL=memory.d.ts.map

package/dist/memory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAMH,MAAM,WAAW,WAAW;IACxB,IAAI,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,MAAM;IACnB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,WAAW,EAAE,CAAC;CACvD;AAED,+DAA+D;AAC/D,qBAAa,cAAe,YAAW,MAAM;IACzC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAqB;IAE7C,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAK5B,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,WAAW,EAAE;CAejD"}

package/dist/memory.js

@@ -1,40 +0,0 @@
-/**
- * Long-term memory — facts the agent carries across conversations.
- *
- * Phase-1 sibling of the reference engines' memory. Distinct from checkpointing
- * (which persists a single conversation's messages): `Memory` is a durable pool of
- * standalone facts the agent recalls into context on any turn, keyed by relevance
- * to the current message. `InMemoryMemory` is the zero-dependency default (lexical
- * recall); a vector-backed memory drops in behind the interface.
- */
-function tokens(text) {
-    return text.toLowerCase().match(/[a-z0-9]+/g) ?? [];
-}
-/** A process-local memory pool with lexical-overlap recall. */
-export class InMemoryMemory {
-    entries = [];
-    remember(text) {
-        const t = text.trim();
-        if (t)
-            this.entries.push({ text: t });
-    }
-    recall(query, topK = 4) {
-        if (topK <= 0)
-            return [];
-        const qTerms = new Set(tokens(query));
-        return this.entries
-            .map((e, i) => {
-            const docTerms = new Set(tokens(e.text));
-            let overlap = 0;
-            for (const t of qTerms)
-                if (docTerms.has(t))
-                    overlap++;
-            return { e, i, overlap };
-        })
-            .filter((x) => x.overlap > 0)
-            .sort((a, b) => b.overlap - a.overlap || a.i - b.i)
-            .slice(0, topK)
-            .map((x) => x.e);
-    }
-}
-//# sourceMappingURL=memory.js.map

package/dist/memory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory.js","sourceRoot":"","sources":["../src/memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,SAAS,MAAM,CAAC,IAAY;IACxB,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;AACxD,CAAC;AAWD,+DAA+D;AAC/D,MAAM,OAAO,cAAc;IACN,OAAO,GAAkB,EAAE,CAAC;IAE7C,QAAQ,CAAC,IAAY;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,CAAC,KAAa,EAAE,IAAI,GAAG,CAAC;QAC1B,IAAI,IAAI,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,OAAO;aACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACV,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACzC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,OAAO,EAAE,CAAC;YACvD,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC;QAC7B,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;aAC5B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAClD,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;aACd,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;CACJ"}

package/dist/rerank.d.ts

@@ -1,27 +0,0 @@
-/**
- * Knowledge reranking — reorder retrieved documents by relevance.
- *
- * Phase-1 sibling of the reference engines' reranking. A `Reranker` takes the
- * query and the retriever's candidate hits and returns them reordered (and
- * possibly trimmed). `NoopReranker` is the default passthrough; `LexicalReranker`
- * re-scores by query-term coverage normalized for document length, so a concise
- * on-topic doc outranks a long one with the same raw overlap. A cross-encoder or
- * gateway reranker drops in behind the same interface.
- */
-import type { KnowledgeHit } from './knowledge.js';
-export interface Reranker {
-    rerank(query: string, hits: KnowledgeHit[]): KnowledgeHit[];
-}
-/** Returns the hits unchanged — the zero-cost default. */
-export declare class NoopReranker implements Reranker {
-    rerank(_query: string, hits: KnowledgeHit[]): KnowledgeHit[];
-}
-/**
- * Reorders by query-term coverage normalized by document length:
- * `coverage / log2(2 + docTokenCount)`, so coverage is rewarded but long docs are
- * penalized relative to concise ones with the same coverage. Stable for ties.
- */
-export declare class LexicalReranker implements Reranker {
-    rerank(query: string, hits: KnowledgeHit[]): KnowledgeHit[];
-}
-//# sourceMappingURL=rerank.d.ts.map

package/dist/rerank.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"rerank.d.ts","sourceRoot":"","sources":["../src/rerank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAMnD,MAAM,WAAW,QAAQ;IACrB,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE,CAAC;CAC/D;AAED,0DAA0D;AAC1D,qBAAa,YAAa,YAAW,QAAQ;IACzC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE;CAG/D;AAED;;;;GAIG;AACH,qBAAa,eAAgB,YAAW,QAAQ;IAC5C,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE;CAiB9D"}

package/dist/rerank.js

@@ -1,45 +0,0 @@
-/**
- * Knowledge reranking — reorder retrieved documents by relevance.
- *
- * Phase-1 sibling of the reference engines' reranking. A `Reranker` takes the
- * query and the retriever's candidate hits and returns them reordered (and
- * possibly trimmed). `NoopReranker` is the default passthrough; `LexicalReranker`
- * re-scores by query-term coverage normalized for document length, so a concise
- * on-topic doc outranks a long one with the same raw overlap. A cross-encoder or
- * gateway reranker drops in behind the same interface.
- */
-function tokens(text) {
-    return text.toLowerCase().match(/[a-z0-9]+/g) ?? [];
-}
-/** Returns the hits unchanged — the zero-cost default. */
-export class NoopReranker {
-    rerank(_query, hits) {
-        return hits;
-    }
-}
-/**
- * Reorders by query-term coverage normalized by document length:
- * `coverage / log2(2 + docTokenCount)`, so coverage is rewarded but long docs are
- * penalized relative to concise ones with the same coverage. Stable for ties.
- */
-export class LexicalReranker {
-    rerank(query, hits) {
-        const qTerms = new Set(tokens(query));
-        if (qTerms.size === 0)
-            return hits;
-        const score = (hit) => {
-            const docTokens = tokens(hit.content);
-            let coverage = 0;
-            for (const t of new Set(docTokens))
-                if (qTerms.has(t))
-                    coverage++;
-            return coverage / Math.log2(2 + docTokens.length);
-        };
-        // Stable sort by descending score (decorate with index to preserve ties).
-        return hits
-            .map((hit, i) => ({ hit, i, s: score(hit) }))
-            .sort((a, b) => b.s - a.s || a.i - b.i)
-            .map((x) => x.hit);
-    }
-}
-//# sourceMappingURL=rerank.js.map

package/dist/rerank.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rerank.js","sourceRoot":"","sources":["../src/rerank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH,SAAS,MAAM,CAAC,IAAY;IACxB,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;AACxD,CAAC;AAMD,0DAA0D;AAC1D,MAAM,OAAO,YAAY;IACrB,MAAM,CAAC,MAAc,EAAE,IAAoB;QACvC,OAAO,IAAI,CAAC;IAChB,CAAC;CACJ;AAED;;;;GAIG;AACH,MAAM,OAAO,eAAe;IACxB,MAAM,CAAC,KAAa,EAAE,IAAoB;QACtC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACtC,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEnC,MAAM,KAAK,GAAG,CAAC,GAAiB,EAAU,EAAE;YACxC,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACtC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,IAAI,GAAG,CAAC,SAAS,CAAC;gBAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,QAAQ,EAAE,CAAC;YAClE,OAAO,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;QACtD,CAAC,CAAC;QAEF,0EAA0E;QAC1E,OAAO,IAAI;aACN,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAC5C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;CACJ"}

package/dist/thread.d.ts

@@ -1,43 +0,0 @@
-/**
- * Conversation threads — carry message history across `SmoothAgent.run` calls.
- *
- * Phase-2 sibling of the C# `SmoothAgentThread` (`dotnet/core`) and the reference
- * engine's persisted `Conversation`. A {@link SmoothAgentThread} is the in-memory
- * handle you hold per user conversation and pass to each run: the agent seeds the
- * turn from the thread's messages, runs, and appends this turn's user/assistant/tool
- * messages back to it, so the next turn has the full context. The system prompt is
- * supplied per-run from instructions/knowledge/memory and is *never* stored here.
- *
- * This complements checkpointing (`./checkpoint.ts`): a checkpoint *persists* a
- * conversation to a store keyed by id; a thread is the live in-memory object you
- * pass between runs. The thread's {@link SmoothAgentThread.id} is the natural key
- * to checkpoint under.
- */
-type Message = Record<string, unknown>;
-/**
- * A conversation thread: a stable id plus the ordered non-system messages so far.
- *
- * Construct fresh (a new id is generated) or pass an `id` to resume one (e.g. a key
- * recovered from a checkpoint):
- *
- * ```ts
- * const thread = new SmoothAgentThread();              // fresh conversation
- * const resumed = new SmoothAgentThread('conv-42');    // resume by id
- * ```
- */
-export declare class SmoothAgentThread {
-    readonly id: string;
-    /** Ordered history, oldest first, never including a system message. */
-    private readonly _messages;
-    constructor(id?: string, messages?: Message[]);
-    /** The accumulated history, oldest first (no system prompt). */
-    get messages(): readonly Message[];
-    /** Number of messages currently in the thread. */
-    get length(): number;
-    /** Append one message, skipping any system message (rebuilt per-run). */
-    add(message: Message): void;
-    /** Append several messages, skipping any system messages. */
-    extend(messages: readonly Message[]): void;
-}
-export {};
-//# sourceMappingURL=thread.d.ts.map

package/dist/thread.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"thread.d.ts","sourceRoot":"","sources":["../src/thread.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,KAAK,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAOvC;;;;;;;;;;GAUG;AACH,qBAAa,iBAAiB;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,uEAAuE;IACvE,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAiB;gBAE/B,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,OAAO,EAAE;IAK7C,gEAAgE;IAChE,IAAI,QAAQ,IAAI,SAAS,OAAO,EAAE,CAEjC;IAED,kDAAkD;IAClD,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,yEAAyE;IACzE,GAAG,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI;IAK3B,6DAA6D;IAC7D,MAAM,CAAC,QAAQ,EAAE,SAAS,OAAO,EAAE,GAAG,IAAI;CAG7C"}

package/dist/thread.js

@@ -1,60 +0,0 @@
-/**
- * Conversation threads — carry message history across `SmoothAgent.run` calls.
- *
- * Phase-2 sibling of the C# `SmoothAgentThread` (`dotnet/core`) and the reference
- * engine's persisted `Conversation`. A {@link SmoothAgentThread} is the in-memory
- * handle you hold per user conversation and pass to each run: the agent seeds the
- * turn from the thread's messages, runs, and appends this turn's user/assistant/tool
- * messages back to it, so the next turn has the full context. The system prompt is
- * supplied per-run from instructions/knowledge/memory and is *never* stored here.
- *
- * This complements checkpointing (`./checkpoint.ts`): a checkpoint *persists* a
- * conversation to a store keyed by id; a thread is the live in-memory object you
- * pass between runs. The thread's {@link SmoothAgentThread.id} is the natural key
- * to checkpoint under.
- */
-/** Generate a random hex id (crypto.randomUUID without the dashes). */
-function newThreadId() {
-    return globalThis.crypto.randomUUID().replace(/-/g, '');
-}
-/**
- * A conversation thread: a stable id plus the ordered non-system messages so far.
- *
- * Construct fresh (a new id is generated) or pass an `id` to resume one (e.g. a key
- * recovered from a checkpoint):
- *
- * ```ts
- * const thread = new SmoothAgentThread();              // fresh conversation
- * const resumed = new SmoothAgentThread('conv-42');    // resume by id
- * ```
- */
-export class SmoothAgentThread {
-    id;
-    /** Ordered history, oldest first, never including a system message. */
-    _messages = [];
-    constructor(id, messages) {
-        this.id = id && id.length > 0 ? id : newThreadId();
-        if (messages)
-            this.extend(messages);
-    }
-    /** The accumulated history, oldest first (no system prompt). */
-    get messages() {
-        return this._messages;
-    }
-    /** Number of messages currently in the thread. */
-    get length() {
-        return this._messages.length;
-    }
-    /** Append one message, skipping any system message (rebuilt per-run). */
-    add(message) {
-        if (message.role === 'system')
-            return;
-        this._messages.push(message);
-    }
-    /** Append several messages, skipping any system messages. */
-    extend(messages) {
-        for (const m of messages)
-            this.add(m);
-    }
-}
-//# sourceMappingURL=thread.js.map

package/dist/thread.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"thread.js","sourceRoot":"","sources":["../src/thread.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,uEAAuE;AACvE,SAAS,WAAW;IAChB,OAAO,UAAU,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,iBAAiB;IACjB,EAAE,CAAS;IACpB,uEAAuE;IACtD,SAAS,GAAc,EAAE,CAAC;IAE3C,YAAY,EAAW,EAAE,QAAoB;QACzC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACnD,IAAI,QAAQ;YAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,gEAAgE;IAChE,IAAI,QAAQ;QACR,OAAO,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IAED,kDAAkD;IAClD,IAAI,MAAM;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;IACjC,CAAC;IAED,yEAAyE;IACzE,GAAG,CAAC,OAAgB;QAChB,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO;QACtC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IAED,6DAA6D;IAC7D,MAAM,CAAC,QAA4B;QAC/B,KAAK,MAAM,CAAC,IAAI,QAAQ;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;CACJ"}

package/dist/toolSearch.d.ts

@@ -1,55 +0,0 @@
-/**
- * The `tool_search` meta-tool — promotes deferred tools on demand.
- *
- * Phase-3 sibling of the Rust reference `tool_search.rs`. Mirrors the behaviour,
- * not the type shapes (this core has no `ToolRegistry` — tools are a plain array
- * on {@link AgentOptions}).
- *
- * As a tool set grows past ~20-30 entries, every model turn pays tokens to read
- * schemas it isn't going to use, diluting the model's attention budget. So a caller
- * can register some tools as **deferred** (`AgentOptions.deferredTools`): their
- * schemas are hidden from the model. Instead the agent advertises a single built-in
- * `tool_search(query)` meta-tool. When the model calls it, this fuzzy-matches the
- * query against the deferred tools' names + descriptions, **promotes** the matches
- * into the visible set (so the model can call them on subsequent turns), and returns
- * each match's name + description as JSON.
- *
- * A deferred tool that has not been promoted is *not* dispatchable — calling it
- * surfaces as an unknown tool until `tool_search` adds it to the promoted set.
- */
-import type { Tool } from './agent.js';
-/** The built-in meta-tool's name. Reserved when deferred tools are in play. */
-export declare const TOOL_SEARCH_NAME = "tool_search";
-/**
- * Cap on how many deferred tools a single `tool_search` call may promote, so a
- * generic query like "tool" doesn't promote the entire deferred set in one shot.
- */
-export declare const MAX_MATCHES = 8;
-/**
- * Drives deferred-tool promotion for one agent run. Implements {@link Tool} so the
- * agent can advertise + dispatch it like any other tool. Holds the deferred tools
- * (by name) and the mutable set of promoted names; the agent consults
- * {@link promotedTools} each iteration to decide which deferred schemas are now
- * visible/dispatchable.
- */
-export declare class ToolSearch implements Tool {
-    readonly name = "tool_search";
-    readonly description: string;
-    readonly parameters: Record<string, unknown>;
-    private readonly deferredByName;
-    private readonly promoted;
-    constructor(deferred: Tool[]);
-    /** True if any tool was registered deferred (the meta-tool is advertised only then). */
-    hasDeferred(): boolean;
-    /** True if a deferred tool has been promoted and is now dispatchable. */
-    isPromoted(name: string): boolean;
-    /** The deferred tools that have been promoted — their schemas join the visible set. */
-    promotedTools(): Tool[];
-    /** Resolve a promoted deferred tool for dispatch. Unpromoted deferred tools are invisible. */
-    toolByName(name: string): Tool | undefined;
-    /** Mark a deferred tool promoted. Returns false if no such deferred tool. */
-    promote(name: string): boolean;
-    /** Fuzzy-match the query, promote matches, and return their schemas as JSON. */
-    execute(args: Record<string, unknown>): Promise<string>;
-}
-//# sourceMappingURL=toolSearch.d.ts.map

package/dist/toolSearch.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"toolSearch.d.ts","sourceRoot":"","sources":["../src/toolSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAEvC,+EAA+E;AAC/E,eAAO,MAAM,gBAAgB,gBAAgB,CAAC;AAE9C;;;GAGG;AACH,eAAO,MAAM,WAAW,IAAI,CAAC;AAmB7B;;;;;;GAMG;AACH,qBAAa,UAAW,YAAW,IAAI;IACnC,QAAQ,CAAC,IAAI,iBAAoB;IACjC,QAAQ,CAAC,WAAW,SAAe;IACnC,QAAQ,CAAC,UAAU,0BAAU;IAE7B,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAoB;IACnD,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAqB;gBAElC,QAAQ,EAAE,IAAI,EAAE;IAI5B,wFAAwF;IACxF,WAAW,IAAI,OAAO;IAItB,yEAAyE;IACzE,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAIjC,uFAAuF;IACvF,aAAa,IAAI,IAAI,EAAE;IASvB,8FAA8F;IAC9F,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAI1C,6EAA6E;IAC7E,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAM9B,gFAAgF;IAC1E,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;CAuBhE"}