@soulcraft/brainy 0.23.0 → 0.25.0

package/dist/hnsw/hnswIndexOptimized.js

@@ -1,441 +0,0 @@
-/**
- * Optimized HNSW (Hierarchical Navigable Small World) Index implementation
- * Extends the base HNSW implementation with support for large datasets
- * Uses product quantization for dimensionality reduction and disk-based storage when needed
- */
-import { HNSWIndex } from './hnswIndex.js';
-// Default configuration for the optimized HNSW index
-const DEFAULT_OPTIMIZED_CONFIG = {
-    M: 16,
-    efConstruction: 200,
-    efSearch: 50,
-    ml: 16,
-    memoryThreshold: 1024 * 1024 * 1024, // 1GB default threshold
-    productQuantization: {
-        enabled: false,
-        numSubvectors: 16,
-        numCentroids: 256
-    },
-    useDiskBasedIndex: false
-};
-/**
- * Product Quantization implementation
- * Reduces vector dimensionality by splitting vectors into subvectors
- * and quantizing each subvector to the nearest centroid
- */
-class ProductQuantizer {
-    constructor(numSubvectors = 16, numCentroids = 256) {
-        this.centroids = [];
-        this.subvectorSize = 0;
-        this.initialized = false;
-        this.dimension = 0;
-        this.numSubvectors = numSubvectors;
-        this.numCentroids = numCentroids;
-    }
-    /**
-     * Initialize the product quantizer with training data
-     * @param vectors Training vectors to use for learning centroids
-     */
-    train(vectors) {
-        if (vectors.length === 0) {
-            throw new Error('Cannot train product quantizer with empty vector set');
-        }
-        this.dimension = vectors[0].length;
-        this.subvectorSize = Math.ceil(this.dimension / this.numSubvectors);
-        // Initialize centroids for each subvector
-        for (let i = 0; i < this.numSubvectors; i++) {
-            // Extract subvectors from training data
-            const subvectors = vectors.map((vector) => {
-                const start = i * this.subvectorSize;
-                const end = Math.min(start + this.subvectorSize, this.dimension);
-                return vector.slice(start, end);
-            });
-            // Initialize centroids for this subvector using k-means++
-            this.centroids[i] = this.kMeansPlusPlus(subvectors, this.numCentroids);
-        }
-        this.initialized = true;
-    }
-    /**
-     * Quantize a vector using product quantization
-     * @param vector Vector to quantize
-     * @returns Array of centroid indices, one for each subvector
-     */
-    quantize(vector) {
-        if (!this.initialized) {
-            throw new Error('Product quantizer not initialized. Call train() first.');
-        }
-        if (vector.length !== this.dimension) {
-            throw new Error(`Vector dimension mismatch: expected ${this.dimension}, got ${vector.length}`);
-        }
-        const codes = [];
-        // Quantize each subvector
-        for (let i = 0; i < this.numSubvectors; i++) {
-            const start = i * this.subvectorSize;
-            const end = Math.min(start + this.subvectorSize, this.dimension);
-            const subvector = vector.slice(start, end);
-            // Find nearest centroid
-            let minDist = Number.MAX_VALUE;
-            let nearestCentroidIndex = 0;
-            for (let j = 0; j < this.centroids[i].length; j++) {
-                const centroid = this.centroids[i][j];
-                const dist = this.euclideanDistanceSquared(subvector, centroid);
-                if (dist < minDist) {
-                    minDist = dist;
-                    nearestCentroidIndex = j;
-                }
-            }
-            codes.push(nearestCentroidIndex);
-        }
-        return codes;
-    }
-    /**
-     * Reconstruct a vector from its quantized representation
-     * @param codes Array of centroid indices
-     * @returns Reconstructed vector
-     */
-    reconstruct(codes) {
-        if (!this.initialized) {
-            throw new Error('Product quantizer not initialized. Call train() first.');
-        }
-        if (codes.length !== this.numSubvectors) {
-            throw new Error(`Code length mismatch: expected ${this.numSubvectors}, got ${codes.length}`);
-        }
-        const reconstructed = [];
-        // Reconstruct each subvector
-        for (let i = 0; i < this.numSubvectors; i++) {
-            const centroidIndex = codes[i];
-            const centroid = this.centroids[i][centroidIndex];
-            // Add centroid components to reconstructed vector
-            for (const component of centroid) {
-                reconstructed.push(component);
-            }
-        }
-        // Trim to original dimension if needed
-        return reconstructed.slice(0, this.dimension);
-    }
-    /**
-     * Compute squared Euclidean distance between two vectors
-     * @param a First vector
-     * @param b Second vector
-     * @returns Squared Euclidean distance
-     */
-    euclideanDistanceSquared(a, b) {
-        let sum = 0;
-        const length = Math.min(a.length, b.length);
-        for (let i = 0; i < length; i++) {
-            const diff = a[i] - b[i];
-            sum += diff * diff;
-        }
-        return sum;
-    }
-    /**
-     * Implement k-means++ algorithm to initialize centroids
-     * @param vectors Vectors to cluster
-     * @param k Number of clusters
-     * @returns Array of centroids
-     */
-    kMeansPlusPlus(vectors, k) {
-        if (vectors.length < k) {
-            // If we have fewer vectors than centroids, use the vectors as centroids
-            return [...vectors];
-        }
-        const centroids = [];
-        // Choose first centroid randomly
-        const firstIndex = Math.floor(Math.random() * vectors.length);
-        centroids.push([...vectors[firstIndex]]);
-        // Choose remaining centroids
-        for (let i = 1; i < k; i++) {
-            // Compute distances to nearest centroid for each vector
-            const distances = vectors.map((vector) => {
-                let minDist = Number.MAX_VALUE;
-                for (const centroid of centroids) {
-                    const dist = this.euclideanDistanceSquared(vector, centroid);
-                    minDist = Math.min(minDist, dist);
-                }
-                return minDist;
-            });
-            // Compute sum of distances
-            const distSum = distances.reduce((sum, dist) => sum + dist, 0);
-            // Choose next centroid with probability proportional to distance
-            let r = Math.random() * distSum;
-            let nextIndex = 0;
-            for (let j = 0; j < distances.length; j++) {
-                r -= distances[j];
-                if (r <= 0) {
-                    nextIndex = j;
-                    break;
-                }
-            }
-            centroids.push([...vectors[nextIndex]]);
-        }
-        return centroids;
-    }
-    /**
-     * Get the centroids for each subvector
-     * @returns Array of centroid arrays
-     */
-    getCentroids() {
-        return this.centroids;
-    }
-    /**
-     * Set the centroids for each subvector
-     * @param centroids Array of centroid arrays
-     */
-    setCentroids(centroids) {
-        this.centroids = centroids;
-        this.numSubvectors = centroids.length;
-        this.numCentroids = centroids[0].length;
-        this.initialized = true;
-    }
-    /**
-     * Get the dimension of the vectors
-     * @returns Dimension
-     */
-    getDimension() {
-        return this.dimension;
-    }
-    /**
-     * Set the dimension of the vectors
-     * @param dimension Dimension
-     */
-    setDimension(dimension) {
-        this.dimension = dimension;
-        this.subvectorSize = Math.ceil(dimension / this.numSubvectors);
-    }
-}
-/**
- * Optimized HNSW Index implementation
- * Extends the base HNSW implementation with support for large datasets
- * Uses product quantization for dimensionality reduction and disk-based storage when needed
- */
-export class HNSWIndexOptimized extends HNSWIndex {
-    constructor(config = {}, distanceFunction, storage = null) {
-        // Initialize base HNSW index with standard config
-        super(config, distanceFunction);
-        this.productQuantizer = null;
-        this.storage = null;
-        this.useDiskBasedIndex = false;
-        this.useProductQuantization = false;
-        this.quantizedVectors = new Map();
-        this.memoryUsage = 0;
-        this.vectorCount = 0;
-        // Set optimized config
-        this.optimizedConfig = { ...DEFAULT_OPTIMIZED_CONFIG, ...config };
-        // Set storage adapter
-        this.storage = storage;
-        // Initialize product quantizer if enabled
-        if (this.optimizedConfig.productQuantization?.enabled) {
-            this.useProductQuantization = true;
-            this.productQuantizer = new ProductQuantizer(this.optimizedConfig.productQuantization.numSubvectors, this.optimizedConfig.productQuantization.numCentroids);
-        }
-        // Set disk-based index flag
-        this.useDiskBasedIndex = this.optimizedConfig.useDiskBasedIndex || false;
-    }
-    /**
-     * Add a vector to the index
-     * Uses product quantization if enabled and memory threshold is exceeded
-     */
-    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');
-        }
-        // Estimate memory usage for this vector
-        const vectorMemory = vector.length * 8; // 8 bytes per number (Float64)
-        const connectionsMemory = this.optimizedConfig.M * this.optimizedConfig.ml * 16; // Estimate for connections
-        const totalMemory = vectorMemory + connectionsMemory;
-        // Update memory usage estimate
-        this.memoryUsage += totalMemory;
-        this.vectorCount++;
-        // Check if we should switch to product quantization
-        if (this.useProductQuantization &&
-            this.memoryUsage > this.optimizedConfig.memoryThreshold &&
-            this.productQuantizer &&
-            !this.productQuantizer.getDimension()) {
-            // Initialize product quantizer with existing vectors
-            this.initializeProductQuantizer();
-        }
-        // If product quantization is active, quantize the vector
-        if (this.useProductQuantization &&
-            this.productQuantizer &&
-            this.productQuantizer.getDimension() > 0) {
-            // Quantize the vector
-            const codes = this.productQuantizer.quantize(vector);
-            // Store the quantized vector
-            this.quantizedVectors.set(id, codes);
-            // Reconstruct the vector for indexing
-            const reconstructedVector = this.productQuantizer.reconstruct(codes);
-            // Add the reconstructed vector to the index
-            return await super.addItem({ id, vector: reconstructedVector });
-        }
-        // If disk-based index is active and storage is available, store the vector
-        if (this.useDiskBasedIndex && this.storage) {
-            // Create a noun object
-            const noun = {
-                id,
-                vector,
-                connections: new Map()
-            };
-            // Store the noun
-            this.storage.saveNoun(noun).catch((error) => {
-                console.error(`Failed to save noun ${id} to storage:`, error);
-            });
-        }
-        // Add the vector to the in-memory index
-        return await super.addItem(item);
-    }
-    /**
-     * Search for nearest neighbors
-     * Uses product quantization if enabled
-     */
-    async search(queryVector, k = 10) {
-        // Check if query vector is defined
-        if (!queryVector) {
-            throw new Error('Query vector is undefined or null');
-        }
-        // If product quantization is active, quantize the query vector
-        if (this.useProductQuantization &&
-            this.productQuantizer &&
-            this.productQuantizer.getDimension() > 0) {
-            // Quantize the query vector
-            const codes = this.productQuantizer.quantize(queryVector);
-            // Reconstruct the query vector
-            const reconstructedVector = this.productQuantizer.reconstruct(codes);
-            // Search with the reconstructed vector
-            return await super.search(reconstructedVector, k);
-        }
-        // Otherwise, use the standard search
-        return await super.search(queryVector, k);
-    }
-    /**
-     * Remove an item from the index
-     */
-    removeItem(id) {
-        // If product quantization is active, remove the quantized vector
-        if (this.useProductQuantization) {
-            this.quantizedVectors.delete(id);
-        }
-        // If disk-based index is active and storage is available, remove the vector from storage
-        if (this.useDiskBasedIndex && this.storage) {
-            this.storage.deleteNoun(id).catch((error) => {
-                console.error(`Failed to delete noun ${id} from storage:`, error);
-            });
-        }
-        // Update memory usage estimate
-        if (this.vectorCount > 0) {
-            this.memoryUsage = Math.max(0, this.memoryUsage - this.memoryUsage / this.vectorCount);
-            this.vectorCount--;
-        }
-        // Remove the item from the in-memory index
-        return super.removeItem(id);
-    }
-    /**
-     * Clear the index
-     */
-    clear() {
-        // Clear product quantization data
-        if (this.useProductQuantization) {
-            this.quantizedVectors.clear();
-            this.productQuantizer = new ProductQuantizer(this.optimizedConfig.productQuantization.numSubvectors, this.optimizedConfig.productQuantization.numCentroids);
-        }
-        // Reset memory usage
-        this.memoryUsage = 0;
-        this.vectorCount = 0;
-        // Clear the in-memory index
-        super.clear();
-    }
-    /**
-     * Initialize product quantizer with existing vectors
-     */
-    initializeProductQuantizer() {
-        if (!this.productQuantizer) {
-            return;
-        }
-        // Get all vectors from the index
-        const nouns = super.getNouns();
-        const vectors = [];
-        // Extract vectors
-        for (const [_, noun] of nouns) {
-            vectors.push(noun.vector);
-        }
-        // Train the product quantizer
-        if (vectors.length > 0) {
-            this.productQuantizer.train(vectors);
-            // Quantize all existing vectors
-            for (const [id, noun] of nouns) {
-                const codes = this.productQuantizer.quantize(noun.vector);
-                this.quantizedVectors.set(id, codes);
-            }
-            console.log(`Initialized product quantizer with ${vectors.length} vectors`);
-        }
-    }
-    /**
-     * Get the product quantizer
-     * @returns Product quantizer or null if not enabled
-     */
-    getProductQuantizer() {
-        return this.productQuantizer;
-    }
-    /**
-     * Get the optimized configuration
-     * @returns Optimized configuration
-     */
-    getOptimizedConfig() {
-        return { ...this.optimizedConfig };
-    }
-    /**
-     * Get the estimated memory usage
-     * @returns Estimated memory usage in bytes
-     */
-    getMemoryUsage() {
-        return this.memoryUsage;
-    }
-    /**
-     * Set the storage adapter
-     * @param storage Storage adapter
-     */
-    setStorage(storage) {
-        this.storage = storage;
-    }
-    /**
-     * Get the storage adapter
-     * @returns Storage adapter or null if not set
-     */
-    getStorage() {
-        return this.storage;
-    }
-    /**
-     * Set whether to use disk-based index
-     * @param useDiskBasedIndex Whether to use disk-based index
-     */
-    setUseDiskBasedIndex(useDiskBasedIndex) {
-        this.useDiskBasedIndex = useDiskBasedIndex;
-    }
-    /**
-     * Get whether disk-based index is used
-     * @returns Whether disk-based index is used
-     */
-    getUseDiskBasedIndex() {
-        return this.useDiskBasedIndex;
-    }
-    /**
-     * Set whether to use product quantization
-     * @param useProductQuantization Whether to use product quantization
-     */
-    setUseProductQuantization(useProductQuantization) {
-        this.useProductQuantization = useProductQuantization;
-    }
-    /**
-     * Get whether product quantization is used
-     * @returns Whether product quantization is used
-     */
-    getUseProductQuantization() {
-        return this.useProductQuantization;
-    }
-}
-//# sourceMappingURL=hnswIndexOptimized.js.map

package/dist/hnsw/hnswIndexOptimized.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hnswIndexOptimized.js","sourceRoot":"","sources":["../../src/hnsw/hnswIndexOptimized.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AASH,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAsB1C,qDAAqD;AACrD,MAAM,wBAAwB,GAAwB;IACpD,CAAC,EAAE,EAAE;IACL,cAAc,EAAE,GAAG;IACnB,QAAQ,EAAE,EAAE;IACZ,EAAE,EAAE,EAAE;IACN,eAAe,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,wBAAwB;IAC7D,mBAAmB,EAAE;QACnB,OAAO,EAAE,KAAK;QACd,aAAa,EAAE,EAAE;QACjB,YAAY,EAAE,GAAG;KAClB;IACD,iBAAiB,EAAE,KAAK;CACzB,CAAA;AAED;;;;GAIG;AACH,MAAM,gBAAgB;IAQpB,YAAY,gBAAwB,EAAE,EAAE,eAAuB,GAAG;QAL1D,cAAS,GAAe,EAAE,CAAA;QAC1B,kBAAa,GAAW,CAAC,CAAA;QACzB,gBAAW,GAAY,KAAK,CAAA;QAC5B,cAAS,GAAW,CAAC,CAAA;QAG3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAA;QAClC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,OAAiB;QAC5B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAA;QACzE,CAAC;QAED,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;QAClC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,CAAA;QAEnE,0CAA0C;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,wCAAwC;YACxC,MAAM,UAAU,GAAa,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;gBAClD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAA;gBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;gBAChE,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;YACjC,CAAC,CAAC,CAAA;YAEF,0DAA0D;YAC1D,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,IAAI,CAAC,YAAY,CAAC,CAAA;QACxE,CAAC;QAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAA;IACzB,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,MAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAA;QAC3E,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CACb,uCAAuC,IAAI,CAAC,SAAS,SAAS,MAAM,CAAC,MAAM,EAAE,CAC9E,CAAA;QACH,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAA;QAE1B,0BAA0B;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAA;YACpC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;YAChE,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;YAE1C,wBAAwB;YACxB,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,CAAA;YAC9B,IAAI,oBAAoB,GAAG,CAAC,CAAA;YAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACrC,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;gBAE/D,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAA;oBACd,oBAAoB,GAAG,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAA;QAClC,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,KAAe;QAChC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAA;QAC3E,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CACb,kCAAkC,IAAI,CAAC,aAAa,SAAS,KAAK,CAAC,MAAM,EAAE,CAC5E,CAAA;QACH,CAAC;QAED,MAAM,aAAa,GAAW,EAAE,CAAA;QAEhC,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAA;YAEjD,kDAAkD;YAClD,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE,CAAC;gBACjC,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;IAC/C,CAAC;IAED;;;;;OAKG;IACK,wBAAwB,CAAC,CAAS,EAAE,CAAS;QACnD,IAAI,GAAG,GAAG,CAAC,CAAA;QACX,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;QAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;YACxB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAA;QACpB,CAAC;QAED,OAAO,GAAG,CAAA;IACZ,CAAC;IAED;;;;;OAKG;IACK,cAAc,CAAC,OAAiB,EAAE,CAAS;QACjD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,wEAAwE;YACxE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAA;QACrB,CAAC;QAED,MAAM,SAAS,GAAa,EAAE,CAAA;QAE9B,iCAAiC;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAA;QAC7D,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QAExC,6BAA6B;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,wDAAwD;YACxD,MAAM,SAAS,GAAa,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;gBACjD,IAAI,OAAO,GAAG,MAAM,CAAC,SAAS,CAAA;gBAE9B,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;oBAC5D,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;gBACnC,CAAC;gBAED,OAAO,OAAO,CAAA;YAChB,CAAC,CAAC,CAAA;YAEF,2BAA2B;YAC3B,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC,CAAC,CAAA;YAE9D,iEAAiE;YACjE,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAA;YAC/B,IAAI,SAAS,GAAG,CAAC,CAAA;YAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAA;gBACjB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACX,SAAS,GAAG,CAAC,CAAA;oBACb,MAAK;gBACP,CAAC;YACH,CAAC;YAED,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QACzC,CAAC;QAED,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;;OAGG;IACI,YAAY;QACjB,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,SAAqB;QACvC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;QAC1B,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC,MAAM,CAAA;QACrC,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;QACvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAA;IACzB,CAAC;IAED;;;OAGG;IACI,YAAY;QACjB,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,SAAiB;QACnC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;QAC1B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,CAAA;IAChE,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,kBAAmB,SAAQ,SAAS;IAU/C,YACE,SAAuC,EAAE,EACzC,gBAAkC,EAClC,UAAiC,IAAI;QAErC,kDAAkD;QAClD,KAAK,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAA;QAdzB,qBAAgB,GAA4B,IAAI,CAAA;QAChD,YAAO,GAA0B,IAAI,CAAA;QACrC,sBAAiB,GAAY,KAAK,CAAA;QAClC,2BAAsB,GAAY,KAAK,CAAA;QACvC,qBAAgB,GAA0B,IAAI,GAAG,EAAE,CAAA;QACnD,gBAAW,GAAW,CAAC,CAAA;QACvB,gBAAW,GAAW,CAAC,CAAA;QAU7B,uBAAuB;QACvB,IAAI,CAAC,eAAe,GAAG,EAAE,GAAG,wBAAwB,EAAE,GAAG,MAAM,EAAE,CAAA;QAEjE,sBAAsB;QACtB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAEtB,0CAA0C;QAC1C,IAAI,IAAI,CAAC,eAAe,CAAC,mBAAmB,EAAE,OAAO,EAAE,CAAC;YACtD,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAA;YAClC,IAAI,CAAC,gBAAgB,GAAG,IAAI,gBAAgB,CAC1C,IAAI,CAAC,eAAe,CAAC,mBAAmB,CAAC,aAAa,EACtD,IAAI,CAAC,eAAe,CAAC,mBAAmB,CAAC,YAAY,CACtD,CAAA;QACH,CAAC;QAED,4BAA4B;QAC5B,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,eAAe,CAAC,iBAAiB,IAAI,KAAK,CAAA;IAC1E,CAAC;IAED;;;OAGG;IACa,KAAK,CAAC,OAAO,CAAC,IAAoB;QAChD,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,wCAAwC;QACxC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA,CAAC,+BAA+B;QACtE,MAAM,iBAAiB,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,GAAG,EAAE,CAAA,CAAC,2BAA2B;QAC3G,MAAM,WAAW,GAAG,YAAY,GAAG,iBAAiB,CAAA;QAEpD,+BAA+B;QAC/B,IAAI,CAAC,WAAW,IAAI,WAAW,CAAA;QAC/B,IAAI,CAAC,WAAW,EAAE,CAAA;QAElB,oDAAoD;QACpD,IACE,IAAI,CAAC,sBAAsB;YAC3B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,eAAgB;YACxD,IAAI,CAAC,gBAAgB;YACrB,CAAC,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,EACrC,CAAC;YACD,qDAAqD;YACrD,IAAI,CAAC,0BAA0B,EAAE,CAAA;QACnC,CAAC;QAED,yDAAyD;QACzD,IACE,IAAI,CAAC,sBAAsB;YAC3B,IAAI,CAAC,gBAAgB;YACrB,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,GAAG,CAAC,EACxC,CAAC;YACD,sBAAsB;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAA;YAEpD,6BAA6B;YAC7B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YAEpC,sCAAsC;YACtC,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;YAEpE,4CAA4C;YAC5C,OAAO,MAAM,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,mBAAmB,EAAE,CAAC,CAAA;QACjE,CAAC;QAED,2EAA2E;QAC3E,IAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC3C,uBAAuB;YACvB,MAAM,IAAI,GAAa;gBACrB,EAAE;gBACF,MAAM;gBACN,WAAW,EAAE,IAAI,GAAG,EAAE;aACvB,CAAA;YAED,iBAAiB;YACjB,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC1C,OAAO,CAAC,KAAK,CAAC,uBAAuB,EAAE,cAAc,EAAE,KAAK,CAAC,CAAA;YAC/D,CAAC,CAAC,CAAA;QACJ,CAAC;QAED,wCAAwC;QACxC,OAAO,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;IAClC,CAAC;IAED;;;OAGG;IACa,KAAK,CAAC,MAAM,CAC1B,WAAmB,EACnB,IAAY,EAAE;QAEd,mCAAmC;QACnC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAA;QACtD,CAAC;QAED,+DAA+D;QAC/D,IACE,IAAI,CAAC,sBAAsB;YAC3B,IAAI,CAAC,gBAAgB;YACrB,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,GAAG,CAAC,EACxC,CAAC;YACD,4BAA4B;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAA;YAEzD,+BAA+B;YAC/B,MAAM,mBAAmB,GAAG,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,KAAK,CAAC,CAAA;YAEpE,uCAAuC;YACvC,OAAO,MAAM,KAAK,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAA;QACnD,CAAC;QAED,qCAAqC;QACrC,OAAO,MAAM,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAA;IAC3C,CAAC;IAED;;OAEG;IACa,UAAU,CAAC,EAAU;QACnC,iEAAiE;QACjE,IAAI,IAAI,CAAC,sBAAsB,EAAE,CAAC;YAChC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QAClC,CAAC;QAED,yFAAyF;QACzF,IAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC1C,OAAO,CAAC,KAAK,CAAC,yBAAyB,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAA;YACnE,CAAC,CAAC,CAAA;QACJ,CAAC;QAED,+BAA+B;QAC/B,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CACzB,CAAC,EACD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CACvD,CAAA;YACD,IAAI,CAAC,WAAW,EAAE,CAAA;QACpB,CAAC;QAED,2CAA2C;QAC3C,OAAO,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;IAC7B,CAAC;IAED;;OAEG;IACa,KAAK;QACnB,kCAAkC;QAClC,IAAI,IAAI,CAAC,sBAAsB,EAAE,CAAC;YAChC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAA;YAC7B,IAAI,CAAC,gBAAgB,GAAG,IAAI,gBAAgB,CAC1C,IAAI,CAAC,eAAe,CAAC,mBAAoB,CAAC,aAAa,EACvD,IAAI,CAAC,eAAe,CAAC,mBAAoB,CAAC,YAAY,CACvD,CAAA;QACH,CAAC;QAED,qBAAqB;QACrB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAA;QACpB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAA;QAEpB,4BAA4B;QAC5B,KAAK,CAAC,KAAK,EAAE,CAAA;IACf,CAAC;IAED;;OAEG;IACK,0BAA0B;QAChC,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC3B,OAAM;QACR,CAAC;QAED,iCAAiC;QACjC,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAA;QAC9B,MAAM,OAAO,GAAa,EAAE,CAAA;QAE5B,kBAAkB;QAClB,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QAC3B,CAAC;QAED,8BAA8B;QAC9B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;YAEpC,gCAAgC;YAChC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;gBAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACzD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;YACtC,CAAC;YAED,OAAO,CAAC,GAAG,CACT,sCAAsC,OAAO,CAAC,MAAM,UAAU,CAC/D,CAAA;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACI,mBAAmB;QACxB,OAAO,IAAI,CAAC,gBAAgB,CAAA;IAC9B,CAAC;IAED;;;OAGG;IACI,kBAAkB;QACvB,OAAO,EAAE,GAAG,IAAI,CAAC,eAAe,EAAE,CAAA;IACpC,CAAC;IAED;;;OAGG;IACI,cAAc;QACnB,OAAO,IAAI,CAAC,WAAW,CAAA;IACzB,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,OAAuB;QACvC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IACxB,CAAC;IAED;;;OAGG;IACI,UAAU;QACf,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED;;;OAGG;IACI,oBAAoB,CAAC,iBAA0B;QACpD,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;IAC5C,CAAC;IAED;;;OAGG;IACI,oBAAoB;QACzB,OAAO,IAAI,CAAC,iBAAiB,CAAA;IAC/B,CAAC;IAED;;;OAGG;IACI,yBAAyB,CAAC,sBAA+B;QAC9D,IAAI,CAAC,sBAAsB,GAAG,sBAAsB,CAAA;IACtD,CAAC;IAED;;;OAGG;IACI,yBAAyB;QAC9B,OAAO,IAAI,CAAC,sBAAsB,CAAA;IACpC,CAAC;CACF"}

package/dist/mcp/brainyMCPAdapter.js

@@ -1,142 +0,0 @@
-/**
- * BrainyMCPAdapter
- *
- * This class provides an adapter for accessing Brainy data through the Model Control Protocol (MCP).
- * It wraps a BrainyData instance and exposes methods for getting vectors, searching similar items,
- * and getting relationships.
- */
-import { v4 as uuidv4 } from 'uuid';
-import { MCP_VERSION } from '../types/mcpTypes.js';
-export class BrainyMCPAdapter {
-    /**
-     * Creates a new BrainyMCPAdapter
-     * @param brainyData The BrainyData instance to wrap
-     */
-    constructor(brainyData) {
-        this.brainyData = brainyData;
-    }
-    /**
-     * Handles an MCP data access request
-     * @param request The MCP request
-     * @returns An MCP response
-     */
-    async handleRequest(request) {
-        try {
-            switch (request.operation) {
-                case 'get':
-                    return await this.handleGetRequest(request);
-                case 'search':
-                    return await this.handleSearchRequest(request);
-                case 'add':
-                    return await this.handleAddRequest(request);
-                case 'getRelationships':
-                    return await this.handleGetRelationshipsRequest(request);
-                default:
-                    return this.createErrorResponse(request.requestId, 'UNSUPPORTED_OPERATION', `Operation ${request.operation} is not supported`);
-            }
-        }
-        catch (error) {
-            return this.createErrorResponse(request.requestId, 'INTERNAL_ERROR', error instanceof Error ? error.message : String(error));
-        }
-    }
-    /**
-     * Handles a get request
-     * @param request The MCP request
-     * @returns An MCP response
-     */
-    async handleGetRequest(request) {
-        const { id } = request.parameters;
-        if (!id) {
-            return this.createErrorResponse(request.requestId, 'MISSING_PARAMETER', 'Parameter "id" is required');
-        }
-        const noun = await this.brainyData.get(id);
-        if (!noun) {
-            return this.createErrorResponse(request.requestId, 'NOT_FOUND', `No noun found with id ${id}`);
-        }
-        return this.createSuccessResponse(request.requestId, noun);
-    }
-    /**
-     * Handles a search request
-     * @param request The MCP request
-     * @returns An MCP response
-     */
-    async handleSearchRequest(request) {
-        const { query, k = 10 } = request.parameters;
-        if (!query) {
-            return this.createErrorResponse(request.requestId, 'MISSING_PARAMETER', 'Parameter "query" is required');
-        }
-        const results = await this.brainyData.searchText(query, k);
-        return this.createSuccessResponse(request.requestId, results);
-    }
-    /**
-     * Handles an add request
-     * @param request The MCP request
-     * @returns An MCP response
-     */
-    async handleAddRequest(request) {
-        const { text, metadata } = request.parameters;
-        if (!text) {
-            return this.createErrorResponse(request.requestId, 'MISSING_PARAMETER', 'Parameter "text" is required');
-        }
-        const id = await this.brainyData.add(text, metadata);
-        return this.createSuccessResponse(request.requestId, { id });
-    }
-    /**
-     * Handles a getRelationships request
-     * @param request The MCP request
-     * @returns An MCP response
-     */
-    async handleGetRelationshipsRequest(request) {
-        const { id } = request.parameters;
-        if (!id) {
-            return this.createErrorResponse(request.requestId, 'MISSING_PARAMETER', 'Parameter "id" is required');
-        }
-        // This is a simplified implementation - in a real implementation, we would
-        // need to check if these methods exist on the BrainyDataInterface
-        const outgoing = await this.brainyData.getVerbsBySource?.(id) || [];
-        const incoming = await this.brainyData.getVerbsByTarget?.(id) || [];
-        return this.createSuccessResponse(request.requestId, { outgoing, incoming });
-    }
-    /**
-     * Creates a success response
-     * @param requestId The request ID
-     * @param data The response data
-     * @returns An MCP response
-     */
-    createSuccessResponse(requestId, data) {
-        return {
-            success: true,
-            requestId,
-            version: MCP_VERSION,
-            data
-        };
-    }
-    /**
-     * Creates an error response
-     * @param requestId The request ID
-     * @param code The error code
-     * @param message The error message
-     * @param details Optional error details
-     * @returns An MCP response
-     */
-    createErrorResponse(requestId, code, message, details) {
-        return {
-            success: false,
-            requestId,
-            version: MCP_VERSION,
-            error: {
-                code,
-                message,
-                details
-            }
-        };
-    }
-    /**
-     * Creates a new request ID
-     * @returns A new UUID
-     */
-    generateRequestId() {
-        return uuidv4();
-    }
-}
-//# sourceMappingURL=brainyMCPAdapter.js.map

package/dist/mcp/brainyMCPAdapter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"brainyMCPAdapter.js","sourceRoot":"","sources":["../../src/mcp/brainyMCPAdapter.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAA;AAEnC,OAAO,EAKL,WAAW,EACZ,MAAM,sBAAsB,CAAA;AAE7B,MAAM,OAAO,gBAAgB;IAG3B;;;OAGG;IACH,YAAY,UAA+B;QACzC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAA;IAC9B,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,aAAa,CAAC,OAA6B;QAC/C,IAAI,CAAC;YACH,QAAQ,OAAO,CAAC,SAAS,EAAE,CAAC;gBAC1B,KAAK,KAAK;oBACR,OAAO,MAAM,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAA;gBAC7C,KAAK,QAAQ;oBACX,OAAO,MAAM,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAA;gBAChD,KAAK,KAAK;oBACR,OAAO,MAAM,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAA;gBAC7C,KAAK,kBAAkB;oBACrB,OAAO,MAAM,IAAI,CAAC,6BAA6B,CAAC,OAAO,CAAC,CAAA;gBAC1D;oBACE,OAAO,IAAI,CAAC,mBAAmB,CAC7B,OAAO,CAAC,SAAS,EACjB,uBAAuB,EACvB,aAAa,OAAO,CAAC,SAAS,mBAAmB,CAClD,CAAA;YACL,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,IAAI,CAAC,mBAAmB,CAC7B,OAAO,CAAC,SAAS,EACjB,gBAAgB,EAChB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CACvD,CAAA;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,gBAAgB,CAAC,OAA6B;QAC1D,MAAM,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,UAAU,CAAA;QAEjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,OAAO,IAAI,CAAC,mBAAmB,CAC7B,OAAO,CAAC,SAAS,EACjB,mBAAmB,EACnB,4BAA4B,CAC7B,CAAA;QACH,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAE1C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC,mBAAmB,CAC7B,OAAO,CAAC,SAAS,EACjB,WAAW,EACX,yBAAyB,EAAE,EAAE,CAC9B,CAAA;QACH,CAAC;QAED,OAAO,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,CAAC,CAAA;IAC5D,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,mBAAmB,CAAC,OAA6B;QAC7D,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC,UAAU,CAAA;QAE5C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,mBAAmB,CAC7B,OAAO,CAAC,SAAS,EACjB,mBAAmB,EACnB,+BAA+B,CAChC,CAAA;QACH,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;QAC1D,OAAO,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;IAC/D,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,gBAAgB,CAAC,OAA6B;QAC1D,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,UAAU,CAAA;QAE7C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,IAAI,CAAC,mBAAmB,CAC7B,OAAO,CAAC,SAAS,EACjB,mBAAmB,EACnB,8BAA8B,CAC/B,CAAA;QACH,CAAC;QAED,MAAM,EAAE,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QACpD,OAAO,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC9D,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,6BAA6B,CAAC,OAA6B;QACvE,MAAM,EAAE,EAAE,EAAE,GAAG,OAAO,CAAC,UAAU,CAAA;QAEjC,IAAI,CAAC,EAAE,EAAE,CAAC;YACR,OAAO,IAAI,CAAC,mBAAmB,CAC7B,OAAO,CAAC,SAAS,EACjB,mBAAmB,EACnB,4BAA4B,CAC7B,CAAA;QACH,CAAC;QAED,2EAA2E;QAC3E,kEAAkE;QAClE,MAAM,QAAQ,GAAG,MAAO,IAAI,CAAC,UAAkB,CAAC,gBAAgB,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QAC5E,MAAM,QAAQ,GAAG,MAAO,IAAI,CAAC,UAAkB,CAAC,gBAAgB,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAA;QAE5E,OAAO,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAA;IAC9E,CAAC;IAED;;;;;OAKG;IACK,qBAAqB,CAAC,SAAiB,EAAE,IAAS;QACxD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,SAAS;YACT,OAAO,EAAE,WAAW;YACpB,IAAI;SACL,CAAA;IACH,CAAC;IAED;;;;;;;OAOG;IACK,mBAAmB,CACzB,SAAiB,EACjB,IAAY,EACZ,OAAe,EACf,OAAa;QAEb,OAAO;YACL,OAAO,EAAE,KAAK;YACd,SAAS;YACT,OAAO,EAAE,WAAW;YACpB,KAAK,EAAE;gBACL,IAAI;gBACJ,OAAO;gBACP,OAAO;aACR;SACF,CAAA;IACH,CAAC;IAED;;;OAGG;IACH,iBAAiB;QACf,OAAO,MAAM,EAAE,CAAA;IACjB,CAAC;CACF"}