agentdb 1.0.0

package/dist/quantization/product-quantization.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Product Quantization (PQ) for 4-32x vector compression
+ *
+ * Reduces storage requirements while maintaining 95%+ search accuracy.
+ * Splits vectors into subvectors and quantizes each independently.
+ *
+ * @example
+ * ```typescript
+ * const pq = new ProductQuantizer({ dimensions: 768, subvectors: 8, bits: 8 });
+ * await pq.train(trainingVectors); // Train codebooks
+ *
+ * // Compress vectors (768 floats → 8 bytes = 96x reduction)
+ * const codes = pq.encode(vector);
+ *
+ * // Decompress for similarity search
+ * const approximation = pq.decode(codes);
+ * ```
+ */
+export interface ProductQuantizerConfig {
+    /** Vector dimensions (e.g., 768 for many embeddings) */
+    dimensions: number;
+    /** Number of subvectors (typically 4-16) */
+    subvectors: number;
+    /** Bits per subvector (typically 8 = 256 centroids) */
+    bits: number;
+    /** K-means iterations for training (default: 20) */
+    kmeansIterations?: number;
+    /** Enable compression statistics (default: true) */
+    enableStats?: boolean;
+}
+export interface CompressionStats {
+    originalSize: number;
+    compressedSize: number;
+    compressionRatio: number;
+    encodeCount: number;
+    decodeCount: number;
+    avgEncodeTime: number;
+    avgDecodeTime: number;
+}
+interface Codebook {
+    centroids: number[][];
+}
+export declare class ProductQuantizer {
+    private config;
+    private codebooks;
+    private subvectorDim;
+    private trained;
+    private stats;
+    constructor(config: ProductQuantizerConfig);
+    /**
+     * Train codebooks using k-means clustering on training vectors
+     */
+    train(trainingVectors: number[][]): Promise<void>;
+    /**
+     * Extract subvectors for a specific segment
+     */
+    private extractSubvectors;
+    /**
+     * Train k-means clustering to create centroids
+     */
+    private trainKMeans;
+    /**
+     * Encode vector into quantized codes
+     */
+    encode(vector: number[]): Uint8Array;
+    /**
+     * Decode quantized codes back to approximate vector
+     */
+    decode(codes: Uint8Array): number[];
+    /**
+     * Compute asymmetric distance for faster search
+     * Compare query vector directly with quantized database vectors
+     */
+    asymmetricDistance(query: number[], codes: Uint8Array): number;
+    /**
+     * Euclidean distance between two vectors
+     */
+    private euclideanDistance;
+    /**
+     * Squared Euclidean distance (faster, no sqrt)
+     */
+    private euclideanDistanceSquared;
+    /**
+     * Get compression statistics
+     */
+    getStats(): CompressionStats;
+    /**
+     * Reset statistics
+     */
+    resetStats(): void;
+    /**
+     * Check if quantizer is trained
+     */
+    isTrained(): boolean;
+    /**
+     * Export codebooks for persistence
+     */
+    exportCodebooks(): Codebook[];
+    /**
+     * Import codebooks from persistence
+     */
+    importCodebooks(codebooks: Codebook[]): void;
+    /**
+     * Get configuration
+     */
+    getConfig(): Required<ProductQuantizerConfig>;
+}
+export {};
+//# sourceMappingURL=product-quantization.d.ts.map

package/dist/quantization/product-quantization.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"product-quantization.d.ts","sourceRoot":"","sources":["../../src/quantization/product-quantization.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,MAAM,WAAW,sBAAsB;IACrC,wDAAwD;IACxD,UAAU,EAAE,MAAM,CAAC;IACnB,4CAA4C;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,IAAI,EAAE,MAAM,CAAC;IACb,oDAAoD;IACpD,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,oDAAoD;IACpD,WAAW,CAAC,EAAE,OAAO,CAAC;CACvB;AAED,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,UAAU,QAAQ;IAChB,SAAS,EAAE,MAAM,EAAE,EAAE,CAAC;CACvB;AAED,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,MAAM,CAAmC;IACjD,OAAO,CAAC,SAAS,CAAkB;IACnC,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,OAAO,CAAkB;IAGjC,OAAO,CAAC,KAAK,CAKX;gBAEU,MAAM,EAAE,sBAAsB;IAkB1C;;OAEG;IACG,KAAK,CAAC,eAAe,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAkBvD;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAMzB;;OAEG;IACH,OAAO,CAAC,WAAW;IAkEnB;;OAEG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,UAAU;IAyCpC;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,EAAE;IA2BnC;;;OAGG;IACH,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM;IAqB9D;;OAEG;IACH,OAAO,CAAC,iBAAiB;IAIzB;;OAEG;IACH,OAAO,CAAC,wBAAwB;IAShC;;OAEG;IACH,QAAQ,IAAI,gBAAgB;IAmB5B;;OAEG;IACH,UAAU,IAAI,IAAI;IASlB;;OAEG;IACH,SAAS,IAAI,OAAO;IAIpB;;OAEG;IACH,eAAe,IAAI,QAAQ,EAAE;IAM7B;;OAEG;IACH,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI;IAa5C;;OAEG;IACH,SAAS,IAAI,QAAQ,CAAC,sBAAsB,CAAC;CAG9C"}

package/dist/quantization/product-quantization.js

@@ -0,0 +1,287 @@
+"use strict";
+/**
+ * Product Quantization (PQ) for 4-32x vector compression
+ *
+ * Reduces storage requirements while maintaining 95%+ search accuracy.
+ * Splits vectors into subvectors and quantizes each independently.
+ *
+ * @example
+ * ```typescript
+ * const pq = new ProductQuantizer({ dimensions: 768, subvectors: 8, bits: 8 });
+ * await pq.train(trainingVectors); // Train codebooks
+ *
+ * // Compress vectors (768 floats → 8 bytes = 96x reduction)
+ * const codes = pq.encode(vector);
+ *
+ * // Decompress for similarity search
+ * const approximation = pq.decode(codes);
+ * ```
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ProductQuantizer = void 0;
+class ProductQuantizer {
+    constructor(config) {
+        this.codebooks = [];
+        this.trained = false;
+        // Statistics
+        this.stats = {
+            encodeCount: 0,
+            decodeCount: 0,
+            totalEncodeTime: 0,
+            totalDecodeTime: 0
+        };
+        this.config = {
+            dimensions: config.dimensions,
+            subvectors: config.subvectors,
+            bits: config.bits,
+            kmeansIterations: config.kmeansIterations ?? 20,
+            enableStats: config.enableStats ?? true
+        };
+        if (config.dimensions % config.subvectors !== 0) {
+            throw new Error(`Dimensions (${config.dimensions}) must be divisible by subvectors (${config.subvectors})`);
+        }
+        this.subvectorDim = config.dimensions / config.subvectors;
+    }
+    /**
+     * Train codebooks using k-means clustering on training vectors
+     */
+    async train(trainingVectors) {
+        if (trainingVectors.length === 0) {
+            throw new Error('Training vectors cannot be empty');
+        }
+        const numCentroids = Math.pow(2, this.config.bits);
+        this.codebooks = [];
+        // Train one codebook per subvector
+        for (let m = 0; m < this.config.subvectors; m++) {
+            const subvectors = this.extractSubvectors(trainingVectors, m);
+            const centroids = this.trainKMeans(subvectors, numCentroids);
+            this.codebooks.push({ centroids });
+        }
+        this.trained = true;
+    }
+    /**
+     * Extract subvectors for a specific segment
+     */
+    extractSubvectors(vectors, segmentIndex) {
+        const start = segmentIndex * this.subvectorDim;
+        const end = start + this.subvectorDim;
+        return vectors.map(v => v.slice(start, end));
+    }
+    /**
+     * Train k-means clustering to create centroids
+     */
+    trainKMeans(vectors, k) {
+        const n = vectors.length;
+        const d = vectors[0].length;
+        // Initialize centroids randomly
+        const centroids = [];
+        const indices = new Set();
+        while (centroids.length < Math.min(k, n)) {
+            const idx = Math.floor(Math.random() * n);
+            if (!indices.has(idx)) {
+                centroids.push([...vectors[idx]]);
+                indices.add(idx);
+            }
+        }
+        // K-means iterations
+        for (let iter = 0; iter < this.config.kmeansIterations; iter++) {
+            // Assignment step
+            const assignments = new Array(n).fill(0);
+            for (let i = 0; i < n; i++) {
+                let minDist = Infinity;
+                let bestCluster = 0;
+                for (let c = 0; c < centroids.length; c++) {
+                    const dist = this.euclideanDistance(vectors[i], centroids[c]);
+                    if (dist < minDist) {
+                        minDist = dist;
+                        bestCluster = c;
+                    }
+                }
+                assignments[i] = bestCluster;
+            }
+            // Update step
+            const clusterSums = Array(centroids.length)
+                .fill(0)
+                .map(() => Array(d).fill(0));
+            const clusterCounts = Array(centroids.length).fill(0);
+            for (let i = 0; i < n; i++) {
+                const cluster = assignments[i];
+                clusterCounts[cluster]++;
+                for (let j = 0; j < d; j++) {
+                    clusterSums[cluster][j] += vectors[i][j];
+                }
+            }
+            // Update centroids
+            for (let c = 0; c < centroids.length; c++) {
+                if (clusterCounts[c] > 0) {
+                    for (let j = 0; j < d; j++) {
+                        centroids[c][j] = clusterSums[c][j] / clusterCounts[c];
+                    }
+                }
+            }
+        }
+        // Fill remaining centroids if k > n
+        while (centroids.length < k) {
+            centroids.push(Array(d).fill(0));
+        }
+        return centroids;
+    }
+    /**
+     * Encode vector into quantized codes
+     */
+    encode(vector) {
+        if (!this.trained) {
+            throw new Error('Quantizer must be trained before encoding');
+        }
+        if (vector.length !== this.config.dimensions) {
+            throw new Error(`Vector dimension (${vector.length}) does not match config (${this.config.dimensions})`);
+        }
+        const startTime = performance.now();
+        const codes = new Uint8Array(this.config.subvectors);
+        for (let m = 0; m < this.config.subvectors; m++) {
+            const start = m * this.subvectorDim;
+            const end = start + this.subvectorDim;
+            const subvector = vector.slice(start, end);
+            // Find nearest centroid
+            let minDist = Infinity;
+            let bestCode = 0;
+            for (let c = 0; c < this.codebooks[m].centroids.length; c++) {
+                const dist = this.euclideanDistance(subvector, this.codebooks[m].centroids[c]);
+                if (dist < minDist) {
+                    minDist = dist;
+                    bestCode = c;
+                }
+            }
+            codes[m] = bestCode;
+        }
+        if (this.config.enableStats) {
+            this.stats.encodeCount++;
+            this.stats.totalEncodeTime += performance.now() - startTime;
+        }
+        return codes;
+    }
+    /**
+     * Decode quantized codes back to approximate vector
+     */
+    decode(codes) {
+        if (!this.trained) {
+            throw new Error('Quantizer must be trained before decoding');
+        }
+        if (codes.length !== this.config.subvectors) {
+            throw new Error(`Code length (${codes.length}) does not match subvectors (${this.config.subvectors})`);
+        }
+        const startTime = performance.now();
+        const vector = [];
+        for (let m = 0; m < this.config.subvectors; m++) {
+            const code = codes[m];
+            const centroid = this.codebooks[m].centroids[code];
+            vector.push(...centroid);
+        }
+        if (this.config.enableStats) {
+            this.stats.decodeCount++;
+            this.stats.totalDecodeTime += performance.now() - startTime;
+        }
+        return vector;
+    }
+    /**
+     * Compute asymmetric distance for faster search
+     * Compare query vector directly with quantized database vectors
+     */
+    asymmetricDistance(query, codes) {
+        if (!this.trained) {
+            throw new Error('Quantizer must be trained before computing distances');
+        }
+        let distance = 0;
+        for (let m = 0; m < this.config.subvectors; m++) {
+            const start = m * this.subvectorDim;
+            const end = start + this.subvectorDim;
+            const querySubvector = query.slice(start, end);
+            const code = codes[m];
+            const centroid = this.codebooks[m].centroids[code];
+            distance += this.euclideanDistanceSquared(querySubvector, centroid);
+        }
+        return Math.sqrt(distance);
+    }
+    /**
+     * Euclidean distance between two vectors
+     */
+    euclideanDistance(a, b) {
+        return Math.sqrt(this.euclideanDistanceSquared(a, b));
+    }
+    /**
+     * Squared Euclidean distance (faster, no sqrt)
+     */
+    euclideanDistanceSquared(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 compression statistics
+     */
+    getStats() {
+        const originalSize = this.config.dimensions * 4; // 4 bytes per float32
+        const compressedSize = this.config.subvectors; // 1 byte per subvector
+        return {
+            originalSize,
+            compressedSize,
+            compressionRatio: originalSize / compressedSize,
+            encodeCount: this.stats.encodeCount,
+            decodeCount: this.stats.decodeCount,
+            avgEncodeTime: this.stats.encodeCount > 0
+                ? this.stats.totalEncodeTime / this.stats.encodeCount
+                : 0,
+            avgDecodeTime: this.stats.decodeCount > 0
+                ? this.stats.totalDecodeTime / this.stats.decodeCount
+                : 0
+        };
+    }
+    /**
+     * Reset statistics
+     */
+    resetStats() {
+        this.stats = {
+            encodeCount: 0,
+            decodeCount: 0,
+            totalEncodeTime: 0,
+            totalDecodeTime: 0
+        };
+    }
+    /**
+     * Check if quantizer is trained
+     */
+    isTrained() {
+        return this.trained;
+    }
+    /**
+     * Export codebooks for persistence
+     */
+    exportCodebooks() {
+        return this.codebooks.map(cb => ({
+            centroids: cb.centroids.map(c => [...c])
+        }));
+    }
+    /**
+     * Import codebooks from persistence
+     */
+    importCodebooks(codebooks) {
+        if (codebooks.length !== this.config.subvectors) {
+            throw new Error(`Codebook count (${codebooks.length}) does not match subvectors (${this.config.subvectors})`);
+        }
+        this.codebooks = codebooks.map(cb => ({
+            centroids: cb.centroids.map(c => [...c])
+        }));
+        this.trained = true;
+    }
+    /**
+     * Get configuration
+     */
+    getConfig() {
+        return { ...this.config };
+    }
+}
+exports.ProductQuantizer = ProductQuantizer;
+//# sourceMappingURL=product-quantization.js.map

package/dist/quantization/product-quantization.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"product-quantization.js","sourceRoot":"","sources":["../../src/quantization/product-quantization.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;;AA6BH,MAAa,gBAAgB;IAc3B,YAAY,MAA8B;QAZlC,cAAS,GAAe,EAAE,CAAC;QAE3B,YAAO,GAAY,KAAK,CAAC;QAEjC,aAAa;QACL,UAAK,GAAG;YACd,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,CAAC;YACd,eAAe,EAAE,CAAC;YAClB,eAAe,EAAE,CAAC;SACnB,CAAC;QAGA,IAAI,CAAC,MAAM,GAAG;YACZ,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,gBAAgB,EAAE,MAAM,CAAC,gBAAgB,IAAI,EAAE;YAC/C,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,IAAI;SACxC,CAAC;QAEF,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CACb,eAAe,MAAM,CAAC,UAAU,sCAAsC,MAAM,CAAC,UAAU,GAAG,CAC3F,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,eAA2B;QACrC,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QAEpB,mCAAmC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;YAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;YAC7D,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,OAAmB,EAAE,YAAoB;QACjE,MAAM,KAAK,GAAG,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QAC/C,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,OAAmB,EAAE,CAAS;QAChD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAE5B,gCAAgC;QAChC,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,OAAO,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;YAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,IAAI,EAAE,EAAE,CAAC;YAC/D,kBAAkB;YAClB,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,OAAO,GAAG,QAAQ,CAAC;gBACvB,IAAI,WAAW,GAAG,CAAC,CAAC;gBAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9D,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;wBACnB,OAAO,GAAG,IAAI,CAAC;wBACf,WAAW,GAAG,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;gBAED,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;YAC/B,CAAC;YAED,cAAc;YACd,MAAM,WAAW,GAAe,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC;iBACpD,IAAI,CAAC,CAAC,CAAC;iBACP,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAEtD,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,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3B,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YAED,mBAAmB;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3B,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;oBACzD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,MAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,IAAI,KAAK,CACb,qBAAqB,MAAM,CAAC,MAAM,4BAA4B,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,CACxF,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;YACpC,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;YACtC,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE3C,wBAAwB;YACxB,IAAI,OAAO,GAAG,QAAQ,CAAC;YACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;YAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/E,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAC;oBACf,QAAQ,GAAG,CAAC,CAAC;gBACf,CAAC;YACH,CAAC;YAED,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QACtB,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAC9D,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAiB;QACtB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAC5C,MAAM,IAAI,KAAK,CACb,gBAAgB,KAAK,CAAC,MAAM,gCAAgC,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,CACtF,CAAC;QACJ,CAAC;QAED,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACnD,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC3B,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAC5B,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAC9D,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,KAAe,EAAE,KAAiB;QACnD,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC1E,CAAC;QAED,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;YACpC,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;YACtC,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE/C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAEnD,QAAQ,IAAI,IAAI,CAAC,wBAAwB,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,CAAW,EAAE,CAAW;QAChD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,CAAW,EAAE,CAAW;QACvD,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;QACN,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,sBAAsB;QACvE,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,uBAAuB;QAEtE,OAAO;YACL,YAAY;YACZ,cAAc;YACd,gBAAgB,EAAE,YAAY,GAAG,cAAc;YAC/C,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW;YACnC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW;YACnC,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC;gBACvC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW;gBACrD,CAAC,CAAC,CAAC;YACL,aAAa,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC;gBACvC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW;gBACrD,CAAC,CAAC,CAAC;SACN,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,KAAK,GAAG;YACX,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,CAAC;YACd,eAAe,EAAE,CAAC;YAClB,eAAe,EAAE,CAAC;SACnB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/B,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SACzC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,SAAqB;QACnC,IAAI,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;YAChD,MAAM,IAAI,KAAK,CACb,mBAAmB,SAAS,CAAC,MAAM,gCAAgC,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,CAC7F,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACpC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SACzC,CAAC,CAAC,CAAC;QACJ,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;CACF;AAjUD,4CAiUC"}