@danielsimonjr/memoryjs 1.0.0

package/dist/search/ParallelSearchExecutor.d.ts

@@ -0,0 +1,172 @@
+/**
+ * Parallel Search Executor
+ *
+ * Phase 12 Sprint 2: Executes search layers (semantic, lexical, symbolic)
+ * concurrently using Promise.all with graceful fallback on failures.
+ *
+ * @module search/ParallelSearchExecutor
+ */
+import type { ReadonlyKnowledgeGraph, SymbolicFilters } from '../types/index.js';
+import type { SemanticSearch } from './SemanticSearch.js';
+import type { RankedSearch } from './RankedSearch.js';
+/**
+ * Timing information for a search layer.
+ */
+export interface LayerTiming {
+    /** Layer identifier */
+    layer: 'semantic' | 'lexical' | 'symbolic';
+    /** Start timestamp */
+    startTime: number;
+    /** End timestamp */
+    endTime: number;
+    /** Duration in milliseconds */
+    durationMs: number;
+    /** Whether the layer succeeded */
+    success: boolean;
+    /** Error message if failed */
+    error?: string;
+    /** Number of results returned */
+    resultCount: number;
+}
+/**
+ * Result from parallel search execution with timing metadata.
+ */
+export interface ParallelSearchResult {
+    /** Semantic search results: entity name -> similarity score */
+    semanticResults: Map<string, number>;
+    /** Lexical search results: entity name -> normalized score */
+    lexicalResults: Map<string, number>;
+    /** Symbolic search results: entity name -> filter match score */
+    symbolicResults: Map<string, number>;
+    /** Timing information for each layer */
+    timings: LayerTiming[];
+    /** Total execution time in milliseconds */
+    totalTimeMs: number;
+    /** Whether all layers succeeded */
+    allSucceeded: boolean;
+    /** Summary of failed layers */
+    failedLayers: string[];
+}
+/**
+ * Options for parallel search execution.
+ */
+export interface ParallelSearchOptions {
+    /** Semantic search options */
+    semantic?: {
+        minSimilarity?: number;
+        topK?: number;
+    };
+    /** Lexical search options */
+    lexical?: {
+        useStopwords?: boolean;
+        useStemming?: boolean;
+    };
+    /** Symbolic filter criteria */
+    symbolic?: SymbolicFilters;
+    /** Maximum results per layer */
+    limit?: number;
+    /** Timeout per layer in milliseconds (default: 30000) */
+    timeoutMs?: number;
+}
+/**
+ * ParallelSearchExecutor - Execute search layers concurrently
+ *
+ * Orchestrates parallel execution of semantic, lexical, and symbolic search
+ * layers using Promise.all. Provides:
+ * - Concurrent execution for improved latency
+ * - Per-layer timing metadata
+ * - Graceful fallback on individual layer failures
+ * - Layer-specific error isolation
+ *
+ * @example
+ * ```typescript
+ * const executor = new ParallelSearchExecutor(semanticSearch, rankedSearch);
+ *
+ * const result = await executor.execute(graph, 'machine learning', {
+ *   semantic: { minSimilarity: 0.5 },
+ *   symbolic: { tags: ['ai'] }
+ * });
+ *
+ * console.log(`Total time: ${result.totalTimeMs}ms`);
+ * for (const timing of result.timings) {
+ *   console.log(`${timing.layer}: ${timing.durationMs}ms, ${timing.resultCount} results`);
+ * }
+ * ```
+ */
+export declare class ParallelSearchExecutor {
+    private semanticSearch;
+    private rankedSearch;
+    private symbolicSearch;
+    constructor(semanticSearch: SemanticSearch | null, rankedSearch: RankedSearch);
+    /**
+     * Execute all search layers in parallel.
+     *
+     * @param graph - Knowledge graph to search
+     * @param query - Search query text
+     * @param options - Search options for each layer
+     * @returns Parallel search results with timing metadata
+     */
+    execute(graph: ReadonlyKnowledgeGraph, query: string, options?: ParallelSearchOptions): Promise<ParallelSearchResult>;
+    /**
+     * Execute semantic search layer with timing.
+     */
+    private executeSemanticLayer;
+    /**
+     * Execute lexical search layer (TF-IDF/BM25) with timing.
+     */
+    private executeLexicalLayer;
+    /**
+     * Execute symbolic search layer with timing.
+     */
+    private executeSymbolicLayer;
+    /**
+     * Create a timeout promise.
+     */
+    private createTimeout;
+    /**
+     * Execute a single layer independently.
+     *
+     * @param layer - Layer to execute
+     * @param graph - Knowledge graph
+     * @param query - Search query
+     * @param options - Layer-specific options
+     * @returns Layer results with timing
+     */
+    executeLayer(layer: 'semantic' | 'lexical' | 'symbolic', graph: ReadonlyKnowledgeGraph, query: string, options?: ParallelSearchOptions): Promise<{
+        results: Map<string, number>;
+        timing: LayerTiming;
+    }>;
+    /**
+     * Execute only specific layers in parallel.
+     *
+     * @param layers - Layers to execute
+     * @param graph - Knowledge graph
+     * @param query - Search query
+     * @param options - Search options
+     * @returns Partial results for requested layers
+     */
+    executeSelectedLayers(layers: Array<'semantic' | 'lexical' | 'symbolic'>, graph: ReadonlyKnowledgeGraph, query: string, options?: ParallelSearchOptions): Promise<{
+        results: Map<'semantic' | 'lexical' | 'symbolic', Map<string, number>>;
+        timings: LayerTiming[];
+        totalTimeMs: number;
+    }>;
+    /**
+     * Get timing summary from results.
+     *
+     * @param timings - Array of layer timings
+     * @returns Formatted timing summary
+     */
+    static formatTimingSummary(timings: LayerTiming[]): string;
+    /**
+     * Calculate potential speedup from parallel execution.
+     *
+     * @param timings - Array of layer timings
+     * @returns Speedup metrics
+     */
+    static calculateSpeedup(timings: LayerTiming[]): {
+        sequentialTime: number;
+        parallelTime: number;
+        speedup: number;
+    };
+}
+//# sourceMappingURL=ParallelSearchExecutor.d.ts.map

package/dist/search/ParallelSearchExecutor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ParallelSearchExecutor.d.ts","sourceRoot":"","sources":["../../src/search/ParallelSearchExecutor.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAEV,sBAAsB,EACtB,eAAe,EAChB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAItD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,uBAAuB;IACvB,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,UAAU,CAAC;IAC3C,sBAAsB;IACtB,SAAS,EAAE,MAAM,CAAC;IAClB,oBAAoB;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,+BAA+B;IAC/B,UAAU,EAAE,MAAM,CAAC;IACnB,kCAAkC;IAClC,OAAO,EAAE,OAAO,CAAC;IACjB,8BAA8B;IAC9B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iCAAiC;IACjC,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,+DAA+D;IAC/D,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrC,8DAA8D;IAC9D,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,iEAAiE;IACjE,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACrC,wCAAwC;IACxC,OAAO,EAAE,WAAW,EAAE,CAAC;IACvB,2CAA2C;IAC3C,WAAW,EAAE,MAAM,CAAC;IACpB,mCAAmC;IACnC,YAAY,EAAE,OAAO,CAAC;IACtB,+BAA+B;IAC/B,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,8BAA8B;IAC9B,QAAQ,CAAC,EAAE;QACT,aAAa,CAAC,EAAE,MAAM,CAAC;QACvB,IAAI,CAAC,EAAE,MAAM,CAAC;KACf,CAAC;IACF,6BAA6B;IAC7B,OAAO,CAAC,EAAE;QACR,YAAY,CAAC,EAAE,OAAO,CAAC;QACvB,WAAW,CAAC,EAAE,OAAO,CAAC;KACvB,CAAC;IACF,+BAA+B;IAC/B,QAAQ,CAAC,EAAE,eAAe,CAAC;IAC3B,gCAAgC;IAChC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,yDAAyD;IACzD,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,qBAAa,sBAAsB;IAI/B,OAAO,CAAC,cAAc;IACtB,OAAO,CAAC,YAAY;IAJtB,OAAO,CAAC,cAAc,CAAiB;gBAG7B,cAAc,EAAE,cAAc,GAAG,IAAI,EACrC,YAAY,EAAE,YAAY;IAKpC;;;;;;;OAOG;IACG,OAAO,CACX,KAAK,EAAE,sBAAsB,EAC7B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,qBAA0B,GAClC,OAAO,CAAC,oBAAoB,CAAC;IA2ChC;;OAEG;YACW,oBAAoB;IA+DlC;;OAEG;YACW,mBAAmB;IAkDjC;;OAEG;YACW,oBAAoB;IA4ClC;;OAEG;IACH,OAAO,CAAC,aAAa;IAMrB;;;;;;;;OAQG;IACG,YAAY,CAChB,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,UAAU,EAC1C,KAAK,EAAE,sBAAsB,EAC7B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,qBAA0B,GAClC,OAAO,CAAC;QAAE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAAC,MAAM,EAAE,WAAW,CAAA;KAAE,CAAC;IA6BjE;;;;;;;;OAQG;IACG,qBAAqB,CACzB,MAAM,EAAE,KAAK,CAAC,UAAU,GAAG,SAAS,GAAG,UAAU,CAAC,EAClD,KAAK,EAAE,sBAAsB,EAC7B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,qBAA0B,GAClC,OAAO,CAAC;QACT,OAAO,EAAE,GAAG,CAAC,UAAU,GAAG,SAAS,GAAG,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QACvE,OAAO,EAAE,WAAW,EAAE,CAAC;QACvB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;IA0BF;;;;;OAKG;IACH,MAAM,CAAC,mBAAmB,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG,MAAM;IAsB1D;;;;;OAKG;IACH,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,WAAW,EAAE,GAAG;QAC/C,cAAc,EAAE,MAAM,CAAC;QACvB,YAAY,EAAE,MAAM,CAAC;QACrB,OAAO,EAAE,MAAM,CAAC;KACjB;CAOF"}

package/dist/search/ParallelSearchExecutor.js

@@ -0,0 +1,310 @@
+/**
+ * Parallel Search Executor
+ *
+ * Phase 12 Sprint 2: Executes search layers (semantic, lexical, symbolic)
+ * concurrently using Promise.all with graceful fallback on failures.
+ *
+ * @module search/ParallelSearchExecutor
+ */
+import { SymbolicSearch } from './SymbolicSearch.js';
+import { SEMANTIC_SEARCH_LIMITS } from '../utils/constants.js';
+/**
+ * ParallelSearchExecutor - Execute search layers concurrently
+ *
+ * Orchestrates parallel execution of semantic, lexical, and symbolic search
+ * layers using Promise.all. Provides:
+ * - Concurrent execution for improved latency
+ * - Per-layer timing metadata
+ * - Graceful fallback on individual layer failures
+ * - Layer-specific error isolation
+ *
+ * @example
+ * ```typescript
+ * const executor = new ParallelSearchExecutor(semanticSearch, rankedSearch);
+ *
+ * const result = await executor.execute(graph, 'machine learning', {
+ *   semantic: { minSimilarity: 0.5 },
+ *   symbolic: { tags: ['ai'] }
+ * });
+ *
+ * console.log(`Total time: ${result.totalTimeMs}ms`);
+ * for (const timing of result.timings) {
+ *   console.log(`${timing.layer}: ${timing.durationMs}ms, ${timing.resultCount} results`);
+ * }
+ * ```
+ */
+export class ParallelSearchExecutor {
+    semanticSearch;
+    rankedSearch;
+    symbolicSearch;
+    constructor(semanticSearch, rankedSearch) {
+        this.semanticSearch = semanticSearch;
+        this.rankedSearch = rankedSearch;
+        this.symbolicSearch = new SymbolicSearch();
+    }
+    /**
+     * Execute all search layers in parallel.
+     *
+     * @param graph - Knowledge graph to search
+     * @param query - Search query text
+     * @param options - Search options for each layer
+     * @returns Parallel search results with timing metadata
+     */
+    async execute(graph, query, options = {}) {
+        const { semantic = {}, lexical = {}, symbolic = {}, limit = SEMANTIC_SEARCH_LIMITS.DEFAULT_LIMIT, timeoutMs = 30000, } = options;
+        const overallStart = Date.now();
+        const timings = [];
+        const failedLayers = [];
+        // Execute all three layers in parallel
+        const [semanticResult, lexicalResult, symbolicResult] = await Promise.all([
+            this.executeSemanticLayer(graph, query, semantic, limit * 2, timeoutMs),
+            this.executeLexicalLayer(query, lexical, limit * 2, timeoutMs),
+            this.executeSymbolicLayer(graph.entities, symbolic, timeoutMs),
+        ]);
+        // Collect timing information
+        timings.push(semanticResult.timing);
+        timings.push(lexicalResult.timing);
+        timings.push(symbolicResult.timing);
+        // Track failed layers
+        if (!semanticResult.timing.success)
+            failedLayers.push('semantic');
+        if (!lexicalResult.timing.success)
+            failedLayers.push('lexical');
+        if (!symbolicResult.timing.success)
+            failedLayers.push('symbolic');
+        const totalTimeMs = Date.now() - overallStart;
+        return {
+            semanticResults: semanticResult.results,
+            lexicalResults: lexicalResult.results,
+            symbolicResults: symbolicResult.results,
+            timings,
+            totalTimeMs,
+            allSucceeded: failedLayers.length === 0,
+            failedLayers,
+        };
+    }
+    /**
+     * Execute semantic search layer with timing.
+     */
+    async executeSemanticLayer(graph, query, options, limit, _timeoutMs) {
+        const startTime = Date.now();
+        const results = new Map();
+        let success = true;
+        let error;
+        if (!this.semanticSearch) {
+            // Semantic search not available - treat as graceful degradation
+            return {
+                results,
+                timing: {
+                    layer: 'semantic',
+                    startTime,
+                    endTime: Date.now(),
+                    durationMs: Date.now() - startTime,
+                    success: true, // Not an error, just not configured
+                    resultCount: 0,
+                },
+            };
+        }
+        try {
+            // Execute semantic search with timeout
+            const semanticResults = await Promise.race([
+                this.semanticSearch.search(graph, query, options.topK ?? limit, options.minSimilarity ?? 0),
+                this.createTimeout(_timeoutMs, 'Semantic search timeout'),
+            ]);
+            for (const result of semanticResults) {
+                results.set(result.entity.name, result.similarity);
+            }
+        }
+        catch (err) {
+            success = false;
+            error = err instanceof Error ? err.message : String(err);
+        }
+        const endTime = Date.now();
+        return {
+            results,
+            timing: {
+                layer: 'semantic',
+                startTime,
+                endTime,
+                durationMs: endTime - startTime,
+                success,
+                error,
+                resultCount: results.size,
+            },
+        };
+    }
+    /**
+     * Execute lexical search layer (TF-IDF/BM25) with timing.
+     */
+    async executeLexicalLayer(query, _options, limit, _timeoutMs) {
+        const startTime = Date.now();
+        const results = new Map();
+        let success = true;
+        let error;
+        try {
+            // Execute lexical search with timeout
+            const lexicalResults = await Promise.race([
+                this.rankedSearch.searchNodesRanked(query, undefined, // tags
+                undefined, // minImportance
+                undefined, // maxImportance
+                limit),
+                this.createTimeout(_timeoutMs, 'Lexical search timeout'),
+            ]);
+            // Normalize scores to 0-1 range
+            const maxScore = Math.max(...lexicalResults.map(r => r.score), 1);
+            for (const result of lexicalResults) {
+                results.set(result.entity.name, result.score / maxScore);
+            }
+        }
+        catch (err) {
+            success = false;
+            error = err instanceof Error ? err.message : String(err);
+        }
+        const endTime = Date.now();
+        return {
+            results,
+            timing: {
+                layer: 'lexical',
+                startTime,
+                endTime,
+                durationMs: endTime - startTime,
+                success,
+                error,
+                resultCount: results.size,
+            },
+        };
+    }
+    /**
+     * Execute symbolic search layer with timing.
+     */
+    async executeSymbolicLayer(entities, filters, _timeoutMs) {
+        const startTime = Date.now();
+        const results = new Map();
+        let success = true;
+        let error;
+        try {
+            // Symbolic search is synchronous but wrap for consistency
+            if (!filters || Object.keys(filters).length === 0) {
+                // No filters - give all entities base score
+                for (const entity of entities) {
+                    results.set(entity.name, 0.5);
+                }
+            }
+            else {
+                const symbolicResults = this.symbolicSearch.search(entities, filters);
+                for (const result of symbolicResults) {
+                    results.set(result.entity.name, result.score);
+                }
+            }
+        }
+        catch (err) {
+            success = false;
+            error = err instanceof Error ? err.message : String(err);
+        }
+        const endTime = Date.now();
+        return {
+            results,
+            timing: {
+                layer: 'symbolic',
+                startTime,
+                endTime,
+                durationMs: endTime - startTime,
+                success,
+                error,
+                resultCount: results.size,
+            },
+        };
+    }
+    /**
+     * Create a timeout promise.
+     */
+    createTimeout(ms, message) {
+        return new Promise((_, reject) => {
+            setTimeout(() => reject(new Error(message)), ms);
+        });
+    }
+    /**
+     * Execute a single layer independently.
+     *
+     * @param layer - Layer to execute
+     * @param graph - Knowledge graph
+     * @param query - Search query
+     * @param options - Layer-specific options
+     * @returns Layer results with timing
+     */
+    async executeLayer(layer, graph, query, options = {}) {
+        const limit = options.limit ?? SEMANTIC_SEARCH_LIMITS.DEFAULT_LIMIT;
+        const timeoutMs = options.timeoutMs ?? 30000;
+        switch (layer) {
+            case 'semantic':
+                return this.executeSemanticLayer(graph, query, options.semantic ?? {}, limit * 2, timeoutMs);
+            case 'lexical':
+                return this.executeLexicalLayer(query, options.lexical ?? {}, limit * 2, timeoutMs);
+            case 'symbolic':
+                return this.executeSymbolicLayer(graph.entities, options.symbolic, timeoutMs);
+        }
+    }
+    /**
+     * Execute only specific layers in parallel.
+     *
+     * @param layers - Layers to execute
+     * @param graph - Knowledge graph
+     * @param query - Search query
+     * @param options - Search options
+     * @returns Partial results for requested layers
+     */
+    async executeSelectedLayers(layers, graph, query, options = {}) {
+        const overallStart = Date.now();
+        const results = new Map();
+        const timings = [];
+        const layerPromises = layers.map(layer => this.executeLayer(layer, graph, query, options).then(result => ({
+            layer,
+            ...result,
+        })));
+        const layerExecutionResults = await Promise.all(layerPromises);
+        for (const { layer, results: layerData, timing } of layerExecutionResults) {
+            results.set(layer, layerData);
+            timings.push(timing);
+        }
+        return {
+            results,
+            timings,
+            totalTimeMs: Date.now() - overallStart,
+        };
+    }
+    /**
+     * Get timing summary from results.
+     *
+     * @param timings - Array of layer timings
+     * @returns Formatted timing summary
+     */
+    static formatTimingSummary(timings) {
+        const lines = [];
+        let totalTime = 0;
+        let maxTime = 0;
+        for (const timing of timings) {
+            const status = timing.success ? 'OK' : `FAILED: ${timing.error}`;
+            lines.push(`  ${timing.layer}: ${timing.durationMs}ms (${timing.resultCount} results) [${status}]`);
+            totalTime += timing.durationMs;
+            maxTime = Math.max(maxTime, timing.durationMs);
+        }
+        lines.unshift('Search Layer Timings:');
+        lines.push(`  Total (sequential): ${totalTime}ms`);
+        lines.push(`  Max (parallel bottleneck): ${maxTime}ms`);
+        lines.push(`  Speedup: ${(totalTime / maxTime).toFixed(2)}x`);
+        return lines.join('\n');
+    }
+    /**
+     * Calculate potential speedup from parallel execution.
+     *
+     * @param timings - Array of layer timings
+     * @returns Speedup metrics
+     */
+    static calculateSpeedup(timings) {
+        const sequentialTime = timings.reduce((sum, t) => sum + t.durationMs, 0);
+        const parallelTime = Math.max(...timings.map(t => t.durationMs));
+        const speedup = sequentialTime / parallelTime;
+        return { sequentialTime, parallelTime, speedup };
+    }
+}
+//# sourceMappingURL=ParallelSearchExecutor.js.map

package/dist/search/ParallelSearchExecutor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ParallelSearchExecutor.js","sourceRoot":"","sources":["../../src/search/ParallelSearchExecutor.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AASH,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AAgE/D;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,OAAO,sBAAsB;IAIvB;IACA;IAJF,cAAc,CAAiB;IAEvC,YACU,cAAqC,EACrC,YAA0B;QAD1B,mBAAc,GAAd,cAAc,CAAuB;QACrC,iBAAY,GAAZ,YAAY,CAAc;QAElC,IAAI,CAAC,cAAc,GAAG,IAAI,cAAc,EAAE,CAAC;IAC7C,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,OAAO,CACX,KAA6B,EAC7B,KAAa,EACb,UAAiC,EAAE;QAEnC,MAAM,EACJ,QAAQ,GAAG,EAAE,EACb,OAAO,GAAG,EAAE,EACZ,QAAQ,GAAG,EAAE,EACb,KAAK,GAAG,sBAAsB,CAAC,aAAa,EAC5C,SAAS,GAAG,KAAK,GAClB,GAAG,OAAO,CAAC;QAEZ,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,uCAAuC;QACvC,MAAM,CAAC,cAAc,EAAE,aAAa,EAAE,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACxE,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC;YACvE,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC;YAC9D,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC;SAC/D,CAAC,CAAC;QAEH,6BAA6B;QAC7B,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACpC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAEpC,sBAAsB;QACtB,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,OAAO;YAAE,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO;YAAE,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,OAAO;YAAE,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAElE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC;QAE9C,OAAO;YACL,eAAe,EAAE,cAAc,CAAC,OAAO;YACvC,cAAc,EAAE,aAAa,CAAC,OAAO;YACrC,eAAe,EAAE,cAAc,CAAC,OAAO;YACvC,OAAO;YACP,WAAW;YACX,YAAY,EAAE,YAAY,CAAC,MAAM,KAAK,CAAC;YACvC,YAAY;SACb,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAChC,KAA6B,EAC7B,KAAa,EACb,OAAkD,EAClD,KAAa,EACb,UAAkB;QAElB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,KAAyB,CAAC;QAE9B,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,gEAAgE;YAChE,OAAO;gBACL,OAAO;gBACP,MAAM,EAAE;oBACN,KAAK,EAAE,UAAU;oBACjB,SAAS;oBACT,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;oBACnB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;oBAClC,OAAO,EAAE,IAAI,EAAE,oCAAoC;oBACnD,WAAW,EAAE,CAAC;iBACf;aACF,CAAC;QACJ,CAAC;QAED,IAAI,CAAC;YACH,uCAAuC;YACvC,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC;gBACzC,IAAI,CAAC,cAAc,CAAC,MAAM,CACxB,KAAK,EACL,KAAK,EACL,OAAO,CAAC,IAAI,IAAI,KAAK,EACrB,OAAO,CAAC,aAAa,IAAI,CAAC,CAC3B;gBACD,IAAI,CAAC,aAAa,CAAQ,UAAU,EAAE,yBAAyB,CAAC;aACjE,CAAC,CAAC;YAEH,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;gBACrC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,OAAO;YACL,OAAO;YACP,MAAM,EAAE;gBACN,KAAK,EAAE,UAAU;gBACjB,SAAS;gBACT,OAAO;gBACP,UAAU,EAAE,OAAO,GAAG,SAAS;gBAC/B,OAAO;gBACP,KAAK;gBACL,WAAW,EAAE,OAAO,CAAC,IAAI;aAC1B;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,mBAAmB,CAC/B,KAAa,EACb,QAA2D,EAC3D,KAAa,EACb,UAAkB;QAElB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,KAAyB,CAAC;QAE9B,IAAI,CAAC;YACH,sCAAsC;YACtC,MAAM,cAAc,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC;gBACxC,IAAI,CAAC,YAAY,CAAC,iBAAiB,CACjC,KAAK,EACL,SAAS,EAAE,OAAO;gBAClB,SAAS,EAAE,gBAAgB;gBAC3B,SAAS,EAAE,gBAAgB;gBAC3B,KAAK,CACN;gBACD,IAAI,CAAC,aAAa,CAAQ,UAAU,EAAE,wBAAwB,CAAC;aAChE,CAAC,CAAC;YAEH,gCAAgC;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;YAClE,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;gBACpC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,OAAO;YACL,OAAO;YACP,MAAM,EAAE;gBACN,KAAK,EAAE,SAAS;gBAChB,SAAS;gBACT,OAAO;gBACP,UAAU,EAAE,OAAO,GAAG,SAAS;gBAC/B,OAAO;gBACP,KAAK;gBACL,WAAW,EAAE,OAAO,CAAC,IAAI;aAC1B;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAChC,QAA2B,EAC3B,OAAoC,EACpC,UAAkB;QAElB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE1C,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,KAAyB,CAAC;QAE9B,IAAI,CAAC;YACH,0DAA0D;YAC1D,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAClD,4CAA4C;gBAC5C,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBACtE,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;oBACrC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChD,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,GAAG,KAAK,CAAC;YAChB,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,OAAO;YACL,OAAO;YACP,MAAM,EAAE;gBACN,KAAK,EAAE,UAAU;gBACjB,SAAS;gBACT,OAAO;gBACP,UAAU,EAAE,OAAO,GAAG,SAAS;gBAC/B,OAAO;gBACP,KAAK;gBACL,WAAW,EAAE,OAAO,CAAC,IAAI;aAC1B;SACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,aAAa,CAAI,EAAU,EAAE,OAAe;QAClD,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;YAC/B,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,YAAY,CAChB,KAA0C,EAC1C,KAA6B,EAC7B,KAAa,EACb,UAAiC,EAAE;QAEnC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,sBAAsB,CAAC,aAAa,CAAC;QACpE,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC;QAE7C,QAAQ,KAAK,EAAE,CAAC;YACd,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,oBAAoB,CAC9B,KAAK,EACL,KAAK,EACL,OAAO,CAAC,QAAQ,IAAI,EAAE,EACtB,KAAK,GAAG,CAAC,EACT,SAAS,CACV,CAAC;YACJ,KAAK,SAAS;gBACZ,OAAO,IAAI,CAAC,mBAAmB,CAC7B,KAAK,EACL,OAAO,CAAC,OAAO,IAAI,EAAE,EACrB,KAAK,GAAG,CAAC,EACT,SAAS,CACV,CAAC;YACJ,KAAK,UAAU;gBACb,OAAO,IAAI,CAAC,oBAAoB,CAC9B,KAAK,CAAC,QAAQ,EACd,OAAO,CAAC,QAAQ,EAChB,SAAS,CACV,CAAC;QACN,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,qBAAqB,CACzB,MAAkD,EAClD,KAA6B,EAC7B,KAAa,EACb,UAAiC,EAAE;QAMnC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4D,CAAC;QACpF,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CACvC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC9D,KAAK;YACL,GAAG,MAAM;SACV,CAAC,CAAC,CACJ,CAAC;QAEF,MAAM,qBAAqB,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAE/D,KAAK,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,qBAAqB,EAAE,CAAC;YAC1E,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,CAAC;QAED,OAAO;YACL,OAAO;YACP,OAAO;YACP,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,YAAY;SACvC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,mBAAmB,CAAC,OAAsB;QAC/C,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,MAAM,CAAC,KAAK,EAAE,CAAC;YACjE,KAAK,CAAC,IAAI,CACR,KAAK,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,UAAU,OAAO,MAAM,CAAC,WAAW,cAAc,MAAM,GAAG,CACxF,CAAC;YACF,SAAS,IAAI,MAAM,CAAC,UAAU,CAAC;YAC/B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;QACjD,CAAC;QAED,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,yBAAyB,SAAS,IAAI,CAAC,CAAC;QACnD,KAAK,CAAC,IAAI,CAAC,gCAAgC,OAAO,IAAI,CAAC,CAAC;QACxD,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE9D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,gBAAgB,CAAC,OAAsB;QAK5C,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QACjE,MAAM,OAAO,GAAG,cAAc,GAAG,YAAY,CAAC;QAE9C,OAAO,EAAE,cAAc,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC;IACnD,CAAC;CACF"}

package/dist/search/QuantizedVectorStore.d.ts

@@ -0,0 +1,171 @@
+/**
+ * Quantized Vector Store
+ *
+ * Phase 12 Sprint 6: 8-bit scalar quantization for 4x vector memory reduction.
+ * Uses asymmetric similarity computation for improved accuracy.
+ *
+ * @module search/QuantizedVectorStore
+ */
+/**
+ * Quantization parameters for a vector set.
+ */
+export interface QuantizationParams {
+    /** Minimum value in the original vectors */
+    min: number;
+    /** Maximum value in the original vectors */
+    max: number;
+    /** Scale factor for quantization */
+    scale: number;
+    /** Dimension of vectors */
+    dimension: number;
+}
+/**
+ * Statistics for the quantized vector store.
+ */
+export interface QuantizedVectorStoreStats {
+    /** Number of stored vectors */
+    vectorCount: number;
+    /** Vector dimension */
+    dimension: number;
+    /** Full precision memory usage (bytes) */
+    fullPrecisionBytes: number;
+    /** Quantized memory usage (bytes) */
+    quantizedBytes: number;
+    /** Memory reduction ratio */
+    memoryReductionRatio: number;
+    /** Average quantization error */
+    avgQuantizationError: number;
+}
+/**
+ * Search result from quantized vector store.
+ */
+export interface QuantizedSearchResult {
+    /** Entity ID */
+    id: string;
+    /** Similarity score (0-1) */
+    similarity: number;
+    /** Whether result used quantized computation */
+    quantized: boolean;
+}
+/**
+ * Configuration options for QuantizedVectorStore.
+ */
+export interface QuantizedVectorStoreOptions {
+    /** Use asymmetric similarity (query in full precision) */
+    asymmetric?: boolean;
+    /** Minimum vectors before enabling quantization */
+    minVectorsForQuantization?: number;
+    /** Enable accuracy tracking */
+    trackAccuracy?: boolean;
+}
+/**
+ * Quantized Vector Store with 8-bit scalar quantization.
+ *
+ * Provides 4x memory reduction while maintaining >95% accuracy
+ * using asymmetric similarity computation.
+ *
+ * @example
+ * ```typescript
+ * const store = new QuantizedVectorStore();
+ *
+ * // Add vectors
+ * store.add('entity1', [0.1, 0.2, 0.3, ...]);
+ * store.add('entity2', [0.4, 0.5, 0.6, ...]);
+ *
+ * // Search
+ * const results = store.search([0.15, 0.25, 0.35, ...], 10);
+ *
+ * // Get stats
+ * const stats = store.getStats();
+ * console.log(`Memory reduction: ${stats.memoryReductionRatio}x`);
+ * ```
+ */
+export declare class QuantizedVectorStore {
+    private fullPrecisionVectors;
+    private quantizedVectors;
+    private quantizationParams;
+    private options;
+    private isQuantized;
+    private quantizationErrors;
+    constructor(options?: QuantizedVectorStoreOptions);
+    /**
+     * Add a vector to the store.
+     *
+     * @param id - Entity identifier
+     * @param vector - Float vector (any dimension, must be consistent)
+     */
+    add(id: string, vector: number[]): void;
+    /**
+     * Remove a vector from the store.
+     *
+     * @param id - Entity identifier
+     * @returns True if vector was removed
+     */
+    remove(id: string): boolean;
+    /**
+     * Check if a vector exists.
+     *
+     * @param id - Entity identifier
+     */
+    has(id: string): boolean;
+    /**
+     * Get a vector (dequantized if necessary).
+     *
+     * @param id - Entity identifier
+     * @returns Vector or undefined
+     */
+    get(id: string): number[] | undefined;
+    /**
+     * Search for similar vectors.
+     *
+     * @param query - Query vector
+     * @param k - Number of results to return
+     * @returns Top k similar vectors with scores
+     */
+    search(query: number[], k: number): QuantizedSearchResult[];
+    /**
+     * Compute similarity between a query and specific entity.
+     *
+     * @param query - Query vector
+     * @param id - Entity identifier
+     * @returns Similarity score or undefined if not found
+     */
+    computeSimilarity(query: number[], id: string): number | undefined;
+    /**
+     * Force quantization of all vectors.
+     */
+    quantize(): void;
+    /**
+     * Get store statistics.
+     */
+    getStats(): QuantizedVectorStoreStats;
+    /**
+     * Check if store is currently using quantization.
+     */
+    isUsingQuantization(): boolean;
+    /**
+     * Get the number of stored vectors.
+     */
+    size(): number;
+    /**
+     * Clear all vectors from the store.
+     */
+    clear(): void;
+    /**
+     * Export all vectors.
+     */
+    export(): Map<string, number[]>;
+    /**
+     * Import vectors from a map.
+     *
+     * @param vectors - Map of id to vector
+     * @param quantize - Whether to quantize after import
+     */
+    import(vectors: Map<string, number[]>, quantize?: boolean): void;
+    private computeQuantizationParams;
+    private quantizeVector;
+    private dequantizeVector;
+    private cosineSimilarity;
+    private computeError;
+}
+//# sourceMappingURL=QuantizedVectorStore.d.ts.map

package/dist/search/QuantizedVectorStore.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"QuantizedVectorStore.d.ts","sourceRoot":"","sources":["../../src/search/QuantizedVectorStore.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,4CAA4C;IAC5C,GAAG,EAAE,MAAM,CAAC;IACZ,4CAA4C;IAC5C,GAAG,EAAE,MAAM,CAAC;IACZ,oCAAoC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,2BAA2B;IAC3B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,yBAAyB;IACxC,+BAA+B;IAC/B,WAAW,EAAE,MAAM,CAAC;IACpB,uBAAuB;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,0CAA0C;IAC1C,kBAAkB,EAAE,MAAM,CAAC;IAC3B,qCAAqC;IACrC,cAAc,EAAE,MAAM,CAAC;IACvB,6BAA6B;IAC7B,oBAAoB,EAAE,MAAM,CAAC;IAC7B,iCAAiC;IACjC,oBAAoB,EAAE,MAAM,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,gBAAgB;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,6BAA6B;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,gDAAgD;IAChD,SAAS,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,MAAM,WAAW,2BAA2B;IAC1C,0DAA0D;IAC1D,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,mDAAmD;IACnD,yBAAyB,CAAC,EAAE,MAAM,CAAC;IACnC,+BAA+B;IAC/B,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAQD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,oBAAoB,CAA4B;IACxD,OAAO,CAAC,gBAAgB,CAA0B;IAClD,OAAO,CAAC,kBAAkB,CAAmC;IAC7D,OAAO,CAAC,OAAO,CAAwC;IACvD,OAAO,CAAC,WAAW,CAAS;IAC5B,OAAO,CAAC,kBAAkB,CAAgB;gBAE9B,OAAO,CAAC,EAAE,2BAA2B;IAMjD;;;;;OAKG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI;IAuBvC;;;;;OAKG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAM3B;;;;OAIG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAIxB;;;;;OAKG;IACH,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS;IAKrC;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,qBAAqB,EAAE;IAyB3D;;;;;;OAMG;IACH,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAelE;;OAEG;IACH,QAAQ,IAAI,IAAI;IAqBhB;;OAEG;IACH,QAAQ,IAAI,yBAAyB;IAsBrC;;OAEG;IACH,mBAAmB,IAAI,OAAO;IAI9B;;OAEG;IACH,IAAI,IAAI,MAAM;IAId;;OAEG;IACH,KAAK,IAAI,IAAI;IAQb;;OAEG;IACH,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;IAQ/B;;;;;OAKG;IACH,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,QAAQ,UAAO,GAAG,IAAI;IAa7D,OAAO,CAAC,yBAAyB;IAkBjC,OAAO,CAAC,cAAc;IAiBtB,OAAO,CAAC,gBAAgB;IAexB,OAAO,CAAC,gBAAgB;IAiBxB,OAAO,CAAC,YAAY;CAQrB"}