@danielsimonjr/memoryjs 1.0.0

package/dist/search/BooleanSearch.js

@@ -0,0 +1,431 @@
+/**
+ * Boolean Search
+ *
+ * Advanced search with boolean operators (AND, OR, NOT) and field-specific queries.
+ *
+ * @module search/BooleanSearch
+ */
+import { SEARCH_LIMITS, QUERY_LIMITS } from '../utils/constants.js';
+import { ValidationError } from '../utils/errors.js';
+import { SearchFilterChain } from './SearchFilterChain.js';
+/**
+ * Phase 4 Sprint 4: Maximum AST cache size.
+ */
+const AST_CACHE_MAX_SIZE = 50;
+/**
+ * Phase 4 Sprint 4: Result cache max size.
+ */
+const RESULT_CACHE_MAX_SIZE = 100;
+/**
+ * Phase 4 Sprint 4: Cache TTL in milliseconds (5 minutes).
+ */
+const BOOLEAN_CACHE_TTL_MS = 5 * 60 * 1000;
+/**
+ * Performs boolean search with query parsing and AST evaluation.
+ */
+export class BooleanSearch {
+    storage;
+    /**
+     * Phase 4 Sprint 4: AST cache to avoid re-parsing queries.
+     * Maps query string -> parsed AST.
+     */
+    astCache = new Map();
+    /**
+     * Phase 4 Sprint 4: Result cache for boolean search.
+     * Maps cache key -> cached results.
+     */
+    resultCache = new Map();
+    constructor(storage) {
+        this.storage = storage;
+    }
+    /**
+     * Phase 4 Sprint 4: Generate cache key for boolean search.
+     */
+    generateCacheKey(query, tags, minImportance, maxImportance, offset, limit) {
+        return JSON.stringify({
+            q: query,
+            tags: tags?.sort().join(',') ?? '',
+            min: minImportance,
+            max: maxImportance,
+            off: offset,
+            lim: limit,
+        });
+    }
+    /**
+     * Phase 4 Sprint 4: Clear all caches.
+     */
+    clearCache() {
+        this.astCache.clear();
+        this.resultCache.clear();
+    }
+    /**
+     * Phase 4 Sprint 4: Cleanup old cache entries.
+     */
+    cleanupResultCache() {
+        const now = Date.now();
+        const entries = Array.from(this.resultCache.entries());
+        // Remove expired entries
+        for (const [key, entry] of entries) {
+            if (now - entry.timestamp > BOOLEAN_CACHE_TTL_MS) {
+                this.resultCache.delete(key);
+            }
+        }
+        // If still over limit, remove oldest entries
+        if (this.resultCache.size > RESULT_CACHE_MAX_SIZE) {
+            const sortedEntries = entries
+                .filter(([k]) => this.resultCache.has(k))
+                .sort((a, b) => a[1].timestamp - b[1].timestamp);
+            const toRemove = sortedEntries.slice(0, this.resultCache.size - RESULT_CACHE_MAX_SIZE);
+            for (const [key] of toRemove) {
+                this.resultCache.delete(key);
+            }
+        }
+    }
+    /**
+     * Phase 4 Sprint 4: Get or parse AST for a query.
+     */
+    getOrParseAST(query) {
+        // Check AST cache
+        const cached = this.astCache.get(query);
+        if (cached) {
+            return cached;
+        }
+        // Parse and cache
+        const ast = this.parseBooleanQuery(query);
+        // Enforce cache size limit
+        if (this.astCache.size >= AST_CACHE_MAX_SIZE) {
+            // Remove first entry (oldest)
+            const firstKey = this.astCache.keys().next().value;
+            if (firstKey)
+                this.astCache.delete(firstKey);
+        }
+        this.astCache.set(query, ast);
+        return ast;
+    }
+    /**
+     * Boolean search with support for AND, OR, NOT operators, field-specific queries, and pagination.
+     *
+     * Phase 4 Sprint 4: Implements AST caching and result caching for repeated queries.
+     *
+     * Query syntax examples:
+     * - "alice AND programming" - Both terms must match
+     * - "type:person OR type:organization" - Either type matches
+     * - "NOT archived" - Exclude archived items
+     * - "name:alice AND (observation:coding OR observation:teaching)"
+     *
+     * @param query - Boolean query string
+     * @param tags - Optional tags filter
+     * @param minImportance - Optional minimum importance
+     * @param maxImportance - Optional maximum importance
+     * @param offset - Number of results to skip (default: 0)
+     * @param limit - Maximum number of results (default: 50, max: 200)
+     * @returns Filtered knowledge graph matching the boolean query with pagination applied
+     */
+    async booleanSearch(query, tags, minImportance, maxImportance, offset = 0, limit = SEARCH_LIMITS.DEFAULT) {
+        // Validate query length
+        if (query.length > QUERY_LIMITS.MAX_QUERY_LENGTH) {
+            throw new ValidationError('Query too long', [`Query length ${query.length} exceeds maximum of ${QUERY_LIMITS.MAX_QUERY_LENGTH} characters`]);
+        }
+        const graph = await this.storage.loadGraph();
+        // Phase 4 Sprint 4: Check result cache
+        const cacheKey = this.generateCacheKey(query, tags, minImportance, maxImportance, offset, limit);
+        const cached = this.resultCache.get(cacheKey);
+        if (cached && cached.entityCount === graph.entities.length) {
+            const now = Date.now();
+            if (now - cached.timestamp < BOOLEAN_CACHE_TTL_MS) {
+                // Return cached results
+                const cachedNameSet = new Set(cached.entityNames);
+                const cachedEntities = graph.entities.filter(e => cachedNameSet.has(e.name));
+                const cachedRelations = graph.relations.filter(r => cachedNameSet.has(r.from) && cachedNameSet.has(r.to));
+                return { entities: cachedEntities, relations: cachedRelations };
+            }
+        }
+        // Phase 4 Sprint 4: Use cached AST or parse new one
+        let queryAst;
+        try {
+            queryAst = this.getOrParseAST(query);
+        }
+        catch (error) {
+            throw new Error(`Failed to parse boolean query: ${error instanceof Error ? error.message : String(error)}`);
+        }
+        // Validate query complexity
+        this.validateQueryComplexity(queryAst);
+        // First filter by boolean query evaluation (search-specific)
+        const booleanMatched = graph.entities.filter(e => this.evaluateBooleanQuery(queryAst, e));
+        // Apply tag and importance filters using SearchFilterChain
+        const filters = { tags, minImportance, maxImportance };
+        const filteredEntities = SearchFilterChain.applyFilters(booleanMatched, filters);
+        // Apply pagination using SearchFilterChain
+        const pagination = SearchFilterChain.validatePagination(offset, limit);
+        const paginatedEntities = SearchFilterChain.paginate(filteredEntities, pagination);
+        // Phase 4 Sprint 4: Cache the results
+        this.resultCache.set(cacheKey, {
+            ast: queryAst,
+            entityNames: paginatedEntities.map(e => e.name),
+            entityCount: graph.entities.length,
+            timestamp: Date.now(),
+        });
+        // Cleanup old cache entries periodically
+        if (this.resultCache.size > RESULT_CACHE_MAX_SIZE / 2) {
+            this.cleanupResultCache();
+        }
+        const filteredEntityNames = new Set(paginatedEntities.map(e => e.name));
+        const filteredRelations = graph.relations.filter(r => filteredEntityNames.has(r.from) && filteredEntityNames.has(r.to));
+        return { entities: paginatedEntities, relations: filteredRelations };
+    }
+    /**
+     * Tokenize a boolean query into tokens.
+     *
+     * Handles quoted strings, parentheses, and operators.
+     */
+    tokenizeBooleanQuery(query) {
+        const tokens = [];
+        let current = '';
+        let inQuotes = false;
+        for (let i = 0; i < query.length; i++) {
+            const char = query[i];
+            if (char === '"') {
+                if (inQuotes) {
+                    // End of quoted string
+                    tokens.push(current);
+                    current = '';
+                    inQuotes = false;
+                }
+                else {
+                    // Start of quoted string
+                    if (current.trim()) {
+                        tokens.push(current.trim());
+                        current = '';
+                    }
+                    inQuotes = true;
+                }
+            }
+            else if (!inQuotes && (char === '(' || char === ')')) {
+                // Parentheses are separate tokens
+                if (current.trim()) {
+                    tokens.push(current.trim());
+                    current = '';
+                }
+                tokens.push(char);
+            }
+            else if (!inQuotes && /\s/.test(char)) {
+                // Whitespace outside quotes
+                if (current.trim()) {
+                    tokens.push(current.trim());
+                    current = '';
+                }
+            }
+            else {
+                current += char;
+            }
+        }
+        if (current.trim()) {
+            tokens.push(current.trim());
+        }
+        return tokens;
+    }
+    /**
+     * Parse a boolean search query into an AST.
+     *
+     * Supports: AND, OR, NOT, parentheses, field-specific queries (field:value)
+     */
+    parseBooleanQuery(query) {
+        const tokens = this.tokenizeBooleanQuery(query);
+        let position = 0;
+        const peek = () => tokens[position];
+        const consume = () => tokens[position++];
+        // Parse OR expressions (lowest precedence)
+        const parseOr = () => {
+            let left = parseAnd();
+            while (peek()?.toUpperCase() === 'OR') {
+                consume(); // consume 'OR'
+                const right = parseAnd();
+                left = { type: 'OR', children: [left, right] };
+            }
+            return left;
+        };
+        // Parse AND expressions
+        const parseAnd = () => {
+            let left = parseNot();
+            while (peek() && peek()?.toUpperCase() !== 'OR' && peek() !== ')') {
+                // Implicit AND if next token is not OR or )
+                if (peek()?.toUpperCase() === 'AND') {
+                    consume(); // consume 'AND'
+                }
+                const right = parseNot();
+                left = { type: 'AND', children: [left, right] };
+            }
+            return left;
+        };
+        // Parse NOT expressions
+        const parseNot = () => {
+            if (peek()?.toUpperCase() === 'NOT') {
+                consume(); // consume 'NOT'
+                const child = parseNot();
+                return { type: 'NOT', child };
+            }
+            return parsePrimary();
+        };
+        // Parse primary expressions (terms, field queries, parentheses)
+        const parsePrimary = () => {
+            const token = peek();
+            if (!token) {
+                throw new Error('Unexpected end of query');
+            }
+            // Parentheses
+            if (token === '(') {
+                consume(); // consume '('
+                const node = parseOr();
+                if (consume() !== ')') {
+                    throw new Error('Expected closing parenthesis');
+                }
+                return node;
+            }
+            // Field-specific query (field:value)
+            if (token.includes(':')) {
+                consume();
+                const [field, ...valueParts] = token.split(':');
+                const value = valueParts.join(':'); // Handle colons in value
+                return { type: 'TERM', field: field.toLowerCase(), value: value.toLowerCase() };
+            }
+            // Regular term
+            consume();
+            return { type: 'TERM', value: token.toLowerCase() };
+        };
+        const result = parseOr();
+        // Check for unconsumed tokens
+        if (position < tokens.length) {
+            throw new Error(`Unexpected token: ${tokens[position]}`);
+        }
+        return result;
+    }
+    /**
+     * Evaluate a boolean query AST against an entity.
+     */
+    evaluateBooleanQuery(node, entity) {
+        switch (node.type) {
+            case 'AND':
+                return node.children.every(child => this.evaluateBooleanQuery(child, entity));
+            case 'OR':
+                return node.children.some(child => this.evaluateBooleanQuery(child, entity));
+            case 'NOT':
+                return !this.evaluateBooleanQuery(node.child, entity);
+            case 'TERM': {
+                const value = node.value;
+                // OPTIMIZED: Use pre-computed lowercase cache
+                const lowercased = this.storage.getLowercased(entity.name);
+                // Field-specific search
+                if (node.field) {
+                    switch (node.field) {
+                        case 'name':
+                            return lowercased ? lowercased.name.includes(value) : entity.name.toLowerCase().includes(value);
+                        case 'type':
+                        case 'entitytype':
+                            return lowercased ? lowercased.entityType.includes(value) : entity.entityType.toLowerCase().includes(value);
+                        case 'observation':
+                        case 'observations':
+                            // OPTIMIZED: Use observation index for simple single-word terms (O(1) vs O(n))
+                            // The index only matches complete words, not substrings, so we can only
+                            // use it as a quick positive check. If not found in index, fall through
+                            // to substring matching for compatibility.
+                            if (this.isSimpleTerm(value) && !value.includes(' ')) {
+                                const candidateNames = this.storage.getEntitiesByObservationWord(value);
+                                if (candidateNames.has(entity.name)) {
+                                    return true; // O(1) positive match
+                                }
+                                // Not found in index - entity doesn't have this complete word,
+                                // but might contain it as substring - fall through to check
+                            }
+                            // Linear scan for substring matches, phrases, and patterns
+                            return lowercased
+                                ? lowercased.observations.some(obs => obs.includes(value))
+                                : entity.observations.some(obs => obs.toLowerCase().includes(value));
+                        case 'tag':
+                        case 'tags':
+                            return lowercased
+                                ? lowercased.tags.some(tag => tag.includes(value))
+                                : (entity.tags?.some(tag => tag.toLowerCase().includes(value)) || false);
+                        default:
+                            // Unknown field, search all text fields
+                            return this.entityMatchesTerm(entity, value, lowercased);
+                    }
+                }
+                // General search across all fields
+                return this.entityMatchesTerm(entity, value, lowercased);
+            }
+        }
+    }
+    /**
+     * Check if a search term is simple (no regex or wildcards).
+     * Simple terms can use the O(1) observation index.
+     */
+    isSimpleTerm(term) {
+        const specialChars = /[.*+?^${}()|\\[\]]/;
+        return !specialChars.test(term);
+    }
+    /**
+     * Check if entity matches a search term in any text field.
+     * OPTIMIZED: Uses pre-computed lowercase data when available.
+     */
+    entityMatchesTerm(entity, term, lowercased) {
+        if (lowercased) {
+            return (lowercased.name.includes(term) ||
+                lowercased.entityType.includes(term) ||
+                lowercased.observations.some(obs => obs.includes(term)) ||
+                lowercased.tags.some(tag => tag.includes(term)));
+        }
+        // Fallback for entities not in cache
+        const termLower = term.toLowerCase();
+        return (entity.name.toLowerCase().includes(termLower) ||
+            entity.entityType.toLowerCase().includes(termLower) ||
+            entity.observations.some(obs => obs.toLowerCase().includes(termLower)) ||
+            (entity.tags?.some(tag => tag.toLowerCase().includes(termLower)) || false));
+    }
+    /**
+     * Validate query complexity to prevent resource exhaustion.
+     * Checks nesting depth, term count, and operator count against configured limits.
+     */
+    validateQueryComplexity(node, depth = 0) {
+        // Check nesting depth
+        if (depth > QUERY_LIMITS.MAX_DEPTH) {
+            throw new ValidationError('Query too complex', [`Query nesting depth ${depth} exceeds maximum of ${QUERY_LIMITS.MAX_DEPTH}`]);
+        }
+        // Count terms and operators recursively
+        const complexity = this.calculateQueryComplexity(node);
+        if (complexity.terms > QUERY_LIMITS.MAX_TERMS) {
+            throw new ValidationError('Query too complex', [`Query has ${complexity.terms} terms, exceeds maximum of ${QUERY_LIMITS.MAX_TERMS}`]);
+        }
+        if (complexity.operators > QUERY_LIMITS.MAX_OPERATORS) {
+            throw new ValidationError('Query too complex', [`Query has ${complexity.operators} operators, exceeds maximum of ${QUERY_LIMITS.MAX_OPERATORS}`]);
+        }
+    }
+    /**
+     * Calculate query complexity metrics.
+     */
+    calculateQueryComplexity(node, depth = 0) {
+        switch (node.type) {
+            case 'AND':
+            case 'OR':
+                const childResults = node.children.map(child => this.calculateQueryComplexity(child, depth + 1));
+                return {
+                    terms: childResults.reduce((sum, r) => sum + r.terms, 0),
+                    operators: childResults.reduce((sum, r) => sum + r.operators, 1), // +1 for current operator
+                    maxDepth: Math.max(depth, ...childResults.map(r => r.maxDepth)),
+                };
+            case 'NOT':
+                const notResult = this.calculateQueryComplexity(node.child, depth + 1);
+                return {
+                    terms: notResult.terms,
+                    operators: notResult.operators + 1,
+                    maxDepth: Math.max(depth, notResult.maxDepth),
+                };
+            case 'TERM':
+                return {
+                    terms: 1,
+                    operators: 0,
+                    maxDepth: depth,
+                };
+        }
+    }
+}
+//# sourceMappingURL=BooleanSearch.js.map

package/dist/search/BooleanSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BooleanSearch.js","sourceRoot":"","sources":["../../src/search/BooleanSearch.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAsB,MAAM,wBAAwB,CAAC;AAgB/E;;GAEG;AACH,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAE9B;;GAEG;AACH,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAElC;;GAEG;AACH,MAAM,oBAAoB,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;AAE3C;;GAEG;AACH,MAAM,OAAO,aAAa;IAaJ;IAZpB;;;OAGG;IACK,QAAQ,GAAkC,IAAI,GAAG,EAAE,CAAC;IAE5D;;;OAGG;IACK,WAAW,GAAmC,IAAI,GAAG,EAAE,CAAC;IAEhE,YAAoB,OAAqB;QAArB,YAAO,GAAP,OAAO,CAAc;IAAG,CAAC;IAE7C;;OAEG;IACK,gBAAgB,CACtB,KAAa,EACb,IAAe,EACf,aAAsB,EACtB,aAAsB,EACtB,MAAe,EACf,KAAc;QAEd,OAAO,IAAI,CAAC,SAAS,CAAC;YACpB,CAAC,EAAE,KAAK;YACR,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE;YAClC,GAAG,EAAE,aAAa;YAClB,GAAG,EAAE,aAAa;YAClB,GAAG,EAAE,MAAM;YACX,GAAG,EAAE,KAAK;SACX,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,kBAAkB;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC;QAEvD,yBAAyB;QACzB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE,CAAC;YACnC,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,oBAAoB,EAAE,CAAC;gBACjD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,qBAAqB,EAAE,CAAC;YAClD,MAAM,aAAa,GAAG,OAAO;iBAC1B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACxC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YAEnD,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,qBAAqB,CAAC,CAAC;YACvF,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC7B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,KAAa;QACjC,kBAAkB;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,kBAAkB;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAE1C,2BAA2B;QAC3B,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,kBAAkB,EAAE,CAAC;YAC7C,8BAA8B;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YACnD,IAAI,QAAQ;gBAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC9B,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACH,KAAK,CAAC,aAAa,CACjB,KAAa,EACb,IAAe,EACf,aAAsB,EACtB,aAAsB,EACtB,SAAiB,CAAC,EAClB,QAAgB,aAAa,CAAC,OAAO;QAErC,wBAAwB;QACxB,IAAI,KAAK,CAAC,MAAM,GAAG,YAAY,CAAC,gBAAgB,EAAE,CAAC;YACjD,MAAM,IAAI,eAAe,CACvB,gBAAgB,EAChB,CAAC,gBAAgB,KAAK,CAAC,MAAM,uBAAuB,YAAY,CAAC,gBAAgB,aAAa,CAAC,CAChG,CAAC;QACJ,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAE7C,uCAAuC;QACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACjG,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE9C,IAAI,MAAM,IAAI,MAAM,CAAC,WAAW,KAAK,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACvB,IAAI,GAAG,GAAG,MAAM,CAAC,SAAS,GAAG,oBAAoB,EAAE,CAAC;gBAClD,wBAAwB;gBACxB,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAClD,MAAM,cAAc,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC7E,MAAM,eAAe,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAC5C,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAC1D,CAAC;gBACF,OAAO,EAAE,QAAQ,EAAE,cAA0B,EAAE,SAAS,EAAE,eAAe,EAAE,CAAC;YAC9E,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,IAAI,QAA0B,CAAC;QAC/B,IAAI,CAAC;YACH,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CACb,kCAAkC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAC3F,CAAC;QACJ,CAAC;QAED,4BAA4B;QAC5B,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;QAEvC,6DAA6D;QAC7D,MAAM,cAAc,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC/C,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,CAAC,CAAC,CACvC,CAAC;QAEF,2DAA2D;QAC3D,MAAM,OAAO,GAAkB,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,EAAE,CAAC;QACtE,MAAM,gBAAgB,GAAG,iBAAiB,CAAC,YAAY,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAEjF,2CAA2C;QAC3C,MAAM,UAAU,GAAG,iBAAiB,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACvE,MAAM,iBAAiB,GAAG,iBAAiB,CAAC,QAAQ,CAAC,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAEnF,sCAAsC;QACtC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE;YAC7B,GAAG,EAAE,QAAQ;YACb,WAAW,EAAE,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAC/C,WAAW,EAAE,KAAK,CAAC,QAAQ,CAAC,MAAM;YAClC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;SACtB,CAAC,CAAC;QAEH,yCAAyC;QACzC,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,GAAG,qBAAqB,GAAG,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5B,CAAC;QAED,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACxE,MAAM,iBAAiB,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CACtE,CAAC;QAEF,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,iBAAiB,EAAE,CAAC;IACvE,CAAC;IAED;;;;OAIG;IACK,oBAAoB,CAAC,KAAa;QACxC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,IAAI,QAAQ,GAAG,KAAK,CAAC;QAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEtB,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;gBACjB,IAAI,QAAQ,EAAE,CAAC;oBACb,uBAAuB;oBACvB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACrB,OAAO,GAAG,EAAE,CAAC;oBACb,QAAQ,GAAG,KAAK,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,yBAAyB;oBACzB,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;wBACnB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;wBAC5B,OAAO,GAAG,EAAE,CAAC;oBACf,CAAC;oBACD,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;iBAAM,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACvD,kCAAkC;gBAClC,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC5B,OAAO,GAAG,EAAE,CAAC;gBACf,CAAC;gBACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;iBAAM,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,4BAA4B;gBAC5B,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;oBACnB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC5B,OAAO,GAAG,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CAAC,KAAa;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,MAAM,IAAI,GAAG,GAAuB,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,GAAuB,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;QAE7D,2CAA2C;QAC3C,MAAM,OAAO,GAAG,GAAqB,EAAE;YACrC,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YAEtB,OAAO,IAAI,EAAE,EAAE,WAAW,EAAE,KAAK,IAAI,EAAE,CAAC;gBACtC,OAAO,EAAE,CAAC,CAAC,eAAe;gBAC1B,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACzB,IAAI,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACjD,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,wBAAwB;QACxB,MAAM,QAAQ,GAAG,GAAqB,EAAE;YACtC,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;YAEtB,OAAO,IAAI,EAAE,IAAI,IAAI,EAAE,EAAE,WAAW,EAAE,KAAK,IAAI,IAAI,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;gBAClE,4CAA4C;gBAC5C,IAAI,IAAI,EAAE,EAAE,WAAW,EAAE,KAAK,KAAK,EAAE,CAAC;oBACpC,OAAO,EAAE,CAAC,CAAC,gBAAgB;gBAC7B,CAAC;gBACD,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACzB,IAAI,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YAClD,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,wBAAwB;QACxB,MAAM,QAAQ,GAAG,GAAqB,EAAE;YACtC,IAAI,IAAI,EAAE,EAAE,WAAW,EAAE,KAAK,KAAK,EAAE,CAAC;gBACpC,OAAO,EAAE,CAAC,CAAC,gBAAgB;gBAC3B,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACzB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAChC,CAAC;YACD,OAAO,YAAY,EAAE,CAAC;QACxB,CAAC,CAAC;QAEF,gEAAgE;QAChE,MAAM,YAAY,GAAG,GAAqB,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,EAAE,CAAC;YAErB,IAAI,CAAC,KAAK,EAAE,CAAC;gBACX,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;YAC7C,CAAC;YAED,cAAc;YACd,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;gBAClB,OAAO,EAAE,CAAC,CAAC,cAAc;gBACzB,MAAM,IAAI,GAAG,OAAO,EAAE,CAAC;gBACvB,IAAI,OAAO,EAAE,KAAK,GAAG,EAAE,CAAC;oBACtB,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;gBAClD,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC;YAED,qCAAqC;YACrC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,OAAO,EAAE,CAAC;gBACV,MAAM,CAAC,KAAK,EAAE,GAAG,UAAU,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBAChD,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,yBAAyB;gBAC7D,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YAClF,CAAC;YAED,eAAe;YACf,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACtD,CAAC,CAAC;QAEF,MAAM,MAAM,GAAG,OAAO,EAAE,CAAC;QAEzB,8BAA8B;QAC9B,IAAI,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,qBAAqB,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,oBAAoB,CAAC,IAAsB,EAAE,MAAc;QACjE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;YAEhF,KAAK,IAAI;gBACP,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;YAE/E,KAAK,KAAK;gBACR,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAExD,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;gBACzB,8CAA8C;gBAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAE3D,wBAAwB;gBACxB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBACf,QAAQ,IAAI,CAAC,KAAK,EAAE,CAAC;wBACnB,KAAK,MAAM;4BACT,OAAO,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;wBAClG,KAAK,MAAM,CAAC;wBACZ,KAAK,YAAY;4BACf,OAAO,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;wBAC9G,KAAK,aAAa,CAAC;wBACnB,KAAK,cAAc;4BACjB,+EAA+E;4BAC/E,wEAAwE;4BACxE,wEAAwE;4BACxE,2CAA2C;4BAC3C,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gCACrD,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC;gCACxE,IAAI,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;oCACpC,OAAO,IAAI,CAAC,CAAC,sBAAsB;gCACrC,CAAC;gCACD,+DAA+D;gCAC/D,4DAA4D;4BAC9D,CAAC;4BACD,2DAA2D;4BAC3D,OAAO,UAAU;gCACf,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gCAC1D,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;wBACzE,KAAK,KAAK,CAAC;wBACX,KAAK,MAAM;4BACT,OAAO,UAAU;gCACf,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gCAClD,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;wBAC7E;4BACE,wCAAwC;4BACxC,OAAO,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;oBAC7D,CAAC;gBACH,CAAC;gBAED,mCAAmC;gBACnC,OAAO,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,YAAY,CAAC,IAAY;QAC/B,MAAM,YAAY,GAAG,oBAAoB,CAAC;QAC1C,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,MAAc,EAAE,IAAY,EAAE,UAA0D;QAChH,IAAI,UAAU,EAAE,CAAC;YACf,OAAO,CACL,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC9B,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC;gBACpC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACvD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAChD,CAAC;QACJ,CAAC;QAED,qCAAqC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACrC,OAAO,CACL,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC;YAC7C,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC;YACnD,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACtE,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,IAAI,KAAK,CAAC,CAC3E,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,uBAAuB,CAAC,IAAsB,EAAE,QAAgB,CAAC;QACvE,sBAAsB;QACtB,IAAI,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,CAAC,uBAAuB,KAAK,uBAAuB,YAAY,CAAC,SAAS,EAAE,CAAC,CAC9E,CAAC;QACJ,CAAC;QAED,wCAAwC;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,CAAC;QAEvD,IAAI,UAAU,CAAC,KAAK,GAAG,YAAY,CAAC,SAAS,EAAE,CAAC;YAC9C,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,CAAC,aAAa,UAAU,CAAC,KAAK,8BAA8B,YAAY,CAAC,SAAS,EAAE,CAAC,CACtF,CAAC;QACJ,CAAC;QAED,IAAI,UAAU,CAAC,SAAS,GAAG,YAAY,CAAC,aAAa,EAAE,CAAC;YACtD,MAAM,IAAI,eAAe,CACvB,mBAAmB,EACnB,CAAC,aAAa,UAAU,CAAC,SAAS,kCAAkC,YAAY,CAAC,aAAa,EAAE,CAAC,CAClG,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;OAEG;IACK,wBAAwB,CAC9B,IAAsB,EACtB,QAAgB,CAAC;QAEjB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,KAAK,KAAK,CAAC;YACX,KAAK,IAAI;gBACP,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjG,OAAO;oBACL,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;oBACxD,SAAS,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,0BAA0B;oBAC5F,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;iBAChE,CAAC;YAEJ,KAAK,KAAK;gBACR,MAAM,SAAS,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACvE,OAAO;oBACL,KAAK,EAAE,SAAS,CAAC,KAAK;oBACtB,SAAS,EAAE,SAAS,CAAC,SAAS,GAAG,CAAC;oBAClC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,QAAQ,CAAC;iBAC9C,CAAC;YAEJ,KAAK,MAAM;gBACT,OAAO;oBACL,KAAK,EAAE,CAAC;oBACR,SAAS,EAAE,CAAC;oBACZ,QAAQ,EAAE,KAAK;iBAChB,CAAC;QACN,CAAC;IACH,CAAC;CACF"}

package/dist/search/EarlyTerminationManager.d.ts

@@ -0,0 +1,140 @@
+/**
+ * Early Termination Manager
+ *
+ * Phase 12 Sprint 4: Manages early termination of hybrid search when
+ * results are adequate, executing layers in cost-order for efficiency.
+ *
+ * @module search/EarlyTerminationManager
+ */
+import type { HybridSearchResult, QueryAnalysis, ReadonlyKnowledgeGraph } from '../types/index.js';
+import type { HybridSearchManager } from './HybridSearchManager.js';
+import type { SearchLayer } from './QueryCostEstimator.js';
+import { QueryCostEstimator } from './QueryCostEstimator.js';
+/**
+ * Adequacy check result for a set of search results.
+ */
+export interface AdequacyCheck {
+    /** Whether results are adequate */
+    adequate: boolean;
+    /** Adequacy score (0-1) */
+    score: number;
+    /** Reasons for the adequacy determination */
+    reasons: string[];
+    /** Layers that contributed to results */
+    contributingLayers: SearchLayer[];
+}
+/**
+ * Options for early termination.
+ */
+export interface EarlyTerminationOptions {
+    /** Adequacy threshold (0-1, default: 0.7) */
+    adequacyThreshold?: number;
+    /** Minimum results required (default: 3) */
+    minResults?: number;
+    /** Maximum results to collect (default: 20) */
+    maxResults?: number;
+    /** Whether semantic search is available (default: true) */
+    semanticAvailable?: boolean;
+    /** Query analysis for smarter adequacy checking */
+    analysis?: QueryAnalysis;
+    /** Minimum diversity score (0-1, default: 0.3) */
+    minDiversity?: number;
+    /** Minimum average relevance score (0-1, default: 0.4) */
+    minRelevance?: number;
+}
+/**
+ * Result from early termination search.
+ */
+export interface EarlyTerminationResult {
+    /** Final search results */
+    results: HybridSearchResult[];
+    /** Layers that were executed (in order) */
+    executedLayers: SearchLayer[];
+    /** Adequacy check details */
+    adequacy: AdequacyCheck;
+    /** Whether early termination occurred */
+    earlyTerminated: boolean;
+    /** Total time in milliseconds */
+    executionTimeMs: number;
+}
+/**
+ * Early Termination Manager
+ *
+ * Executes search layers in cost-order (fastest first) and terminates
+ * early when results are adequate, saving computation time.
+ *
+ * @example
+ * ```typescript
+ * const manager = new EarlyTerminationManager(hybridSearch);
+ * const result = await manager.searchWithEarlyTermination(
+ *   graph,
+ *   'machine learning',
+ *   { adequacyThreshold: 0.8, minResults: 5 }
+ * );
+ *
+ * if (result.earlyTerminated) {
+ *   console.log(`Terminated after ${result.executedLayers.length} layers`);
+ * }
+ * ```
+ */
+export declare class EarlyTerminationManager {
+    private hybridSearch;
+    private costEstimator;
+    constructor(hybridSearch: HybridSearchManager, costEstimator?: QueryCostEstimator);
+    /**
+     * Execute search with early termination support.
+     *
+     * Executes layers in cost-order and terminates early when results
+     * meet the adequacy threshold.
+     *
+     * @param graph - Knowledge graph to search
+     * @param query - Search query
+     * @param options - Early termination options
+     * @returns Search results with termination details
+     */
+    searchWithEarlyTermination(graph: ReadonlyKnowledgeGraph, query: string, options?: EarlyTerminationOptions): Promise<EarlyTerminationResult>;
+    /**
+     * Execute a single layer search.
+     * @private
+     */
+    private executeLayerSearch;
+    /**
+     * Get weight configuration for a specific layer.
+     * @private
+     */
+    private getLayerWeights;
+    /**
+     * Check if results are adequate based on configured thresholds.
+     *
+     * @param results - Current search results
+     * @param options - Adequacy options
+     * @param executedLayers - Layers that have been executed
+     * @returns Adequacy check result
+     */
+    checkAdequacy(results: HybridSearchResult[], options: EarlyTerminationOptions, executedLayers: SearchLayer[]): AdequacyCheck;
+    /**
+     * Calculate diversity score from results.
+     * @private
+     */
+    private calculateDiversityScore;
+    /**
+     * Get layers that contributed to results.
+     * @private
+     */
+    private getContributingLayers;
+    /**
+     * Calculate adequacy score for a set of results.
+     *
+     * Standalone method for checking result adequacy without full search.
+     *
+     * @param results - Results to evaluate
+     * @param options - Adequacy options
+     * @returns Adequacy score (0-1)
+     */
+    calculateAdequacyScore(results: HybridSearchResult[], options?: EarlyTerminationOptions): number;
+    /**
+     * Get the cost estimator for external use.
+     */
+    getCostEstimator(): QueryCostEstimator;
+}
+//# sourceMappingURL=EarlyTerminationManager.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"EarlyTerminationManager.d.ts","sourceRoot":"","sources":["../../src/search/EarlyTerminationManager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,kBAAkB,EAClB,aAAa,EACb,sBAAsB,EACvB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AACpE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAE7D;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,mCAAmC;IACnC,QAAQ,EAAE,OAAO,CAAC;IAClB,2BAA2B;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,6CAA6C;IAC7C,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,yCAAyC;IACzC,kBAAkB,EAAE,WAAW,EAAE,CAAC;CACnC;AAED;;GAEG;AACH,MAAM,WAAW,uBAAuB;IACtC,6CAA6C;IAC7C,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,4CAA4C;IAC5C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,+CAA+C;IAC/C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,2DAA2D;IAC3D,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAC5B,mDAAmD;IACnD,QAAQ,CAAC,EAAE,aAAa,CAAC;IACzB,kDAAkD;IAClD,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,0DAA0D;IAC1D,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,2BAA2B;IAC3B,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAC9B,2CAA2C;IAC3C,cAAc,EAAE,WAAW,EAAE,CAAC;IAC9B,6BAA6B;IAC7B,QAAQ,EAAE,aAAa,CAAC;IACxB,yCAAyC;IACzC,eAAe,EAAE,OAAO,CAAC;IACzB,iCAAiC;IACjC,eAAe,EAAE,MAAM,CAAC;CACzB;AAcD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,uBAAuB;IAIhC,OAAO,CAAC,YAAY;IAHtB,OAAO,CAAC,aAAa,CAAqB;gBAGhC,YAAY,EAAE,mBAAmB,EACzC,aAAa,CAAC,EAAE,kBAAkB;IAKpC;;;;;;;;;;OAUG;IACG,0BAA0B,CAC9B,KAAK,EAAE,sBAAsB,EAC7B,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,sBAAsB,CAAC;IA0ElC;;;OAGG;YACW,kBAAkB;IAoBhC;;;OAGG;IACH,OAAO,CAAC,eAAe;IAevB;;;;;;;OAOG;IACH,aAAa,CACX,OAAO,EAAE,kBAAkB,EAAE,EAC7B,OAAO,EAAE,uBAAuB,EAChC,cAAc,EAAE,WAAW,EAAE,GAC5B,aAAa;IAyFhB;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IAqB/B;;;OAGG;IACH,OAAO,CAAC,qBAAqB;IAU7B;;;;;;;;OAQG;IACH,sBAAsB,CACpB,OAAO,EAAE,kBAAkB,EAAE,EAC7B,OAAO,GAAE,uBAA4B,GACpC,MAAM;IAKT;;OAEG;IACH,gBAAgB,IAAI,kBAAkB;CAGvC"}