@danielsimonjr/memoryjs 1.0.0

package/dist/utils/searchAlgorithms.js

@@ -0,0 +1,168 @@
+/**
+ * Search Algorithms
+ *
+ * Algorithms for search operations: Levenshtein distance for fuzzy matching
+ * and TF-IDF for relevance scoring.
+ *
+ * @module utils/searchAlgorithms
+ */
+// ==================== Levenshtein Distance ====================
+/**
+ * Calculate Levenshtein distance between two strings.
+ *
+ * Returns the minimum number of single-character edits needed to change
+ * one word into another.
+ *
+ * **Algorithm**: Space-optimized dynamic programming using only two rows.
+ * Time complexity: O(m*n), Space complexity: O(min(m,n)).
+ *
+ * This optimization reduces memory usage from O(m*n) to O(min(m,n)) by
+ * observing that each row only depends on the previous row.
+ *
+ * @param str1 - First string to compare
+ * @param str2 - Second string to compare
+ * @returns Minimum number of edits required (0 = identical strings)
+ *
+ * @example
+ * ```typescript
+ * levenshteinDistance("kitten", "sitting"); // Returns 3
+ * levenshteinDistance("hello", "hello");    // Returns 0
+ * levenshteinDistance("abc", "");           // Returns 3
+ * ```
+ */
+export function levenshteinDistance(str1, str2) {
+    // Ensure str1 is the shorter string for optimal space usage
+    if (str1.length > str2.length) {
+        [str1, str2] = [str2, str1];
+    }
+    const m = str1.length;
+    const n = str2.length;
+    // Use two rows instead of full matrix - O(min(m,n)) space
+    let prev = Array.from({ length: m + 1 }, (_, i) => i);
+    let curr = new Array(m + 1);
+    for (let j = 1; j <= n; j++) {
+        curr[0] = j; // Distance from empty string
+        for (let i = 1; i <= m; i++) {
+            if (str1[i - 1] === str2[j - 1]) {
+                // Characters match, no edit needed
+                curr[i] = prev[i - 1];
+            }
+            else {
+                // Take minimum of three operations
+                curr[i] = 1 + Math.min(prev[i - 1], // substitution
+                prev[i], // deletion
+                curr[i - 1] // insertion
+                );
+            }
+        }
+        // Swap rows for next iteration
+        [prev, curr] = [curr, prev];
+    }
+    return prev[m];
+}
+// ==================== TF-IDF ====================
+/**
+ * Calculate Term Frequency (TF) for a term in a document.
+ *
+ * TF = (Number of times term appears in document) / (Total terms in document)
+ *
+ * @param term - The search term
+ * @param document - The document text
+ * @returns Term frequency (0.0 to 1.0)
+ */
+export function calculateTF(term, document) {
+    const termLower = term.toLowerCase();
+    const tokens = tokenize(document);
+    if (tokens.length === 0)
+        return 0;
+    const termCount = tokens.filter(t => t === termLower).length;
+    return termCount / tokens.length;
+}
+/**
+ * Calculate Inverse Document Frequency (IDF) for a term across documents.
+ *
+ * IDF = log(Total documents / Documents containing term)
+ *
+ * Note: For bulk IDF calculation, prefer calculateIDFFromTokenSets which
+ * avoids re-tokenizing documents for each term.
+ *
+ * @param term - The search term
+ * @param documents - Array of document texts
+ * @returns Inverse document frequency
+ */
+export function calculateIDF(term, documents) {
+    if (documents.length === 0)
+        return 0;
+    const termLower = term.toLowerCase();
+    const docsWithTerm = documents.filter(doc => tokenize(doc).includes(termLower)).length;
+    if (docsWithTerm === 0)
+        return 0;
+    return Math.log(documents.length / docsWithTerm);
+}
+/**
+ * Calculate Inverse Document Frequency (IDF) from pre-tokenized documents.
+ *
+ * IDF = log(Total documents / Documents containing term)
+ *
+ * **Optimized**: Avoids re-tokenizing documents for each term. Pre-tokenize
+ * documents once and convert to Sets for O(1) lookup per document.
+ *
+ * @param term - The search term (should already be lowercase)
+ * @param tokenSets - Array of Sets, each containing unique tokens for a document
+ * @returns Inverse document frequency
+ *
+ * @example
+ * ```typescript
+ * const docs = ["hello world", "hello there"];
+ * const tokenSets = docs.map(d => new Set(tokenize(d)));
+ * calculateIDFFromTokenSets("hello", tokenSets); // Low IDF (common term)
+ * calculateIDFFromTokenSets("world", tokenSets); // Higher IDF (less common)
+ * ```
+ */
+export function calculateIDFFromTokenSets(term, tokenSets) {
+    if (tokenSets.length === 0)
+        return 0;
+    const termLower = term.toLowerCase();
+    let docsWithTerm = 0;
+    for (const tokenSet of tokenSets) {
+        if (tokenSet.has(termLower)) {
+            docsWithTerm++;
+        }
+    }
+    if (docsWithTerm === 0)
+        return 0;
+    return Math.log(tokenSets.length / docsWithTerm);
+}
+/**
+ * Calculate TF-IDF score for a term in a document.
+ *
+ * TF-IDF = TF * IDF
+ *
+ * Higher scores indicate more important/relevant terms.
+ *
+ * @param term - The search term
+ * @param document - The document text
+ * @param documents - Array of all documents
+ * @returns TF-IDF score
+ */
+export function calculateTFIDF(term, document, documents) {
+    const tf = calculateTF(term, document);
+    const idf = calculateIDF(term, documents);
+    return tf * idf;
+}
+/**
+ * Tokenize text into lowercase words.
+ *
+ * Splits on whitespace and removes punctuation.
+ *
+ * @param text - Text to tokenize
+ * @returns Array of lowercase tokens
+ */
+export function tokenize(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^\w\s]/g, ' ')
+        .split(/\s+/)
+        .filter(token => token.length > 0);
+}
+//# sourceMappingURL=searchAlgorithms.js.map

package/dist/utils/searchAlgorithms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"searchAlgorithms.js","sourceRoot":"","sources":["../../src/utils/searchAlgorithms.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,iEAAiE;AAEjE;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY,EAAE,IAAY;IAC5D,4DAA4D;IAC5D,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAEtB,0DAA0D;IAC1D,IAAI,IAAI,GAAa,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAChE,IAAI,IAAI,GAAa,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,6BAA6B;QAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAChC,mCAAmC;gBACnC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,mCAAmC;gBACnC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CACpB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAG,eAAe;gBAC7B,IAAI,CAAC,CAAC,CAAC,EAAO,WAAW;gBACzB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAG,YAAY;iBAC3B,CAAC;YACJ,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,mDAAmD;AAEnD;;;;;;;;GAQG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY,EAAE,QAAgB;IACxD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAElC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;IAC7D,OAAO,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;AACnC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,SAAmB;IAC5D,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAErC,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,YAAY,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAC1C,QAAQ,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAClC,CAAC,MAAM,CAAC;IAET,IAAI,YAAY,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEjC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,yBAAyB,CAAC,IAAY,EAAE,SAAwB;IAC9E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAErC,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAC5B,YAAY,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAED,IAAI,YAAY,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEjC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,YAAY,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAY,EACZ,QAAgB,EAChB,SAAmB;IAEnB,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACvC,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC1C,OAAO,EAAE,GAAG,GAAG,CAAC;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;SACxB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACvC,CAAC"}

package/dist/utils/searchCache.d.ts

@@ -0,0 +1,108 @@
+/**
+ * Search Result Cache
+ *
+ * Simple LRU-style cache for search results with TTL support.
+ * Improves performance for repeated queries without external dependencies.
+ *
+ * @module utils/searchCache
+ */
+import type { SearchResult, KnowledgeGraph } from '../types/index.js';
+/**
+ * Cache statistics for monitoring.
+ */
+export interface CacheStats {
+    hits: number;
+    misses: number;
+    size: number;
+    hitRate: number;
+}
+/**
+ * Simple LRU cache implementation for search results.
+ *
+ * Features:
+ * - Maximum size limit (LRU eviction when full)
+ * - TTL-based expiration
+ * - Cache statistics tracking
+ * - Hash-based key generation from query parameters
+ */
+export declare class SearchCache<T = SearchResult[] | KnowledgeGraph> {
+    private maxSize;
+    private ttlMs;
+    private cache;
+    private accessOrder;
+    private hits;
+    private misses;
+    constructor(maxSize?: number, ttlMs?: number);
+    /**
+     * Generate cache key from query parameters.
+     */
+    private generateKey;
+    /**
+     * Get value from cache.
+     *
+     * @param params - Query parameters to generate cache key
+     * @returns Cached value or undefined if not found/expired
+     */
+    get(params: Record<string, unknown>): T | undefined;
+    /**
+     * Set value in cache.
+     *
+     * @param params - Query parameters to generate cache key
+     * @param value - Value to cache
+     */
+    set(params: Record<string, unknown>, value: T): void;
+    /**
+     * Invalidate all cached entries.
+     */
+    clear(): void;
+    /**
+     * Remove specific entry from access order.
+     */
+    private removeFromAccessOrder;
+    /**
+     * Get cache statistics.
+     */
+    getStats(): CacheStats;
+    /**
+     * Reset cache statistics.
+     */
+    resetStats(): void;
+    /**
+     * Clean up expired entries.
+     *
+     * Should be called periodically to prevent memory buildup.
+     */
+    cleanupExpired(): void;
+    /**
+     * Get current cache size.
+     */
+    get size(): number;
+    /**
+     * Check if cache has entry for params.
+     */
+    has(params: Record<string, unknown>): boolean;
+}
+/**
+ * Global search caches for different search types.
+ */
+export declare const searchCaches: {
+    basic: SearchCache<KnowledgeGraph>;
+    ranked: SearchCache<SearchResult[]>;
+    boolean: SearchCache<KnowledgeGraph>;
+    fuzzy: SearchCache<KnowledgeGraph>;
+};
+/**
+ * Clear all search caches.
+ *
+ * Should be called when graph is modified to ensure cache consistency.
+ */
+export declare function clearAllSearchCaches(): void;
+/**
+ * Get combined statistics for all caches.
+ */
+export declare function getAllCacheStats(): Record<string, CacheStats>;
+/**
+ * Clean up expired entries in all caches.
+ */
+export declare function cleanupAllCaches(): void;
+//# sourceMappingURL=searchCache.d.ts.map

package/dist/utils/searchCache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"searchCache.d.ts","sourceRoot":"","sources":["../../src/utils/searchCache.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAWtE;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;;GAQG;AACH,qBAAa,WAAW,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,cAAc;IAOxD,OAAO,CAAC,OAAO;IACf,OAAO,CAAC,KAAK;IAPf,OAAO,CAAC,KAAK,CAAyC;IACtD,OAAO,CAAC,WAAW,CAAgB;IACnC,OAAO,CAAC,IAAI,CAAK;IACjB,OAAO,CAAC,MAAM,CAAK;gBAGT,OAAO,GAAE,MAAY,EACrB,KAAK,GAAE,MAAsB;IAGvC;;OAEG;IACH,OAAO,CAAC,WAAW;IASnB;;;;;OAKG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,SAAS;IAyBnD;;;;;OAKG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAyBpD;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,OAAO,CAAC,qBAAqB;IAO7B;;OAEG;IACH,QAAQ,IAAI,UAAU;IAUtB;;OAEG;IACH,UAAU,IAAI,IAAI;IAKlB;;;;OAIG;IACH,cAAc,IAAI,IAAI;IAgBtB;;OAEG;IACH,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED;;OAEG;IACH,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,OAAO;CAe9C;AAED;;GAEG;AACH,eAAO,MAAM,YAAY;;;;;CAKxB,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,oBAAoB,IAAI,IAAI,CAK3C;AAED;;GAEG;AACH,wBAAgB,gBAAgB,IAAI,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAO7D;AAED;;GAEG;AACH,wBAAgB,gBAAgB,IAAI,IAAI,CAKvC"}

package/dist/utils/searchCache.js

@@ -0,0 +1,210 @@
+/**
+ * Search Result Cache
+ *
+ * Simple LRU-style cache for search results with TTL support.
+ * Improves performance for repeated queries without external dependencies.
+ *
+ * @module utils/searchCache
+ */
+/**
+ * Simple LRU cache implementation for search results.
+ *
+ * Features:
+ * - Maximum size limit (LRU eviction when full)
+ * - TTL-based expiration
+ * - Cache statistics tracking
+ * - Hash-based key generation from query parameters
+ */
+export class SearchCache {
+    maxSize;
+    ttlMs;
+    cache = new Map();
+    accessOrder = [];
+    hits = 0;
+    misses = 0;
+    constructor(maxSize = 500, ttlMs = 5 * 60 * 1000 // 5 minutes default
+    ) {
+        this.maxSize = maxSize;
+        this.ttlMs = ttlMs;
+    }
+    /**
+     * Generate cache key from query parameters.
+     */
+    generateKey(params) {
+        // Sort keys for consistent hashing
+        const sorted = Object.keys(params)
+            .sort()
+            .map(key => `${key}:${JSON.stringify(params[key])}`)
+            .join('|');
+        return sorted;
+    }
+    /**
+     * Get value from cache.
+     *
+     * @param params - Query parameters to generate cache key
+     * @returns Cached value or undefined if not found/expired
+     */
+    get(params) {
+        const key = this.generateKey(params);
+        const entry = this.cache.get(key);
+        if (!entry) {
+            this.misses++;
+            return undefined;
+        }
+        // Check expiration
+        if (Date.now() > entry.expiresAt) {
+            this.cache.delete(key);
+            this.removeFromAccessOrder(key);
+            this.misses++;
+            return undefined;
+        }
+        // Update access order (move to end = most recently used)
+        this.removeFromAccessOrder(key);
+        this.accessOrder.push(key);
+        this.hits++;
+        return entry.value;
+    }
+    /**
+     * Set value in cache.
+     *
+     * @param params - Query parameters to generate cache key
+     * @param value - Value to cache
+     */
+    set(params, value) {
+        const key = this.generateKey(params);
+        // Remove old entry if exists
+        if (this.cache.has(key)) {
+            this.removeFromAccessOrder(key);
+        }
+        // Evict least recently used if at capacity
+        if (this.cache.size >= this.maxSize && !this.cache.has(key)) {
+            const lruKey = this.accessOrder.shift();
+            if (lruKey) {
+                this.cache.delete(lruKey);
+            }
+        }
+        // Add new entry
+        this.cache.set(key, {
+            value,
+            timestamp: Date.now(),
+            expiresAt: Date.now() + this.ttlMs,
+        });
+        this.accessOrder.push(key);
+    }
+    /**
+     * Invalidate all cached entries.
+     */
+    clear() {
+        this.cache.clear();
+        this.accessOrder = [];
+    }
+    /**
+     * Remove specific entry from access order.
+     */
+    removeFromAccessOrder(key) {
+        const index = this.accessOrder.indexOf(key);
+        if (index > -1) {
+            this.accessOrder.splice(index, 1);
+        }
+    }
+    /**
+     * Get cache statistics.
+     */
+    getStats() {
+        const total = this.hits + this.misses;
+        return {
+            hits: this.hits,
+            misses: this.misses,
+            size: this.cache.size,
+            hitRate: total > 0 ? this.hits / total : 0,
+        };
+    }
+    /**
+     * Reset cache statistics.
+     */
+    resetStats() {
+        this.hits = 0;
+        this.misses = 0;
+    }
+    /**
+     * Clean up expired entries.
+     *
+     * Should be called periodically to prevent memory buildup.
+     */
+    cleanupExpired() {
+        const now = Date.now();
+        const keysToDelete = [];
+        for (const [key, entry] of this.cache.entries()) {
+            if (now > entry.expiresAt) {
+                keysToDelete.push(key);
+            }
+        }
+        for (const key of keysToDelete) {
+            this.cache.delete(key);
+            this.removeFromAccessOrder(key);
+        }
+    }
+    /**
+     * Get current cache size.
+     */
+    get size() {
+        return this.cache.size;
+    }
+    /**
+     * Check if cache has entry for params.
+     */
+    has(params) {
+        const key = this.generateKey(params);
+        const entry = this.cache.get(key);
+        if (!entry)
+            return false;
+        // Check expiration
+        if (Date.now() > entry.expiresAt) {
+            this.cache.delete(key);
+            this.removeFromAccessOrder(key);
+            return false;
+        }
+        return true;
+    }
+}
+/**
+ * Global search caches for different search types.
+ */
+export const searchCaches = {
+    basic: new SearchCache(),
+    ranked: new SearchCache(),
+    boolean: new SearchCache(),
+    fuzzy: new SearchCache(),
+};
+/**
+ * Clear all search caches.
+ *
+ * Should be called when graph is modified to ensure cache consistency.
+ */
+export function clearAllSearchCaches() {
+    searchCaches.basic.clear();
+    searchCaches.ranked.clear();
+    searchCaches.boolean.clear();
+    searchCaches.fuzzy.clear();
+}
+/**
+ * Get combined statistics for all caches.
+ */
+export function getAllCacheStats() {
+    return {
+        basic: searchCaches.basic.getStats(),
+        ranked: searchCaches.ranked.getStats(),
+        boolean: searchCaches.boolean.getStats(),
+        fuzzy: searchCaches.fuzzy.getStats(),
+    };
+}
+/**
+ * Clean up expired entries in all caches.
+ */
+export function cleanupAllCaches() {
+    searchCaches.basic.cleanupExpired();
+    searchCaches.ranked.cleanupExpired();
+    searchCaches.boolean.cleanupExpired();
+    searchCaches.fuzzy.cleanupExpired();
+}
+//# sourceMappingURL=searchCache.js.map

package/dist/utils/searchCache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"searchCache.js","sourceRoot":"","sources":["../../src/utils/searchCache.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAuBH;;;;;;;;GAQG;AACH,MAAM,OAAO,WAAW;IAOZ;IACA;IAPF,KAAK,GAA+B,IAAI,GAAG,EAAE,CAAC;IAC9C,WAAW,GAAa,EAAE,CAAC;IAC3B,IAAI,GAAG,CAAC,CAAC;IACT,MAAM,GAAG,CAAC,CAAC;IAEnB,YACU,UAAkB,GAAG,EACrB,QAAgB,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,oBAAoB;;QADlD,YAAO,GAAP,OAAO,CAAc;QACrB,UAAK,GAAL,KAAK,CAAwB;IACpC,CAAC;IAEJ;;OAEG;IACK,WAAW,CAAC,MAA+B;QACjD,mCAAmC;QACnC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;aAC/B,IAAI,EAAE;aACN,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;aACnD,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,MAA+B;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAElC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,mBAAmB;QACnB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,yDAAyD;QACzD,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI,EAAE,CAAC;QAEZ,OAAO,KAAK,CAAC,KAAK,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,MAA+B,EAAE,KAAQ;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAErC,6BAA6B;QAC7B,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;QAED,2CAA2C;QAC3C,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;YACxC,IAAI,MAAM,EAAE,CAAC;gBACX,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE;YAClB,KAAK;YACL,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK;SACnC,CAAC,CAAC;QACH,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,GAAW;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACtC,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACrB,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;SAC3C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACH,cAAc;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,YAAY,GAAa,EAAE,CAAC;QAElC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;gBAC1B,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,MAA+B;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAElC,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QAEzB,mBAAmB;QACnB,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,KAAK,EAAE,IAAI,WAAW,EAAkB;IACxC,MAAM,EAAE,IAAI,WAAW,EAAkB;IACzC,OAAO,EAAE,IAAI,WAAW,EAAkB;IAC1C,KAAK,EAAE,IAAI,WAAW,EAAkB;CACzC,CAAC;AAEF;;;;GAIG;AACH,MAAM,UAAU,oBAAoB;IAClC,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IAC5B,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IAC7B,YAAY,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB;IAC9B,OAAO;QACL,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE;QACpC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,QAAQ,EAAE;QACtC,OAAO,EAAE,YAAY,CAAC,OAAO,CAAC,QAAQ,EAAE;QACxC,KAAK,EAAE,YAAY,CAAC,KAAK,CAAC,QAAQ,EAAE;KACrC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB;IAC9B,YAAY,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;IACpC,YAAY,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IACrC,YAAY,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;IACtC,YAAY,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;AACtC,CAAC"}