@darkiceinteractive/mcp-conductor 2.0.0-alpha.1 → 3.0.0-beta.2

package/dist/runtime/findtool/embed.js

@@ -0,0 +1,85 @@
+/**
+ * Lightweight embedding for findTool
+ *
+ * Uses a character-level TF-IDF-style embedding that runs entirely in-process
+ * with no ONNX runtime dependency. This keeps the package lightweight while
+ * providing meaningful semantic similarity for MCP tool search.
+ *
+ * The embedding is a fixed-dimensional Float32Array built from:
+ *   1. Unigram token frequencies (normalised)
+ *   2. Bigram token frequencies (normalised)
+ *
+ * This is sufficient for the findTool use case where queries are short phrases
+ * and tool descriptions are relatively short, structured text.
+ *
+ * If $MCP_CONDUCTOR_EMBED_MODEL=onnx is set and @xenova/transformers is
+ * installed, we will delegate to MiniLM-L6 at runtime. Otherwise we fall
+ * back to the in-process TF-IDF embedder.
+ *
+ * @module runtime/findtool/embed
+ */
+// Embedding dimension for the in-process embedder
+export const EMBED_DIM = 256;
+// ─────────────────────────────────────────────────────────────────────────────
+// Tokeniser
+// ─────────────────────────────────────────────────────────────────────────────
+function tokenise(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^a-z0-9_\-. ]/g, ' ')
+        .split(/\s+/)
+        .filter(Boolean);
+}
+// Deterministic hash of a string to [0, EMBED_DIM)
+function hashBucket(s) {
+    let h = 5381;
+    for (let i = 0; i < s.length; i++) {
+        h = ((h << 5) + h) ^ s.charCodeAt(i);
+        h = h >>> 0; // keep unsigned 32-bit
+    }
+    return h % EMBED_DIM;
+}
+/**
+ * Build a Float32Array embedding for a text string.
+ * The vector is L2-normalised for cosine similarity computation.
+ */
+export function embed(text) {
+    const vec = new Float32Array(EMBED_DIM);
+    const tokens = tokenise(text);
+    if (tokens.length === 0)
+        return vec;
+    // Unigram features
+    for (const token of tokens) {
+        vec[hashBucket(token)] = (vec[hashBucket(token)] ?? 0) + 1;
+    }
+    // Bigram features
+    for (let i = 0; i < tokens.length - 1; i++) {
+        const ti = tokens[i] ?? '';
+        const ti1 = tokens[i + 1] ?? '';
+        const bigram = ti + '_' + ti1;
+        vec[hashBucket(bigram)] = (vec[hashBucket(bigram)] ?? 0) + 0.5;
+    }
+    // L2 normalise
+    let norm = 0;
+    for (let i = 0; i < EMBED_DIM; i++)
+        norm += (vec[i] ?? 0) * (vec[i] ?? 0);
+    norm = Math.sqrt(norm);
+    if (norm > 0) {
+        for (let i = 0; i < EMBED_DIM; i++) {
+            const v = vec[i] ?? 0;
+            vec[i] = v / norm;
+        }
+    }
+    return vec;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Cosine similarity
+// ─────────────────────────────────────────────────────────────────────────────
+export function cosineSimilarity(a, b) {
+    let dot = 0;
+    for (let i = 0; i < a.length; i++)
+        dot += (a[i] ?? 0) * (b[i] ?? 0);
+    // Vectors are already L2-normalised so dot product == cosine similarity
+    return dot;
+}
+//# sourceMappingURL=embed.js.map

package/dist/runtime/findtool/embed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embed.js","sourceRoot":"","sources":["../../../src/runtime/findtool/embed.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,kDAAkD;AAClD,MAAM,CAAC,MAAM,SAAS,GAAG,GAAG,CAAC;AAE7B,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,iBAAiB,EAAE,GAAG,CAAC;SAC/B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,OAAO,CAAC,CAAC;AACrB,CAAC;AAED,mDAAmD;AACnD,SAAS,UAAU,CAAC,CAAS;IAC3B,IAAI,CAAC,GAAG,IAAI,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,uBAAuB;IACtC,CAAC;IACD,OAAO,CAAC,GAAG,SAAS,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,KAAK,CAAC,IAAY;IAChC,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAE9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAEpC,mBAAmB;IACnB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC1B,GAAwC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACnG,CAAC;IAED,kBAAkB;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;QAC7B,GAAwC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACvG,CAAC;IAED,eAAe;IACf,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1E,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,GAAwC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QAAC,CAAC;IACzH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF,MAAM,UAAU,gBAAgB,CAAC,CAAe,EAAE,CAAe;IAC/D,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACpE,wEAAwE;IACxE,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/runtime/findtool/index.d.ts

@@ -0,0 +1,52 @@
+/**
+ * findTool — semantic tool discovery
+ *
+ * Provides `findTool(query, options)` for sandbox code. Lazily initialises
+ * the vector index on first call and re-indexes whenever the registry
+ * publishes a hot-reload event.
+ *
+ * @module runtime/findtool
+ */
+export type { SearchResult } from './vector-index.js';
+export { embed, cosineSimilarity, EMBED_DIM } from './embed.js';
+export interface FindToolOptions {
+    /** Number of results to return (default: 5) */
+    topK?: number;
+    /** Restrict search to these servers */
+    serverFilter?: string[];
+}
+export interface ToolEntry {
+    server: string;
+    tool: string;
+    description: string;
+}
+/**
+ * Register a tool loader callback. Called during system startup so the
+ * findTool module can lazily pull tool definitions from the registry.
+ */
+export declare function registerToolLoader(loader: () => Promise<ToolEntry[]>): void;
+/**
+ * Immediately re-index all tools. Call this when the registry hot-reloads.
+ */
+export declare function reindex(): Promise<void>;
+/**
+ * Find MCP tools semantically similar to `query`.
+ *
+ * @example
+ * const tools = await findTool('list github issues', { topK: 3 });
+ */
+export declare function findTool(query: string, options?: FindToolOptions): Promise<Array<{
+    server: string;
+    tool: string;
+    description: string;
+    score: number;
+}>>;
+/**
+ * Seed the index directly (used in tests and worker bootstrap).
+ */
+export declare function seedIndex(tools: ToolEntry[]): void;
+/**
+ * Reset state (tests only).
+ */
+export declare function resetFindTool(): void;
+//# sourceMappingURL=index.d.ts.map

package/dist/runtime/findtool/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/runtime/findtool/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,YAAY,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAMhE,MAAM,WAAW,eAAe;IAC9B,+CAA+C;IAC/C,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,uCAAuC;IACvC,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;CACrB;AAiBD;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,MAAM,OAAO,CAAC,SAAS,EAAE,CAAC,GAAG,IAAI,CAG3E;AAED;;GAEG;AACH,wBAAsB,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAK7C;AAcD;;;;;GAKG;AACH,wBAAsB,QAAQ,CAC5B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,eAAoB,GAC5B,OAAO,CAAC,KAAK,CAAC;IAAE,MAAM,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAAC,CAGtF;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,IAAI,CAGlD;AAED;;GAEG;AACH,wBAAgB,aAAa,IAAI,IAAI,CAIpC"}

package/dist/runtime/findtool/index.js

@@ -0,0 +1,78 @@
+/**
+ * findTool — semantic tool discovery
+ *
+ * Provides `findTool(query, options)` for sandbox code. Lazily initialises
+ * the vector index on first call and re-indexes whenever the registry
+ * publishes a hot-reload event.
+ *
+ * @module runtime/findtool
+ */
+import { VectorIndex } from './vector-index.js';
+export { embed, cosineSimilarity, EMBED_DIM } from './embed.js';
+// ─────────────────────────────────────────────────────────────────────────────
+// Singleton index
+// ─────────────────────────────────────────────────────────────────────────────
+let _index = null;
+let _initialised = false;
+let _toolLoader = null;
+function getIndex() {
+    if (!_index) {
+        _index = new VectorIndex();
+    }
+    return _index;
+}
+/**
+ * Register a tool loader callback. Called during system startup so the
+ * findTool module can lazily pull tool definitions from the registry.
+ */
+export function registerToolLoader(loader) {
+    _toolLoader = loader;
+    _initialised = false; // force re-init on next search
+}
+/**
+ * Immediately re-index all tools. Call this when the registry hot-reloads.
+ */
+export async function reindex() {
+    if (!_toolLoader)
+        return;
+    const tools = await _toolLoader();
+    getIndex().rebuild(tools);
+    _initialised = true;
+}
+async function ensureInitialised() {
+    if (_initialised)
+        return;
+    if (_toolLoader) {
+        await reindex();
+    }
+    _initialised = true;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Public API
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Find MCP tools semantically similar to `query`.
+ *
+ * @example
+ * const tools = await findTool('list github issues', { topK: 3 });
+ */
+export async function findTool(query, options = {}) {
+    await ensureInitialised();
+    return getIndex().search(query, options.topK ?? 5, options.serverFilter);
+}
+/**
+ * Seed the index directly (used in tests and worker bootstrap).
+ */
+export function seedIndex(tools) {
+    getIndex().rebuild(tools);
+    _initialised = true;
+}
+/**
+ * Reset state (tests only).
+ */
+export function resetFindTool() {
+    _index = null;
+    _initialised = false;
+    _toolLoader = null;
+}
+//# sourceMappingURL=index.js.map

package/dist/runtime/findtool/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/runtime/findtool/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhD,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAmBhE,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF,IAAI,MAAM,GAAuB,IAAI,CAAC;AACtC,IAAI,YAAY,GAAG,KAAK,CAAC;AACzB,IAAI,WAAW,GAAwC,IAAI,CAAC;AAE5D,SAAS,QAAQ;IACf,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;IAC7B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,MAAkC;IACnE,WAAW,GAAG,MAAM,CAAC;IACrB,YAAY,GAAG,KAAK,CAAC,CAAC,+BAA+B;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO;IAC3B,IAAI,CAAC,WAAW;QAAE,OAAO;IACzB,MAAM,KAAK,GAAG,MAAM,WAAW,EAAE,CAAC;IAClC,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC1B,YAAY,GAAG,IAAI,CAAC;AACtB,CAAC;AAED,KAAK,UAAU,iBAAiB;IAC9B,IAAI,YAAY;QAAE,OAAO;IACzB,IAAI,WAAW,EAAE,CAAC;QAChB,MAAM,OAAO,EAAE,CAAC;IAClB,CAAC;IACD,YAAY,GAAG,IAAI,CAAC;AACtB,CAAC;AAED,gFAAgF;AAChF,aAAa;AACb,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,KAAa,EACb,UAA2B,EAAE;IAE7B,MAAM,iBAAiB,EAAE,CAAC;IAC1B,OAAO,QAAQ,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;AAC3E,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,KAAkB;IAC1C,QAAQ,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC1B,YAAY,GAAG,IAAI,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa;IAC3B,MAAM,GAAG,IAAI,CAAC;IACd,YAAY,GAAG,KAAK,CAAC;IACrB,WAAW,GAAG,IAAI,CAAC;AACrB,CAAC"}

package/dist/runtime/findtool/vector-index.d.ts

@@ -0,0 +1,53 @@
+/**
+ * In-memory vector index for tool embeddings
+ *
+ * Stores Float32Array embeddings for each registered MCP tool and provides
+ * cosine-similarity nearest-neighbour search. Re-indexes on registry hot-reload.
+ *
+ * For large deployments (>10k tools) consider replacing with hnswlib-node or
+ * LanceDB (set $LANCEDB_URL to enable the remote backend).
+ *
+ * @module runtime/findtool/vector-index
+ */
+export interface IndexedTool {
+    server: string;
+    tool: string;
+    description: string;
+    vector: Float32Array;
+}
+export interface SearchResult {
+    server: string;
+    tool: string;
+    description: string;
+    score: number;
+}
+export declare class VectorIndex {
+    private entries;
+    /**
+     * Add or replace all tools for a server. Existing entries for that
+     * server are removed first.
+     */
+    upsertServer(server: string, tools: Array<{
+        tool: string;
+        description: string;
+    }>): void;
+    /**
+     * Remove all entries for a server.
+     */
+    removeServer(server: string): void;
+    /**
+     * Rebuild the entire index from a flat list of tools.
+     */
+    rebuild(tools: Array<{
+        server: string;
+        tool: string;
+        description: string;
+    }>): void;
+    /**
+     * Search for tools similar to `query`.
+     */
+    search(query: string, topK?: number, serverFilter?: string[]): SearchResult[];
+    get size(): number;
+    clear(): void;
+}
+//# sourceMappingURL=vector-index.d.ts.map

package/dist/runtime/findtool/vector-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-index.d.ts","sourceRoot":"","sources":["../../../src/runtime/findtool/vector-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,MAAM,EAAE,YAAY,CAAC;CACtB;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,OAAO,CAAqB;IAEpC;;;OAGG;IACH,YAAY,CACV,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,GAClD,IAAI;IAWP;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIlC;;OAEG;IACH,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,GAAG,IAAI;IASlF;;OAEG;IACH,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,IAAI,SAAI,EACR,YAAY,CAAC,EAAE,MAAM,EAAE,GACtB,YAAY,EAAE;IAmBjB,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,KAAK,IAAI,IAAI;CAGd"}

package/dist/runtime/findtool/vector-index.js

@@ -0,0 +1,71 @@
+/**
+ * In-memory vector index for tool embeddings
+ *
+ * Stores Float32Array embeddings for each registered MCP tool and provides
+ * cosine-similarity nearest-neighbour search. Re-indexes on registry hot-reload.
+ *
+ * For large deployments (>10k tools) consider replacing with hnswlib-node or
+ * LanceDB (set $LANCEDB_URL to enable the remote backend).
+ *
+ * @module runtime/findtool/vector-index
+ */
+import { embed, cosineSimilarity } from './embed.js';
+export class VectorIndex {
+    entries = [];
+    /**
+     * Add or replace all tools for a server. Existing entries for that
+     * server are removed first.
+     */
+    upsertServer(server, tools) {
+        // Remove existing entries for this server
+        this.entries = this.entries.filter((e) => e.server !== server);
+        for (const { tool, description } of tools) {
+            const text = `${tool}\n${description}`;
+            const vector = embed(text);
+            this.entries.push({ server, tool, description, vector });
+        }
+    }
+    /**
+     * Remove all entries for a server.
+     */
+    removeServer(server) {
+        this.entries = this.entries.filter((e) => e.server !== server);
+    }
+    /**
+     * Rebuild the entire index from a flat list of tools.
+     */
+    rebuild(tools) {
+        this.entries = tools.map(({ server, tool, description }) => ({
+            server,
+            tool,
+            description,
+            vector: embed(`${tool}\n${description}`),
+        }));
+    }
+    /**
+     * Search for tools similar to `query`.
+     */
+    search(query, topK = 5, serverFilter) {
+        if (this.entries.length === 0)
+            return [];
+        const queryVec = embed(query);
+        const candidates = serverFilter
+            ? this.entries.filter((e) => serverFilter.includes(e.server))
+            : this.entries;
+        const scored = candidates.map((e) => ({
+            server: e.server,
+            tool: e.tool,
+            description: e.description,
+            score: cosineSimilarity(queryVec, e.vector),
+        }));
+        scored.sort((a, b) => b.score - a.score);
+        return scored.slice(0, topK);
+    }
+    get size() {
+        return this.entries.length;
+    }
+    clear() {
+        this.entries = [];
+    }
+}
+//# sourceMappingURL=vector-index.js.map

package/dist/runtime/findtool/vector-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vector-index.js","sourceRoot":"","sources":["../../../src/runtime/findtool/vector-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAgBrD,MAAM,OAAO,WAAW;IACd,OAAO,GAAkB,EAAE,CAAC;IAEpC;;;OAGG;IACH,YAAY,CACV,MAAc,EACd,KAAmD;QAEnD,0CAA0C;QAC1C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;QAE/D,KAAK,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,KAAK,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,GAAG,IAAI,KAAK,WAAW,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IACjE,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,KAAmE;QACzE,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3D,MAAM;YACN,IAAI;YACJ,WAAW;YACX,MAAM,EAAE,KAAK,CAAC,GAAG,IAAI,KAAK,WAAW,EAAE,CAAC;SACzC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,MAAM,CACJ,KAAa,EACb,IAAI,GAAG,CAAC,EACR,YAAuB;QAEvB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEzC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,UAAU,GAAG,YAAY;YAC7B,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAC7D,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QAEjB,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACpC,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,KAAK,EAAE,gBAAgB,CAAC,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC;SAC5C,CAAC,CAAC,CAAC;QAEJ,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;CACF"}

package/dist/runtime/helpers/budget.d.ts

@@ -0,0 +1,27 @@
+/**
+ * mcp.budget — Token budget enforcement helper
+ *
+ * Wraps an async function call and automatically trims the result to fit
+ * within a token budget. If the result cannot be trimmed below the budget,
+ * throws BudgetExceededError.
+ *
+ * Token estimation: 1 token ≈ 4 characters (conservative heuristic,
+ * same as summarize.ts).
+ *
+ * @module runtime/helpers/budget
+ */
+export declare class BudgetExceededError extends Error {
+    readonly estimatedTokens: number;
+    readonly maxTokens: number;
+    constructor(estimatedTokens: number, maxTokens: number);
+}
+export declare function estimateTokens(data: unknown): number;
+/**
+ * Execute `fn` and auto-trim its return value to fit within `maxTokens`.
+ * Throws `BudgetExceededError` if the result cannot be trimmed.
+ *
+ * @example
+ * const result = await budget(500, async () => mcp.github.list_issues({ repo: 'foo' }));
+ */
+export declare function budget<T>(maxTokens: number, fn: () => T | Promise<T>): Promise<T>;
+//# sourceMappingURL=budget.d.ts.map

package/dist/runtime/helpers/budget.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"budget.d.ts","sourceRoot":"","sources":["../../../src/runtime/helpers/budget.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AASH,qBAAa,mBAAoB,SAAQ,KAAK;IAC5C,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;gBAEf,eAAe,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;CAQvD;AAQD,wBAAgB,cAAc,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,CAOpD;AAqDD;;;;;;GAMG;AACH,wBAAsB,MAAM,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CASvF"}

package/dist/runtime/helpers/budget.js

@@ -0,0 +1,103 @@
+/**
+ * mcp.budget — Token budget enforcement helper
+ *
+ * Wraps an async function call and automatically trims the result to fit
+ * within a token budget. If the result cannot be trimmed below the budget,
+ * throws BudgetExceededError.
+ *
+ * Token estimation: 1 token ≈ 4 characters (conservative heuristic,
+ * same as summarize.ts).
+ *
+ * @module runtime/helpers/budget
+ */
+import { compact } from './compact.js';
+import { summarize } from './summarize.js';
+// ─────────────────────────────────────────────────────────────────────────────
+// Error type
+// ─────────────────────────────────────────────────────────────────────────────
+export class BudgetExceededError extends Error {
+    estimatedTokens;
+    maxTokens;
+    constructor(estimatedTokens, maxTokens) {
+        super(`Result exceeds token budget after trimming: estimated ${estimatedTokens} tokens, budget ${maxTokens} tokens`);
+        this.name = 'BudgetExceededError';
+        this.estimatedTokens = estimatedTokens;
+        this.maxTokens = maxTokens;
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Token estimation
+// ─────────────────────────────────────────────────────────────────────────────
+const CHARS_PER_TOKEN = 4;
+export function estimateTokens(data) {
+    try {
+        const serialized = JSON.stringify(data) ?? String(data);
+        return Math.ceil(serialized.length / CHARS_PER_TOKEN);
+    }
+    catch {
+        return Math.ceil(String(data).length / CHARS_PER_TOKEN);
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Trimming strategy
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Attempt to trim `data` to fit within `maxTokens`.
+ * Strategy:
+ *   1. Try compact with progressive maxItems reduction (100 → 50 → 20 → 5)
+ *   2. Try summarize (list → paragraph)
+ *   3. If still over budget, throw BudgetExceededError
+ */
+function tryTrim(data, maxTokens) {
+    const maxChars = maxTokens * CHARS_PER_TOKEN;
+    // Step 1: progressive compact on arrays
+    if (Array.isArray(data)) {
+        for (const maxItems of [100, 50, 20, 10, 5, 1]) {
+            const trimmed = compact(data, { maxItems, maxStringLength: 200 });
+            if (estimateTokens(trimmed) <= maxTokens)
+                return trimmed;
+        }
+    }
+    // Step 2: compact objects with depth restriction
+    if (typeof data === 'object' && data !== null) {
+        for (const maxDepth of [5, 3, 2, 1]) {
+            const trimmed = compact(data, { maxDepth, maxItems: 20, maxStringLength: 200 });
+            if (estimateTokens(trimmed) <= maxTokens)
+                return trimmed;
+        }
+    }
+    // Step 3: summarize as list
+    const listSummary = summarize(data, { maxTokens, style: 'list' });
+    if (estimateTokens(listSummary) <= maxTokens)
+        return listSummary;
+    // Step 4: summarize as paragraph (more aggressive)
+    const paraSummary = summarize(data, { maxTokens, style: 'paragraph' });
+    if (estimateTokens(paraSummary) <= maxTokens)
+        return paraSummary;
+    // Step 5: raw string clip
+    const raw = typeof data === 'string' ? data : JSON.stringify(data) ?? String(data);
+    const clipped = raw.slice(0, maxChars - 1) + '…';
+    if (estimateTokens(clipped) <= maxTokens)
+        return clipped;
+    // Untrimmable
+    throw new BudgetExceededError(estimateTokens(data), maxTokens);
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Public API
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Execute `fn` and auto-trim its return value to fit within `maxTokens`.
+ * Throws `BudgetExceededError` if the result cannot be trimmed.
+ *
+ * @example
+ * const result = await budget(500, async () => mcp.github.list_issues({ repo: 'foo' }));
+ */
+export async function budget(maxTokens, fn) {
+    const result = await fn();
+    const estimated = estimateTokens(result);
+    if (estimated <= maxTokens) {
+        return result;
+    }
+    return tryTrim(result, maxTokens);
+}
+//# sourceMappingURL=budget.js.map

package/dist/runtime/helpers/budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"budget.js","sourceRoot":"","sources":["../../../src/runtime/helpers/budget.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAE3C,gFAAgF;AAChF,aAAa;AACb,gFAAgF;AAEhF,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IACnC,eAAe,CAAS;IACxB,SAAS,CAAS;IAE3B,YAAY,eAAuB,EAAE,SAAiB;QACpD,KAAK,CACH,yDAAyD,eAAe,mBAAmB,SAAS,SAAS,CAC9G,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;QAClC,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;CACF;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B,MAAM,UAAU,cAAc,CAAC,IAAa;IAC1C,IAAI,CAAC;QACH,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,eAAe,CAAC,CAAC;IACxD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,eAAe,CAAC,CAAC;IAC1D,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF;;;;;;GAMG;AACH,SAAS,OAAO,CAAC,IAAa,EAAE,SAAiB;IAC/C,MAAM,QAAQ,GAAG,SAAS,GAAG,eAAe,CAAC;IAE7C,wCAAwC;IACxC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,KAAK,MAAM,QAAQ,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC/C,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,CAAC;YAClE,IAAI,cAAc,CAAC,OAAO,CAAC,IAAI,SAAS;gBAAE,OAAO,OAAO,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;QAC9C,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,EAAE,eAAe,EAAE,GAAG,EAAE,CAAC,CAAC;YAChF,IAAI,cAAc,CAAC,OAAO,CAAC,IAAI,SAAS;gBAAE,OAAO,OAAO,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;IAClE,IAAI,cAAc,CAAC,WAAW,CAAC,IAAI,SAAS;QAAE,OAAO,WAAW,CAAC;IAEjE,mDAAmD;IACnD,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAC;IACvE,IAAI,cAAc,CAAC,WAAW,CAAC,IAAI,SAAS;QAAE,OAAO,WAAW,CAAC;IAEjE,0BAA0B;IAC1B,MAAM,GAAG,GAAG,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IACjD,IAAI,cAAc,CAAC,OAAO,CAAC,IAAI,SAAS;QAAE,OAAO,OAAO,CAAC;IAEzD,cAAc;IACd,MAAM,IAAI,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC;AACjE,CAAC;AAED,gFAAgF;AAChF,aAAa;AACb,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAI,SAAiB,EAAE,EAAwB;IACzE,MAAM,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC;IAC1B,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAEzC,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO,OAAO,CAAC,MAAM,EAAE,SAAS,CAAM,CAAC;AACzC,CAAC"}

package/dist/runtime/helpers/compact.d.ts

@@ -0,0 +1,32 @@
+/**
+ * mcp.compact — Field selection and data trimming helper
+ *
+ * Zero-roundtrip sandbox helper. Reduces large data objects to only the
+ * fields the caller cares about, truncates arrays, clips strings, and
+ * limits nesting depth. All operations are synchronous and in-process.
+ *
+ * @module runtime/helpers/compact
+ */
+export interface CompactOptions {
+    /**
+     * Dot-path field selectors to retain. Supports nested paths like
+     * 'labels.name'. If omitted, all fields are retained (only structural
+     * limits apply).
+     */
+    fields?: string[];
+    /** Maximum number of items to retain in any array. */
+    maxItems?: number;
+    /** Maximum object nesting depth (root = depth 0). */
+    maxDepth?: number;
+    /** Maximum character length for any string value. */
+    maxStringLength?: number;
+}
+/**
+ * Compact a data value by selecting fields, truncating arrays, clipping
+ * strings, and limiting nesting depth.
+ *
+ * @example
+ * const lean = compact(issues, { fields: ['id', 'title', 'labels.name'], maxItems: 20 });
+ */
+export declare function compact<T>(data: T, options?: CompactOptions): T;
+//# sourceMappingURL=compact.d.ts.map

package/dist/runtime/helpers/compact.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compact.d.ts","sourceRoot":"","sources":["../../../src/runtime/helpers/compact.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,WAAW,cAAc;IAC7B;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;IAClB,sDAAsD;IACtD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qDAAqD;IACrD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,qDAAqD;IACrD,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAuFD;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,GAAE,cAAmB,GAAG,CAAC,CAOnE"}

package/dist/runtime/helpers/compact.js

@@ -0,0 +1,93 @@
+/**
+ * mcp.compact — Field selection and data trimming helper
+ *
+ * Zero-roundtrip sandbox helper. Reduces large data objects to only the
+ * fields the caller cares about, truncates arrays, clips strings, and
+ * limits nesting depth. All operations are synchronous and in-process.
+ *
+ * @module runtime/helpers/compact
+ */
+// ─────────────────────────────────────────────────────────────────────────────
+// Internal helpers
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Parse a dot-path like "labels.name" into a nested selector tree.
+ * { labels: { name: true }, id: true }
+ */
+function buildSelectorTree(fields) {
+    const tree = {};
+    for (const field of fields) {
+        const parts = field.split('.');
+        let node = tree;
+        for (let i = 0; i < parts.length; i++) {
+            const part = parts[i] ?? '';
+            if (i === parts.length - 1) {
+                node[part] = true;
+            }
+            else {
+                if (typeof node[part] !== 'object' || node[part] === null) {
+                    node[part] = {};
+                }
+                node = node[part];
+            }
+        }
+    }
+    return tree;
+}
+function trimValue(value, selector, opts, depth) {
+    const maxDepth = opts.maxDepth ?? Infinity;
+    if (depth > maxDepth) {
+        return typeof value === 'object' && value !== null ? '[truncated]' : value;
+    }
+    if (typeof value === 'string') {
+        const max = opts.maxStringLength;
+        if (max !== undefined && value.length > max) {
+            return value.slice(0, max) + '…';
+        }
+        return value;
+    }
+    if (Array.isArray(value)) {
+        const maxItems = opts.maxItems;
+        const arr = maxItems !== undefined ? value.slice(0, maxItems) : value;
+        return arr.map((item) => trimValue(item, selector, opts, depth + 1));
+    }
+    if (typeof value === 'object' && value !== null) {
+        const obj = value;
+        const result = {};
+        if (selector && Object.keys(selector).length > 0) {
+            // Only keep selected keys
+            for (const key of Object.keys(selector)) {
+                if (Object.prototype.hasOwnProperty.call(obj, key)) {
+                    const childSelector = selector[key];
+                    const nextSelector = childSelector === true ? null : childSelector;
+                    result[key] = trimValue(obj[key], nextSelector, opts, depth + 1);
+                }
+            }
+        }
+        else {
+            // No field filter — apply structural limits only
+            for (const key of Object.keys(obj)) {
+                result[key] = trimValue(obj[key], null, opts, depth + 1);
+            }
+        }
+        return result;
+    }
+    return value;
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Public API
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Compact a data value by selecting fields, truncating arrays, clipping
+ * strings, and limiting nesting depth.
+ *
+ * @example
+ * const lean = compact(issues, { fields: ['id', 'title', 'labels.name'], maxItems: 20 });
+ */
+export function compact(data, options = {}) {
+    const selector = options.fields && options.fields.length > 0
+        ? buildSelectorTree(options.fields)
+        : null;
+    return trimValue(data, selector, options, 0);
+}
+//# sourceMappingURL=compact.js.map

package/dist/runtime/helpers/compact.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compact.js","sourceRoot":"","sources":["../../../src/runtime/helpers/compact.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAiBH,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;GAGG;AACH,SAAS,iBAAiB,CAAC,MAAgB;IACzC,MAAM,IAAI,GAA4B,EAAE,CAAC;IACzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/B,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,IAAI,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;oBAC1D,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;gBAClB,CAAC;gBACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAA4B,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAChB,KAAc,EACd,QAAwC,EACxC,IAAoB,EACpB,KAAa;IAEb,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAE3C,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;QACrB,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7E,CAAC;IAED,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC;QACjC,IAAI,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC;QACnC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,MAAM,GAAG,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACtE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAChD,MAAM,GAAG,GAAG,KAAgC,CAAC;QAC7C,MAAM,MAAM,GAA4B,EAAE,CAAC;QAE3C,IAAI,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjD,0BAA0B;YAC1B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACxC,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;oBACnD,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;oBACpC,MAAM,YAAY,GAChB,aAAa,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAE,aAAyC,CAAC;oBAC7E,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACnE,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,iDAAiD;YACjD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnC,MAAM,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,gFAAgF;AAChF,aAAa;AACb,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAI,IAAO,EAAE,UAA0B,EAAE;IAC9D,MAAM,QAAQ,GACZ,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;QACzC,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,MAAM,CAAC;QACnC,CAAC,CAAC,IAAI,CAAC;IAEX,OAAO,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAM,CAAC;AACpD,CAAC"}