@seanhogg/builderforce-memory 2026.6.18

package/dist/memory/MemoryStore.js

@@ -0,0 +1,290 @@
+/**
+ * MemoryStore – persistent key-value fact store and weight checkpoint helper.
+ *
+ * Uses IndexedDB with a dedicated 'ssmjs' database containing two object stores:
+ *   - 'facts'   : MemoryEntry records keyed by the fact key string
+ *   - 'weights' : a single ArrayBuffer keyed by `weightsKey`
+ *
+ * Weight save/load is delegated to the SSMRuntime passed to saveWeights/loadWeights.
+ */
+import { SSMError } from '../errors/SSMError.js';
+import { tokenize, jaccardSimilarity, cosineSimilarity } from '../similarity/index.js';
+const FACTS_STORE = 'facts';
+const WEIGHTS_STORE = 'weights';
+const DB_VERSION = 1;
+/**
+ * Process-wide monotonic counter stamped onto each remembered entry. Strictly
+ * increasing per write regardless of store instance, so it reliably breaks
+ * `timestamp` ties (same-millisecond writes) in newest-first ordering.
+ */
+let _writeSeq = 0;
+/** Max number of cached content→embedding vectors retained in memory. */
+const EMBED_CACHE_MAX = 2000;
+export class MemoryStore {
+    _dbName;
+    _weightsKey;
+    _idb;
+    _defaultTtl;
+    _db = null;
+    /** Content → L2-normalised embedding cache, used by recallSimilar. */
+    _embedCache = new Map();
+    constructor(opts = {}) {
+        this._dbName = opts.dbName ?? 'ssmjs';
+        this._weightsKey = opts.weightsKey ?? 'ssmjs-weights';
+        this._idb = opts.idbFactory;
+        this._defaultTtl = opts.defaultTtlMs;
+    }
+    // ── Internal DB open ──────────────────────────────────────────────────────
+    _open() {
+        if (this._db)
+            return Promise.resolve(this._db);
+        return new Promise((resolve, reject) => {
+            const factory = this._idb ?? (typeof indexedDB !== 'undefined' ? indexedDB : undefined);
+            if (!factory) {
+                reject(new SSMError('MEMORY_UNAVAILABLE', 'IndexedDB is not available in this environment. Pass an idbFactory option (e.g. from fake-indexeddb) for Node.js support.'));
+                return;
+            }
+            const req = factory.open(this._dbName, DB_VERSION);
+            req.onupgradeneeded = (e) => {
+                const db = e.target.result;
+                if (!db.objectStoreNames.contains(FACTS_STORE)) {
+                    db.createObjectStore(FACTS_STORE, { keyPath: 'key' });
+                }
+                if (!db.objectStoreNames.contains(WEIGHTS_STORE)) {
+                    db.createObjectStore(WEIGHTS_STORE);
+                }
+            };
+            req.onsuccess = () => {
+                this._db = req.result;
+                resolve(req.result);
+            };
+            /* istanbul ignore next -- IDB open onerror fires only on storage faults; not reproducible with fake-indexeddb */
+            req.onerror = () => reject(new SSMError('MEMORY_UNAVAILABLE', `Failed to open IndexedDB "${this._dbName}": ${req.error?.message ?? 'unknown'}`, req.error));
+        });
+    }
+    // ── TTL helpers ───────────────────────────────────────────────────────────
+    _isExpired(entry) {
+        if (entry.ttlMs == null)
+            return false;
+        return Date.now() > entry.timestamp + entry.ttlMs;
+    }
+    // ── Semantic facts ────────────────────────────────────────────────────────
+    /** Stores or overwrites a fact. */
+    async remember(key, content, opts) {
+        const db = await this._open();
+        const entry = {
+            key,
+            content,
+            timestamp: Date.now(),
+            seq: ++_writeSeq,
+            ttlMs: opts?.ttlMs ?? this._defaultTtl,
+            type: opts?.type,
+            tags: opts?.tags,
+            importance: opts?.importance,
+        };
+        const tx = db.transaction(FACTS_STORE, 'readwrite');
+        return requestToPromise(tx.objectStore(FACTS_STORE).put(entry), `Failed to store fact "${key}"`, () => undefined);
+    }
+    /**
+     * Retrieves a fact by key.
+     * Returns `undefined` if the key does not exist or the entry has expired.
+     */
+    async recall(key) {
+        const db = await this._open();
+        const tx = db.transaction(FACTS_STORE, 'readonly');
+        return requestToPromise(tx.objectStore(FACTS_STORE).get(key), `Failed to recall fact "${key}"`, (entry) => (entry && this._isExpired(entry) ? undefined : entry));
+    }
+    /** Returns all non-expired stored facts, newest first. */
+    async recallAll() {
+        const db = await this._open();
+        const tx = db.transaction(FACTS_STORE, 'readonly');
+        return requestToPromise(tx.objectStore(FACTS_STORE).getAll(), 'Failed to recall all facts', (entries) => entries
+            .filter(e => !this._isExpired(e))
+            // Newest first; break same-millisecond ties by write sequence so
+            // ordering is deterministic (IndexedDB getAll() returns key order,
+            // which would otherwise surface same-ms writes oldest-first).
+            .sort((a, b) => b.timestamp - a.timestamp || (b.seq ?? 0) - (a.seq ?? 0)));
+    }
+    /**
+     * Returns the N most recently updated non-expired facts.
+     * Equivalent to `recallAll()` truncated to `n` entries.
+     */
+    async recallRecent(n) {
+        const all = await this.recallAll();
+        return all.slice(0, n);
+    }
+    /**
+     * Returns all non-expired entries that contain the given tag.
+     */
+    async recallByTag(tag) {
+        const all = await this.recallAll();
+        return all.filter(e => e.tags?.includes(tag) ?? false);
+    }
+    /**
+     * Finds the top-K semantically similar entries to `query`.
+     *
+     * When `runtime` exposes an `embed()` method (the SSMRuntime does), similarity
+     * is computed as cosine distance between SSM hidden-state embeddings — i.e. the
+     * memory layer uses the very model it is attached to, and recall quality
+     * improves automatically as that model is adapted/distilled. Embeddings are
+     * cached per content string to avoid recomputing across calls.
+     *
+     * If no embedding-capable runtime is provided, or embedding fails for any
+     * reason, it transparently falls back to Jaccard word-overlap similarity.
+     */
+    async recallSimilar(query, topK, runtime) {
+        const all = await this.recallAll();
+        if (all.length === 0)
+            return [];
+        // ── Preferred path: SSM-embedding cosine similarity ───────────────────
+        if (runtime != null && typeof runtime.embed === 'function') {
+            const queryVec = await this._embedWithCache(runtime, query);
+            if (queryVec) {
+                const scored = [];
+                let embeddedAll = true;
+                for (const entry of all) {
+                    const entryVec = await this._embedWithCache(runtime, entry.content);
+                    if (!entryVec) {
+                        embeddedAll = false;
+                        break;
+                    }
+                    scored.push({ entry, score: cosineSimilarity(queryVec, entryVec) });
+                }
+                if (embeddedAll) {
+                    scored.sort((a, b) => b.score - a.score);
+                    return scored.slice(0, topK).map(s => s.entry);
+                }
+            }
+            // Any failure falls through to the Jaccard path below.
+        }
+        // ── Fallback: Jaccard word-overlap similarity ─────────────────────────
+        const queryTokens = new Set(tokenize(query));
+        const scored = all.map(entry => {
+            const entryTokens = new Set(tokenize(entry.content));
+            const score = jaccardSimilarity(queryTokens, entryTokens);
+            return { entry, score };
+        });
+        scored.sort((a, b) => b.score - a.score);
+        return scored.slice(0, topK).map(s => s.entry);
+    }
+    /**
+     * Returns a cached embedding for `text`, computing it via `runtime.embed()`
+     * on a cache miss. Returns `null` (never throws) when embedding is
+     * unavailable so callers can fall back to lexical similarity.
+     */
+    async _embedWithCache(runtime, text) {
+        const cached = this._embedCache.get(text);
+        if (cached)
+            return cached;
+        try {
+            const vec = await runtime.embed(text);
+            if (vec instanceof Float32Array && vec.length > 0) {
+                // Bound cache growth — simplest eviction is a full clear.
+                if (this._embedCache.size >= EMBED_CACHE_MAX)
+                    this._embedCache.clear();
+                this._embedCache.set(text, vec);
+                return vec;
+            }
+        }
+        catch {
+            // Embedding unavailable (no GPU, destroyed runtime, etc.) — signal fallback.
+        }
+        return null;
+    }
+    /**
+     * Hard-deletes all entries whose TTL has expired.
+     * @returns The number of entries deleted.
+     */
+    async purgeExpired() {
+        const db = await this._open();
+        // Load all raw entries (including expired ones) to check each
+        const tx = db.transaction(FACTS_STORE, 'readonly');
+        const all = await requestToPromise(tx.objectStore(FACTS_STORE).getAll(), 'Failed to scan facts for purge', (r) => r);
+        const expired = all.filter(e => this._isExpired(e));
+        if (expired.length === 0)
+            return 0;
+        await Promise.all(expired.map(e => this.forget(e.key)));
+        return expired.length;
+    }
+    /** Deletes a single fact. No-op if key does not exist. */
+    async forget(key) {
+        const db = await this._open();
+        const tx = db.transaction(FACTS_STORE, 'readwrite');
+        return requestToPromise(tx.objectStore(FACTS_STORE).delete(key), `Failed to forget fact "${key}"`, () => undefined);
+    }
+    /** Deletes all facts. Does not affect saved weights. */
+    async clear() {
+        const db = await this._open();
+        const tx = db.transaction(FACTS_STORE, 'readwrite');
+        return requestToPromise(tx.objectStore(FACTS_STORE).clear(), 'Failed to clear facts', () => undefined);
+    }
+    // ── Cross-session memory merge ────────────────────────────────────────────
+    /**
+     * Returns all non-expired facts as a plain array for export.
+     * Suitable for serialisation and import into another MemoryStore instance.
+     */
+    async exportAll() {
+        return this.recallAll();
+    }
+    /**
+     * Imports entries from an external array.
+     *
+     * - `'merge'`     : only writes an entry if no existing entry with the same
+     *                   key exists, or if the incoming entry has a newer timestamp.
+     * - `'overwrite'` : writes all entries unconditionally.
+     */
+    async importAll(entries, strategy) {
+        for (const entry of entries) {
+            if (strategy === 'overwrite') {
+                await this._putRaw(entry);
+            }
+            else {
+                const existing = await this.recall(entry.key);
+                if (existing == null || entry.timestamp > existing.timestamp) {
+                    await this._putRaw(entry);
+                }
+            }
+        }
+    }
+    /** Writes a raw MemoryEntry directly (preserves original timestamp / metadata). */
+    async _putRaw(entry) {
+        const db = await this._open();
+        const tx = db.transaction(FACTS_STORE, 'readwrite');
+        return requestToPromise(tx.objectStore(FACTS_STORE).put(entry), `Failed to import fact "${entry.key}"`, () => undefined);
+    }
+    // ── Weight persistence ────────────────────────────────────────────────────
+    /**
+     * Saves SSM weights via `runtime.save()`.
+     * The weights are stored under `weightsKey` in this store's IndexedDB,
+     * separate from MambaSession's own key.
+     */
+    async saveWeights(runtime) {
+        await runtime.save({ storage: 'indexedDB', key: this._weightsKey });
+    }
+    /**
+     * Loads SSM weights via `runtime.load()`.
+     * Returns `false` when no saved weights exist under `weightsKey`.
+     */
+    async loadWeights(runtime) {
+        return runtime.load({ key: this._weightsKey });
+    }
+}
+// ── IndexedDB helper ──────────────────────────────────────────────────────────
+/**
+ * Wires an IDBRequest to a promise: resolves with `map(result)` on success,
+ * rejects with a normalised MEMORY_UNAVAILABLE error on failure. Extracted so
+ * the success/error wiring lives in one place instead of being duplicated across
+ * every store method.
+ *
+ * The onerror branch fires only on IndexedDB storage faults (quota exceeded,
+ * disk failure, corruption), which the in-memory fake-indexeddb used in tests
+ * cannot reproduce — hence the istanbul ignore on that single line.
+ */
+function requestToPromise(req, failMsg, map) {
+    return new Promise((resolve, reject) => {
+        req.onsuccess = () => resolve(map(req.result));
+        /* istanbul ignore next -- IDB storage-fault path; not reproducible with fake-indexeddb */
+        req.onerror = () => reject(new SSMError('MEMORY_UNAVAILABLE', `${failMsg}: ${req.error?.message ?? 'unknown'}`, req.error ?? undefined));
+    });
+}
+//# sourceMappingURL=MemoryStore.js.map

package/dist/memory/MemoryStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryStore.js","sourceRoot":"","sources":["../../src/memory/MemoryStore.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAqDvF,MAAM,WAAW,GAAK,OAAO,CAAC;AAC9B,MAAM,aAAa,GAAG,SAAS,CAAC;AAChC,MAAM,UAAU,GAAM,CAAC,CAAC;AAExB;;;;GAIG;AACH,IAAI,SAAS,GAAG,CAAC,CAAC;AAYlB,yEAAyE;AACzE,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,MAAM,OAAO,WAAW;IACH,OAAO,CAAc;IACrB,WAAW,CAAU;IACrB,IAAI,CAAiC;IACrC,WAAW,CAAsB;IAC1C,GAAG,GAAuB,IAAI,CAAC;IACvC,sEAAsE;IACrD,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;IAE/D,YAAY,OAA2B,EAAE;QACrC,IAAI,CAAC,OAAO,GAAO,IAAI,CAAC,MAAM,IAAQ,OAAO,CAAC;QAC9C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,IAAI,eAAe,CAAC;QACtD,IAAI,CAAC,IAAI,GAAU,IAAI,CAAC,UAAU,CAAC;QACnC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;IACzC,CAAC;IAED,6EAA6E;IAErE,KAAK;QACT,IAAI,IAAI,CAAC,GAAG;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAE/C,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACnC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACxF,IAAI,CAAC,OAAO,EAAE,CAAC;gBACX,MAAM,CAAC,IAAI,QAAQ,CACf,oBAAoB,EACpB,2HAA2H,CAC9H,CAAC,CAAC;gBACH,OAAO;YACX,CAAC;YAED,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;YAEnD,GAAG,CAAC,eAAe,GAAG,CAAC,CAAC,EAAE,EAAE;gBACxB,MAAM,EAAE,GAAI,CAAC,CAAC,MAA2B,CAAC,MAAM,CAAC;gBACjD,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC7C,EAAE,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;gBAC1D,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;oBAC/C,EAAE,CAAC,iBAAiB,CAAC,aAAa,CAAC,CAAC;gBACxC,CAAC;YACL,CAAC,CAAC;YAEF,GAAG,CAAC,SAAS,GAAG,GAAG,EAAE;gBACjB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC,CAAC;YACF,iHAAiH;YACjH,GAAG,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,QAAQ,CACnC,oBAAoB,EACpB,6BAA6B,IAAI,CAAC,OAAO,MAAM,GAAG,CAAC,KAAK,EAAE,OAAO,IAAI,SAAS,EAAE,EAChF,GAAG,CAAC,KAAK,CACZ,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IACP,CAAC;IAED,6EAA6E;IAErE,UAAU,CAAC,KAAkB;QACjC,IAAI,KAAK,CAAC,KAAK,IAAI,IAAI;YAAE,OAAO,KAAK,CAAC;QACtC,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC;IACtD,CAAC;IAED,6EAA6E;IAE7E,mCAAmC;IACnC,KAAK,CAAC,QAAQ,CAAC,GAAW,EAAE,OAAe,EAAE,IAAsB;QAC/D,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAgB;YACvB,GAAG;YACH,OAAO;YACP,SAAS,EAAI,IAAI,CAAC,GAAG,EAAE;YACvB,GAAG,EAAU,EAAE,SAAS;YACxB,KAAK,EAAQ,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,WAAW;YAC5C,IAAI,EAAS,IAAI,EAAE,IAAI;YACvB,IAAI,EAAS,IAAI,EAAE,IAAI;YACvB,UAAU,EAAG,IAAI,EAAE,UAAU;SAChC,CAAC;QAEF,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACpD,OAAO,gBAAgB,CAAC,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,yBAAyB,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;IACtH,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,CAAC,GAAW;QACpB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QACnD,OAAO,gBAAgB,CACnB,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,GAAG,CAAwC,EAC3E,0BAA0B,GAAG,GAAG,EAChC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CACnE,CAAC;IACN,CAAC;IAED,0DAA0D;IAC1D,KAAK,CAAC,SAAS;QACX,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QACnD,OAAO,gBAAgB,CACnB,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,MAAM,EAA+B,EACjE,4BAA4B,EAC5B,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACjC,iEAAiE;YACjE,mEAAmE;YACnE,8DAA8D;aAC7D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAChF,CAAC;IACN,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAC,CAAS;QACxB,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,GAAW;QACzB,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,aAAa,CAAC,KAAa,EAAE,IAAY,EAAE,OAAuB;QACpE,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEhC,yEAAyE;QACzE,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,OAAO,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;YACzD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAC5D,IAAI,QAAQ,EAAE,CAAC;gBACX,MAAM,MAAM,GAA4C,EAAE,CAAC;gBAC3D,IAAI,WAAW,GAAG,IAAI,CAAC;gBACvB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;oBACtB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;oBACpE,IAAI,CAAC,QAAQ,EAAE,CAAC;wBAAC,WAAW,GAAG,KAAK,CAAC;wBAAC,MAAM;oBAAC,CAAC;oBAC9C,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxE,CAAC;gBACD,IAAI,WAAW,EAAE,CAAC;oBACd,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;oBACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACnD,CAAC;YACL,CAAC;YACD,uDAAuD;QAC3D,CAAC;QAED,yEAAyE;QACzE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YAC3B,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YACrD,MAAM,KAAK,GAAS,iBAAiB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;YAChE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC5B,CAAC,CAAC,CAAC;QAEH,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,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,eAAe,CAAC,OAAsB,EAAE,IAAY;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,IAAI,CAAC;YACD,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACtC,IAAI,GAAG,YAAY,YAAY,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChD,0DAA0D;gBAC1D,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,IAAI,eAAe;oBAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;gBACvE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAChC,OAAO,GAAG,CAAC;YACf,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACL,6EAA6E;QACjF,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY;QACd,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9B,8DAA8D;QAC9D,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;QACnD,MAAM,GAAG,GAAG,MAAM,gBAAgB,CAC9B,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,MAAM,EAA+B,EACjE,gCAAgC,EAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CACX,CAAC;QAEF,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEnC,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,0DAA0D;IAC1D,KAAK,CAAC,MAAM,CAAC,GAAW;QACpB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACpD,OAAO,gBAAgB,CAAC,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,0BAA0B,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;IACxH,CAAC;IAED,wDAAwD;IACxD,KAAK,CAAC,KAAK;QACP,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACpD,OAAO,gBAAgB,CAAC,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,EAAE,uBAAuB,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;IAC3G,CAAC;IAED,6EAA6E;IAE7E;;;OAGG;IACH,KAAK,CAAC,SAAS;QACX,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC5B,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,SAAS,CAAC,OAAsB,EAAE,QAA+B;QACnE,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;gBAC3B,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACJ,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAC9C,IAAI,QAAQ,IAAI,IAAI,IAAI,KAAK,CAAC,SAAS,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;oBAC3D,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,mFAAmF;IAC3E,KAAK,CAAC,OAAO,CAAC,KAAkB;QACpC,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACpD,OAAO,gBAAgB,CAAC,EAAE,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,0BAA0B,KAAK,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;IAC7H,CAAC;IAED,6EAA6E;IAE7E;;;;OAIG;IACH,KAAK,CAAC,WAAW,CAAC,OAAwB;QACtC,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACxE,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,CAAC,OAAwB;QACtC,OAAO,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACnD,CAAC;CACJ;AAED,iFAAiF;AAEjF;;;;;;;;;GASG;AACH,SAAS,gBAAgB,CAAO,GAAkB,EAAE,OAAe,EAAE,GAAqB;IACtF,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACtC,GAAG,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/C,0FAA0F;QAC1F,GAAG,CAAC,OAAO,GAAG,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,QAAQ,CACnC,oBAAoB,EACpB,GAAG,OAAO,KAAK,GAAG,CAAC,KAAK,EAAE,OAAO,IAAI,SAAS,EAAE,EAChD,GAAG,CAAC,KAAK,IAAI,SAAS,CACzB,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC"}

package/dist/memory/index.d.ts

@@ -0,0 +1,3 @@
+export { MemoryStore } from './MemoryStore.js';
+export type { MemoryEntry, MemoryStoreOptions, RememberOptions, FactType } from './MemoryStore.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/memory/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/memory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,YAAY,EAAE,WAAW,EAAE,kBAAkB,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/memory/index.js

@@ -0,0 +1,2 @@
+export { MemoryStore } from './MemoryStore.js';
+//# sourceMappingURL=index.js.map

package/dist/memory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/memory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/router/InferenceRouter.d.ts

@@ -0,0 +1,92 @@
+/**
+ * InferenceRouter – decides whether a given input should be handled by the
+ * local SSM or routed to a transformer bridge.
+ *
+ * Three heuristics run in priority order (cheapest first):
+ *   1. Complexity patterns  — regex against the input string (synchronous, zero cost)
+ *   2. Input length         — char count proxy for token count (synchronous, zero cost)
+ *   3. Perplexity probe     — async SSM evaluate(); only runs when 1 & 2 are inconclusive
+ *
+ * When no bridge is available the router always returns target='ssm'.
+ */
+export type RoutingStrategy = 'auto' | 'ssm' | 'transformer';
+/**
+ * The structured result of a routing decision.
+ */
+export interface RoutingDecision {
+    /** Which model should handle this input. */
+    target: 'ssm' | 'transformer';
+    /** The primary heuristic that triggered this decision. */
+    reason: 'strategy' | 'complexity' | 'length' | 'perplexity' | 'no_bridge';
+    /** Confidence score in the range 0–1. */
+    confidence: number;
+    /** Optional human-readable explanation. */
+    details?: string;
+}
+export interface RouterContext {
+    /**
+     * Cached SSM perplexity for this input if already computed by the caller.
+     * Providing this skips the async perplexity probe in auto mode.
+     */
+    perplexity?: number;
+}
+export interface RoutingAuditEntry {
+    timestamp: number;
+    inputLength: number;
+    decision: RoutingDecision;
+    durationMs: number;
+}
+export interface InferenceRouterOptions {
+    /**
+     * Routing strategy.
+     * - 'auto'        : heuristic routing (default)
+     * - 'ssm'         : always route to SSM
+     * - 'transformer' : always route to transformer (no-op when bridge absent)
+     */
+    strategy?: RoutingStrategy;
+    /**
+     * Input character length above which auto-routing prefers the transformer.
+     * ~1200 chars ≈ 300 tokens — beyond this a large context model tends to
+     * outperform a small SSM for most tasks.
+     * Default: 1200
+     */
+    longInputThreshold?: number;
+    /**
+     * SSM perplexity above which auto-routing falls back to the transformer.
+     * High perplexity signals the model hasn't seen this topic.
+     * Default: 80
+     */
+    perplexityThreshold?: number;
+    /**
+     * Whether a transformer bridge is currently attached to the runtime.
+     * The router uses this to short-circuit to 'ssm' when no bridge is present.
+     * Set by SSMRuntime when constructing the router.
+     * Default: false
+     */
+    hasBridge?: boolean;
+    /**
+     * Callback for computing SSM perplexity, provided by SSMRuntime.
+     * Avoids a circular import between InferenceRouter and SSMRuntime.
+     * Only called in 'auto' mode as a last-resort heuristic.
+     */
+    perplexityProbe?: (text: string) => Promise<number>;
+}
+export declare class InferenceRouter {
+    private readonly _strategy;
+    private readonly _longInputThreshold;
+    private readonly _perplexityThreshold;
+    private readonly _hasBridge;
+    private readonly _perplexityProbe;
+    private readonly _auditLog;
+    constructor(opts?: InferenceRouterOptions);
+    /**
+     * Routes `input` to either SSM or transformer and returns a RoutingDecision.
+     *
+     * Always returns target='ssm' when no bridge is attached, regardless of strategy.
+     */
+    route(input: string, ctx?: RouterContext): Promise<RoutingDecision>;
+    /** Returns a copy of the in-memory routing audit log (most recent last). */
+    getAuditLog(): RoutingAuditEntry[];
+    private _decide;
+}
+//# sourceMappingURL=InferenceRouter.d.ts.map

package/dist/router/InferenceRouter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InferenceRouter.d.ts","sourceRoot":"","sources":["../../src/router/InferenceRouter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,MAAM,MAAM,eAAe,GAAG,MAAM,GAAG,KAAK,GAAG,aAAa,CAAC;AAE7D;;GAEG;AACH,MAAM,WAAW,eAAe;IAC5B,4CAA4C;IAC5C,MAAM,EAAO,KAAK,GAAG,aAAa,CAAC;IACnC,0DAA0D;IAC1D,MAAM,EAAO,UAAU,GAAG,YAAY,GAAG,QAAQ,GAAG,YAAY,GAAG,WAAW,CAAC;IAC/E,yCAAyC;IACzC,UAAU,EAAG,MAAM,CAAC;IACpB,2CAA2C;IAC3C,OAAO,CAAC,EAAK,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,aAAa;IAC1B;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,iBAAiB;IAC9B,SAAS,EAAI,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAK,eAAe,CAAC;IAC7B,UAAU,EAAG,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,sBAAsB;IACnC;;;;;OAKG;IACH,QAAQ,CAAC,EAAc,eAAe,CAAC;IAEvC;;;;;OAKG;IACH,kBAAkB,CAAC,EAAI,MAAM,CAAC;IAE9B;;;;OAIG;IACH,mBAAmB,CAAC,EAAG,MAAM,CAAC;IAE9B;;;;;OAKG;IACH,SAAS,CAAC,EAAa,OAAO,CAAC;IAE/B;;;;OAIG;IACH,eAAe,CAAC,EAAO,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;CAC5D;AAoBD,qBAAa,eAAe;IACxB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAA6B;IACvD,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAU;IAC9C,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAAS;IAC9C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAoB;IAC/C,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAsD;IACvF,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAsC;gBAEpD,IAAI,GAAE,sBAA2B;IAQ7C;;;;OAIG;IACG,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,GAAE,aAAkB,GAAG,OAAO,CAAC,eAAe,CAAC;IAmB7E,4EAA4E;IAC5E,WAAW,IAAI,iBAAiB,EAAE;YAMpB,OAAO;CAoDxB"}

package/dist/router/InferenceRouter.js

@@ -0,0 +1,113 @@
+/**
+ * InferenceRouter – decides whether a given input should be handled by the
+ * local SSM or routed to a transformer bridge.
+ *
+ * Three heuristics run in priority order (cheapest first):
+ *   1. Complexity patterns  — regex against the input string (synchronous, zero cost)
+ *   2. Input length         — char count proxy for token count (synchronous, zero cost)
+ *   3. Perplexity probe     — async SSM evaluate(); only runs when 1 & 2 are inconclusive
+ *
+ * When no bridge is available the router always returns target='ssm'.
+ */
+// ── Complexity-signal regex patterns ─────────────────────────────────────────
+// These match inputs that benefit from a larger transformer's broader knowledge.
+const COMPLEXITY_PATTERNS = [
+    /step[\s-]by[\s-]step/i,
+    /\banalyze\b|\banalyse\b/i,
+    /\bexplain\s+(why|how|in\s+detail)/i,
+    /\bcompare\b.*\band\b/i,
+    /\bcontrast\b/i,
+    /\bpros?\s+and\s+cons?\b/i,
+    /\bsummariz/i,
+    /\bwrite\s+a\s+(detailed|comprehensive|complete|full)\b/i,
+    /\bwhat\s+are\s+the\s+(key|main|top)\s+(difference|reason|factor)/i,
+];
+/** Maximum audit log entries to keep in memory. */
+const MAX_AUDIT_LOG = 500;
+export class InferenceRouter {
+    _strategy;
+    _longInputThreshold;
+    _perplexityThreshold;
+    _hasBridge;
+    _perplexityProbe;
+    _auditLog = [];
+    constructor(opts = {}) {
+        this._strategy = opts.strategy ?? 'auto';
+        this._longInputThreshold = opts.longInputThreshold ?? 1200;
+        this._perplexityThreshold = opts.perplexityThreshold ?? 80;
+        this._hasBridge = opts.hasBridge ?? false;
+        this._perplexityProbe = opts.perplexityProbe;
+    }
+    /**
+     * Routes `input` to either SSM or transformer and returns a RoutingDecision.
+     *
+     * Always returns target='ssm' when no bridge is attached, regardless of strategy.
+     */
+    async route(input, ctx = {}) {
+        const startMs = Date.now();
+        const decision = await this._decide(input, ctx);
+        const durationMs = Date.now() - startMs;
+        const auditEntry = {
+            timestamp: Date.now(),
+            inputLength: input.length,
+            decision,
+            durationMs,
+        };
+        this._auditLog.push(auditEntry);
+        if (this._auditLog.length > MAX_AUDIT_LOG) {
+            this._auditLog.shift();
+        }
+        return decision;
+    }
+    /** Returns a copy of the in-memory routing audit log (most recent last). */
+    getAuditLog() {
+        return this._auditLog.slice();
+    }
+    // ── Private routing logic ─────────────────────────────────────────────────
+    async _decide(input, ctx) {
+        // No bridge → always SSM
+        if (!this._hasBridge) {
+            return { target: 'ssm', reason: 'no_bridge', confidence: 1.0 };
+        }
+        // Fixed-strategy overrides
+        if (this._strategy === 'ssm') {
+            return { target: 'ssm', reason: 'strategy', confidence: 1.0 };
+        }
+        if (this._strategy === 'transformer') {
+            return { target: 'transformer', reason: 'strategy', confidence: 1.0 };
+        }
+        // Auto heuristics ────────────────────────────────────────────────────
+        // 1. Complexity patterns (synchronous)
+        const matchedPattern = COMPLEXITY_PATTERNS.find(p => p.test(input));
+        if (matchedPattern) {
+            return {
+                target: 'transformer',
+                reason: 'complexity',
+                confidence: 0.9,
+                details: `Matched pattern: ${matchedPattern.source}`,
+            };
+        }
+        // 2. Input length (synchronous)
+        if (input.length > this._longInputThreshold) {
+            return {
+                target: 'transformer',
+                reason: 'length',
+                confidence: 0.85,
+                details: `Input length ${input.length} exceeds threshold ${this._longInputThreshold}`,
+            };
+        }
+        // 3. Perplexity probe (async) — only if probe function provided
+        const perplexity = ctx.perplexity ??
+            (this._perplexityProbe ? await this._perplexityProbe(input) : undefined);
+        if (perplexity !== undefined && perplexity > this._perplexityThreshold) {
+            return {
+                target: 'transformer',
+                reason: 'perplexity',
+                confidence: Math.min(0.95, 0.5 + (perplexity - this._perplexityThreshold) / 200),
+                details: `SSM perplexity ${perplexity.toFixed(1)} exceeds threshold ${this._perplexityThreshold}`,
+            };
+        }
+        return { target: 'ssm', reason: 'complexity', confidence: 0.8 };
+    }
+}
+//# sourceMappingURL=InferenceRouter.js.map

package/dist/router/InferenceRouter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InferenceRouter.js","sourceRoot":"","sources":["../../src/router/InferenceRouter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAyEH,gFAAgF;AAChF,iFAAiF;AAEjF,MAAM,mBAAmB,GAAa;IAClC,uBAAuB;IACvB,0BAA0B;IAC1B,oCAAoC;IACpC,uBAAuB;IACvB,eAAe;IACf,0BAA0B;IAC1B,aAAa;IACb,yDAAyD;IACzD,mEAAmE;CACtE,CAAC;AAEF,mDAAmD;AACnD,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B,MAAM,OAAO,eAAe;IACP,SAAS,CAA6B;IACtC,mBAAmB,CAAU;IAC7B,oBAAoB,CAAS;IAC7B,UAAU,CAAoB;IAC9B,gBAAgB,CAAsD;IACtE,SAAS,GAAmC,EAAE,CAAC;IAEhE,YAAY,OAA+B,EAAE;QACzC,IAAI,CAAC,SAAS,GAAc,IAAI,CAAC,QAAQ,IAAe,MAAM,CAAC;QAC/D,IAAI,CAAC,mBAAmB,GAAI,IAAI,CAAC,kBAAkB,IAAK,IAAI,CAAC;QAC7D,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,mBAAmB,IAAI,EAAE,CAAC;QAC3D,IAAI,CAAC,UAAU,GAAa,IAAI,CAAC,SAAS,IAAc,KAAK,CAAC;QAC9D,IAAI,CAAC,gBAAgB,GAAO,IAAI,CAAC,eAAe,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAK,CAAC,KAAa,EAAE,MAAqB,EAAE;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;QAExC,MAAM,UAAU,GAAsB;YAClC,SAAS,EAAI,IAAI,CAAC,GAAG,EAAE;YACvB,WAAW,EAAE,KAAK,CAAC,MAAM;YACzB,QAAQ;YACR,UAAU;SACb,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,aAAa,EAAE,CAAC;YACxC,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QAC3B,CAAC;QAED,OAAO,QAAQ,CAAC;IACpB,CAAC;IAED,4EAA4E;IAC5E,WAAW;QACP,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC;IAED,6EAA6E;IAErE,KAAK,CAAC,OAAO,CAAC,KAAa,EAAE,GAAkB;QACnD,yBAAyB;QACzB,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACnB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QACnE,CAAC;QAED,2BAA2B;QAC3B,IAAI,IAAI,CAAC,SAAS,KAAK,KAAK,EAAE,CAAC;YAC3B,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAClE,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,KAAK,aAAa,EAAE,CAAC;YACnC,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;QAC1E,CAAC;QAED,uEAAuE;QAEvE,uCAAuC;QACvC,MAAM,cAAc,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACpE,IAAI,cAAc,EAAE,CAAC;YACjB,OAAO;gBACH,MAAM,EAAM,aAAa;gBACzB,MAAM,EAAM,YAAY;gBACxB,UAAU,EAAE,GAAG;gBACf,OAAO,EAAK,oBAAoB,cAAc,CAAC,MAAM,EAAE;aAC1D,CAAC;QACN,CAAC;QAED,gCAAgC;QAChC,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC1C,OAAO;gBACH,MAAM,EAAM,aAAa;gBACzB,MAAM,EAAM,QAAQ;gBACpB,UAAU,EAAE,IAAI;gBAChB,OAAO,EAAK,gBAAgB,KAAK,CAAC,MAAM,sBAAsB,IAAI,CAAC,mBAAmB,EAAE;aAC3F,CAAC;QACN,CAAC;QAED,gEAAgE;QAChE,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU;YAC7B,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAE7E,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;YACrE,OAAO;gBACH,MAAM,EAAM,aAAa;gBACzB,MAAM,EAAM,YAAY;gBACxB,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,GAAG,CAAC;gBAChF,OAAO,EAAK,kBAAkB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,sBAAsB,IAAI,CAAC,oBAAoB,EAAE;aACvG,CAAC;QACN,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;IACpE,CAAC;CACJ"}

package/dist/router/index.d.ts

@@ -0,0 +1,3 @@
+export { InferenceRouter } from './InferenceRouter.js';
+export type { RoutingStrategy, RoutingDecision, RouterContext, InferenceRouterOptions, RoutingAuditEntry } from './InferenceRouter.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/router/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/router/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,YAAY,EAAE,eAAe,EAAE,eAAe,EAAE,aAAa,EAAE,sBAAsB,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/router/index.js

@@ -0,0 +1,2 @@
+export { InferenceRouter } from './InferenceRouter.js';
+//# sourceMappingURL=index.js.map

package/dist/router/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/router/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC"}