@sparkleideas/embeddings 3.0.0-alpha.12-patch.25 → 3.0.0-alpha.12-patch.27

package/dist/rvf-embedding-cache.d.ts

@@ -0,0 +1,118 @@
+/**
+ * RVF Embedding Cache - Pure TypeScript Binary File Cache
+ *
+ * Replaces the sql.js-based PersistentEmbeddingCache with a lightweight
+ * pure-TS binary file format. No native dependencies required.
+ *
+ * Features:
+ * - Map-based in-memory cache with periodic flush to binary file
+ * - LRU eviction tracked via access timestamps
+ * - TTL support for cache entries
+ * - Deterministic FNV-1a text hashing for keys
+ * - Binary format: RVEC magic + entry records
+ *
+ * Binary entry format:
+ *   [4-byte key-hash][4-byte dims][dims*4 bytes float32][8-byte timestamp][8-byte access-count]
+ *
+ * @module @sparkleideas/embeddings
+ */
+/**
+ * Configuration for RVF embedding cache
+ */
+export interface RvfEmbeddingCacheConfig {
+    /** Path to the binary cache file */
+    cachePath: string;
+    /** Maximum number of entries (default: 10000) */
+    maxSize?: number;
+    /** TTL in milliseconds (default: 7 days) */
+    ttlMs?: number;
+    /** Embedding dimensions (used for validation) */
+    dimensions?: number;
+}
+/**
+ * Pure-TS binary file embedding cache with LRU eviction and TTL support.
+ *
+ * Stores embeddings as raw Float32Array bytes keyed by FNV-1a text hashes.
+ * Uses an in-memory Map with periodic flush to a compact binary file.
+ */
+export declare class RvfEmbeddingCache {
+    private readonly cachePath;
+    private readonly maxSize;
+    private readonly ttlMs;
+    private readonly dimensions;
+    private entries;
+    private textToHash;
+    private dirty;
+    private flushTimer;
+    private initialized;
+    constructor(config: RvfEmbeddingCacheConfig);
+    /**
+     * Lazily initialize the cache: load from disk if file exists, start auto-flush.
+     */
+    private ensureInitialized;
+    /**
+     * Get an embedding from the cache by text.
+     * Returns null if not found or expired.
+     */
+    get(text: string): Promise<Float32Array | null>;
+    /**
+     * Store an embedding in the cache.
+     * Triggers LRU eviction if the cache exceeds maxSize.
+     */
+    set(text: string, embedding: Float32Array): Promise<void>;
+    /**
+     * Check whether the cache contains an embedding for the given text.
+     */
+    has(text: string): Promise<boolean>;
+    /**
+     * Delete a specific entry from the cache.
+     * Returns true if the entry existed and was deleted.
+     */
+    delete(text: string): Promise<boolean>;
+    /**
+     * Clear all entries from the cache and persist the empty state.
+     */
+    clear(): Promise<void>;
+    /**
+     * Return the number of entries currently in the cache.
+     */
+    size(): Promise<number>;
+    /**
+     * Flush pending changes to disk and stop the auto-flush timer.
+     */
+    close(): Promise<void>;
+    /**
+     * FNV-1a 32-bit hash of the input text.
+     * Deterministic: same input always produces the same hash.
+     */
+    private hashText;
+    /**
+     * If the cache exceeds maxSize, evict the least-recently-accessed entries
+     * until we are back at 90% capacity.
+     */
+    private evictIfNeeded;
+    /**
+     * Remove all entries whose createdAt timestamp is older than TTL.
+     */
+    private cleanExpired;
+    private startAutoFlush;
+    private stopAutoFlush;
+    /**
+     * Write all entries to the binary cache file.
+     *
+     * Format:
+     *   [4-byte magic "RVEC"]
+     *   For each entry:
+     *     [4-byte key-hash (uint32)]
+     *     [4-byte dims (uint32)]
+     *     [dims * 4 bytes float32 data]
+     *     [8-byte createdAt (float64, used as timestamp)]
+     *     [8-byte accessCount (float64)]
+     */
+    private flushToFile;
+    /**
+     * Load entries from the binary cache file.
+     */
+    private loadFromFile;
+}
+//# sourceMappingURL=rvf-embedding-cache.d.ts.map

package/dist/rvf-embedding-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rvf-embedding-cache.d.ts","sourceRoot":"","sources":["../src/rvf-embedding-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAcH;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,oCAAoC;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,iDAAiD;IACjD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,4CAA4C;IAC5C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iDAAiD;IACjD,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAuCD;;;;;GAKG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAqB;IAEhD,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,UAAU,CAAkC;IACpD,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,UAAU,CAA+C;IACjE,OAAO,CAAC,WAAW,CAAS;gBAEhB,MAAM,EAAE,uBAAuB;IAY3C;;OAEG;YACW,iBAAiB;IA2B/B;;;OAGG;IACG,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC;IA2BrD;;;OAGG;IACG,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;IAsC/D;;OAEG;IACG,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAmBzC;;;OAGG;IACG,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAc5C;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAS5B;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,MAAM,CAAC;IAK7B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB5B;;;OAGG;IACH,OAAO,CAAC,QAAQ;IAahB;;;OAGG;IACH,OAAO,CAAC,aAAa;IA+BrB;;OAEG;IACH,OAAO,CAAC,YAAY;IA+BpB,OAAO,CAAC,cAAc;IAWtB,OAAO,CAAC,aAAa;IAWrB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,WAAW;IAsEnB;;OAEG;IACH,OAAO,CAAC,YAAY;CA0FrB"}

package/dist/rvf-embedding-cache.js

@@ -0,0 +1,458 @@
+/**
+ * RVF Embedding Cache - Pure TypeScript Binary File Cache
+ *
+ * Replaces the sql.js-based PersistentEmbeddingCache with a lightweight
+ * pure-TS binary file format. No native dependencies required.
+ *
+ * Features:
+ * - Map-based in-memory cache with periodic flush to binary file
+ * - LRU eviction tracked via access timestamps
+ * - TTL support for cache entries
+ * - Deterministic FNV-1a text hashing for keys
+ * - Binary format: RVEC magic + entry records
+ *
+ * Binary entry format:
+ *   [4-byte key-hash][4-byte dims][dims*4 bytes float32][8-byte timestamp][8-byte access-count]
+ *
+ * @module @sparkleideas/embeddings
+ */
+import { existsSync, mkdirSync, readFileSync, writeFileSync, renameSync } from 'fs';
+import { dirname } from 'path';
+/** Validate a file path is safe */
+function validatePath(p) {
+    if (p.includes('\0'))
+        throw new Error('Cache path contains null bytes');
+}
+// ============================================================================
+// Constants
+// ============================================================================
+/** Binary file magic bytes: "RVEC" */
+const MAGIC = new Uint8Array([0x52, 0x56, 0x45, 0x43]); // R V E C
+/** Default TTL: 7 days in milliseconds */
+const DEFAULT_TTL_MS = 7 * 24 * 60 * 60 * 1000;
+/** Default max entries */
+const DEFAULT_MAX_SIZE = 10000;
+/** Auto-flush interval: 30 seconds */
+const AUTO_FLUSH_INTERVAL_MS = 30000;
+/** FNV-1a offset basis (32-bit) */
+const FNV_OFFSET_BASIS = 0x811c9dc5;
+/** FNV-1a prime (32-bit) */
+const FNV_PRIME = 0x01000193;
+// ============================================================================
+// RVF Embedding Cache
+// ============================================================================
+/**
+ * Pure-TS binary file embedding cache with LRU eviction and TTL support.
+ *
+ * Stores embeddings as raw Float32Array bytes keyed by FNV-1a text hashes.
+ * Uses an in-memory Map with periodic flush to a compact binary file.
+ */
+export class RvfEmbeddingCache {
+    cachePath;
+    maxSize;
+    ttlMs;
+    dimensions;
+    entries = new Map();
+    textToHash = new Map();
+    dirty = false;
+    flushTimer = null;
+    initialized = false;
+    constructor(config) {
+        this.cachePath = config.cachePath;
+        this.maxSize = config.maxSize ?? DEFAULT_MAX_SIZE;
+        this.ttlMs = config.ttlMs ?? DEFAULT_TTL_MS;
+        this.dimensions = config.dimensions;
+        validatePath(this.cachePath);
+    }
+    // --------------------------------------------------------------------------
+    // Initialization
+    // --------------------------------------------------------------------------
+    /**
+     * Lazily initialize the cache: load from disk if file exists, start auto-flush.
+     */
+    async ensureInitialized() {
+        if (this.initialized)
+            return;
+        // Ensure parent directory exists
+        const dir = dirname(this.cachePath);
+        if (!existsSync(dir)) {
+            mkdirSync(dir, { recursive: true });
+        }
+        // Load existing cache file
+        if (existsSync(this.cachePath)) {
+            this.loadFromFile();
+        }
+        // Clean expired entries on startup
+        this.cleanExpired();
+        // Start auto-flush timer
+        this.startAutoFlush();
+        this.initialized = true;
+    }
+    // --------------------------------------------------------------------------
+    // Public API (matches PersistentEmbeddingCache)
+    // --------------------------------------------------------------------------
+    /**
+     * Get an embedding from the cache by text.
+     * Returns null if not found or expired.
+     */
+    async get(text) {
+        await this.ensureInitialized();
+        const hash = this.hashText(text);
+        const entry = this.entries.get(hash);
+        if (!entry) {
+            return null;
+        }
+        // Check TTL
+        const now = Date.now();
+        if (now - entry.createdAt > this.ttlMs) {
+            this.entries.delete(hash);
+            this.textToHash.delete(text);
+            this.dirty = true;
+            return null;
+        }
+        // Update LRU tracking
+        entry.accessedAt = now;
+        entry.accessCount++;
+        this.dirty = true;
+        return entry.embedding;
+    }
+    /**
+     * Store an embedding in the cache.
+     * Triggers LRU eviction if the cache exceeds maxSize.
+     */
+    async set(text, embedding) {
+        await this.ensureInitialized();
+        // Validate dimensions if configured
+        if (this.dimensions !== undefined && embedding.length !== this.dimensions) {
+            throw new Error(`Dimension mismatch: expected ${this.dimensions}, got ${embedding.length}`);
+        }
+        const hash = this.hashText(text);
+        const now = Date.now();
+        // Copy the embedding to avoid external mutation
+        const copy = new Float32Array(embedding.length);
+        copy.set(embedding);
+        const existing = this.entries.get(hash);
+        if (existing) {
+            existing.embedding = copy;
+            existing.accessedAt = now;
+            existing.accessCount++;
+        }
+        else {
+            this.entries.set(hash, {
+                embedding: copy,
+                createdAt: now,
+                accessedAt: now,
+                accessCount: 1,
+            });
+            this.textToHash.set(text, hash);
+        }
+        this.dirty = true;
+        // Evict if over capacity
+        this.evictIfNeeded();
+    }
+    /**
+     * Check whether the cache contains an embedding for the given text.
+     */
+    async has(text) {
+        await this.ensureInitialized();
+        const hash = this.hashText(text);
+        const entry = this.entries.get(hash);
+        if (!entry)
+            return false;
+        // Check TTL
+        if (Date.now() - entry.createdAt > this.ttlMs) {
+            this.entries.delete(hash);
+            this.textToHash.delete(text);
+            this.dirty = true;
+            return false;
+        }
+        return true;
+    }
+    /**
+     * Delete a specific entry from the cache.
+     * Returns true if the entry existed and was deleted.
+     */
+    async delete(text) {
+        await this.ensureInitialized();
+        const hash = this.hashText(text);
+        const existed = this.entries.delete(hash);
+        this.textToHash.delete(text);
+        if (existed) {
+            this.dirty = true;
+        }
+        return existed;
+    }
+    /**
+     * Clear all entries from the cache and persist the empty state.
+     */
+    async clear() {
+        await this.ensureInitialized();
+        this.entries.clear();
+        this.textToHash.clear();
+        this.dirty = true;
+        this.flushToFile();
+    }
+    /**
+     * Return the number of entries currently in the cache.
+     */
+    async size() {
+        await this.ensureInitialized();
+        return this.entries.size;
+    }
+    /**
+     * Flush pending changes to disk and stop the auto-flush timer.
+     */
+    async close() {
+        this.stopAutoFlush();
+        if (this.dirty) {
+            this.flushToFile();
+        }
+        this.entries.clear();
+        this.textToHash.clear();
+        this.initialized = false;
+    }
+    // --------------------------------------------------------------------------
+    // Hashing
+    // --------------------------------------------------------------------------
+    /**
+     * FNV-1a 32-bit hash of the input text.
+     * Deterministic: same input always produces the same hash.
+     */
+    hashText(text) {
+        let hash = FNV_OFFSET_BASIS;
+        for (let i = 0; i < text.length; i++) {
+            hash ^= text.charCodeAt(i);
+            hash = Math.imul(hash, FNV_PRIME) >>> 0;
+        }
+        return hash;
+    }
+    // --------------------------------------------------------------------------
+    // LRU Eviction
+    // --------------------------------------------------------------------------
+    /**
+     * If the cache exceeds maxSize, evict the least-recently-accessed entries
+     * until we are back at 90% capacity.
+     */
+    evictIfNeeded() {
+        if (this.entries.size <= this.maxSize)
+            return;
+        const targetSize = Math.floor(this.maxSize * 0.9);
+        const toEvict = this.entries.size - targetSize;
+        // Sort entries by accessedAt ascending (oldest first)
+        const sorted = [...this.entries.entries()].sort((a, b) => a[1].accessedAt - b[1].accessedAt);
+        // Build reverse map for O(1) lookup (hash → text)
+        const hashToText = new Map();
+        for (const [text, hash] of this.textToHash) {
+            hashToText.set(hash, text);
+        }
+        for (let i = 0; i < toEvict && i < sorted.length; i++) {
+            const [hash] = sorted[i];
+            this.entries.delete(hash);
+            const text = hashToText.get(hash);
+            if (text !== undefined)
+                this.textToHash.delete(text);
+        }
+        this.dirty = true;
+    }
+    // --------------------------------------------------------------------------
+    // TTL Cleanup
+    // --------------------------------------------------------------------------
+    /**
+     * Remove all entries whose createdAt timestamp is older than TTL.
+     */
+    cleanExpired() {
+        const cutoff = Date.now() - this.ttlMs;
+        const toDelete = [];
+        for (const [hash, entry] of this.entries) {
+            if (entry.createdAt < cutoff) {
+                toDelete.push(hash);
+            }
+        }
+        // Build reverse map for O(1) lookup
+        const hashToText = new Map();
+        for (const [text, h] of this.textToHash) {
+            hashToText.set(h, text);
+        }
+        for (const hash of toDelete) {
+            this.entries.delete(hash);
+            const text = hashToText.get(hash);
+            if (text !== undefined)
+                this.textToHash.delete(text);
+        }
+        if (toDelete.length > 0) {
+            this.dirty = true;
+        }
+    }
+    // --------------------------------------------------------------------------
+    // Auto-Flush Timer
+    // --------------------------------------------------------------------------
+    startAutoFlush() {
+        if (this.flushTimer)
+            return;
+        this.flushTimer = setInterval(() => {
+            if (this.dirty) {
+                this.flushToFile();
+            }
+        }, AUTO_FLUSH_INTERVAL_MS);
+        if (this.flushTimer.unref)
+            this.flushTimer.unref();
+    }
+    stopAutoFlush() {
+        if (this.flushTimer) {
+            clearInterval(this.flushTimer);
+            this.flushTimer = null;
+        }
+    }
+    // --------------------------------------------------------------------------
+    // Binary Serialization
+    // --------------------------------------------------------------------------
+    /**
+     * Write all entries to the binary cache file.
+     *
+     * Format:
+     *   [4-byte magic "RVEC"]
+     *   For each entry:
+     *     [4-byte key-hash (uint32)]
+     *     [4-byte dims (uint32)]
+     *     [dims * 4 bytes float32 data]
+     *     [8-byte createdAt (float64, used as timestamp)]
+     *     [8-byte accessCount (float64)]
+     */
+    flushToFile() {
+        try {
+            // Version 2 format: magic(4) + version(4) + entries...
+            // Entry: hash(4) + dims(4) + embedding(dims*4) + createdAt(8) + accessedAt(8) + accessCount(8)
+            let totalSize = MAGIC.length + 4; // magic + version uint32
+            for (const [, entry] of this.entries) {
+                totalSize += 4 + 4 + entry.embedding.length * 4 + 8 + 8 + 8;
+            }
+            const buffer = new ArrayBuffer(totalSize);
+            const view = new DataView(buffer);
+            const bytes = new Uint8Array(buffer);
+            let offset = 0;
+            // Write magic
+            bytes.set(MAGIC, 0);
+            offset += MAGIC.length;
+            // Write format version
+            view.setUint32(offset, 2, true);
+            offset += 4;
+            // Write entries
+            for (const [hash, entry] of this.entries) {
+                // Key hash (uint32, little-endian)
+                view.setUint32(offset, hash, true);
+                offset += 4;
+                // Dimensions (uint32, little-endian)
+                view.setUint32(offset, entry.embedding.length, true);
+                offset += 4;
+                // Embedding data (float32 array, little-endian)
+                for (let i = 0; i < entry.embedding.length; i++) {
+                    view.setFloat32(offset, entry.embedding[i], true);
+                    offset += 4;
+                }
+                // createdAt as float64 (little-endian) - v2: separate from accessedAt
+                view.setFloat64(offset, entry.createdAt, true);
+                offset += 8;
+                // accessedAt as float64 (little-endian)
+                view.setFloat64(offset, entry.accessedAt, true);
+                offset += 8;
+                // Access count as float64 (little-endian)
+                view.setFloat64(offset, entry.accessCount, true);
+                offset += 8;
+            }
+            // Ensure parent directory exists
+            const dir = dirname(this.cachePath);
+            if (!existsSync(dir)) {
+                mkdirSync(dir, { recursive: true });
+            }
+            const tmpSuffix = Date.now().toString(36) + Math.random().toString(36).slice(2, 8);
+            const tmpPath = this.cachePath + '.tmp.' + tmpSuffix;
+            writeFileSync(tmpPath, Buffer.from(buffer));
+            renameSync(tmpPath, this.cachePath);
+            this.dirty = false;
+        }
+        catch (error) {
+            console.error('[rvf-embedding-cache] Flush error:', error instanceof Error ? error.message : error);
+        }
+    }
+    /**
+     * Load entries from the binary cache file.
+     */
+    loadFromFile() {
+        try {
+            const fileBuffer = readFileSync(this.cachePath);
+            if (fileBuffer.length < MAGIC.length)
+                return;
+            const buffer = fileBuffer.buffer.slice(fileBuffer.byteOffset, fileBuffer.byteOffset + fileBuffer.byteLength);
+            const view = new DataView(buffer);
+            const bytes = new Uint8Array(buffer);
+            let offset = 0;
+            // Verify magic
+            for (let i = 0; i < MAGIC.length; i++) {
+                if (bytes[offset + i] !== MAGIC[i]) {
+                    console.warn('[rvf-embedding-cache] Invalid magic bytes, skipping load');
+                    return;
+                }
+            }
+            offset += MAGIC.length;
+            // Check for version header (v2+)
+            let formatVersion = 1;
+            if (offset + 4 <= buffer.byteLength) {
+                const possibleVersion = view.getUint32(offset, true);
+                if (possibleVersion === 2) {
+                    formatVersion = possibleVersion;
+                    offset += 4;
+                }
+            }
+            // Read entries
+            while (offset + 8 <= buffer.byteLength) {
+                // Need at least 4 (hash) + 4 (dims) = 8 bytes for the header
+                const hash = view.getUint32(offset, true);
+                offset += 4;
+                const dims = view.getUint32(offset, true);
+                offset += 4;
+                const entryDataSize = formatVersion === 2
+                    ? dims * 4 + 8 + 8 + 8 // v2: embedding + createdAt + accessedAt + accessCount
+                    : dims * 4 + 8 + 8; // v1: embedding + accessedAt + accessCount
+                if (offset + entryDataSize > buffer.byteLength) {
+                    console.warn('[rvf-embedding-cache] Truncated entry, stopping load');
+                    break;
+                }
+                // Read embedding
+                const embedding = new Float32Array(dims);
+                for (let i = 0; i < dims; i++) {
+                    embedding[i] = view.getFloat32(offset, true);
+                    offset += 4;
+                }
+                let createdAt;
+                let accessedAt;
+                let accessCount;
+                if (formatVersion >= 2) {
+                    createdAt = view.getFloat64(offset, true);
+                    offset += 8;
+                    accessedAt = view.getFloat64(offset, true);
+                    offset += 8;
+                    accessCount = view.getFloat64(offset, true);
+                    offset += 8;
+                }
+                else {
+                    // v1: only accessedAt was stored, use it as createdAt too
+                    accessedAt = view.getFloat64(offset, true);
+                    offset += 8;
+                    accessCount = view.getFloat64(offset, true);
+                    offset += 8;
+                    createdAt = accessedAt;
+                }
+                this.entries.set(hash, {
+                    embedding,
+                    createdAt,
+                    accessedAt,
+                    accessCount,
+                });
+            }
+        }
+        catch (error) {
+            console.warn('[rvf-embedding-cache] Load error:', error instanceof Error ? error.message : error);
+        }
+    }
+}
+//# sourceMappingURL=rvf-embedding-cache.js.map

package/dist/rvf-embedding-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rvf-embedding-cache.js","sourceRoot":"","sources":["../src/rvf-embedding-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC;AACpF,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAE/B,mCAAmC;AACnC,SAAS,YAAY,CAAC,CAAS;IAC7B,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;AAC1E,CAAC;AA+BD,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,sCAAsC;AACtC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU;AAElE,0CAA0C;AAC1C,MAAM,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC;AAE/C,0BAA0B;AAC1B,MAAM,gBAAgB,GAAG,KAAK,CAAC;AAE/B,sCAAsC;AACtC,MAAM,sBAAsB,GAAG,KAAK,CAAC;AAErC,mCAAmC;AACnC,MAAM,gBAAgB,GAAG,UAAU,CAAC;AAEpC,4BAA4B;AAC5B,MAAM,SAAS,GAAG,UAAU,CAAC;AAE7B,+EAA+E;AAC/E,sBAAsB;AACtB,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,OAAO,iBAAiB;IACX,SAAS,CAAS;IAClB,OAAO,CAAS;IAChB,KAAK,CAAS;IACd,UAAU,CAAqB;IAExC,OAAO,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC7C,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC5C,KAAK,GAAG,KAAK,CAAC;IACd,UAAU,GAA0C,IAAI,CAAC;IACzD,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,MAA+B;QACzC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,gBAAgB,CAAC;QAClD,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,cAAc,CAAC;QAC5C,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;QACpC,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC;IAED,6EAA6E;IAC7E,iBAAiB;IACjB,6EAA6E;IAE7E;;OAEG;IACK,KAAK,CAAC,iBAAiB;QAC7B,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,iCAAiC;QACjC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;QAED,2BAA2B;QAC3B,IAAI,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,CAAC;QAED,mCAAmC;QACnC,IAAI,CAAC,YAAY,EAAE,CAAC;QAEpB,yBAAyB;QACzB,IAAI,CAAC,cAAc,EAAE,CAAC;QAEtB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED,6EAA6E;IAC7E,gDAAgD;IAChD,6EAA6E;IAE7E;;;OAGG;IACH,KAAK,CAAC,GAAG,CAAC,IAAY;QACpB,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE/B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAErC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,IAAI,CAAC;QACd,CAAC;QAED,YAAY;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,sBAAsB;QACtB,KAAK,CAAC,UAAU,GAAG,GAAG,CAAC;QACvB,KAAK,CAAC,WAAW,EAAE,CAAC;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAElB,OAAO,KAAK,CAAC,SAAS,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,GAAG,CAAC,IAAY,EAAE,SAAuB;QAC7C,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE/B,oCAAoC;QACpC,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YAC1E,MAAM,IAAI,KAAK,CACb,gCAAgC,IAAI,CAAC,UAAU,SAAS,SAAS,CAAC,MAAM,EAAE,CAC3E,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,gDAAgD;QAChD,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAEpB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC;YAC1B,QAAQ,CAAC,UAAU,GAAG,GAAG,CAAC;YAC1B,QAAQ,CAAC,WAAW,EAAE,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE;gBACrB,SAAS,EAAE,IAAI;gBACf,SAAS,EAAE,GAAG;gBACd,UAAU,EAAE,GAAG;gBACf,WAAW,EAAE,CAAC;aACf,CAAC,CAAC;YACH,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAElB,yBAAyB;QACzB,IAAI,CAAC,aAAa,EAAE,CAAC;IACvB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,IAAY;QACpB,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE/B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAErC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QAEzB,YAAY;QACZ,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,CAAC,IAAY;QACvB,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE/B,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAE7B,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAE/B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,IAAI;QACR,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,aAAa,EAAE,CAAC;QAErB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED,6EAA6E;IAC7E,UAAU;IACV,6EAA6E;IAE7E;;;OAGG;IACK,QAAQ,CAAC,IAAY;QAC3B,IAAI,IAAI,GAAG,gBAAgB,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6EAA6E;IAC7E,eAAe;IACf,6EAA6E;IAE7E;;;OAGG;IACK,aAAa;QACnB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QAE9C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,UAAU,CAAC;QAE/C,sDAAsD;QACtD,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAC7C,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAC5C,CAAC;QAEF,kDAAkD;QAClD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3C,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,IAAI,KAAK,SAAS;gBAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,6EAA6E;IAC7E,cAAc;IACd,6EAA6E;IAE7E;;OAEG;IACK,YAAY;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC;QACvC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACzC,IAAI,KAAK,CAAC,SAAS,GAAG,MAAM,EAAE,CAAC;gBAC7B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,IAAI,KAAK,SAAS;gBAAE,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,mBAAmB;IACnB,6EAA6E;IAErE,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO;QAE5B,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE;YACjC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBACf,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,CAAC;QACH,CAAC,EAAE,sBAAsB,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK;YAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IACrD,CAAC;IAEO,aAAa;QACnB,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACzB,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,uBAAuB;IACvB,6EAA6E;IAE7E;;;;;;;;;;;OAWG;IACK,WAAW;QACjB,IAAI,CAAC;YACH,uDAAuD;YACvD,+FAA+F;YAC/F,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,yBAAyB;YAC3D,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACrC,SAAS,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9D,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,cAAc;YACd,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACpB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC;YAEvB,uBAAuB;YACvB,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YAChC,MAAM,IAAI,CAAC,CAAC;YAEZ,gBAAgB;YAChB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACzC,mCAAmC;gBACnC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACnC,MAAM,IAAI,CAAC,CAAC;gBAEZ,qCAAqC;gBACrC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACrD,MAAM,IAAI,CAAC,CAAC;gBAEZ,gDAAgD;gBAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAChD,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;oBAClD,MAAM,IAAI,CAAC,CAAC;gBACd,CAAC;gBAED,sEAAsE;gBACtE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;gBAC/C,MAAM,IAAI,CAAC,CAAC;gBAEZ,wCAAwC;gBACxC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;gBAChD,MAAM,IAAI,CAAC,CAAC;gBAEZ,0CAA0C;gBAC1C,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;gBACjD,MAAM,IAAI,CAAC,CAAC;YACd,CAAC;YAED,iCAAiC;YACjC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACtC,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnF,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,GAAG,OAAO,GAAG,SAAS,CAAC;YACrD,aAAa,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CACX,oCAAoC,EACpC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAC/C,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChD,IAAI,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM;gBAAE,OAAO;YAE7C,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,CACpC,UAAU,CAAC,UAAU,EACrB,UAAU,CAAC,UAAU,GAAG,UAAU,CAAC,UAAU,CAC9C,CAAC;YACF,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,eAAe;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBACnC,OAAO,CAAC,IAAI,CAAC,0DAA0D,CAAC,CAAC;oBACzE,OAAO;gBACT,CAAC;YACH,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC;YAEvB,iCAAiC;YACjC,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;gBACpC,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACrD,IAAI,eAAe,KAAK,CAAC,EAAE,CAAC;oBAC1B,aAAa,GAAG,eAAe,CAAC;oBAChC,MAAM,IAAI,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;YAED,eAAe;YACf,OAAO,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;gBACvC,6DAA6D;gBAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC1C,MAAM,IAAI,CAAC,CAAC;gBAEZ,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC1C,MAAM,IAAI,CAAC,CAAC;gBAEZ,MAAM,aAAa,GAAG,aAAa,KAAK,CAAC;oBACvC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAG,uDAAuD;oBAChF,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAO,2CAA2C;gBACvE,IAAI,MAAM,GAAG,aAAa,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;oBAC/C,OAAO,CAAC,IAAI,CAAC,sDAAsD,CAAC,CAAC;oBACrE,MAAM;gBACR,CAAC;gBAED,iBAAiB;gBACjB,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBAC7C,MAAM,IAAI,CAAC,CAAC;gBACd,CAAC;gBAED,IAAI,SAAiB,CAAC;gBACtB,IAAI,UAAkB,CAAC;gBACvB,IAAI,WAAmB,CAAC;gBAExB,IAAI,aAAa,IAAI,CAAC,EAAE,CAAC;oBACvB,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBAC1C,MAAM,IAAI,CAAC,CAAC;oBACZ,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBAC3C,MAAM,IAAI,CAAC,CAAC;oBACZ,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBAC5C,MAAM,IAAI,CAAC,CAAC;gBACd,CAAC;qBAAM,CAAC;oBACN,0DAA0D;oBAC1D,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBAC3C,MAAM,IAAI,CAAC,CAAC;oBACZ,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;oBAC5C,MAAM,IAAI,CAAC,CAAC;oBACZ,SAAS,GAAG,UAAU,CAAC;gBACzB,CAAC;gBAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE;oBACrB,SAAS;oBACT,SAAS;oBACT,UAAU;oBACV,WAAW;iBACZ,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CACV,mCAAmC,EACnC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAC/C,CAAC;QACJ,CAAC;IACH,CAAC;CACF"}

package/dist/rvf-embedding-service.d.ts

@@ -0,0 +1,79 @@
+/**
+ * RVF Embedding Service - Lightweight Hash-Based Embeddings
+ *
+ * Provides deterministic, sub-millisecond embedding generation using
+ * FNV-1a hash-based vectors. No neural model or external API required.
+ *
+ * Features:
+ * - Deterministic: same input always produces the same embedding
+ * - FNV-1a hash seeding with multi-round mixing
+ * - L2-normalized output vectors
+ * - Sub-millisecond generation (<0.1ms typical)
+ * - RvfEmbeddingCache for binary file persistence
+ * - Zero external dependencies
+ *
+ * Use cases:
+ * - Fast similarity search where relative distances matter more than semantics
+ * - Development and testing without API keys
+ * - Offline environments without neural model access
+ * - Bootstrapping before heavier providers are available
+ *
+ * @module @sparkleideas/embeddings
+ */
+import { EventEmitter } from 'events';
+import type { EmbeddingProvider, EmbeddingResult, BatchEmbeddingResult, IEmbeddingService, EmbeddingEventListener, RvfEmbeddingConfig } from './types.js';
+/**
+ * Lightweight hash-based embedding service.
+ *
+ * Generates deterministic embeddings from text using FNV-1a hashing
+ * with multi-round mixing and L2 normalization. The output is a unit
+ * vector in R^n where n = configured dimensions (default 384).
+ *
+ * Extends EventEmitter and implements IEmbeddingService for drop-in
+ * compatibility with other providers.
+ */
+export declare class RvfEmbeddingService extends EventEmitter implements IEmbeddingService {
+    readonly provider: EmbeddingProvider;
+    private readonly dimensions;
+    private readonly cache;
+    private readonly normalizationType;
+    private readonly embeddingListeners;
+    private persistentCache;
+    constructor(config: RvfEmbeddingConfig);
+    /**
+     * Generate an embedding for a single text string.
+     */
+    embed(text: string): Promise<EmbeddingResult>;
+    /**
+     * Generate embeddings for multiple text strings.
+     */
+    embedBatch(texts: string[]): Promise<BatchEmbeddingResult>;
+    clearCache(): void;
+    getCacheStats(): {
+        size: number;
+        maxSize: number;
+        hitRate: number;
+    };
+    shutdown(): Promise<void>;
+    addEventListener(listener: EmbeddingEventListener): void;
+    removeEventListener(listener: EmbeddingEventListener): void;
+    private emitEvent;
+    /**
+     * Generate a deterministic embedding from text using FNV-1a hashing.
+     *
+     * Algorithm:
+     * 1. Compute a base FNV-1a hash of the full text.
+     * 2. For each dimension, derive a unique seed by mixing the base hash
+     *    with the dimension index using the golden ratio constant.
+     * 3. Apply a sine-based pseudo-random transform to spread values.
+     * 4. L2-normalize the result to produce a unit vector.
+     *
+     * This is deterministic: the same text always yields the same vector.
+     */
+    private generateHashEmbedding;
+    /**
+     * Apply user-configured normalization if set.
+     */
+    private applyNormalization;
+}
+//# sourceMappingURL=rvf-embedding-service.d.ts.map