agentdb 1.0.12 → 1.1.1

package/dist/presets.mjs

@@ -1,140 +0,0 @@
-/**
- * Database configuration presets for common use cases
- * Provides convenient factory functions for different dataset sizes
- *
- * Note: Vector dimension is not part of DatabaseConfig - it's determined
- * by the actual vectors inserted. These presets configure database behavior,
- * caching, and optimization settings.
- */
-export class Presets {
-    /**
-     * Small dataset preset (< 10K vectors)
-     * Optimized for quick initialization and small-scale testing
-     *
-     * @param dimension - Vector dimension (for backward compatibility, not used)
-     * @param path - Database file path (omit or use undefined for in-memory)
-     * @returns Database configuration optimized for small datasets
-     */
-    static smallDataset(dimension, path) {
-        return {
-            path: path || undefined,
-            memoryMode: !path || path === ':memory:',
-            cacheSize: 100, // 100MB cache for small datasets
-            walMode: true,
-            queryCache: {
-                enabled: true,
-                maxSize: 1000,
-                ttl: 60000, // 1 minute
-                enableStats: true
-            }
-        };
-    }
-    /**
-     * Medium dataset preset (10K - 100K vectors)
-     * Balanced configuration for moderate-scale applications
-     *
-     * @param dimension - Vector dimension (for backward compatibility, not used)
-     * @param path - Database file path (omit or use undefined for in-memory)
-     * @returns Database configuration optimized for medium datasets
-     */
-    static mediumDataset(dimension, path) {
-        return {
-            path: path || undefined,
-            memoryMode: !path || path === ':memory:',
-            cacheSize: 500, // 500MB cache for medium datasets
-            walMode: true,
-            queryCache: {
-                enabled: true,
-                maxSize: 5000,
-                ttl: 300000, // 5 minutes
-                enableStats: true
-            }
-        };
-    }
-    /**
-     * Large dataset preset (100K+ vectors)
-     * High-performance configuration for large-scale production use
-     *
-     * @param dimension - Vector dimension (for backward compatibility, not used)
-     * @param path - Database file path
-     * @returns Database configuration optimized for large datasets
-     */
-    static largeDataset(dimension, path) {
-        return {
-            path: path || undefined,
-            memoryMode: !path || path === ':memory:',
-            cacheSize: 2000, // 2GB cache for large datasets
-            walMode: true,
-            mmapSize: 1073741824, // 1GB mmap
-            queryCache: {
-                enabled: true,
-                maxSize: 10000,
-                ttl: 600000, // 10 minutes
-                enableStats: true
-            }
-        };
-    }
-    /**
-     * In-memory preset
-     * Fast, ephemeral database for testing and temporary operations
-     *
-     * @param dimension - Vector dimension (for backward compatibility, not used)
-     * @returns Database configuration for in-memory database
-     */
-    static inMemory(dimension) {
-        return {
-            memoryMode: true,
-            cacheSize: 100,
-            queryCache: {
-                enabled: true,
-                maxSize: 500,
-                ttl: 60000,
-                enableStats: true
-            }
-        };
-    }
-    /**
-     * High-accuracy preset
-     * Larger cache and longer TTL for better accuracy
-     *
-     * @param dimension - Vector dimension (for backward compatibility, not used)
-     * @param path - Database file path
-     * @returns Database configuration optimized for accuracy
-     */
-    static highAccuracy(dimension, path) {
-        return {
-            path: path || undefined,
-            memoryMode: !path || path === ':memory:',
-            cacheSize: 1000,
-            walMode: true,
-            queryCache: {
-                enabled: true,
-                maxSize: 20000,
-                ttl: 1800000, // 30 minutes
-                enableStats: true
-            }
-        };
-    }
-    /**
-     * Fast search preset
-     * Optimized for speed with minimal caching
-     *
-     * @param dimension - Vector dimension (for backward compatibility, not used)
-     * @param path - Database file path
-     * @returns Database configuration optimized for speed
-     */
-    static fastSearch(dimension, path) {
-        return {
-            path: path || undefined,
-            memoryMode: !path || path === ':memory:',
-            cacheSize: 50, // Minimal cache
-            walMode: true,
-            queryCache: {
-                enabled: true,
-                maxSize: 100,
-                ttl: 10000, // 10 seconds
-                enableStats: false
-            }
-        };
-    }
-}

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

@@ -1,104 +0,0 @@
-/**
- * Binary Quantization for Ultra-Fast Vector Search
- *
- * Achieves 256x compression by packing 8 dimensions into 1 byte.
- * Uses Hamming distance for 32x faster search compared to cosine distance.
- *
- * @module binary-quantization
- */
-export interface BinaryQuantizationConfig {
-    /** Quantization method: 'threshold' or 'median' */
-    method: 'threshold' | 'median';
-    /** Threshold value for 'threshold' method (default: 0.0) */
-    threshold?: number;
-    /** Enable asymmetric search (query vs codes) for better quality */
-    useAsymmetric?: boolean;
-}
-export interface BinaryQuantizationStats {
-    /** Number of vectors trained */
-    vectorsTrained: number;
-    /** Original dimension size */
-    dimensions: number;
-    /** Compressed size in bytes */
-    compressedBytes: number;
-    /** Compression ratio (original / compressed) */
-    compressionRatio: number;
-    /** Average encoding time (ms) */
-    avgEncodeTime: number;
-    /** Average decoding time (ms) */
-    avgDecodeTime: number;
-    /** Average Hamming distance time (μs) */
-    avgHammingTime: number;
-    /** Quantization method used */
-    method: string;
-}
-export declare class BinaryQuantizer {
-    private config;
-    private trained;
-    private dimensions;
-    private threshold;
-    private stats;
-    constructor(config: BinaryQuantizationConfig);
-    /**
-     * Train the quantizer on a set of vectors
-     * For 'median' method, calculates per-dimension medians
-     * For 'threshold' method, uses configured threshold
-     */
-    train(vectors: number[][]): Promise<void>;
-    /**
-     * Calculate global median across all dimensions and vectors
-     */
-    private calculateGlobalMedian;
-    /**
-     * Encode a vector into binary codes (Uint8Array)
-     * Packs 8 dimensions into 1 byte for 256x compression
-     */
-    encode(vector: number[]): Uint8Array;
-    /**
-     * Decode binary codes back to approximate vector
-     * Maps 0 to -1 and 1 to +1
-     */
-    decode(codes: Uint8Array): number[];
-    /**
-     * Calculate Hamming distance between two binary codes
-     * Uses bitwise XOR and popcount for ultra-fast computation
-     */
-    hammingDistance(a: Uint8Array, b: Uint8Array): number;
-    /**
-     * Count number of set bits in a byte (population count)
-     * Uses Brian Kernighan's algorithm for efficiency
-     */
-    private popcount;
-    /**
-     * Asymmetric search: compare float query vector with binary codes
-     * More accurate than symmetric Hamming distance
-     *
-     * Returns a distance score (lower is better)
-     */
-    asymmetricSearch(query: number[], codes: Uint8Array): number;
-    /**
-     * Get quantizer statistics
-     */
-    getStats(): BinaryQuantizationStats;
-    /**
-     * Reset statistics counters
-     */
-    resetStats(): void;
-    /**
-     * Check if quantizer is trained
-     */
-    isTrained(): boolean;
-    /**
-     * Get dimensions
-     */
-    getDimensions(): number;
-    /**
-     * Get threshold value
-     */
-    getThreshold(): number;
-}
-/**
- * Helper function to create a binary quantizer
- */
-export declare function createBinaryQuantizer(config: BinaryQuantizationConfig): BinaryQuantizer;
-//# sourceMappingURL=binary-quantization.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"binary-quantization.d.ts","sourceRoot":"","sources":["../../src/quantization/binary-quantization.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,MAAM,WAAW,wBAAwB;IACvC,mDAAmD;IACnD,MAAM,EAAE,WAAW,GAAG,QAAQ,CAAC;IAC/B,4DAA4D;IAC5D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,mEAAmE;IACnE,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED,MAAM,WAAW,uBAAuB;IACtC,gCAAgC;IAChC,cAAc,EAAE,MAAM,CAAC;IACvB,8BAA8B;IAC9B,UAAU,EAAE,MAAM,CAAC;IACnB,+BAA+B;IAC/B,eAAe,EAAE,MAAM,CAAC;IACxB,gDAAgD;IAChD,gBAAgB,EAAE,MAAM,CAAC;IACzB,iCAAiC;IACjC,aAAa,EAAE,MAAM,CAAC;IACtB,iCAAiC;IACjC,aAAa,EAAE,MAAM,CAAC;IACtB,yCAAyC;IACzC,cAAc,EAAE,MAAM,CAAC;IACvB,+BAA+B;IAC/B,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,qBAAa,eAAe;IAC1B,OAAO,CAAC,MAAM,CAAqC;IACnD,OAAO,CAAC,OAAO,CAAkB;IACjC,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,SAAS,CAAa;IAG9B,OAAO,CAAC,KAAK,CAQX;gBAEU,MAAM,EAAE,wBAAwB;IAQ5C;;;;OAIG;IACG,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAyB/C;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAe7B;;;OAGG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,UAAU;IAkCpC;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,UAAU,GAAG,MAAM,EAAE;IAyBnC;;;OAGG;IACH,eAAe,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,MAAM;IAsBrD;;;OAGG;IACH,OAAO,CAAC,QAAQ;IAShB;;;;;OAKG;IACH,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM;IA0B5D;;OAEG;IACH,QAAQ,IAAI,uBAAuB;IAsBnC;;OAEG;IACH,UAAU,IAAI,IAAI;IAYlB;;OAEG;IACH,SAAS,IAAI,OAAO;IAIpB;;OAEG;IACH,aAAa,IAAI,MAAM;IAIvB;;OAEG;IACH,YAAY,IAAI,MAAM;CAGvB;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,wBAAwB,GAAG,eAAe,CAEvF"}

package/dist/quantization/binary-quantization.js

@@ -1,246 +0,0 @@
-"use strict";
-/**
- * Binary Quantization for Ultra-Fast Vector Search
- *
- * Achieves 256x compression by packing 8 dimensions into 1 byte.
- * Uses Hamming distance for 32x faster search compared to cosine distance.
- *
- * @module binary-quantization
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BinaryQuantizer = void 0;
-exports.createBinaryQuantizer = createBinaryQuantizer;
-class BinaryQuantizer {
-    constructor(config) {
-        this.trained = false;
-        this.dimensions = 0;
-        this.threshold = 0;
-        // Statistics tracking
-        this.stats = {
-            vectorsTrained: 0,
-            totalEncodeTime: 0,
-            totalDecodeTime: 0,
-            totalHammingTime: 0,
-            encodeCount: 0,
-            decodeCount: 0,
-            hammingCount: 0,
-        };
-        this.config = {
-            method: config.method,
-            threshold: config.threshold ?? 0.0,
-            useAsymmetric: config.useAsymmetric ?? true,
-        };
-    }
-    /**
-     * Train the quantizer on a set of vectors
-     * For 'median' method, calculates per-dimension medians
-     * For 'threshold' method, uses configured threshold
-     */
-    async train(vectors) {
-        if (vectors.length === 0) {
-            throw new Error('Cannot train on empty vector set');
-        }
-        this.dimensions = vectors[0].length;
-        // Validate all vectors have same dimensions
-        for (const vec of vectors) {
-            if (vec.length !== this.dimensions) {
-                throw new Error(`Inconsistent vector dimensions: expected ${this.dimensions}, got ${vec.length}`);
-            }
-        }
-        if (this.config.method === 'median') {
-            // Calculate median for each dimension
-            this.threshold = this.calculateGlobalMedian(vectors);
-        }
-        else {
-            this.threshold = this.config.threshold;
-        }
-        this.stats.vectorsTrained = vectors.length;
-        this.trained = true;
-    }
-    /**
-     * Calculate global median across all dimensions and vectors
-     */
-    calculateGlobalMedian(vectors) {
-        const allValues = [];
-        for (const vec of vectors) {
-            allValues.push(...vec);
-        }
-        allValues.sort((a, b) => a - b);
-        const mid = Math.floor(allValues.length / 2);
-        return allValues.length % 2 === 0
-            ? (allValues[mid - 1] + allValues[mid]) / 2
-            : allValues[mid];
-    }
-    /**
-     * Encode a vector into binary codes (Uint8Array)
-     * Packs 8 dimensions into 1 byte for 256x compression
-     */
-    encode(vector) {
-        if (!this.trained) {
-            throw new Error('Quantizer must be trained before encoding');
-        }
-        if (vector.length !== this.dimensions) {
-            throw new Error(`Vector dimension mismatch: expected ${this.dimensions}, got ${vector.length}`);
-        }
-        const startTime = performance.now();
-        // Calculate number of bytes needed (8 dimensions per byte)
-        const numBytes = Math.ceil(this.dimensions / 8);
-        const codes = new Uint8Array(numBytes);
-        // Pack 8 bits into each byte
-        for (let i = 0; i < this.dimensions; i++) {
-            const byteIndex = Math.floor(i / 8);
-            const bitIndex = i % 8;
-            if (vector[i] > this.threshold) {
-                // Set bit to 1
-                codes[byteIndex] |= (1 << bitIndex);
-            }
-            // Bit is already 0 by default, no need to clear
-        }
-        const encodeTime = performance.now() - startTime;
-        this.stats.totalEncodeTime += encodeTime;
-        this.stats.encodeCount++;
-        return codes;
-    }
-    /**
-     * Decode binary codes back to approximate vector
-     * Maps 0 to -1 and 1 to +1
-     */
-    decode(codes) {
-        if (!this.trained) {
-            throw new Error('Quantizer must be trained before decoding');
-        }
-        const startTime = performance.now();
-        const vector = new Array(this.dimensions);
-        for (let i = 0; i < this.dimensions; i++) {
-            const byteIndex = Math.floor(i / 8);
-            const bitIndex = i % 8;
-            // Extract bit and map: 0 → -1, 1 → +1
-            const bit = (codes[byteIndex] >> bitIndex) & 1;
-            vector[i] = bit === 1 ? 1 : -1;
-        }
-        const decodeTime = performance.now() - startTime;
-        this.stats.totalDecodeTime += decodeTime;
-        this.stats.decodeCount++;
-        return vector;
-    }
-    /**
-     * Calculate Hamming distance between two binary codes
-     * Uses bitwise XOR and popcount for ultra-fast computation
-     */
-    hammingDistance(a, b) {
-        if (a.length !== b.length) {
-            throw new Error('Binary codes must have same length');
-        }
-        const startTime = performance.now();
-        let distance = 0;
-        // XOR bytes and count set bits
-        for (let i = 0; i < a.length; i++) {
-            const xor = a[i] ^ b[i];
-            distance += this.popcount(xor);
-        }
-        const hammingTime = (performance.now() - startTime) * 1000; // Convert to μs
-        this.stats.totalHammingTime += hammingTime;
-        this.stats.hammingCount++;
-        return distance;
-    }
-    /**
-     * Count number of set bits in a byte (population count)
-     * Uses Brian Kernighan's algorithm for efficiency
-     */
-    popcount(byte) {
-        let count = 0;
-        while (byte) {
-            byte &= byte - 1; // Clear least significant set bit
-            count++;
-        }
-        return count;
-    }
-    /**
-     * Asymmetric search: compare float query vector with binary codes
-     * More accurate than symmetric Hamming distance
-     *
-     * Returns a distance score (lower is better)
-     */
-    asymmetricSearch(query, codes) {
-        if (!this.trained) {
-            throw new Error('Quantizer must be trained before search');
-        }
-        if (query.length !== this.dimensions) {
-            throw new Error(`Query dimension mismatch: expected ${this.dimensions}, got ${query.length}`);
-        }
-        let distance = 0;
-        for (let i = 0; i < this.dimensions; i++) {
-            const byteIndex = Math.floor(i / 8);
-            const bitIndex = i % 8;
-            const bit = (codes[byteIndex] >> bitIndex) & 1;
-            const codeValue = bit === 1 ? 1 : -1;
-            // Squared difference for distance
-            const diff = query[i] - codeValue;
-            distance += diff * diff;
-        }
-        return distance;
-    }
-    /**
-     * Get quantizer statistics
-     */
-    getStats() {
-        const compressedBytes = Math.ceil(this.dimensions / 8);
-        const originalBytes = this.dimensions * 4; // 4 bytes per float32
-        return {
-            vectorsTrained: this.stats.vectorsTrained,
-            dimensions: this.dimensions,
-            compressedBytes,
-            compressionRatio: originalBytes / compressedBytes,
-            avgEncodeTime: this.stats.encodeCount > 0
-                ? this.stats.totalEncodeTime / this.stats.encodeCount
-                : 0,
-            avgDecodeTime: this.stats.decodeCount > 0
-                ? this.stats.totalDecodeTime / this.stats.decodeCount
-                : 0,
-            avgHammingTime: this.stats.hammingCount > 0
-                ? this.stats.totalHammingTime / this.stats.hammingCount
-                : 0,
-            method: this.config.method,
-        };
-    }
-    /**
-     * Reset statistics counters
-     */
-    resetStats() {
-        this.stats = {
-            vectorsTrained: this.stats.vectorsTrained,
-            totalEncodeTime: 0,
-            totalDecodeTime: 0,
-            totalHammingTime: 0,
-            encodeCount: 0,
-            decodeCount: 0,
-            hammingCount: 0,
-        };
-    }
-    /**
-     * Check if quantizer is trained
-     */
-    isTrained() {
-        return this.trained;
-    }
-    /**
-     * Get dimensions
-     */
-    getDimensions() {
-        return this.dimensions;
-    }
-    /**
-     * Get threshold value
-     */
-    getThreshold() {
-        return this.threshold;
-    }
-}
-exports.BinaryQuantizer = BinaryQuantizer;
-/**
- * Helper function to create a binary quantizer
- */
-function createBinaryQuantizer(config) {
-    return new BinaryQuantizer(config);
-}
-//# sourceMappingURL=binary-quantization.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"binary-quantization.js","sourceRoot":"","sources":["../../src/quantization/binary-quantization.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAkTH,sDAEC;AAtRD,MAAa,eAAe;IAiB1B,YAAY,MAAgC;QAfpC,YAAO,GAAY,KAAK,CAAC;QACzB,eAAU,GAAW,CAAC,CAAC;QACvB,cAAS,GAAW,CAAC,CAAC;QAE9B,sBAAsB;QACd,UAAK,GAAG;YACd,cAAc,EAAE,CAAC;YACjB,eAAe,EAAE,CAAC;YAClB,eAAe,EAAE,CAAC;YAClB,gBAAgB,EAAE,CAAC;YACnB,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,CAAC;SAChB,CAAC;QAGA,IAAI,CAAC,MAAM,GAAG;YACZ,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,SAAS,EAAE,MAAM,CAAC,SAAS,IAAI,GAAG;YAClC,aAAa,EAAE,MAAM,CAAC,aAAa,IAAI,IAAI;SAC5C,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAK,CAAC,OAAmB;QAC7B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAEpC,4CAA4C;QAC5C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,IAAI,GAAG,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;gBACnC,MAAM,IAAI,KAAK,CAAC,4CAA4C,IAAI,CAAC,UAAU,SAAS,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YACpG,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YACpC,sCAAsC;YACtC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;QACzC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,OAAmB;QAC/C,MAAM,SAAS,GAAa,EAAE,CAAC;QAE/B,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QACzB,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE7C,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;YAC/B,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;YAC3C,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QAC/D,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,uCAAuC,IAAI,CAAC,UAAU,SAAS,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QAClG,CAAC;QAED,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,2DAA2D;QAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;QAEvC,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;YAEvB,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC/B,eAAe;gBACf,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC;YACtC,CAAC;YACD,gDAAgD;QAClD,CAAC;QAED,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,UAAU,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAEzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAiB;QACtB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QAC/D,CAAC;QAED,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;YAEvB,sCAAsC;YACtC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/C,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,eAAe,IAAI,UAAU,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAEzB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,CAAa,EAAE,CAAa;QAC1C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAEpC,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,+BAA+B;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxB,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,WAAW,GAAG,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,gBAAgB;QAC5E,IAAI,CAAC,KAAK,CAAC,gBAAgB,IAAI,WAAW,CAAC;QAC3C,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;QAE1B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACK,QAAQ,CAAC,IAAY;QAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,kCAAkC;YACpD,KAAK,EAAE,CAAC;QACV,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,KAAe,EAAE,KAAiB;QACjD,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;QAC7D,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,sCAAsC,IAAI,CAAC,UAAU,SAAS,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAChG,CAAC;QAED,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC;YAEvB,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/C,MAAM,SAAS,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAErC,kCAAkC;YAClC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;YAClC,QAAQ,IAAI,IAAI,GAAG,IAAI,CAAC;QAC1B,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,sBAAsB;QAEjE,OAAO;YACL,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc;YACzC,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,eAAe;YACf,gBAAgB,EAAE,aAAa,GAAG,eAAe;YACjD,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;YACL,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC;gBACzC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY;gBACvD,CAAC,CAAC,CAAC;YACL,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;SAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,KAAK,GAAG;YACX,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc;YACzC,eAAe,EAAE,CAAC;YAClB,eAAe,EAAE,CAAC;YAClB,gBAAgB,EAAE,CAAC;YACnB,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,CAAC;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,aAAa;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;CACF;AA/QD,0CA+QC;AAED;;GAEG;AACH,SAAgB,qBAAqB,CAAC,MAAgC;IACpE,OAAO,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;AACrC,CAAC"}