@soulcraft/brainy 0.24.0 → 0.26.0

package/dist/examples/basicUsage.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"basicUsage.js","sourceRoot":"","sources":["../../src/examples/basicUsage.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAE7C,iCAAiC;AACjC,MAAM,cAAc,GAAG;IACrB,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IACzB,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IACzB,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC1B,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC1B,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC3B,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC1B,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;IAC3B,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;CAC5B,CAAA;AAED,mBAAmB;AACnB,MAAM,QAAQ,GAAG;IACf,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,IAAI,EAAE;IAC3C,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,IAAI,EAAE;IAC3C,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;IAC3C,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;IAC3C,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE;IAC9C,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE;IAC7C,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;IAC5C,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;CAC7C,CAAA;AAED;;GAEG;AACH,KAAK,UAAU,UAAU;IACvB,OAAO,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAA;IAE9C,+BAA+B;IAC/B,MAAM,EAAE,GAAG,IAAI,UAAU,EAAE,CAAA;IAC3B,MAAM,EAAE,CAAC,IAAI,EAAE,CAAA;IAEf,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAA;IAEhD,8BAA8B;IAC9B,MAAM,GAAG,GAA2B,EAAE,CAAA;IACtC,MAAM,QAAQ,GAA4D;QACxE,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,IAAI,EAAE;QAC3C,GAAG,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,IAAI,EAAE;QAC3C,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;QAC3C,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;QAC3C,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE;QAC9C,IAAI,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,KAAK,EAAE;QAC7C,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;QAC5C,KAAK,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE;KAC7C,CAAA;IACD,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;QAC5D,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;QAEhD,OAAO,CAAC,GAAG,CAAC,UAAU,IAAI,cAAc,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACtD,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,kBAAkB,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;IAE1C,6BAA6B;IAC7B,OAAO,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAA;IAC1D,MAAM,UAAU,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;IAC5D,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACvB,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QAChC,MAAM,IAAI,GACR,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;QAC3E,OAAO,CAAC,GAAG,CACT,KAAK,IAAI,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,EACzD,MAAM,CAAC,QAAQ,EACf,GAAG,CACJ,CAAA;IACH,CAAC;IAED,6BAA6B;IAC7B,OAAO,CAAC,GAAG,CAAC,8CAA8C,CAAC,CAAA;IAC3D,MAAM,WAAW,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;IAC9D,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACvB,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,MAAM,IAAI,GACR,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;QAC3E,OAAO,CAAC,GAAG,CACT,KAAK,IAAI,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,EACzD,MAAM,CAAC,QAAQ,EACf,GAAG,CACJ,CAAA;IACH,CAAC;IAED,kBAAkB;IAClB,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAA;IAChD,MAAM,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;QACnC,GAAG,QAAQ,CAAC,MAAM,CAAC;QACnB,KAAK,EAAE,SAAS;KACjB,CAAC,CAAA;IAEF,2BAA2B;IAC3B,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;IACzC,OAAO,CAAC,GAAG,CAAC,wBAAwB,EAAE,OAAO,CAAC,CAAA;IAE9C,kBAAkB;IAClB,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAA;IACpC,MAAM,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAA;IAC7B,OAAO,CAAC,GAAG,CAAC,+BAA+B,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;IAEvD,uCAAuC;IACvC,OAAO,CAAC,GAAG,CAAC,6DAA6D,CAAC,CAAA;IAC1E,MAAM,wBAAwB,GAAG,MAAM,EAAE,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;IAC3E,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACvB,KAAK,MAAM,MAAM,IAAI,wBAAwB,EAAE,CAAC;QAC9C,MAAM,IAAI,GACR,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,SAAS,CAAA;QAC3E,OAAO,CAAC,GAAG,CACT,KAAK,IAAI,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa,EACzD,MAAM,CAAC,QAAQ,EACf,GAAG,CACJ,CAAA;IACH,CAAC;IAED,OAAO,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAA;AAClD,CAAC;AAED,qDAAqD;AACrD,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE,CAAC;IAClC,sBAAsB;IACtB,QAAQ,CAAC,gBAAgB,CAAC,kBAAkB,EAAE,GAAG,EAAE;QACjD,MAAM,MAAM,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAA;QAC/C,MAAM,CAAC,WAAW,GAAG,wBAAwB,CAAA;QAC7C,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,IAAI,EAAE;YAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAA;YAC5C,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;YAEjC,6CAA6C;YAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAA;YAC/B,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,EAAE;gBACxB,WAAW,CAAC,GAAG,IAAI,CAAC,CAAA;gBACpB,MAAM,CAAC,WAAW;oBAChB,IAAI;yBACD,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CACX,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAC7D;yBACA,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAA;YACvB,CAAC,CAAA;YAED,IAAI,CAAC;gBACH,MAAM,UAAU,EAAE,CAAA;YACpB,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,OAAO,CAAC,KAAK,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAA;YAChD,CAAC;YAED,sBAAsB;YACtB,OAAO,CAAC,GAAG,GAAG,WAAW,CAAA;QAC3B,CAAC,CAAC,CAAA;QAEF,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;IACnC,CAAC,CAAC,CAAA;AACJ,CAAC;KAAM,CAAC;IACN,sBAAsB;IACtB,UAAU,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;QAC3B,OAAO,CAAC,KAAK,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAA;IAChD,CAAC,CAAC,CAAA;AACJ,CAAC"}

package/dist/hnsw/hnswIndex.js

@@ -1,550 +0,0 @@
-/**
- * HNSW (Hierarchical Navigable Small World) Index implementation
- * Based on the paper: "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
- */
-import { euclideanDistance, calculateDistancesBatch } from '../utils/index.js';
-// Default HNSW parameters
-const DEFAULT_CONFIG = {
-    M: 16, // Max number of connections per noun
-    efConstruction: 200, // Size of a dynamic candidate list during construction
-    efSearch: 50, // Size of a dynamic candidate list during search
-    ml: 16 // Max level
-};
-export class HNSWIndex {
-    constructor(config = {}, distanceFunction = euclideanDistance, options = {}) {
-        this.nouns = new Map();
-        this.entryPointId = null;
-        this.maxLevel = 0;
-        this.dimension = null;
-        this.useParallelization = true; // Whether to use parallelization for performance-critical operations
-        this.config = { ...DEFAULT_CONFIG, ...config };
-        this.distanceFunction = distanceFunction;
-        this.useParallelization =
-            options.useParallelization !== undefined
-                ? options.useParallelization
-                : true;
-    }
-    /**
-     * Set whether to use parallelization for performance-critical operations
-     */
-    setUseParallelization(useParallelization) {
-        this.useParallelization = useParallelization;
-    }
-    /**
-     * Get whether parallelization is enabled
-     */
-    getUseParallelization() {
-        return this.useParallelization;
-    }
-    /**
-     * Calculate distances between a query vector and multiple vectors in parallel
-     * This is used to optimize performance for search operations
-     * Uses GPU acceleration when available for optimal performance
-     *
-     * @param queryVector The query vector
-     * @param vectors Array of vectors to compare against
-     * @returns Array of distances
-     */
-    async calculateDistancesInParallel(queryVector, vectors) {
-        // If parallelization is disabled or there are very few vectors, use sequential processing
-        if (!this.useParallelization || vectors.length < 10) {
-            return vectors.map((item) => ({
-                id: item.id,
-                distance: this.distanceFunction(queryVector, item.vector)
-            }));
-        }
-        try {
-            // Extract just the vectors from the input array
-            const vectorsOnly = vectors.map((item) => item.vector);
-            // Use GPU-accelerated distance calculation when possible
-            const distances = await calculateDistancesBatch(queryVector, vectorsOnly, this.distanceFunction);
-            // Map the distances back to their IDs
-            return vectors.map((item, index) => ({
-                id: item.id,
-                distance: distances[index]
-            }));
-        }
-        catch (error) {
-            console.error('Error in GPU-accelerated distance calculation, falling back to sequential processing:', error);
-            // Fall back to sequential processing if GPU acceleration fails
-            return vectors.map((item) => ({
-                id: item.id,
-                distance: this.distanceFunction(queryVector, item.vector)
-            }));
-        }
-    }
-    /**
-     * Add a vector to the index
-     */
-    async addItem(item) {
-        // Check if item is defined
-        if (!item) {
-            throw new Error('Item is undefined or null');
-        }
-        const { id, vector } = item;
-        // Check if vector is defined
-        if (!vector) {
-            throw new Error('Vector is undefined or null');
-        }
-        // Set dimension on first insert
-        if (this.dimension === null) {
-            this.dimension = vector.length;
-        }
-        else if (vector.length !== this.dimension) {
-            throw new Error(`Vector dimension mismatch: expected ${this.dimension}, got ${vector.length}`);
-        }
-        // Generate random level for this noun
-        const nounLevel = this.getRandomLevel();
-        // Create new noun
-        const noun = {
-            id,
-            vector,
-            connections: new Map()
-        };
-        // Initialize empty connection sets for each level
-        for (let level = 0; level <= nounLevel; level++) {
-            noun.connections.set(level, new Set());
-        }
-        // If this is the first noun, make it the entry point
-        if (this.nouns.size === 0) {
-            this.entryPointId = id;
-            this.maxLevel = nounLevel;
-            this.nouns.set(id, noun);
-            return id;
-        }
-        // Find entry point
-        if (!this.entryPointId) {
-            console.error('Entry point ID is null');
-            // If there's no entry point, this is the first noun, so we should have returned earlier
-            // This is a safety check
-            this.entryPointId = id;
-            this.maxLevel = nounLevel;
-            this.nouns.set(id, noun);
-            return id;
-        }
-        const entryPoint = this.nouns.get(this.entryPointId);
-        if (!entryPoint) {
-            console.error(`Entry point with ID ${this.entryPointId} not found`);
-            // If the entry point doesn't exist, treat this as the first noun
-            this.entryPointId = id;
-            this.maxLevel = nounLevel;
-            this.nouns.set(id, noun);
-            return id;
-        }
-        let currObj = entryPoint;
-        let currDist = this.distanceFunction(vector, entryPoint.vector);
-        // Traverse the graph from top to bottom to find the closest noun
-        for (let level = this.maxLevel; level > nounLevel; level--) {
-            let changed = true;
-            while (changed) {
-                changed = false;
-                // Check all neighbors at current level
-                const connections = currObj.connections.get(level) || new Set();
-                for (const neighborId of connections) {
-                    const neighbor = this.nouns.get(neighborId);
-                    if (!neighbor) {
-                        // Skip neighbors that don't exist (expected during rapid additions/deletions)
-                        continue;
-                    }
-                    const distToNeighbor = this.distanceFunction(vector, neighbor.vector);
-                    if (distToNeighbor < currDist) {
-                        currDist = distToNeighbor;
-                        currObj = neighbor;
-                        changed = true;
-                    }
-                }
-            }
-        }
-        // For each level from nounLevel down to 0
-        for (let level = Math.min(nounLevel, this.maxLevel); level >= 0; level--) {
-            // Find ef nearest elements using greedy search
-            const nearestNouns = await this.searchLayer(vector, currObj, this.config.efConstruction, level);
-            // Select M nearest neighbors
-            const neighbors = this.selectNeighbors(vector, nearestNouns, this.config.M);
-            // Add bidirectional connections
-            for (const [neighborId, _] of neighbors) {
-                const neighbor = this.nouns.get(neighborId);
-                if (!neighbor) {
-                    // Skip neighbors that don't exist (expected during rapid additions/deletions)
-                    continue;
-                }
-                noun.connections.get(level).add(neighborId);
-                // Add reverse connection
-                if (!neighbor.connections.has(level)) {
-                    neighbor.connections.set(level, new Set());
-                }
-                neighbor.connections.get(level).add(id);
-                // Ensure neighbor doesn't have too many connections
-                if (neighbor.connections.get(level).size > this.config.M) {
-                    this.pruneConnections(neighbor, level);
-                }
-            }
-            // Update entry point for the next level
-            if (nearestNouns.size > 0) {
-                const [nearestId, nearestDist] = [...nearestNouns][0];
-                if (nearestDist < currDist) {
-                    currDist = nearestDist;
-                    const nearestNoun = this.nouns.get(nearestId);
-                    if (!nearestNoun) {
-                        console.error(`Nearest noun with ID ${nearestId} not found in addItem`);
-                        // Keep the current object as is
-                    }
-                    else {
-                        currObj = nearestNoun;
-                    }
-                }
-            }
-        }
-        // Update max level and entry point if needed
-        if (nounLevel > this.maxLevel) {
-            this.maxLevel = nounLevel;
-            this.entryPointId = id;
-        }
-        // Add noun to the index
-        this.nouns.set(id, noun);
-        return id;
-    }
-    /**
-     * Search for nearest neighbors
-     */
-    async search(queryVector, k = 10) {
-        if (this.nouns.size === 0) {
-            return [];
-        }
-        // Check if query vector is defined
-        if (!queryVector) {
-            throw new Error('Query vector is undefined or null');
-        }
-        if (this.dimension !== null && queryVector.length !== this.dimension) {
-            throw new Error(`Query vector dimension mismatch: expected ${this.dimension}, got ${queryVector.length}`);
-        }
-        // Start from the entry point
-        if (!this.entryPointId) {
-            console.error('Entry point ID is null');
-            return [];
-        }
-        const entryPoint = this.nouns.get(this.entryPointId);
-        if (!entryPoint) {
-            console.error(`Entry point with ID ${this.entryPointId} not found`);
-            return [];
-        }
-        let currObj = entryPoint;
-        let currDist = this.distanceFunction(queryVector, currObj.vector);
-        // Traverse the graph from top to bottom to find the closest noun
-        for (let level = this.maxLevel; level > 0; level--) {
-            let changed = true;
-            while (changed) {
-                changed = false;
-                // Check all neighbors at current level
-                const connections = currObj.connections.get(level) || new Set();
-                // If we have enough connections, use parallel distance calculation
-                if (this.useParallelization && connections.size >= 10) {
-                    // Prepare vectors for parallel calculation
-                    const vectors = [];
-                    for (const neighborId of connections) {
-                        const neighbor = this.nouns.get(neighborId);
-                        if (!neighbor)
-                            continue;
-                        vectors.push({ id: neighborId, vector: neighbor.vector });
-                    }
-                    // Calculate distances in parallel
-                    const distances = await this.calculateDistancesInParallel(queryVector, vectors);
-                    // Find the closest neighbor
-                    for (const { id, distance } of distances) {
-                        if (distance < currDist) {
-                            currDist = distance;
-                            const neighbor = this.nouns.get(id);
-                            if (neighbor) {
-                                currObj = neighbor;
-                                changed = true;
-                            }
-                        }
-                    }
-                }
-                else {
-                    // Use sequential processing for small number of connections
-                    for (const neighborId of connections) {
-                        const neighbor = this.nouns.get(neighborId);
-                        if (!neighbor) {
-                            // Skip neighbors that don't exist (expected during rapid additions/deletions)
-                            continue;
-                        }
-                        const distToNeighbor = this.distanceFunction(queryVector, neighbor.vector);
-                        if (distToNeighbor < currDist) {
-                            currDist = distToNeighbor;
-                            currObj = neighbor;
-                            changed = true;
-                        }
-                    }
-                }
-            }
-        }
-        // Search at level 0 with ef = k
-        const nearestNouns = await this.searchLayer(queryVector, currObj, Math.max(this.config.efSearch, k), 0);
-        // Convert to array and sort by distance
-        return [...nearestNouns].slice(0, k);
-    }
-    /**
-     * Remove an item from the index
-     */
-    removeItem(id) {
-        if (!this.nouns.has(id)) {
-            return false;
-        }
-        const noun = this.nouns.get(id);
-        // Remove connections to this noun from all neighbors
-        for (const [level, connections] of noun.connections.entries()) {
-            for (const neighborId of connections) {
-                const neighbor = this.nouns.get(neighborId);
-                if (!neighbor) {
-                    // Skip neighbors that don't exist (expected during rapid additions/deletions)
-                    continue;
-                }
-                if (neighbor.connections.has(level)) {
-                    neighbor.connections.get(level).delete(id);
-                    // Prune connections after removing this noun to ensure consistency
-                    this.pruneConnections(neighbor, level);
-                }
-            }
-        }
-        // Also check all other nouns for references to this noun and remove them
-        for (const [nounId, otherNoun] of this.nouns.entries()) {
-            if (nounId === id)
-                continue; // Skip the noun being removed
-            for (const [level, connections] of otherNoun.connections.entries()) {
-                if (connections.has(id)) {
-                    connections.delete(id);
-                    // Prune connections after removing this reference
-                    this.pruneConnections(otherNoun, level);
-                }
-            }
-        }
-        // Remove the noun
-        this.nouns.delete(id);
-        // If we removed the entry point, find a new one
-        if (this.entryPointId === id) {
-            if (this.nouns.size === 0) {
-                this.entryPointId = null;
-                this.maxLevel = 0;
-            }
-            else {
-                // Find the noun with the highest level
-                let maxLevel = 0;
-                let newEntryPointId = null;
-                for (const [nounId, noun] of this.nouns.entries()) {
-                    if (noun.connections.size === 0)
-                        continue; // Skip nouns with no connections
-                    const nounLevel = Math.max(...noun.connections.keys());
-                    if (nounLevel >= maxLevel) {
-                        maxLevel = nounLevel;
-                        newEntryPointId = nounId;
-                    }
-                }
-                this.entryPointId = newEntryPointId;
-                this.maxLevel = maxLevel;
-            }
-        }
-        return true;
-    }
-    /**
-     * Get all nouns in the index
-     */
-    getNouns() {
-        return new Map(this.nouns);
-    }
-    /**
-     * Clear the index
-     */
-    clear() {
-        this.nouns.clear();
-        this.entryPointId = null;
-        this.maxLevel = 0;
-    }
-    /**
-     * Get the size of the index
-     */
-    size() {
-        return this.nouns.size;
-    }
-    /**
-     * Get the distance function used by the index
-     */
-    getDistanceFunction() {
-        return this.distanceFunction;
-    }
-    /**
-     * Get the entry point ID
-     */
-    getEntryPointId() {
-        return this.entryPointId;
-    }
-    /**
-     * Get the maximum level
-     */
-    getMaxLevel() {
-        return this.maxLevel;
-    }
-    /**
-     * Get the dimension
-     */
-    getDimension() {
-        return this.dimension;
-    }
-    /**
-     * Get the configuration
-     */
-    getConfig() {
-        return { ...this.config };
-    }
-    /**
-     * Search within a specific layer
-     * Returns a map of noun IDs to distances, sorted by distance
-     */
-    async searchLayer(queryVector, entryPoint, ef, level) {
-        // Set of visited nouns
-        const visited = new Set([entryPoint.id]);
-        // Priority queue of candidates (closest first)
-        const candidates = new Map();
-        candidates.set(entryPoint.id, this.distanceFunction(queryVector, entryPoint.vector));
-        // Priority queue of nearest neighbors found so far (closest first)
-        const nearest = new Map();
-        nearest.set(entryPoint.id, this.distanceFunction(queryVector, entryPoint.vector));
-        // While there are candidates to explore
-        while (candidates.size > 0) {
-            // Get closest candidate
-            const [closestId, closestDist] = [...candidates][0];
-            candidates.delete(closestId);
-            // If this candidate is farther than the farthest in our result set, we're done
-            const farthestInNearest = [...nearest][nearest.size - 1];
-            if (nearest.size >= ef && closestDist > farthestInNearest[1]) {
-                break;
-            }
-            // Explore neighbors of the closest candidate
-            const noun = this.nouns.get(closestId);
-            if (!noun) {
-                console.error(`Noun with ID ${closestId} not found in searchLayer`);
-                continue;
-            }
-            const connections = noun.connections.get(level) || new Set();
-            // If we have enough connections and parallelization is enabled, use parallel distance calculation
-            if (this.useParallelization && connections.size >= 10) {
-                // Collect unvisited neighbors
-                const unvisitedNeighbors = [];
-                for (const neighborId of connections) {
-                    if (!visited.has(neighborId)) {
-                        visited.add(neighborId);
-                        const neighbor = this.nouns.get(neighborId);
-                        if (!neighbor)
-                            continue;
-                        unvisitedNeighbors.push({ id: neighborId, vector: neighbor.vector });
-                    }
-                }
-                if (unvisitedNeighbors.length > 0) {
-                    // Calculate distances in parallel
-                    const distances = await this.calculateDistancesInParallel(queryVector, unvisitedNeighbors);
-                    // Process the results
-                    for (const { id, distance } of distances) {
-                        // If we haven't found ef nearest neighbors yet, or this neighbor is closer than the farthest one we've found
-                        if (nearest.size < ef || distance < farthestInNearest[1]) {
-                            candidates.set(id, distance);
-                            nearest.set(id, distance);
-                            // If we have more than ef neighbors, remove the farthest one
-                            if (nearest.size > ef) {
-                                const sortedNearest = [...nearest].sort((a, b) => a[1] - b[1]);
-                                nearest.clear();
-                                for (let i = 0; i < ef; i++) {
-                                    nearest.set(sortedNearest[i][0], sortedNearest[i][1]);
-                                }
-                            }
-                        }
-                    }
-                }
-            }
-            else {
-                // Use sequential processing for small number of connections
-                for (const neighborId of connections) {
-                    if (!visited.has(neighborId)) {
-                        visited.add(neighborId);
-                        const neighbor = this.nouns.get(neighborId);
-                        if (!neighbor) {
-                            // Skip neighbors that don't exist (expected during rapid additions/deletions)
-                            continue;
-                        }
-                        const distToNeighbor = this.distanceFunction(queryVector, neighbor.vector);
-                        // If we haven't found ef nearest neighbors yet, or this neighbor is closer than the farthest one we've found
-                        if (nearest.size < ef || distToNeighbor < farthestInNearest[1]) {
-                            candidates.set(neighborId, distToNeighbor);
-                            nearest.set(neighborId, distToNeighbor);
-                            // If we have more than ef neighbors, remove the farthest one
-                            if (nearest.size > ef) {
-                                const sortedNearest = [...nearest].sort((a, b) => a[1] - b[1]);
-                                nearest.clear();
-                                for (let i = 0; i < ef; i++) {
-                                    nearest.set(sortedNearest[i][0], sortedNearest[i][1]);
-                                }
-                            }
-                        }
-                    }
-                }
-            }
-        }
-        // Sort nearest by distance
-        return new Map([...nearest].sort((a, b) => a[1] - b[1]));
-    }
-    /**
-     * Select M nearest neighbors from the candidate set
-     */
-    selectNeighbors(queryVector, candidates, M) {
-        if (candidates.size <= M) {
-            return candidates;
-        }
-        // Simple heuristic: just take the M closest
-        const sortedCandidates = [...candidates].sort((a, b) => a[1] - b[1]);
-        const result = new Map();
-        for (let i = 0; i < Math.min(M, sortedCandidates.length); i++) {
-            result.set(sortedCandidates[i][0], sortedCandidates[i][1]);
-        }
-        return result;
-    }
-    /**
-     * Ensure a noun doesn't have too many connections at a given level
-     */
-    pruneConnections(noun, level) {
-        const connections = noun.connections.get(level);
-        if (connections.size <= this.config.M) {
-            return;
-        }
-        // Calculate distances to all neighbors
-        const distances = new Map();
-        const validNeighborIds = new Set();
-        for (const neighborId of connections) {
-            const neighbor = this.nouns.get(neighborId);
-            if (!neighbor) {
-                // Skip neighbors that don't exist (expected during rapid additions/deletions)
-                continue;
-            }
-            // Only add valid neighbors to the distances map
-            distances.set(neighborId, this.distanceFunction(noun.vector, neighbor.vector));
-            validNeighborIds.add(neighborId);
-        }
-        // Only proceed if we have valid neighbors
-        if (distances.size === 0) {
-            // If no valid neighbors, clear connections at this level
-            noun.connections.set(level, new Set());
-            return;
-        }
-        // Select M closest neighbors from valid ones
-        const selectedNeighbors = this.selectNeighbors(noun.vector, distances, this.config.M);
-        // Update connections with only valid neighbors
-        noun.connections.set(level, new Set(selectedNeighbors.keys()));
-    }
-    /**
-     * Generate a random level for a new noun
-     * Uses the same distribution as in the original HNSW paper
-     */
-    getRandomLevel() {
-        const r = Math.random();
-        return Math.floor(-Math.log(r) * (1.0 / Math.log(this.config.M)));
-    }
-}
-//# sourceMappingURL=hnswIndex.js.map

package/dist/hnsw/hnswIndex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hnswIndex.js","sourceRoot":"","sources":["../../src/hnsw/hnswIndex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,OAAO,EAAE,iBAAiB,EAAE,uBAAuB,EAAE,MAAM,mBAAmB,CAAA;AAG9E,0BAA0B;AAC1B,MAAM,cAAc,GAAe;IACjC,CAAC,EAAE,EAAE,EAAE,qCAAqC;IAC5C,cAAc,EAAE,GAAG,EAAE,uDAAuD;IAC5E,QAAQ,EAAE,EAAE,EAAE,iDAAiD;IAC/D,EAAE,EAAE,EAAE,CAAC,YAAY;CACpB,CAAA;AAED,MAAM,OAAO,SAAS;IASpB,YACE,SAA8B,EAAE,EAChC,mBAAqC,iBAAiB,EACtD,UAA4C,EAAE;QAXxC,UAAK,GAA0B,IAAI,GAAG,EAAE,CAAA;QACxC,iBAAY,GAAkB,IAAI,CAAA;QAClC,aAAQ,GAAG,CAAC,CAAA;QAGZ,cAAS,GAAkB,IAAI,CAAA;QAC/B,uBAAkB,GAAY,IAAI,CAAA,CAAC,qEAAqE;QAO9G,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAA;QAC9C,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAA;QACxC,IAAI,CAAC,kBAAkB;YACrB,OAAO,CAAC,kBAAkB,KAAK,SAAS;gBACtC,CAAC,CAAC,OAAO,CAAC,kBAAkB;gBAC5B,CAAC,CAAC,IAAI,CAAA;IACZ,CAAC;IAED;;OAEG;IACI,qBAAqB,CAAC,kBAA2B;QACtD,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAA;IAC9C,CAAC;IAED;;OAEG;IACI,qBAAqB;QAC1B,OAAO,IAAI,CAAC,kBAAkB,CAAA;IAChC,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,4BAA4B,CACxC,WAAmB,EACnB,OAA8C;QAE9C,0FAA0F;QAC1F,IAAI,CAAC,IAAI,CAAC,kBAAkB,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACpD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC5B,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC;aAC1D,CAAC,CAAC,CAAA;QACL,CAAC;QAED,IAAI,CAAC;YACH,gDAAgD;YAChD,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAEtD,yDAAyD;YACzD,MAAM,SAAS,GAAG,MAAM,uBAAuB,CAC7C,WAAW,EACX,WAAW,EACX,IAAI,CAAC,gBAAgB,CACtB,CAAA;YAED,sCAAsC;YACtC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;gBACnC,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,QAAQ,EAAE,SAAS,CAAC,KAAK,CAAC;aAC3B,CAAC,CAAC,CAAA;QACL,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CACX,uFAAuF,EACvF,KAAK,CACN,CAAA;YAED,+DAA+D;YAC/D,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC5B,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC;aAC1D,CAAC,CAAC,CAAA;QACL,CAAC;IACH,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,OAAO,CAAC,IAAoB;QACvC,2BAA2B;QAC3B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;QAC9C,CAAC;QAED,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,IAAI,CAAA;QAE3B,6BAA6B;QAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,6BAA6B,CAAC,CAAA;QAChD,CAAC;QAED,gCAAgC;QAChC,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;YAC5B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAA;QAChC,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YAC5C,MAAM,IAAI,KAAK,CACb,uCAAuC,IAAI,CAAC,SAAS,SAAS,MAAM,CAAC,MAAM,EAAE,CAC9E,CAAA;QACH,CAAC;QAED,sCAAsC;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,EAAE,CAAA;QAEvC,kBAAkB;QAClB,MAAM,IAAI,GAAa;YACrB,EAAE;YACF,MAAM;YACN,WAAW,EAAE,IAAI,GAAG,EAAE;SACvB,CAAA;QAED,kDAAkD;QAClD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAU,CAAC,CAAA;QAChD,CAAC;QAED,qDAAqD;QACrD,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,YAAY,GAAG,EAAE,CAAA;YACtB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAA;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;YACxB,OAAO,EAAE,CAAA;QACX,CAAC;QAED,mBAAmB;QACnB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,OAAO,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAA;YACvC,wFAAwF;YACxF,yBAAyB;YACzB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAA;YACtB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAA;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;YACxB,OAAO,EAAE,CAAA;QACX,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QACpD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,CAAC,KAAK,CAAC,uBAAuB,IAAI,CAAC,YAAY,YAAY,CAAC,CAAA;YACnE,iEAAiE;YACjE,IAAI,CAAC,YAAY,GAAG,EAAE,CAAA;YACtB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAA;YACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;YACxB,OAAO,EAAE,CAAA;QACX,CAAC;QAED,IAAI,OAAO,GAAG,UAAU,CAAA;QACxB,IAAI,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAA;QAE/D,iEAAiE;QACjE,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC;YAC3D,IAAI,OAAO,GAAG,IAAI,CAAA;YAClB,OAAO,OAAO,EAAE,CAAC;gBACf,OAAO,GAAG,KAAK,CAAA;gBAEf,uCAAuC;gBACvC,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAA;gBAEvE,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;oBAC3C,IAAI,CAAC,QAAQ,EAAE,CAAC;wBACd,8EAA8E;wBAC9E,SAAQ;oBACV,CAAC;oBACD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;oBAErE,IAAI,cAAc,GAAG,QAAQ,EAAE,CAAC;wBAC9B,QAAQ,GAAG,cAAc,CAAA;wBACzB,OAAO,GAAG,QAAQ,CAAA;wBAClB,OAAO,GAAG,IAAI,CAAA;oBAChB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACzE,+CAA+C;YAC/C,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,WAAW,CACzC,MAAM,EACN,OAAO,EACP,IAAI,CAAC,MAAM,CAAC,cAAc,EAC1B,KAAK,CACN,CAAA;YAED,6BAA6B;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CACpC,MAAM,EACN,YAAY,EACZ,IAAI,CAAC,MAAM,CAAC,CAAC,CACd,CAAA;YAED,gCAAgC;YAChC,KAAK,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,IAAI,SAAS,EAAE,CAAC;gBACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBAC3C,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,8EAA8E;oBAC9E,SAAQ;gBACV,CAAC;gBAED,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBAE5C,yBAAyB;gBACzB,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACrC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAU,CAAC,CAAA;gBACpD,CAAC;gBACD,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBAExC,oDAAoD;gBACpD,IAAI,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;oBAC1D,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;gBACxC,CAAC;YACH,CAAC;YAED,wCAAwC;YACxC,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;gBACrD,IAAI,WAAW,GAAG,QAAQ,EAAE,CAAC;oBAC3B,QAAQ,GAAG,WAAW,CAAA;oBACtB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;oBAC7C,IAAI,CAAC,WAAW,EAAE,CAAC;wBACjB,OAAO,CAAC,KAAK,CACX,wBAAwB,SAAS,uBAAuB,CACzD,CAAA;wBACD,gCAAgC;oBAClC,CAAC;yBAAM,CAAC;wBACN,OAAO,GAAG,WAAW,CAAA;oBACvB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAA;YACzB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAA;QACxB,CAAC;QAED,wBAAwB;QACxB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QACxB,OAAO,EAAE,CAAA;IACX,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,MAAM,CACjB,WAAmB,EACnB,IAAY,EAAE;QAEd,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,EAAE,CAAA;QACX,CAAC;QAED,mCAAmC;QACnC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAA;QACtD,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,WAAW,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YACrE,MAAM,IAAI,KAAK,CACb,6CAA6C,IAAI,CAAC,SAAS,SAAS,WAAW,CAAC,MAAM,EAAE,CACzF,CAAA;QACH,CAAC;QAED,6BAA6B;QAC7B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,OAAO,CAAC,KAAK,CAAC,wBAAwB,CAAC,CAAA;YACvC,OAAO,EAAE,CAAA;QACX,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QACpD,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO,CAAC,KAAK,CAAC,uBAAuB,IAAI,CAAC,YAAY,YAAY,CAAC,CAAA;YACnE,OAAO,EAAE,CAAA;QACX,CAAC;QAED,IAAI,OAAO,GAAG,UAAU,CAAA;QACxB,IAAI,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAA;QAEjE,iEAAiE;QACjE,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACnD,IAAI,OAAO,GAAG,IAAI,CAAA;YAClB,OAAO,OAAO,EAAE,CAAC;gBACf,OAAO,GAAG,KAAK,CAAA;gBAEf,uCAAuC;gBACvC,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAA;gBAEvE,mEAAmE;gBACnE,IAAI,IAAI,CAAC,kBAAkB,IAAI,WAAW,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;oBACtD,2CAA2C;oBAC3C,MAAM,OAAO,GAA0C,EAAE,CAAA;oBACzD,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;wBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;wBAC3C,IAAI,CAAC,QAAQ;4BAAE,SAAQ;wBACvB,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;oBAC3D,CAAC;oBAED,kCAAkC;oBAClC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,4BAA4B,CACvD,WAAW,EACX,OAAO,CACR,CAAA;oBAED,4BAA4B;oBAC5B,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;wBACzC,IAAI,QAAQ,GAAG,QAAQ,EAAE,CAAC;4BACxB,QAAQ,GAAG,QAAQ,CAAA;4BACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;4BACnC,IAAI,QAAQ,EAAE,CAAC;gCACb,OAAO,GAAG,QAAQ,CAAA;gCAClB,OAAO,GAAG,IAAI,CAAA;4BAChB,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,4DAA4D;oBAC5D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;wBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;wBAC3C,IAAI,CAAC,QAAQ,EAAE,CAAC;4BACd,8EAA8E;4BAC9E,SAAQ;wBACV,CAAC;wBACD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAC1C,WAAW,EACX,QAAQ,CAAC,MAAM,CAChB,CAAA;wBAED,IAAI,cAAc,GAAG,QAAQ,EAAE,CAAC;4BAC9B,QAAQ,GAAG,cAAc,CAAA;4BACzB,OAAO,GAAG,QAAQ,CAAA;4BAClB,OAAO,GAAG,IAAI,CAAA;wBAChB,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,WAAW,CACzC,WAAW,EACX,OAAO,EACP,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,EACjC,CAAC,CACF,CAAA;QAED,wCAAwC;QACxC,OAAO,CAAC,GAAG,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACtC,CAAC;IAED;;OAEG;IACI,UAAU,CAAC,EAAU;QAC1B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAA;QACd,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAA;QAEhC,qDAAqD;QACrD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBAC3C,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACd,8EAA8E;oBAC9E,SAAQ;gBACV,CAAC;gBACD,IAAI,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACpC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;oBAE3C,mEAAmE;oBACnE,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QAED,yEAAyE;QACzE,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACvD,IAAI,MAAM,KAAK,EAAE;gBAAE,SAAQ,CAAC,8BAA8B;YAE1D,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,SAAS,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;gBACnE,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBACxB,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;oBAEtB,kDAAkD;oBAClD,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAA;gBACzC,CAAC;YACH,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QAErB,gDAAgD;QAChD,IAAI,IAAI,CAAC,YAAY,KAAK,EAAE,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAA;gBACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;YACnB,CAAC;iBAAM,CAAC;gBACN,uCAAuC;gBACvC,IAAI,QAAQ,GAAG,CAAC,CAAA;gBAChB,IAAI,eAAe,GAAG,IAAI,CAAA;gBAE1B,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;oBAClD,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC;wBAAE,SAAQ,CAAC,iCAAiC;oBAE3E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAA;oBACtD,IAAI,SAAS,IAAI,QAAQ,EAAE,CAAC;wBAC1B,QAAQ,GAAG,SAAS,CAAA;wBACpB,eAAe,GAAG,MAAM,CAAA;oBAC1B,CAAC;gBACH,CAAC;gBAED,IAAI,CAAC,YAAY,GAAG,eAAe,CAAA;gBACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC5B,CAAC;IAED;;OAEG;IACI,KAAK;QACV,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAA;QACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;IACnB,CAAC;IAED;;OAEG;IACI,IAAI;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;IACxB,CAAC;IAED;;OAEG;IACI,mBAAmB;QACxB,OAAO,IAAI,CAAC,gBAAgB,CAAA;IAC9B,CAAC;IAED;;OAEG;IACI,eAAe;QACpB,OAAO,IAAI,CAAC,YAAY,CAAA;IAC1B,CAAC;IAED;;OAEG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAA;IACtB,CAAC;IAED;;OAEG;IACI,YAAY;QACjB,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED;;OAEG;IACI,SAAS;QACd,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAA;IAC3B,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,WAAW,CACvB,WAAmB,EACnB,UAAoB,EACpB,EAAU,EACV,KAAa;QAEb,uBAAuB;QACvB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAA;QAEhD,+CAA+C;QAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;QAC5C,UAAU,CAAC,GAAG,CACZ,UAAU,CAAC,EAAE,EACb,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,UAAU,CAAC,MAAM,CAAC,CACtD,CAAA;QAED,mEAAmE;QACnE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;QACzC,OAAO,CAAC,GAAG,CACT,UAAU,CAAC,EAAE,EACb,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,UAAU,CAAC,MAAM,CAAC,CACtD,CAAA;QAED,wCAAwC;QACxC,OAAO,UAAU,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,wBAAwB;YACxB,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;YACnD,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;YAE5B,+EAA+E;YAC/E,MAAM,iBAAiB,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAA;YACxD,IAAI,OAAO,CAAC,IAAI,IAAI,EAAE,IAAI,WAAW,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7D,MAAK;YACP,CAAC;YAED,6CAA6C;YAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YACtC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,CAAC,KAAK,CAAC,gBAAgB,SAAS,2BAA2B,CAAC,CAAA;gBACnE,SAAQ;YACV,CAAC;YACD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAA;YAEpE,kGAAkG;YAClG,IAAI,IAAI,CAAC,kBAAkB,IAAI,WAAW,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC;gBACtD,8BAA8B;gBAC9B,MAAM,kBAAkB,GAA0C,EAAE,CAAA;gBACpE,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;wBACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;wBAC3C,IAAI,CAAC,QAAQ;4BAAE,SAAQ;wBACvB,kBAAkB,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;oBACtE,CAAC;gBACH,CAAC;gBAED,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAClC,kCAAkC;oBAClC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,4BAA4B,CACvD,WAAW,EACX,kBAAkB,CACnB,CAAA;oBAED,sBAAsB;oBACtB,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,SAAS,EAAE,CAAC;wBACzC,6GAA6G;wBAC7G,IAAI,OAAO,CAAC,IAAI,GAAG,EAAE,IAAI,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;4BACzD,UAAU,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;4BAC5B,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;4BAEzB,6DAA6D;4BAC7D,IAAI,OAAO,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC;gCACtB,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gCAC9D,OAAO,CAAC,KAAK,EAAE,CAAA;gCACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;oCAC5B,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gCACvD,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,4DAA4D;gBAC5D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;wBAEvB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;wBAC3C,IAAI,CAAC,QAAQ,EAAE,CAAC;4BACd,8EAA8E;4BAC9E,SAAQ;wBACV,CAAC;wBACD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAC1C,WAAW,EACX,QAAQ,CAAC,MAAM,CAChB,CAAA;wBAED,6GAA6G;wBAC7G,IAAI,OAAO,CAAC,IAAI,GAAG,EAAE,IAAI,cAAc,GAAG,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;4BAC/D,UAAU,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAAA;4BAC1C,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE,cAAc,CAAC,CAAA;4BAEvC,6DAA6D;4BAC7D,IAAI,OAAO,CAAC,IAAI,GAAG,EAAE,EAAE,CAAC;gCACtB,MAAM,aAAa,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gCAC9D,OAAO,CAAC,KAAK,EAAE,CAAA;gCACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;oCAC5B,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gCACvD,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1D,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,WAAmB,EACnB,UAA+B,EAC/B,CAAS;QAET,IAAI,UAAU,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC;YACzB,OAAO,UAAU,CAAA;QACnB,CAAC;QAED,4CAA4C;QAC5C,MAAM,gBAAgB,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACpE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;QAExC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9D,MAAM,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5D,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,IAAc,EAAE,KAAa;QACpD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAE,CAAA;QAChD,IAAI,WAAW,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YACtC,OAAM;QACR,CAAC;QAED,uCAAuC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;QAC3C,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAU,CAAA;QAE1C,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;YAC3C,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,8EAA8E;gBAC9E,SAAQ;YACV,CAAC;YAED,gDAAgD;YAChD,SAAS,CAAC,GAAG,CACX,UAAU,EACV,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CACpD,CAAA;YACD,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QAClC,CAAC;QAED,0CAA0C;QAC1C,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACzB,yDAAyD;YACzD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;YACtC,OAAM;QACR,CAAC;QAED,6CAA6C;QAC7C,MAAM,iBAAiB,GAAG,IAAI,CAAC,eAAe,CAC5C,IAAI,CAAC,MAAM,EACX,SAAS,EACT,IAAI,CAAC,MAAM,CAAC,CAAC,CACd,CAAA;QAED,+CAA+C;QAC/C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IAChE,CAAC;IAED;;;OAGG;IACK,cAAc;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAA;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACnE,CAAC;CACF"}