agentdb 2.0.0-alpha.2 → 2.0.0-alpha.2.1

package/dist/browser/ProductQuantization.js

@@ -1,337 +0,0 @@
-/**
- * Product Quantization for Browser
- *
- * Compresses high-dimensional vectors using product quantization.
- * Achieves 4-32x memory reduction with minimal accuracy loss.
- *
- * Features:
- * - PQ8: 8 subvectors, 256 centroids each (4x compression)
- * - PQ16: 16 subvectors, 256 centroids each (8x compression)
- * - Asymmetric distance computation (ADC)
- * - K-means clustering for codebook training
- *
- * Performance:
- * - Memory: Float32 (4 bytes) → uint8 (1 byte) per subvector
- * - Speed: ~1.5x slower search vs uncompressed
- * - Accuracy: 95-99% recall@10
- */
-export class ProductQuantization {
-    config;
-    codebook = null;
-    trained = false;
-    constructor(config) {
-        this.config = {
-            dimension: config.dimension,
-            numSubvectors: config.numSubvectors,
-            numCentroids: config.numCentroids,
-            maxIterations: config.maxIterations || 50,
-            convergenceThreshold: config.convergenceThreshold || 1e-4
-        };
-        // Validate config
-        if (this.config.dimension % this.config.numSubvectors !== 0) {
-            throw new Error(`Dimension ${this.config.dimension} must be divisible by numSubvectors ${this.config.numSubvectors}`);
-        }
-    }
-    /**
-     * Train codebook using k-means on training vectors
-     */
-    async train(vectors) {
-        if (vectors.length === 0) {
-            throw new Error('Training requires at least one vector');
-        }
-        const subvectorDim = this.config.dimension / this.config.numSubvectors;
-        const centroids = [];
-        console.log(`[PQ] Training ${this.config.numSubvectors} subvectors with ${this.config.numCentroids} centroids each...`);
-        // Train each subvector independently
-        for (let s = 0; s < this.config.numSubvectors; s++) {
-            const startDim = s * subvectorDim;
-            const endDim = startDim + subvectorDim;
-            // Extract subvectors
-            const subvectors = vectors.map(v => v.slice(startDim, endDim));
-            // Run k-means
-            const subCentroids = await this.kMeans(subvectors, this.config.numCentroids);
-            centroids.push(...subCentroids);
-            if ((s + 1) % 4 === 0 || s === this.config.numSubvectors - 1) {
-                console.log(`[PQ] Trained ${s + 1}/${this.config.numSubvectors} subvectors`);
-            }
-        }
-        this.codebook = {
-            subvectorDim,
-            numSubvectors: this.config.numSubvectors,
-            numCentroids: this.config.numCentroids,
-            centroids
-        };
-        this.trained = true;
-        console.log('[PQ] Training complete');
-    }
-    /**
-     * K-means clustering for centroids
-     */
-    async kMeans(vectors, k) {
-        const dim = vectors[0].length;
-        const n = vectors.length;
-        // Initialize centroids with k-means++
-        const centroids = this.kMeansPlusPlus(vectors, k);
-        const assignments = new Uint32Array(n);
-        let prevInertia = Infinity;
-        for (let iter = 0; iter < this.config.maxIterations; iter++) {
-            // Assign vectors to nearest centroid
-            let inertia = 0;
-            for (let i = 0; i < n; i++) {
-                let minDist = Infinity;
-                let minIdx = 0;
-                for (let j = 0; j < k; j++) {
-                    const dist = this.squaredDistance(vectors[i], centroids[j]);
-                    if (dist < minDist) {
-                        minDist = dist;
-                        minIdx = j;
-                    }
-                }
-                assignments[i] = minIdx;
-                inertia += minDist;
-            }
-            // Check convergence
-            if (Math.abs(prevInertia - inertia) < this.config.convergenceThreshold) {
-                break;
-            }
-            prevInertia = inertia;
-            // Update centroids
-            const counts = new Uint32Array(k);
-            const sums = Array.from({ length: k }, () => new Float32Array(dim));
-            for (let i = 0; i < n; i++) {
-                const cluster = assignments[i];
-                counts[cluster]++;
-                for (let d = 0; d < dim; d++) {
-                    sums[cluster][d] += vectors[i][d];
-                }
-            }
-            for (let j = 0; j < k; j++) {
-                if (counts[j] > 0) {
-                    for (let d = 0; d < dim; d++) {
-                        centroids[j][d] = sums[j][d] / counts[j];
-                    }
-                }
-            }
-        }
-        return centroids;
-    }
-    /**
-     * K-means++ initialization for better centroid selection
-     */
-    kMeansPlusPlus(vectors, k) {
-        const n = vectors.length;
-        const dim = vectors[0].length;
-        const centroids = [];
-        // Choose first centroid randomly
-        const firstIdx = Math.floor(Math.random() * n);
-        centroids.push(new Float32Array(vectors[firstIdx]));
-        // Choose remaining centroids
-        for (let i = 1; i < k; i++) {
-            const distances = new Float32Array(n);
-            let sumDistances = 0;
-            // Calculate distances to nearest centroid
-            for (let j = 0; j < n; j++) {
-                let minDist = Infinity;
-                for (const centroid of centroids) {
-                    const dist = this.squaredDistance(vectors[j], centroid);
-                    minDist = Math.min(minDist, dist);
-                }
-                distances[j] = minDist;
-                sumDistances += minDist;
-            }
-            // Choose next centroid with probability proportional to distance²
-            let r = Math.random() * sumDistances;
-            for (let j = 0; j < n; j++) {
-                r -= distances[j];
-                if (r <= 0) {
-                    centroids.push(new Float32Array(vectors[j]));
-                    break;
-                }
-            }
-        }
-        return centroids;
-    }
-    /**
-     * Compress a vector using trained codebook
-     */
-    compress(vector) {
-        if (!this.trained || !this.codebook) {
-            throw new Error('Codebook must be trained before compression');
-        }
-        const codes = new Uint8Array(this.config.numSubvectors);
-        const subvectorDim = this.codebook.subvectorDim;
-        // Compute norm for later reconstruction
-        let norm = 0;
-        for (let i = 0; i < vector.length; i++) {
-            norm += vector[i] * vector[i];
-        }
-        norm = Math.sqrt(norm);
-        // Encode each subvector
-        for (let s = 0; s < this.config.numSubvectors; s++) {
-            const startDim = s * subvectorDim;
-            const subvector = vector.slice(startDim, startDim + subvectorDim);
-            // Find nearest centroid
-            let minDist = Infinity;
-            let minIdx = 0;
-            const centroidOffset = s * this.config.numCentroids;
-            for (let c = 0; c < this.config.numCentroids; c++) {
-                const centroid = this.codebook.centroids[centroidOffset + c];
-                const dist = this.squaredDistance(subvector, centroid);
-                if (dist < minDist) {
-                    minDist = dist;
-                    minIdx = c;
-                }
-            }
-            codes[s] = minIdx;
-        }
-        return { codes, norm };
-    }
-    /**
-     * Decompress a vector (approximate reconstruction)
-     */
-    decompress(compressed) {
-        if (!this.codebook) {
-            throw new Error('Codebook not available');
-        }
-        const vector = new Float32Array(this.config.dimension);
-        const subvectorDim = this.codebook.subvectorDim;
-        for (let s = 0; s < this.config.numSubvectors; s++) {
-            const code = compressed.codes[s];
-            const centroidOffset = s * this.config.numCentroids;
-            const centroid = this.codebook.centroids[centroidOffset + code];
-            const startDim = s * subvectorDim;
-            for (let d = 0; d < subvectorDim; d++) {
-                vector[startDim + d] = centroid[d];
-            }
-        }
-        return vector;
-    }
-    /**
-     * Asymmetric Distance Computation (ADC)
-     * Computes distance from query vector to compressed vector
-     */
-    asymmetricDistance(query, compressed) {
-        if (!this.codebook) {
-            throw new Error('Codebook not available');
-        }
-        let distance = 0;
-        const subvectorDim = this.codebook.subvectorDim;
-        for (let s = 0; s < this.config.numSubvectors; s++) {
-            const code = compressed.codes[s];
-            const centroidOffset = s * this.config.numCentroids;
-            const centroid = this.codebook.centroids[centroidOffset + code];
-            const startDim = s * subvectorDim;
-            const querySubvector = query.slice(startDim, startDim + subvectorDim);
-            distance += this.squaredDistance(querySubvector, centroid);
-        }
-        return Math.sqrt(distance);
-    }
-    /**
-     * Batch compression for multiple vectors
-     */
-    batchCompress(vectors) {
-        return vectors.map(v => this.compress(v));
-    }
-    /**
-     * Get memory savings
-     */
-    getCompressionRatio() {
-        // Original: dimension * 4 bytes (Float32)
-        // Compressed: numSubvectors * 1 byte (Uint8) + 4 bytes (norm)
-        const originalBytes = this.config.dimension * 4;
-        const compressedBytes = this.config.numSubvectors + 4;
-        return originalBytes / compressedBytes;
-    }
-    /**
-     * Export codebook for persistence
-     */
-    exportCodebook() {
-        if (!this.codebook) {
-            throw new Error('No codebook to export');
-        }
-        return JSON.stringify({
-            config: this.config,
-            codebook: {
-                subvectorDim: this.codebook.subvectorDim,
-                numSubvectors: this.codebook.numSubvectors,
-                numCentroids: this.codebook.numCentroids,
-                centroids: this.codebook.centroids.map(c => Array.from(c))
-            }
-        });
-    }
-    /**
-     * Import codebook
-     */
-    importCodebook(json) {
-        const data = JSON.parse(json);
-        this.config = data.config;
-        this.codebook = {
-            subvectorDim: data.codebook.subvectorDim,
-            numSubvectors: data.codebook.numSubvectors,
-            numCentroids: data.codebook.numCentroids,
-            centroids: data.codebook.centroids.map((c) => new Float32Array(c))
-        };
-        this.trained = true;
-    }
-    /**
-     * Utility: Squared Euclidean distance
-     */
-    squaredDistance(a, b) {
-        let sum = 0;
-        for (let i = 0; i < a.length; i++) {
-            const diff = a[i] - b[i];
-            sum += diff * diff;
-        }
-        return sum;
-    }
-    /**
-     * Get statistics
-     */
-    getStats() {
-        const compressionRatio = this.getCompressionRatio();
-        const memoryPerVector = this.config.numSubvectors + 4; // codes + norm
-        const codebookSize = this.codebook
-            ? this.config.numSubvectors * this.config.numCentroids * (this.config.dimension / this.config.numSubvectors) * 4
-            : 0;
-        return {
-            trained: this.trained,
-            compressionRatio,
-            memoryPerVector,
-            codebookSize
-        };
-    }
-}
-/**
- * Helper function to create PQ8 (8 subvectors, 4x compression)
- */
-export function createPQ8(dimension) {
-    return new ProductQuantization({
-        dimension,
-        numSubvectors: 8,
-        numCentroids: 256,
-        maxIterations: 50
-    });
-}
-/**
- * Helper function to create PQ16 (16 subvectors, 8x compression)
- */
-export function createPQ16(dimension) {
-    return new ProductQuantization({
-        dimension,
-        numSubvectors: 16,
-        numCentroids: 256,
-        maxIterations: 50
-    });
-}
-/**
- * Helper function to create PQ32 (32 subvectors, 16x compression)
- */
-export function createPQ32(dimension) {
-    return new ProductQuantization({
-        dimension,
-        numSubvectors: 32,
-        numCentroids: 256,
-        maxIterations: 50
-    });
-}
-//# sourceMappingURL=ProductQuantization.js.map

package/dist/browser/ProductQuantization.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ProductQuantization.js","sourceRoot":"","sources":["../../src/browser/ProductQuantization.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAsBH,MAAM,OAAO,mBAAmB;IACtB,MAAM,CAAqB;IAC3B,QAAQ,GAAsB,IAAI,CAAC;IACnC,OAAO,GAAG,KAAK,CAAC;IAExB,YAAY,MAAgB;QAC1B,IAAI,CAAC,MAAM,GAAG;YACZ,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,aAAa,EAAE,MAAM,CAAC,aAAa;YACnC,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,aAAa,EAAE,MAAM,CAAC,aAAa,IAAI,EAAE;YACzC,oBAAoB,EAAE,MAAM,CAAC,oBAAoB,IAAI,IAAI;SAC1D,CAAC;QAEF,kBAAkB;QAClB,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;YAC5D,MAAM,IAAI,KAAK,CAAC,aAAa,IAAI,CAAC,MAAM,CAAC,SAAS,uCAAuC,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC;QACxH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,OAAuB;QACjC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;QACvE,MAAM,SAAS,GAAmB,EAAE,CAAC;QAErC,OAAO,CAAC,GAAG,CAAC,iBAAiB,IAAI,CAAC,MAAM,CAAC,aAAa,oBAAoB,IAAI,CAAC,MAAM,CAAC,YAAY,oBAAoB,CAAC,CAAC;QAExH,qCAAqC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,CAAC,GAAG,YAAY,CAAC;YAClC,MAAM,MAAM,GAAG,QAAQ,GAAG,YAAY,CAAC;YAEvC,qBAAqB;YACrB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;YAE/D,cAAc;YACd,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAC7E,SAAS,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;YAEhC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;gBAC7D,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,aAAa,CAAC,CAAC;YAC/E,CAAC;QACH,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG;YACd,YAAY;YACZ,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,aAAa;YACxC,YAAY,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY;YACtC,SAAS;SACV,CAAC;QAEF,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,OAAO,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,MAAM,CAAC,OAAuB,EAAE,CAAS;QACrD,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QAEzB,sCAAsC;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QACvC,IAAI,WAAW,GAAG,QAAQ,CAAC;QAE3B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YAC5D,qCAAqC;YACrC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,OAAO,GAAG,QAAQ,CAAC;gBACvB,IAAI,MAAM,GAAG,CAAC,CAAC;gBAEf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC5D,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;wBACnB,OAAO,GAAG,IAAI,CAAC;wBACf,MAAM,GAAG,CAAC,CAAC;oBACb,CAAC;gBACH,CAAC;gBAED,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;gBACxB,OAAO,IAAI,OAAO,CAAC;YACrB,CAAC;YAED,oBAAoB;YACpB,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;gBACvE,MAAM;YACR,CAAC;YACD,WAAW,GAAG,OAAO,CAAC;YAEtB,mBAAmB;YACnB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAEpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;gBAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;YAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC7B,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;oBAC3C,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,OAAuB,EAAE,CAAS;QACvD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC9B,MAAM,SAAS,GAAmB,EAAE,CAAC;QAErC,iCAAiC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/C,SAAS,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEpD,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,YAAY,GAAG,CAAC,CAAC;YAErB,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,OAAO,GAAG,QAAQ,CAAC;gBACvB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACxD,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBACpC,CAAC;gBACD,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;gBACvB,YAAY,IAAI,OAAO,CAAC;YAC1B,CAAC;YAED,kEAAkE;YAClE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,YAAY,CAAC;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACX,SAAS,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7C,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,MAAoB;QAC3B,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QACjE,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACxD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC;QAEhD,wCAAwC;QACxC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEvB,wBAAwB;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,CAAC,GAAG,YAAY,CAAC;YAClC,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC;YAElE,wBAAwB;YACxB,IAAI,OAAO,GAAG,QAAQ,CAAC;YACvB,IAAI,MAAM,GAAG,CAAC,CAAC;YAEf,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;gBAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;gBACvD,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM,GAAG,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;YAED,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACpB,CAAC;QAED,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAA4B;QACrC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC5C,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;YACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,cAAc,GAAG,IAAI,CAAC,CAAC;YAEhE,MAAM,QAAQ,GAAG,CAAC,GAAG,YAAY,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,KAAmB,EAAE,UAA4B;QAClE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC5C,CAAC;QAED,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC;QAEhD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC;YACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,cAAc,GAAG,IAAI,CAAC,CAAC;YAEhE,MAAM,QAAQ,GAAG,CAAC,GAAG,YAAY,CAAC;YAClC,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,GAAG,YAAY,CAAC,CAAC;YAEtE,QAAQ,IAAI,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QAC7D,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,OAAuB;QACnC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,mBAAmB;QACjB,0CAA0C;QAC1C,8DAA8D;QAC9D,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC,CAAC;QAChD,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC;QACtD,OAAO,aAAa,GAAG,eAAe,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO,IAAI,CAAC,SAAS,CAAC;YACpB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,QAAQ,EAAE;gBACR,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,YAAY;gBACxC,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,aAAa;gBAC1C,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,YAAY;gBACxC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aAC3D;SACF,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,IAAY;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,QAAQ,GAAG;YACd,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,YAAY;YACxC,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,aAAa;YAC1C,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,YAAY;YACxC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAW,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;SAC7E,CAAC;QACF,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,CAAe,EAAE,CAAe;QACtD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,MAAM,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACpD,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,eAAe;QACtE,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ;YAChC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC;YAChH,CAAC,CAAC,CAAC,CAAC;QAEN,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,gBAAgB;YAChB,eAAe;YACf,YAAY;SACb,CAAC;IACJ,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,OAAO,IAAI,mBAAmB,CAAC;QAC7B,SAAS;QACT,aAAa,EAAE,CAAC;QAChB,YAAY,EAAE,GAAG;QACjB,aAAa,EAAE,EAAE;KAClB,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,SAAiB;IAC1C,OAAO,IAAI,mBAAmB,CAAC;QAC7B,SAAS;QACT,aAAa,EAAE,EAAE;QACjB,YAAY,EAAE,GAAG;QACjB,aAAa,EAAE,EAAE;KAClB,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,SAAiB;IAC1C,OAAO,IAAI,mBAAmB,CAAC;QAC7B,SAAS;QACT,aAAa,EAAE,EAAE;QACjB,YAAY,EAAE,GAAG;QACjB,aAAa,EAAE,EAAE;KAClB,CAAC,CAAC;AACL,CAAC"}

package/dist/browser/browser/AdvancedFeatures.d.ts

@@ -1,144 +0,0 @@
-/**
- * Advanced Features for AgentDB Browser
- *
- * Includes:
- * - GNN (Graph Neural Networks) - Graph attention and message passing
- * - MMR (Maximal Marginal Relevance) - Diversity ranking
- * - SVD (Singular Value Decomposition) - Tensor compression
- * - Batch operations and utilities
- */
-export interface GNNNode {
-    id: number;
-    features: Float32Array;
-    neighbors: number[];
-}
-export interface GNNEdge {
-    from: number;
-    to: number;
-    weight: number;
-}
-export interface GNNConfig {
-    hiddenDim: number;
-    numHeads: number;
-    dropout: number;
-    learningRate: number;
-    attentionType: 'gat' | 'gcn' | 'sage';
-}
-/**
- * Graph Neural Network with attention mechanism
- */
-export declare class GraphNeuralNetwork {
-    private config;
-    private nodes;
-    private edges;
-    private attentionWeights;
-    constructor(config?: Partial<GNNConfig>);
-    /**
-     * Add node to graph
-     */
-    addNode(id: number, features: Float32Array): void;
-    /**
-     * Add edge to graph
-     */
-    addEdge(from: number, to: number, weight?: number): void;
-    /**
-     * Graph Attention Network (GAT) message passing
-     */
-    graphAttention(nodeId: number): Float32Array;
-    /**
-     * Compute attention score between two nodes
-     */
-    private computeAttentionScore;
-    /**
-     * Message passing for all nodes
-     */
-    messagePass(): Map<number, Float32Array>;
-    /**
-     * Update node features after message passing
-     */
-    update(newFeatures: Map<number, Float32Array>): void;
-    /**
-     * Compute graph embeddings for query enhancement
-     */
-    computeGraphEmbedding(nodeId: number, hops?: number): Float32Array;
-    /**
-     * Get statistics
-     */
-    getStats(): {
-        numNodes: number;
-        numEdges: number;
-        avgDegree: number;
-        config: GNNConfig;
-    };
-}
-export interface MMRConfig {
-    lambda: number;
-    metric: 'cosine' | 'euclidean';
-}
-/**
- * Maximal Marginal Relevance for diversity ranking
- */
-export declare class MaximalMarginalRelevance {
-    private config;
-    constructor(config?: Partial<MMRConfig>);
-    /**
-     * Rerank results for diversity
-     * @param query Query vector
-     * @param candidates Candidate vectors with scores
-     * @param k Number of results to return
-     * @returns Reranked indices
-     */
-    rerank(query: Float32Array, candidates: Array<{
-        id: number;
-        vector: Float32Array;
-        score: number;
-    }>, k: number): number[];
-    /**
-     * Similarity computation
-     */
-    private similarity;
-    private cosineSimilarity;
-    private euclideanDistance;
-    /**
-     * Set lambda (relevance vs diversity trade-off)
-     */
-    setLambda(lambda: number): void;
-}
-/**
- * Simple SVD implementation for dimension reduction
- */
-export declare class TensorCompression {
-    /**
-     * Reduce dimensionality using truncated SVD
-     * @param vectors Array of vectors to compress
-     * @param targetDim Target dimension
-     * @returns Compressed vectors
-     */
-    static compress(vectors: Float32Array[], targetDim: number): Float32Array[];
-    /**
-     * Compute mean vector
-     */
-    private static computeMean;
-    /**
-     * Compute covariance matrix
-     */
-    private static computeCovariance;
-    /**
-     * Power iteration for computing top eigenvectors
-     */
-    private static powerIteration;
-}
-/**
- * Efficient batch processing utilities
- */
-export declare class BatchProcessor {
-    /**
-     * Batch cosine similarity computation
-     */
-    static batchCosineSimilarity(query: Float32Array, vectors: Float32Array[]): Float32Array;
-    /**
-     * Batch vector normalization
-     */
-    static batchNormalize(vectors: Float32Array[]): Float32Array[];
-}
-//# sourceMappingURL=AdvancedFeatures.d.ts.map

package/dist/browser/browser/AdvancedFeatures.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"AdvancedFeatures.d.ts","sourceRoot":"","sources":["../../../src/browser/AdvancedFeatures.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAMH,MAAM,WAAW,OAAO;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,YAAY,CAAC;IACvB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,SAAS;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;CACvC;AAED;;GAEG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,MAAM,CAAY;IAC1B,OAAO,CAAC,KAAK,CAAmC;IAChD,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,gBAAgB,CAAkC;gBAE9C,MAAM,GAAE,OAAO,CAAC,SAAS,CAAM;IAU3C;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,YAAY,GAAG,IAAI;IAQjD;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,GAAE,MAAY,GAAG,IAAI;IAe7D;;OAEG;IACH,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IA0D5C;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAiB7B;;OAEG;IACH,WAAW,IAAI,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC;IAUxC;;OAEG;IACH,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,GAAG,IAAI;IASpD;;OAEG;IACH,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,GAAE,MAAU,GAAG,YAAY;IAarE;;OAEG;IACH,QAAQ;;;;;;CAQT;AAMD,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,QAAQ,GAAG,WAAW,CAAC;CAChC;AAED;;GAEG;AACH,qBAAa,wBAAwB;IACnC,OAAO,CAAC,MAAM,CAAY;gBAEd,MAAM,GAAE,OAAO,CAAC,SAAS,CAAM;IAO3C;;;;;;OAMG;IACH,MAAM,CACJ,KAAK,EAAE,YAAY,EACnB,UAAU,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,YAAY,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,EACtE,CAAC,EAAE,MAAM,GACR,MAAM,EAAE;IA6DX;;OAEG;IACH,OAAO,CAAC,UAAU;IAUlB,OAAO,CAAC,gBAAgB;IAcxB,OAAO,CAAC,iBAAiB;IASzB;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAGhC;AAMD;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;;;OAKG;IACH,MAAM,CAAC,QAAQ,CACb,OAAO,EAAE,YAAY,EAAE,EACvB,SAAS,EAAE,MAAM,GAChB,YAAY,EAAE;IAqCjB;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAc1B;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAoBhC;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;CAkD9B;AAMD;;GAEG;AACH,qBAAa,cAAc;IACzB;;OAEG;IACH,MAAM,CAAC,qBAAqB,CAC1B,KAAK,EAAE,YAAY,EACnB,OAAO,EAAE,YAAY,EAAE,GACtB,YAAY;IA4Bf;;OAEG;IACH,MAAM,CAAC,cAAc,CAAC,OAAO,EAAE,YAAY,EAAE,GAAG,YAAY,EAAE;CAe/D"}