@soulcraft/brainy 0.41.0 → 0.43.0

package/dist/hnsw/optimizedHNSWIndex.js

@@ -0,0 +1,313 @@
+/**
+ * Optimized HNSW Index for Large-Scale Vector Search
+ * Implements dynamic parameter tuning and performance optimizations
+ */
+import { HNSWIndex } from './hnswIndex.js';
+import { euclideanDistance } from '../utils/index.js';
+/**
+ * Optimized HNSW Index with dynamic parameter tuning for large datasets
+ */
+export class OptimizedHNSWIndex extends HNSWIndex {
+    constructor(config = {}, distanceFunction = euclideanDistance) {
+        // Set optimized defaults for large scale
+        const defaultConfig = {
+            M: 32, // Higher connectivity for better recall
+            efConstruction: 400, // Better build quality
+            efSearch: 100, // Dynamic - will be tuned
+            ml: 24, // Deeper hierarchy
+            useDiskBasedIndex: false, // Added missing property
+            dynamicParameterTuning: true,
+            targetSearchLatency: 100, // 100ms target
+            targetRecall: 0.95, // 95% recall target
+            maxNodes: 1000000, // 1M node limit
+            memoryBudget: 8 * 1024 * 1024 * 1024, // 8GB
+            diskCacheEnabled: true,
+            compressionEnabled: false, // Disabled by default for compatibility
+            performanceTracking: true,
+            adaptiveEfSearch: true,
+            levelMultiplier: 16,
+            seedConnections: 8,
+            pruningStrategy: 'hybrid'
+        };
+        const mergedConfig = { ...defaultConfig, ...config };
+        // Initialize parent with base config
+        super({
+            M: mergedConfig.M,
+            efConstruction: mergedConfig.efConstruction,
+            efSearch: mergedConfig.efSearch,
+            ml: mergedConfig.ml
+        }, distanceFunction, { useParallelization: true });
+        this.searchHistory = [];
+        this.optimizedConfig = mergedConfig;
+        // Initialize dynamic parameters
+        this.dynamicParams = {
+            efSearch: mergedConfig.efSearch,
+            efConstruction: mergedConfig.efConstruction,
+            M: mergedConfig.M,
+            ml: mergedConfig.ml
+        };
+        // Initialize performance metrics
+        this.performanceMetrics = {
+            averageSearchTime: 0,
+            averageRecall: 0,
+            memoryUsage: 0,
+            indexSize: 0,
+            apiCalls: 0,
+            cacheHitRate: 0
+        };
+        // Start parameter tuning if enabled
+        if (this.optimizedConfig.dynamicParameterTuning) {
+            this.startParameterTuning();
+        }
+    }
+    /**
+     * Optimized search with dynamic parameter adjustment
+     */
+    async search(queryVector, k = 10) {
+        const startTime = Date.now();
+        // Adjust efSearch dynamically based on k and performance history
+        if (this.optimizedConfig.adaptiveEfSearch) {
+            this.adjustEfSearch(k);
+        }
+        // Check memory usage and trigger optimizations if needed
+        if (this.optimizedConfig.performanceTracking) {
+            this.checkMemoryUsage();
+        }
+        // Perform the search with current parameters
+        const originalConfig = this.getConfig();
+        // Temporarily update search parameters
+        const tempConfig = {
+            ...originalConfig,
+            efSearch: this.dynamicParams.efSearch
+        };
+        // Use the parent's search method with optimized parameters
+        let results;
+        try {
+            // This is a simplified approach - in practice, we'd need to modify
+            // the parent class to accept runtime parameter changes
+            results = await super.search(queryVector, k);
+        }
+        catch (error) {
+            console.error('Optimized search failed, falling back to default:', error);
+            results = await super.search(queryVector, k);
+        }
+        // Record performance metrics
+        const searchTime = Date.now() - startTime;
+        this.recordSearchMetrics(searchTime, k, results.length);
+        return results;
+    }
+    /**
+     * Dynamically adjust efSearch based on performance requirements
+     */
+    adjustEfSearch(k) {
+        const recentSearches = this.searchHistory.slice(-10);
+        if (recentSearches.length < 3) {
+            // Not enough data, use heuristic
+            this.dynamicParams.efSearch = Math.max(k * 2, 50);
+            return;
+        }
+        const averageLatency = recentSearches.reduce((sum, s) => sum + s.latency, 0) / recentSearches.length;
+        const targetLatency = this.optimizedConfig.targetSearchLatency;
+        // Adjust efSearch based on latency performance
+        if (averageLatency > targetLatency * 1.2) {
+            // Too slow, reduce efSearch
+            this.dynamicParams.efSearch = Math.max(Math.floor(this.dynamicParams.efSearch * 0.9), k);
+        }
+        else if (averageLatency < targetLatency * 0.8) {
+            // Fast enough, can increase efSearch for better recall
+            this.dynamicParams.efSearch = Math.min(Math.floor(this.dynamicParams.efSearch * 1.1), 500 // Maximum efSearch
+            );
+        }
+        // Ensure efSearch is at least k
+        this.dynamicParams.efSearch = Math.max(this.dynamicParams.efSearch, k);
+    }
+    /**
+     * Record search performance metrics
+     */
+    recordSearchMetrics(latency, k, resultCount) {
+        if (!this.optimizedConfig.performanceTracking) {
+            return;
+        }
+        // Add to search history
+        this.searchHistory.push({
+            latency,
+            k,
+            timestamp: Date.now()
+        });
+        // Keep only recent history (last 100 searches)
+        if (this.searchHistory.length > 100) {
+            this.searchHistory.shift();
+        }
+        // Update performance metrics
+        const recentSearches = this.searchHistory.slice(-20);
+        this.performanceMetrics.averageSearchTime =
+            recentSearches.reduce((sum, s) => sum + s.latency, 0) / recentSearches.length;
+        // Estimate recall (simplified - would need ground truth for accurate measurement)
+        this.performanceMetrics.averageRecall = Math.min(resultCount / k, 1.0);
+    }
+    /**
+     * Check memory usage and trigger optimizations
+     */
+    checkMemoryUsage() {
+        // Estimate memory usage (simplified)
+        const estimatedMemory = this.size() * 1000; // Rough estimate per node
+        this.performanceMetrics.memoryUsage = estimatedMemory;
+        if (estimatedMemory > this.optimizedConfig.memoryBudget * 0.9) {
+            console.warn('Memory usage approaching limit, consider index partitioning');
+            // Could trigger automatic partitioning or compression here
+            if (this.optimizedConfig.compressionEnabled) {
+                this.compressIndex();
+            }
+        }
+    }
+    /**
+     * Compress index to reduce memory usage (placeholder)
+     */
+    compressIndex() {
+        console.log('Index compression not implemented yet');
+        // This would implement vector quantization or other compression techniques
+    }
+    /**
+     * Start automatic parameter tuning
+     */
+    startParameterTuning() {
+        this.parameterTuningInterval = setInterval(() => {
+            this.tuneParameters();
+        }, 30000); // Tune every 30 seconds
+    }
+    /**
+     * Automatic parameter tuning based on performance metrics
+     */
+    tuneParameters() {
+        if (this.searchHistory.length < 10) {
+            return; // Not enough data
+        }
+        const recentSearches = this.searchHistory.slice(-20);
+        const averageLatency = recentSearches.reduce((sum, s) => sum + s.latency, 0) / recentSearches.length;
+        // Tune based on performance vs targets
+        const latencyRatio = averageLatency / this.optimizedConfig.targetSearchLatency;
+        const recallRatio = this.performanceMetrics.averageRecall / this.optimizedConfig.targetRecall;
+        // Adjust M (connectivity) for long-term performance
+        if (this.size() > 10000) { // Only tune for larger indices
+            if (recallRatio < 0.95 && latencyRatio < 1.5) {
+                // Recall is low but we have latency budget, increase M
+                this.dynamicParams.M = Math.min(this.dynamicParams.M + 2, 64);
+            }
+            else if (latencyRatio > 1.2 && recallRatio > 1.0) {
+                // Latency is high but recall is good, can reduce M
+                this.dynamicParams.M = Math.max(this.dynamicParams.M - 2, 16);
+            }
+        }
+        console.log(`Parameter tuning: efSearch=${this.dynamicParams.efSearch}, M=${this.dynamicParams.M}, latency=${averageLatency.toFixed(1)}ms`);
+    }
+    /**
+     * Get optimized configuration recommendations for current dataset size
+     */
+    getOptimizedConfig() {
+        const currentSize = this.size();
+        let recommendedConfig = {};
+        if (currentSize < 10000) {
+            // Small dataset - optimize for speed
+            recommendedConfig = {
+                M: 16,
+                efConstruction: 200,
+                efSearch: 50,
+                ml: 16
+            };
+        }
+        else if (currentSize < 100000) {
+            // Medium dataset - balance speed and recall
+            recommendedConfig = {
+                M: 24,
+                efConstruction: 300,
+                efSearch: 75,
+                ml: 20
+            };
+        }
+        else if (currentSize < 1000000) {
+            // Large dataset - optimize for recall
+            recommendedConfig = {
+                M: 32,
+                efConstruction: 400,
+                efSearch: 100,
+                ml: 24
+            };
+        }
+        else {
+            // Very large dataset - maximum quality
+            recommendedConfig = {
+                M: 48,
+                efConstruction: 500,
+                efSearch: 150,
+                ml: 28
+            };
+        }
+        return {
+            ...this.optimizedConfig,
+            ...recommendedConfig
+        };
+    }
+    /**
+     * Get current performance metrics
+     */
+    getPerformanceMetrics() {
+        return {
+            ...this.performanceMetrics,
+            currentParams: { ...this.dynamicParams },
+            searchHistorySize: this.searchHistory.length
+        };
+    }
+    /**
+     * Apply optimized bulk insertion strategy
+     */
+    async bulkInsert(items) {
+        console.log(`Starting optimized bulk insert of ${items.length} items`);
+        // Sort items to optimize insertion order (by vector similarity)
+        const sortedItems = this.optimizeInsertionOrder(items);
+        // Temporarily adjust construction parameters for bulk operations
+        const originalEfConstruction = this.dynamicParams.efConstruction;
+        this.dynamicParams.efConstruction = Math.min(this.dynamicParams.efConstruction * 1.5, 800);
+        const results = [];
+        const batchSize = 100;
+        try {
+            // Process in batches to manage memory
+            for (let i = 0; i < sortedItems.length; i += batchSize) {
+                const batch = sortedItems.slice(i, i + batchSize);
+                for (const item of batch) {
+                    const id = await this.addItem(item);
+                    results.push(id);
+                }
+                // Periodic memory check
+                if (i % (batchSize * 10) === 0) {
+                    this.checkMemoryUsage();
+                }
+            }
+        }
+        finally {
+            // Restore original construction parameters
+            this.dynamicParams.efConstruction = originalEfConstruction;
+        }
+        console.log(`Completed bulk insert of ${results.length} items`);
+        return results;
+    }
+    /**
+     * Optimize insertion order to improve index quality
+     */
+    optimizeInsertionOrder(items) {
+        if (items.length < 100) {
+            return items; // Not worth optimizing small batches
+        }
+        // Simple clustering-based ordering
+        // In practice, you might use more sophisticated methods
+        return items.sort(() => Math.random() - 0.5); // Shuffle for now
+    }
+    /**
+     * Cleanup resources
+     */
+    destroy() {
+        if (this.parameterTuningInterval) {
+            clearInterval(this.parameterTuningInterval);
+        }
+    }
+}
+//# sourceMappingURL=optimizedHNSWIndex.js.map

package/dist/hnsw/optimizedHNSWIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"optimizedHNSWIndex.js","sourceRoot":"","sources":["../../src/hnsw/optimizedHNSWIndex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC1C,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAwCrD;;GAEG;AACH,MAAM,OAAO,kBAAmB,SAAQ,SAAS;IAO/C,YACE,SAAuC,EAAE,EACzC,mBAAqC,iBAAiB;QAEtD,yCAAyC;QACzC,MAAM,aAAa,GAAkC;YACnD,CAAC,EAAE,EAAE,EAAE,wCAAwC;YAC/C,cAAc,EAAE,GAAG,EAAE,uBAAuB;YAC5C,QAAQ,EAAE,GAAG,EAAE,0BAA0B;YACzC,EAAE,EAAE,EAAE,EAAE,mBAAmB;YAC3B,iBAAiB,EAAE,KAAK,EAAE,yBAAyB;YACnD,sBAAsB,EAAE,IAAI;YAC5B,mBAAmB,EAAE,GAAG,EAAE,eAAe;YACzC,YAAY,EAAE,IAAI,EAAE,oBAAoB;YACxC,QAAQ,EAAE,OAAO,EAAE,gBAAgB;YACnC,YAAY,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,MAAM;YAC5C,gBAAgB,EAAE,IAAI;YACtB,kBAAkB,EAAE,KAAK,EAAE,wCAAwC;YACnE,mBAAmB,EAAE,IAAI;YACzB,gBAAgB,EAAE,IAAI;YACtB,eAAe,EAAE,EAAE;YACnB,eAAe,EAAE,CAAC;YAClB,eAAe,EAAE,QAAQ;SAC1B,CAAA;QAED,MAAM,YAAY,GAAG,EAAE,GAAG,aAAa,EAAE,GAAG,MAAM,EAAE,CAAA;QAEpD,qCAAqC;QACrC,KAAK,CACH;YACE,CAAC,EAAE,YAAY,CAAC,CAAC;YACjB,cAAc,EAAE,YAAY,CAAC,cAAc;YAC3C,QAAQ,EAAE,YAAY,CAAC,QAAQ;YAC/B,EAAE,EAAE,YAAY,CAAC,EAAE;SACpB,EACD,gBAAgB,EAChB,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAC7B,CAAA;QAxCK,kBAAa,GAA6D,EAAE,CAAA;QA0ClF,IAAI,CAAC,eAAe,GAAG,YAAY,CAAA;QAEnC,gCAAgC;QAChC,IAAI,CAAC,aAAa,GAAG;YACnB,QAAQ,EAAE,YAAY,CAAC,QAAQ;YAC/B,cAAc,EAAE,YAAY,CAAC,cAAc;YAC3C,CAAC,EAAE,YAAY,CAAC,CAAC;YACjB,EAAE,EAAE,YAAY,CAAC,EAAE;SACpB,CAAA;QAED,iCAAiC;QACjC,IAAI,CAAC,kBAAkB,GAAG;YACxB,iBAAiB,EAAE,CAAC;YACpB,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,CAAC;YACX,YAAY,EAAE,CAAC;SAChB,CAAA;QAED,oCAAoC;QACpC,IAAI,IAAI,CAAC,eAAe,CAAC,sBAAsB,EAAE,CAAC;YAChD,IAAI,CAAC,oBAAoB,EAAE,CAAA;QAC7B,CAAC;IACH,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,MAAM,CACjB,WAAmB,EACnB,IAAY,EAAE;QAEd,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;QAE5B,iEAAiE;QACjE,IAAI,IAAI,CAAC,eAAe,CAAC,gBAAgB,EAAE,CAAC;YAC1C,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAA;QACxB,CAAC;QAED,yDAAyD;QACzD,IAAI,IAAI,CAAC,eAAe,CAAC,mBAAmB,EAAE,CAAC;YAC7C,IAAI,CAAC,gBAAgB,EAAE,CAAA;QACzB,CAAC;QAED,6CAA6C;QAC7C,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,EAAE,CAAA;QAEvC,uCAAuC;QACvC,MAAM,UAAU,GAAG;YACjB,GAAG,cAAc;YACjB,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,QAAQ;SACtC,CAAA;QAED,2DAA2D;QAC3D,IAAI,OAAgC,CAAA;QAEpC,IAAI,CAAC;YACH,mEAAmE;YACnE,uDAAuD;YACvD,OAAO,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;QAC9C,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,mDAAmD,EAAE,KAAK,CAAC,CAAA;YACzE,OAAO,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;QAC9C,CAAC;QAED,6BAA6B;QAC7B,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAA;QACzC,IAAI,CAAC,mBAAmB,CAAC,UAAU,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAA;QAEvD,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,CAAS;QAC9B,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;QAEpD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,iCAAiC;YACjC,IAAI,CAAC,aAAa,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAA;YACjD,OAAM;QACR,CAAC;QAED,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,CAAA;QACpG,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,mBAAmB,CAAA;QAE9D,+CAA+C;QAC/C,IAAI,cAAc,GAAG,aAAa,GAAG,GAAG,EAAE,CAAC;YACzC,4BAA4B;YAC5B,IAAI,CAAC,aAAa,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CACpC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,GAAG,GAAG,CAAC,EAC7C,CAAC,CACF,CAAA;QACH,CAAC;aAAM,IAAI,cAAc,GAAG,aAAa,GAAG,GAAG,EAAE,CAAC;YAChD,uDAAuD;YACvD,IAAI,CAAC,aAAa,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CACpC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,GAAG,GAAG,CAAC,EAC7C,GAAG,CAAC,mBAAmB;aACxB,CAAA;QACH,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,aAAa,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;IACxE,CAAC;IAED;;OAEG;IACK,mBAAmB,CAAC,OAAe,EAAE,CAAS,EAAE,WAAmB;QACzE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,mBAAmB,EAAE,CAAC;YAC9C,OAAM;QACR,CAAC;QAED,wBAAwB;QACxB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;YACtB,OAAO;YACP,CAAC;YACD,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC,CAAA;QAEF,+CAA+C;QAC/C,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACpC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAA;QAC5B,CAAC;QAED,6BAA6B;QAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;QACpD,IAAI,CAAC,kBAAkB,CAAC,iBAAiB;YACvC,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,CAAA;QAE/E,kFAAkF;QAClF,IAAI,CAAC,kBAAkB,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,CAAC,EAAE,GAAG,CAAC,CAAA;IACxE,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,qCAAqC;QACrC,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAA,CAAC,0BAA0B;QACrE,IAAI,CAAC,kBAAkB,CAAC,WAAW,GAAG,eAAe,CAAA;QAErD,IAAI,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC,YAAY,GAAG,GAAG,EAAE,CAAC;YAC9D,OAAO,CAAC,IAAI,CAAC,6DAA6D,CAAC,CAAA;YAE3E,2DAA2D;YAC3D,IAAI,IAAI,CAAC,eAAe,CAAC,kBAAkB,EAAE,CAAC;gBAC5C,IAAI,CAAC,aAAa,EAAE,CAAA;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,aAAa;QACnB,OAAO,CAAC,GAAG,CAAC,uCAAuC,CAAC,CAAA;QACpD,2EAA2E;IAC7E,CAAC;IAED;;OAEG;IACK,oBAAoB;QAC1B,IAAI,CAAC,uBAAuB,GAAG,WAAW,CAAC,GAAG,EAAE;YAC9C,IAAI,CAAC,cAAc,EAAE,CAAA;QACvB,CAAC,EAAE,KAAK,CAAC,CAAA,CAAC,wBAAwB;IACpC,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACnC,OAAM,CAAC,kBAAkB;QAC3B,CAAC;QAED,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAA;QACpD,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,CAAA;QAEpG,uCAAuC;QACvC,MAAM,YAAY,GAAG,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,mBAAmB,CAAA;QAC9E,MAAM,WAAW,GAAG,IAAI,CAAC,kBAAkB,CAAC,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,YAAY,CAAA;QAE7F,oDAAoD;QACpD,IAAI,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC,+BAA+B;YACxD,IAAI,WAAW,GAAG,IAAI,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;gBAC7C,uDAAuD;gBACvD,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAA;YAC/D,CAAC;iBAAM,IAAI,YAAY,GAAG,GAAG,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;gBACnD,mDAAmD;gBACnD,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAA;YAC/D,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,8BAA8B,IAAI,CAAC,aAAa,CAAC,QAAQ,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,aAAa,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IAC7I,CAAC;IAED;;OAEG;IACI,kBAAkB;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QAE/B,IAAI,iBAAiB,GAAiC,EAAE,CAAA;QAExD,IAAI,WAAW,GAAG,KAAK,EAAE,CAAC;YACxB,qCAAqC;YACrC,iBAAiB,GAAG;gBAClB,CAAC,EAAE,EAAE;gBACL,cAAc,EAAE,GAAG;gBACnB,QAAQ,EAAE,EAAE;gBACZ,EAAE,EAAE,EAAE;aACP,CAAA;QACH,CAAC;aAAM,IAAI,WAAW,GAAG,MAAM,EAAE,CAAC;YAChC,4CAA4C;YAC5C,iBAAiB,GAAG;gBAClB,CAAC,EAAE,EAAE;gBACL,cAAc,EAAE,GAAG;gBACnB,QAAQ,EAAE,EAAE;gBACZ,EAAE,EAAE,EAAE;aACP,CAAA;QACH,CAAC;aAAM,IAAI,WAAW,GAAG,OAAO,EAAE,CAAC;YACjC,sCAAsC;YACtC,iBAAiB,GAAG;gBAClB,CAAC,EAAE,EAAE;gBACL,cAAc,EAAE,GAAG;gBACnB,QAAQ,EAAE,GAAG;gBACb,EAAE,EAAE,EAAE;aACP,CAAA;QACH,CAAC;aAAM,CAAC;YACN,uCAAuC;YACvC,iBAAiB,GAAG;gBAClB,CAAC,EAAE,EAAE;gBACL,cAAc,EAAE,GAAG;gBACnB,QAAQ,EAAE,GAAG;gBACb,EAAE,EAAE,EAAE;aACP,CAAA;QACH,CAAC;QAED,OAAO;YACL,GAAG,IAAI,CAAC,eAAe;YACvB,GAAG,iBAAiB;SACrB,CAAA;IACH,CAAC;IAED;;OAEG;IACI,qBAAqB;QAI1B,OAAO;YACL,GAAG,IAAI,CAAC,kBAAkB;YAC1B,aAAa,EAAE,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE;YACxC,iBAAiB,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM;SAC7C,CAAA;IACH,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,UAAU,CAAC,KAAuB;QAC7C,OAAO,CAAC,GAAG,CAAC,qCAAqC,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAA;QAEtE,gEAAgE;QAChE,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAA;QAEtD,iEAAiE;QACjE,MAAM,sBAAsB,GAAG,IAAI,CAAC,aAAa,CAAC,cAAc,CAAA;QAChE,IAAI,CAAC,aAAa,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,CAC1C,IAAI,CAAC,aAAa,CAAC,cAAc,GAAG,GAAG,EACvC,GAAG,CACJ,CAAA;QAED,MAAM,OAAO,GAAa,EAAE,CAAA;QAC5B,MAAM,SAAS,GAAG,GAAG,CAAA;QAErB,IAAI,CAAC;YACH,sCAAsC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;gBACvD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAA;gBAEjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;oBACnC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBAClB,CAAC;gBAED,wBAAwB;gBACxB,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC/B,IAAI,CAAC,gBAAgB,EAAE,CAAA;gBACzB,CAAC;YACH,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,2CAA2C;YAC3C,IAAI,CAAC,aAAa,CAAC,cAAc,GAAG,sBAAsB,CAAA;QAC5D,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,4BAA4B,OAAO,CAAC,MAAM,QAAQ,CAAC,CAAA;QAC/D,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAAC,KAAuB;QACpD,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;YACvB,OAAO,KAAK,CAAA,CAAC,qCAAqC;QACpD,CAAC;QAED,mCAAmC;QACnC,wDAAwD;QACxD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAA,CAAC,kBAAkB;IACjE,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,IAAI,IAAI,CAAC,uBAAuB,EAAE,CAAC;YACjC,aAAa,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAA;QAC7C,CAAC;IACH,CAAC;CACF"}

package/dist/hnsw/partitionedHNSWIndex.js

@@ -0,0 +1,304 @@
+/**
+ * Partitioned HNSW Index for Large-Scale Vector Search
+ * Implements sharding strategies to handle millions of vectors efficiently
+ */
+import { HNSWIndex } from './hnswIndex.js';
+import { euclideanDistance } from '../utils/index.js';
+/**
+ * Partitioned HNSW Index that splits large datasets across multiple smaller indices
+ * This enables efficient search across millions of vectors by reducing memory usage
+ * and parallelizing search operations
+ */
+export class PartitionedHNSWIndex {
+    constructor(partitionConfig = {}, hnswConfig = {}, distanceFunction = euclideanDistance) {
+        this.partitions = new Map();
+        this.partitionMetadata = new Map();
+        this.dimension = null;
+        this.nextPartitionId = 0;
+        this.config = {
+            maxNodesPerPartition: 50000, // Optimal size for memory efficiency
+            partitionStrategy: 'semantic', // Default to semantic for better performance
+            semanticClusters: 8, // Auto-tuned based on dataset
+            autoTuneSemanticClusters: true,
+            ...partitionConfig
+        };
+        // Optimized HNSW parameters for large scale
+        this.hnswConfig = {
+            M: 32, // Higher connectivity for better recall
+            efConstruction: 400, // Better build quality
+            efSearch: 100, // Balance speed vs accuracy
+            ml: 24, // Deeper hierarchy
+            ...hnswConfig
+        };
+        this.distanceFunction = distanceFunction;
+    }
+    /**
+     * Add a vector to the partitioned index
+     */
+    async addItem(item) {
+        if (this.dimension === null) {
+            this.dimension = item.vector.length;
+        }
+        // Determine which partition this item belongs to
+        const partitionId = await this.selectPartition(item);
+        // Get or create the partition
+        let partition = this.partitions.get(partitionId);
+        if (!partition) {
+            partition = new HNSWIndex(this.hnswConfig, this.distanceFunction, { useParallelization: true });
+            this.partitions.set(partitionId, partition);
+            // Initialize partition metadata
+            this.partitionMetadata.set(partitionId, {
+                id: partitionId,
+                nodeCount: 0,
+                strategy: this.config.partitionStrategy,
+                created: new Date()
+            });
+        }
+        // Add item to the selected partition
+        await partition.addItem(item);
+        // Update partition metadata
+        const metadata = this.partitionMetadata.get(partitionId);
+        metadata.nodeCount = partition.size();
+        // Update bounds for semantic strategy
+        if (this.config.partitionStrategy === 'semantic') {
+            this.updatePartitionBounds(partitionId, item.vector);
+        }
+        // Check if partition is getting too large and needs splitting
+        if (metadata.nodeCount > this.config.maxNodesPerPartition * 1.2) {
+            await this.splitPartition(partitionId);
+        }
+        return item.id;
+    }
+    /**
+     * Search across all partitions for nearest neighbors
+     */
+    async search(queryVector, k = 10, searchScope) {
+        if (this.partitions.size === 0) {
+            return [];
+        }
+        // Determine which partitions to search
+        const partitionsToSearch = await this.selectSearchPartitions(queryVector, searchScope);
+        // Search partitions in parallel
+        const searchPromises = partitionsToSearch.map(async (partitionId) => {
+            const partition = this.partitions.get(partitionId);
+            if (!partition)
+                return [];
+            // Search with higher k to get better global results
+            const partitionK = Math.min(k * 2, partition.size());
+            return partition.search(queryVector, partitionK);
+        });
+        const partitionResults = await Promise.all(searchPromises);
+        // Merge and sort results from all partitions
+        const allResults = [];
+        for (const results of partitionResults) {
+            allResults.push(...results);
+        }
+        // Sort by distance and return top k
+        allResults.sort((a, b) => a[1] - b[1]);
+        return allResults.slice(0, k);
+    }
+    /**
+     * Select the appropriate partition for a new item
+     * Automatically chooses semantic partitioning when beneficial, falls back to hash
+     */
+    async selectPartition(item) {
+        // Auto-tune semantic clusters based on current dataset size
+        if (this.config.autoTuneSemanticClusters && this.config.partitionStrategy === 'semantic') {
+            this.autoTuneSemanticClusters();
+        }
+        switch (this.config.partitionStrategy) {
+            case 'semantic':
+                return await this.semanticPartition(item.vector);
+            case 'hash':
+            default:
+                return this.hashPartition(item.id);
+        }
+    }
+    /**
+     * Hash-based partitioning for even distribution
+     */
+    hashPartition(id) {
+        const hash = this.simpleHash(id);
+        const existingPartitions = Array.from(this.partitions.keys());
+        // Find partition with space, or create new one
+        for (const partitionId of existingPartitions) {
+            const metadata = this.partitionMetadata.get(partitionId);
+            if (metadata && metadata.nodeCount < this.config.maxNodesPerPartition) {
+                return partitionId;
+            }
+        }
+        // Create new partition
+        return `partition_${this.nextPartitionId++}`;
+    }
+    /**
+     * Semantic clustering partitioning
+     */
+    async semanticPartition(vector) {
+        // Find closest partition centroid
+        let closestPartition = '';
+        let minDistance = Infinity;
+        for (const [partitionId, metadata] of this.partitionMetadata.entries()) {
+            if (metadata.bounds?.centroid) {
+                const distance = this.distanceFunction(vector, metadata.bounds.centroid);
+                if (distance < minDistance) {
+                    minDistance = distance;
+                    closestPartition = partitionId;
+                }
+            }
+        }
+        // If no suitable partition found or it's full, create new one
+        if (!closestPartition ||
+            this.partitionMetadata.get(closestPartition).nodeCount >= this.config.maxNodesPerPartition) {
+            closestPartition = `semantic_${this.nextPartitionId++}`;
+        }
+        return closestPartition;
+    }
+    /**
+     * Auto-tune semantic clusters based on dataset size and performance
+     */
+    autoTuneSemanticClusters() {
+        const totalNodes = this.size();
+        const currentPartitions = this.partitions.size;
+        // Optimal clusters based on dataset size
+        let optimalClusters = Math.max(4, Math.min(32, Math.floor(totalNodes / 10000)));
+        // Adjust based on current partition performance
+        if (currentPartitions > 0) {
+            const avgNodesPerPartition = totalNodes / currentPartitions;
+            if (avgNodesPerPartition > this.config.maxNodesPerPartition * 0.8) {
+                // Partitions are getting full, increase clusters
+                optimalClusters = Math.min(32, this.config.semanticClusters + 2);
+            }
+            else if (avgNodesPerPartition < this.config.maxNodesPerPartition * 0.3 && currentPartitions > 4) {
+                // Partitions are underutilized, decrease clusters
+                optimalClusters = Math.max(4, this.config.semanticClusters - 1);
+            }
+        }
+        if (optimalClusters !== this.config.semanticClusters) {
+            console.log(`Auto-tuning semantic clusters: ${this.config.semanticClusters} → ${optimalClusters}`);
+            this.config.semanticClusters = optimalClusters;
+        }
+    }
+    /**
+     * Select which partitions to search based on query
+     */
+    async selectSearchPartitions(queryVector, searchScope) {
+        if (searchScope?.partitionIds) {
+            return searchScope.partitionIds.filter(id => this.partitions.has(id));
+        }
+        const maxPartitions = searchScope?.maxPartitions || Math.min(5, this.partitions.size);
+        if (this.config.partitionStrategy === 'semantic') {
+            // Search partitions with closest centroids
+            const distances = [];
+            for (const [partitionId, metadata] of this.partitionMetadata.entries()) {
+                if (metadata.bounds?.centroid) {
+                    const distance = this.distanceFunction(queryVector, metadata.bounds.centroid);
+                    distances.push([partitionId, distance]);
+                }
+            }
+            distances.sort((a, b) => a[1] - b[1]);
+            return distances.slice(0, maxPartitions).map(([id]) => id);
+        }
+        // For other strategies, search all partitions or random subset
+        const allPartitionIds = Array.from(this.partitions.keys());
+        if (allPartitionIds.length <= maxPartitions) {
+            return allPartitionIds;
+        }
+        // Return random subset
+        const shuffled = [...allPartitionIds].sort(() => Math.random() - 0.5);
+        return shuffled.slice(0, maxPartitions);
+    }
+    /**
+     * Update partition bounds for semantic clustering
+     */
+    updatePartitionBounds(partitionId, vector) {
+        const metadata = this.partitionMetadata.get(partitionId);
+        if (!metadata.bounds) {
+            metadata.bounds = {
+                centroid: [...vector],
+                radius: 0
+            };
+            return;
+        }
+        // Update centroid using incremental mean
+        const { centroid } = metadata.bounds;
+        const nodeCount = metadata.nodeCount;
+        for (let i = 0; i < centroid.length; i++) {
+            centroid[i] = (centroid[i] * (nodeCount - 1) + vector[i]) / nodeCount;
+        }
+        // Update radius
+        const distance = this.distanceFunction(vector, centroid);
+        metadata.bounds.radius = Math.max(metadata.bounds.radius, distance);
+    }
+    /**
+     * Split an overgrown partition into smaller partitions
+     */
+    async splitPartition(partitionId) {
+        const partition = this.partitions.get(partitionId);
+        if (!partition)
+            return;
+        console.log(`Splitting partition ${partitionId} with ${partition.size()} nodes`);
+        // For now, we'll implement a simple strategy
+        // In a full implementation, you'd want to analyze the data distribution
+        // and create more intelligent splits
+        // This is a placeholder - actual implementation would require
+        // accessing the internal nodes of the HNSW index
+    }
+    /**
+     * Simple hash function for consistent partitioning
+     */
+    simpleHash(str) {
+        let hash = 0;
+        for (let i = 0; i < str.length; i++) {
+            const char = str.charCodeAt(i);
+            hash = ((hash << 5) - hash) + char;
+            hash = hash & hash; // Convert to 32-bit integer
+        }
+        return Math.abs(hash);
+    }
+    /**
+     * Get partition statistics
+     */
+    getPartitionStats() {
+        const partitionDetails = Array.from(this.partitionMetadata.values());
+        const totalNodes = partitionDetails.reduce((sum, p) => sum + p.nodeCount, 0);
+        return {
+            totalPartitions: partitionDetails.length,
+            totalNodes,
+            averageNodesPerPartition: totalNodes / partitionDetails.length || 0,
+            partitionDetails
+        };
+    }
+    /**
+     * Remove an item from the index
+     */
+    async removeItem(id) {
+        // Find which partition contains this item
+        for (const [partitionId, partition] of this.partitions.entries()) {
+            if (partition.removeItem(id)) {
+                // Update metadata
+                const metadata = this.partitionMetadata.get(partitionId);
+                metadata.nodeCount = partition.size();
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Clear all partitions
+     */
+    clear() {
+        for (const partition of this.partitions.values()) {
+            partition.clear();
+        }
+        this.partitions.clear();
+        this.partitionMetadata.clear();
+        this.nextPartitionId = 0;
+    }
+    /**
+     * Get total size across all partitions
+     */
+    size() {
+        return Array.from(this.partitions.values()).reduce((sum, partition) => sum + partition.size(), 0);
+    }
+}
+//# sourceMappingURL=partitionedHNSWIndex.js.map

package/dist/hnsw/partitionedHNSWIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partitionedHNSWIndex.js","sourceRoot":"","sources":["../../src/hnsw/partitionedHNSWIndex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC1C,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAoBrD;;;;GAIG;AACH,MAAM,OAAO,oBAAoB;IAS/B,YACE,kBAA4C,EAAE,EAC9C,aAAkC,EAAE,EACpC,mBAAqC,iBAAiB;QAXhD,eAAU,GAA2B,IAAI,GAAG,EAAE,CAAA;QAC9C,sBAAiB,GAAmC,IAAI,GAAG,EAAE,CAAA;QAI7D,cAAS,GAAkB,IAAI,CAAA;QAC/B,oBAAe,GAAG,CAAC,CAAA;QAOzB,IAAI,CAAC,MAAM,GAAG;YACZ,oBAAoB,EAAE,KAAK,EAAE,qCAAqC;YAClE,iBAAiB,EAAE,UAAU,EAAE,6CAA6C;YAC5E,gBAAgB,EAAE,CAAC,EAAE,8BAA8B;YACnD,wBAAwB,EAAE,IAAI;YAC9B,GAAG,eAAe;SACnB,CAAA;QAED,4CAA4C;QAC5C,IAAI,CAAC,UAAU,GAAG;YAChB,CAAC,EAAE,EAAE,EAAE,wCAAwC;YAC/C,cAAc,EAAE,GAAG,EAAE,uBAAuB;YAC5C,QAAQ,EAAE,GAAG,EAAE,4BAA4B;YAC3C,EAAE,EAAE,EAAE,EAAE,mBAAmB;YAC3B,GAAG,UAAU;SACd,CAAA;QAED,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAA;IAC1C,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,OAAO,CAAC,IAAoB;QACvC,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QACrC,CAAC;QAED,iDAAiD;QACjD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAA;QAEpD,8BAA8B;QAC9B,IAAI,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAChD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAS,GAAG,IAAI,SAAS,CACvB,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,gBAAgB,EACrB,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAC7B,CAAA;YACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAA;YAE3C,gCAAgC;YAChC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,EAAE;gBACtC,EAAE,EAAE,WAAW;gBACf,SAAS,EAAE,CAAC;gBACZ,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,iBAAiB;gBACvC,OAAO,EAAE,IAAI,IAAI,EAAE;aACpB,CAAC,CAAA;QACJ,CAAC;QAED,qCAAqC;QACrC,MAAM,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;QAE7B,4BAA4B;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAA;QACzD,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,IAAI,EAAE,CAAA;QAErC,sCAAsC;QACtC,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,KAAK,UAAU,EAAE,CAAC;YACjD,IAAI,CAAC,qBAAqB,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,CAAA;QACtD,CAAC;QAED,8DAA8D;QAC9D,IAAI,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,GAAG,GAAG,EAAE,CAAC;YAChE,MAAM,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAA;QACxC,CAAC;QAED,OAAO,IAAI,CAAC,EAAE,CAAA;IAChB,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,MAAM,CACjB,WAAmB,EACnB,IAAY,EAAE,EACd,WAGC;QAED,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,EAAE,CAAA;QACX,CAAC;QAED,uCAAuC;QACvC,MAAM,kBAAkB,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAA;QAEtF,gCAAgC;QAChC,MAAM,cAAc,GAAG,kBAAkB,CAAC,GAAG,CAAC,KAAK,EAAE,WAAW,EAAE,EAAE;YAClE,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;YAClD,IAAI,CAAC,SAAS;gBAAE,OAAO,EAAE,CAAA;YAEzB,oDAAoD;YACpD,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC,CAAA;YACpD,OAAO,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,CAAC,CAAA;QAClD,CAAC,CAAC,CAAA;QAEF,MAAM,gBAAgB,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,CAAA;QAE1D,6CAA6C;QAC7C,MAAM,UAAU,GAA4B,EAAE,CAAA;QAC9C,KAAK,MAAM,OAAO,IAAI,gBAAgB,EAAE,CAAC;YACvC,UAAU,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAA;QAC7B,CAAC;QAED,oCAAoC;QACpC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACtC,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/B,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,eAAe,CAAC,IAAoB;QAChD,4DAA4D;QAC5D,IAAI,IAAI,CAAC,MAAM,CAAC,wBAAwB,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,KAAK,UAAU,EAAE,CAAC;YACzF,IAAI,CAAC,wBAAwB,EAAE,CAAA;QACjC,CAAC;QAED,QAAQ,IAAI,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC;YACtC,KAAK,UAAU;gBACb,OAAO,MAAM,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAElD,KAAK,MAAM,CAAC;YACZ;gBACE,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,EAAU;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;QAChC,MAAM,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAA;QAE7D,+CAA+C;QAC/C,KAAK,MAAM,WAAW,IAAI,kBAAkB,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;YACxD,IAAI,QAAQ,IAAI,QAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;gBACtE,OAAO,WAAW,CAAA;YACpB,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,OAAO,aAAa,IAAI,CAAC,eAAe,EAAE,EAAE,CAAA;IAC9C,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,iBAAiB,CAAC,MAAc;QAC5C,kCAAkC;QAClC,IAAI,gBAAgB,GAAG,EAAE,CAAA;QACzB,IAAI,WAAW,GAAG,QAAQ,CAAA;QAE1B,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,EAAE,CAAC;YACvE,IAAI,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC;gBAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;gBACxE,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;oBAC3B,WAAW,GAAG,QAAQ,CAAA;oBACtB,gBAAgB,GAAG,WAAW,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QAED,8DAA8D;QAC9D,IAAI,CAAC,gBAAgB;YACjB,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,gBAAgB,CAAE,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;YAChG,gBAAgB,GAAG,YAAY,IAAI,CAAC,eAAe,EAAE,EAAE,CAAA;QACzD,CAAC;QAED,OAAO,gBAAgB,CAAA;IACzB,CAAC;IAED;;OAEG;IACK,wBAAwB;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;QAC9B,MAAM,iBAAiB,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAA;QAE9C,yCAAyC;QACzC,IAAI,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QAE/E,gDAAgD;QAChD,IAAI,iBAAiB,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,oBAAoB,GAAG,UAAU,GAAG,iBAAiB,CAAA;YAE3D,IAAI,oBAAoB,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,GAAG,GAAG,EAAE,CAAC;gBAClE,iDAAiD;gBACjD,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,gBAAiB,GAAG,CAAC,CAAC,CAAA;YACnE,CAAC;iBAAM,IAAI,oBAAoB,GAAG,IAAI,CAAC,MAAM,CAAC,oBAAoB,GAAG,GAAG,IAAI,iBAAiB,GAAG,CAAC,EAAE,CAAC;gBAClG,kDAAkD;gBAClD,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,gBAAiB,GAAG,CAAC,CAAC,CAAA;YAClE,CAAC;QACH,CAAC;QAED,IAAI,eAAe,KAAK,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;YACrD,OAAO,CAAC,GAAG,CAAC,kCAAkC,IAAI,CAAC,MAAM,CAAC,gBAAgB,MAAM,eAAe,EAAE,CAAC,CAAA;YAClG,IAAI,CAAC,MAAM,CAAC,gBAAgB,GAAG,eAAe,CAAA;QAChD,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,sBAAsB,CAClC,WAAmB,EACnB,WAGC;QAED,IAAI,WAAW,EAAE,YAAY,EAAE,CAAC;YAC9B,OAAO,WAAW,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAA;QACvE,CAAC;QAED,MAAM,aAAa,GAAG,WAAW,EAAE,aAAa,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QAErF,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,KAAK,UAAU,EAAE,CAAC;YACjD,2CAA2C;YAC3C,MAAM,SAAS,GAA4B,EAAE,CAAA;YAE7C,KAAK,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,EAAE,CAAC;gBACvE,IAAI,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC;oBAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;oBAC7E,SAAS,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CAAA;gBACzC,CAAC;YACH,CAAC;YAED,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACrC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;QAC5D,CAAC;QAED,+DAA+D;QAC/D,MAAM,eAAe,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAA;QAE1D,IAAI,eAAe,CAAC,MAAM,IAAI,aAAa,EAAE,CAAC;YAC5C,OAAO,eAAe,CAAA;QACxB,CAAC;QAED,uBAAuB;QACvB,MAAM,QAAQ,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAA;QACrE,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAA;IACzC,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,WAAmB,EAAE,MAAc;QAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAA;QAEzD,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACrB,QAAQ,CAAC,MAAM,GAAG;gBAChB,QAAQ,EAAE,CAAC,GAAG,MAAM,CAAC;gBACrB,MAAM,EAAE,CAAC;aACV,CAAA;YACD,OAAM;QACR,CAAC;QAED,yCAAyC;QACzC,MAAM,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAA;QACpC,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAA;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;QACvE,CAAC;QAED,gBAAgB;QAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QACxD,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;IACrE,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,cAAc,CAAC,WAAmB;QAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAClD,IAAI,CAAC,SAAS;YAAE,OAAM;QAEtB,OAAO,CAAC,GAAG,CAAC,uBAAuB,WAAW,SAAS,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QAEhF,6CAA6C;QAC7C,wEAAwE;QACxE,qCAAqC;QAErC,8DAA8D;QAC9D,iDAAiD;IACnD,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,GAAW;QAC5B,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAC9B,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAA;YAClC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAA,CAAC,4BAA4B;QACjD,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IAED;;OAEG;IACI,iBAAiB;QAMtB,MAAM,gBAAgB,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAA;QACpE,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;QAE5E,OAAO;YACL,eAAe,EAAE,gBAAgB,CAAC,MAAM;YACxC,UAAU;YACV,wBAAwB,EAAE,UAAU,GAAG,gBAAgB,CAAC,MAAM,IAAI,CAAC;YACnE,gBAAgB;SACjB,CAAA;IACH,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,UAAU,CAAC,EAAU;QAChC,0CAA0C;QAC1C,KAAK,MAAM,CAAC,WAAW,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC;YACjE,IAAI,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7B,kBAAkB;gBAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAE,CAAA;gBACzD,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,IAAI,EAAE,CAAA;gBACrC,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;OAEG;IACI,KAAK;QACV,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,SAAS,CAAC,KAAK,EAAE,CAAA;QACnB,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAA;QACvB,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAA;QAC9B,IAAI,CAAC,eAAe,GAAG,CAAC,CAAA;IAC1B,CAAC;IAED;;OAEG;IACI,IAAI;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAA;IACnG,CAAC;CACF"}