@danielsimonjr/memoryjs 1.0.0 → 1.1.0

package/dist/search/OptimizedInvertedIndex.d.ts

@@ -1,163 +0,0 @@
-/**
- * Optimized Inverted Index
- *
- * Memory-efficient inverted index using integer IDs and Uint32Array
- * for fast multi-term intersection queries.
- *
- * Phase 12 Sprint 3: Search Algorithm Optimization
- *
- * @module search/OptimizedInvertedIndex
- */
-/**
- * Statistics about memory usage.
- */
-export interface IndexMemoryUsage {
-    /** Total bytes used by posting lists */
-    postingListBytes: number;
-    /** Total bytes used by ID map */
-    idMapBytes: number;
-    /** Total bytes used by term index */
-    termIndexBytes: number;
-    /** Total estimated memory usage in bytes */
-    totalBytes: number;
-    /** Number of unique terms */
-    termCount: number;
-    /** Number of documents indexed */
-    documentCount: number;
-}
-/**
- * Result from a posting list lookup.
- */
-export interface PostingListResult {
-    /** Term that was looked up */
-    term: string;
-    /** Document IDs containing the term (sorted) */
-    docIds: Uint32Array;
-}
-/**
- * Optimized Inverted Index using integer document IDs.
- *
- * Memory Optimizations:
- * 1. Uses integer IDs instead of string entity names
- * 2. Stores posting lists as Uint32Array (4 bytes per ID vs ~20+ bytes per string)
- * 3. Maintains sorted posting lists for efficient intersection
- *
- * Performance Optimizations:
- * 1. Sorted array intersection is O(n+m) where n,m are posting list lengths
- * 2. Early termination when one list is exhausted
- * 3. Binary search available for unbalanced list sizes
- *
- * @example
- * ```typescript
- * const index = new OptimizedInvertedIndex();
- * index.addDocument('entity1', ['machine', 'learning', 'ai']);
- * index.addDocument('entity2', ['deep', 'learning', 'neural']);
- *
- * // Find documents containing both 'machine' AND 'learning'
- * const results = index.intersect(['machine', 'learning']);
- * console.log(results); // ['entity1']
- * ```
- */
-export declare class OptimizedInvertedIndex {
-    /** Map from entity name to integer ID */
-    private entityToId;
-    /** Map from integer ID to entity name */
-    private idToEntity;
-    /** Next available ID */
-    private nextId;
-    /** Inverted index: term -> sorted array of document IDs */
-    private postingLists;
-    /** Temporary posting lists (before finalization) */
-    private tempPostingLists;
-    /** Whether the index is finalized (posting lists converted to Uint32Array) */
-    private finalized;
-    /**
-     * Add a document to the index.
-     *
-     * @param entityName - Unique document identifier
-     * @param terms - Array of terms in the document (should be lowercase)
-     */
-    addDocument(entityName: string, terms: string[]): void;
-    /**
-     * Remove a document from the index.
-     *
-     * @param entityName - Document to remove
-     * @returns True if document was found and removed
-     */
-    removeDocument(entityName: string): boolean;
-    /**
-     * Finalize the index by converting posting lists to Uint32Array.
-     *
-     * This should be called after bulk indexing for optimal memory usage.
-     * The index can still be updated after finalization, but it will
-     * temporarily use more memory during updates.
-     */
-    finalize(): void;
-    /**
-     * Convert finalized index back to mutable format.
-     */
-    private unfinalize;
-    /**
-     * Get posting list for a term.
-     *
-     * @param term - Term to look up
-     * @returns Posting list result or null if term not found
-     */
-    getPostingList(term: string): PostingListResult | null;
-    /**
-     * Perform intersection of posting lists for multiple terms.
-     *
-     * Returns entity names that contain ALL specified terms.
-     *
-     * @param terms - Array of terms to intersect
-     * @returns Array of entity names containing all terms
-     */
-    intersect(terms: string[]): string[];
-    /**
-     * Perform union of posting lists for multiple terms.
-     *
-     * Returns entity names that contain ANY of the specified terms.
-     *
-     * @param terms - Array of terms to union
-     * @returns Array of entity names containing any term
-     */
-    union(terms: string[]): string[];
-    /**
-     * Get entities containing a single term.
-     *
-     * @param term - Term to search for
-     * @returns Array of entity names containing the term
-     */
-    search(term: string): string[];
-    /**
-     * Intersect two sorted Uint32Arrays.
-     *
-     * Uses merge-style intersection which is O(n+m).
-     */
-    private intersectTwo;
-    /**
-     * Get memory usage statistics.
-     */
-    getMemoryUsage(): IndexMemoryUsage;
-    /**
-     * Clear the entire index.
-     */
-    clear(): void;
-    /**
-     * Get the number of documents in the index.
-     */
-    get documentCount(): number;
-    /**
-     * Get the number of unique terms in the index.
-     */
-    get termCount(): number;
-    /**
-     * Check if an entity is indexed.
-     */
-    hasDocument(entityName: string): boolean;
-    /**
-     * Check if a term exists in the index.
-     */
-    hasTerm(term: string): boolean;
-}
-//# sourceMappingURL=OptimizedInvertedIndex.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"OptimizedInvertedIndex.d.ts","sourceRoot":"","sources":["../../src/search/OptimizedInvertedIndex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,wCAAwC;IACxC,gBAAgB,EAAE,MAAM,CAAC;IACzB,iCAAiC;IACjC,UAAU,EAAE,MAAM,CAAC;IACnB,qCAAqC;IACrC,cAAc,EAAE,MAAM,CAAC;IACvB,4CAA4C;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,6BAA6B;IAC7B,SAAS,EAAE,MAAM,CAAC;IAClB,kCAAkC;IAClC,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,8BAA8B;IAC9B,IAAI,EAAE,MAAM,CAAC;IACb,gDAAgD;IAChD,MAAM,EAAE,WAAW,CAAC;CACrB;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,qBAAa,sBAAsB;IACjC,yCAAyC;IACzC,OAAO,CAAC,UAAU,CAAkC;IAEpD,yCAAyC;IACzC,OAAO,CAAC,UAAU,CAAkC;IAEpD,wBAAwB;IACxB,OAAO,CAAC,MAAM,CAAa;IAE3B,2DAA2D;IAC3D,OAAO,CAAC,YAAY,CAAuC;IAE3D,oDAAoD;IACpD,OAAO,CAAC,gBAAgB,CAAoC;IAE5D,8EAA8E;IAC9E,OAAO,CAAC,SAAS,CAAkB;IAEnC;;;;;OAKG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI;IAiCtD;;;;;OAKG;IACH,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IA6B3C;;;;;;OAMG;IACH,QAAQ,IAAI,IAAI;IAiBhB;;OAEG;IACH,OAAO,CAAC,UAAU;IAalB;;;;;OAKG;IACH,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,iBAAiB,GAAG,IAAI;IActD;;;;;;;OAOG;IACH,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;IAqCpC;;;;;;;OAOG;IACH,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;IAyBhC;;;;;OAKG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAY9B;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAoBpB;;OAEG;IACH,cAAc,IAAI,gBAAgB;IAwClC;;OAEG;IACH,KAAK,IAAI,IAAI;IASb;;OAEG;IACH,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED;;OAEG;IACH,IAAI,SAAS,IAAI,MAAM,CAItB;IAED;;OAEG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAIxC;;OAEG;IACH,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;CAK/B"}

package/dist/search/OptimizedInvertedIndex.js

@@ -1,359 +0,0 @@
-/**
- * Optimized Inverted Index
- *
- * Memory-efficient inverted index using integer IDs and Uint32Array
- * for fast multi-term intersection queries.
- *
- * Phase 12 Sprint 3: Search Algorithm Optimization
- *
- * @module search/OptimizedInvertedIndex
- */
-/**
- * Optimized Inverted Index using integer document IDs.
- *
- * Memory Optimizations:
- * 1. Uses integer IDs instead of string entity names
- * 2. Stores posting lists as Uint32Array (4 bytes per ID vs ~20+ bytes per string)
- * 3. Maintains sorted posting lists for efficient intersection
- *
- * Performance Optimizations:
- * 1. Sorted array intersection is O(n+m) where n,m are posting list lengths
- * 2. Early termination when one list is exhausted
- * 3. Binary search available for unbalanced list sizes
- *
- * @example
- * ```typescript
- * const index = new OptimizedInvertedIndex();
- * index.addDocument('entity1', ['machine', 'learning', 'ai']);
- * index.addDocument('entity2', ['deep', 'learning', 'neural']);
- *
- * // Find documents containing both 'machine' AND 'learning'
- * const results = index.intersect(['machine', 'learning']);
- * console.log(results); // ['entity1']
- * ```
- */
-export class OptimizedInvertedIndex {
-    /** Map from entity name to integer ID */
-    entityToId = new Map();
-    /** Map from integer ID to entity name */
-    idToEntity = new Map();
-    /** Next available ID */
-    nextId = 0;
-    /** Inverted index: term -> sorted array of document IDs */
-    postingLists = new Map();
-    /** Temporary posting lists (before finalization) */
-    tempPostingLists = new Map();
-    /** Whether the index is finalized (posting lists converted to Uint32Array) */
-    finalized = false;
-    /**
-     * Add a document to the index.
-     *
-     * @param entityName - Unique document identifier
-     * @param terms - Array of terms in the document (should be lowercase)
-     */
-    addDocument(entityName, terms) {
-        // Unfinalize if already finalized (allows incremental updates)
-        if (this.finalized) {
-            this.unfinalize();
-        }
-        // Get or assign document ID
-        let docId = this.entityToId.get(entityName);
-        if (docId === undefined) {
-            docId = this.nextId++;
-            this.entityToId.set(entityName, docId);
-            this.idToEntity.set(docId, entityName);
-        }
-        // Add unique terms to posting lists
-        const seenTerms = new Set();
-        for (const term of terms) {
-            if (seenTerms.has(term))
-                continue;
-            seenTerms.add(term);
-            let postingList = this.tempPostingLists.get(term);
-            if (!postingList) {
-                postingList = [];
-                this.tempPostingLists.set(term, postingList);
-            }
-            // Only add if not already present (maintains sorted order if added in order)
-            if (postingList.length === 0 || postingList[postingList.length - 1] !== docId) {
-                postingList.push(docId);
-            }
-        }
-    }
-    /**
-     * Remove a document from the index.
-     *
-     * @param entityName - Document to remove
-     * @returns True if document was found and removed
-     */
-    removeDocument(entityName) {
-        const docId = this.entityToId.get(entityName);
-        if (docId === undefined) {
-            return false;
-        }
-        // Unfinalize if needed
-        if (this.finalized) {
-            this.unfinalize();
-        }
-        // Remove from all posting lists
-        for (const [term, postingList] of this.tempPostingLists) {
-            const idx = postingList.indexOf(docId);
-            if (idx !== -1) {
-                postingList.splice(idx, 1);
-                if (postingList.length === 0) {
-                    this.tempPostingLists.delete(term);
-                }
-            }
-        }
-        // Remove ID mappings
-        this.entityToId.delete(entityName);
-        this.idToEntity.delete(docId);
-        return true;
-    }
-    /**
-     * Finalize the index by converting posting lists to Uint32Array.
-     *
-     * This should be called after bulk indexing for optimal memory usage.
-     * The index can still be updated after finalization, but it will
-     * temporarily use more memory during updates.
-     */
-    finalize() {
-        if (this.finalized)
-            return;
-        // Convert temp posting lists to Uint32Array and sort
-        this.postingLists.clear();
-        for (const [term, list] of this.tempPostingLists) {
-            // Sort and convert to Uint32Array
-            list.sort((a, b) => a - b);
-            const arr = new Uint32Array(list);
-            this.postingLists.set(term, arr);
-        }
-        // Clear temp posting lists to save memory
-        this.tempPostingLists.clear();
-        this.finalized = true;
-    }
-    /**
-     * Convert finalized index back to mutable format.
-     */
-    unfinalize() {
-        if (!this.finalized)
-            return;
-        // Convert Uint32Array back to regular arrays
-        this.tempPostingLists.clear();
-        for (const [term, arr] of this.postingLists) {
-            this.tempPostingLists.set(term, Array.from(arr));
-        }
-        this.postingLists.clear();
-        this.finalized = false;
-    }
-    /**
-     * Get posting list for a term.
-     *
-     * @param term - Term to look up
-     * @returns Posting list result or null if term not found
-     */
-    getPostingList(term) {
-        if (this.finalized) {
-            const arr = this.postingLists.get(term);
-            if (!arr)
-                return null;
-            return { term, docIds: arr };
-        }
-        else {
-            const list = this.tempPostingLists.get(term);
-            if (!list)
-                return null;
-            // Sort and return as Uint32Array
-            const sorted = list.slice().sort((a, b) => a - b);
-            return { term, docIds: new Uint32Array(sorted) };
-        }
-    }
-    /**
-     * Perform intersection of posting lists for multiple terms.
-     *
-     * Returns entity names that contain ALL specified terms.
-     *
-     * @param terms - Array of terms to intersect
-     * @returns Array of entity names containing all terms
-     */
-    intersect(terms) {
-        if (terms.length === 0) {
-            return [];
-        }
-        // Ensure finalized for optimal performance
-        if (!this.finalized) {
-            this.finalize();
-        }
-        // Get posting lists for all terms
-        const postingLists = [];
-        for (const term of terms) {
-            const list = this.postingLists.get(term);
-            if (!list || list.length === 0) {
-                // If any term has no posting list, intersection is empty
-                return [];
-            }
-            postingLists.push(list);
-        }
-        // Sort by length (smallest first for early termination)
-        postingLists.sort((a, b) => a.length - b.length);
-        // Perform multi-way sorted intersection
-        let result = postingLists[0];
-        for (let i = 1; i < postingLists.length; i++) {
-            result = this.intersectTwo(result, postingLists[i]);
-            if (result.length === 0) {
-                return [];
-            }
-        }
-        // Convert IDs back to entity names
-        return Array.from(result).map(id => this.idToEntity.get(id));
-    }
-    /**
-     * Perform union of posting lists for multiple terms.
-     *
-     * Returns entity names that contain ANY of the specified terms.
-     *
-     * @param terms - Array of terms to union
-     * @returns Array of entity names containing any term
-     */
-    union(terms) {
-        if (terms.length === 0) {
-            return [];
-        }
-        // Ensure finalized for optimal performance
-        if (!this.finalized) {
-            this.finalize();
-        }
-        // Collect all unique document IDs
-        const allIds = new Set();
-        for (const term of terms) {
-            const list = this.postingLists.get(term);
-            if (list) {
-                for (const id of list) {
-                    allIds.add(id);
-                }
-            }
-        }
-        // Convert IDs back to entity names
-        return Array.from(allIds).map(id => this.idToEntity.get(id));
-    }
-    /**
-     * Get entities containing a single term.
-     *
-     * @param term - Term to search for
-     * @returns Array of entity names containing the term
-     */
-    search(term) {
-        if (!this.finalized) {
-            const list = this.tempPostingLists.get(term);
-            if (!list)
-                return [];
-            return list.map(id => this.idToEntity.get(id));
-        }
-        const list = this.postingLists.get(term);
-        if (!list)
-            return [];
-        return Array.from(list).map(id => this.idToEntity.get(id));
-    }
-    /**
-     * Intersect two sorted Uint32Arrays.
-     *
-     * Uses merge-style intersection which is O(n+m).
-     */
-    intersectTwo(a, b) {
-        const result = [];
-        let i = 0;
-        let j = 0;
-        while (i < a.length && j < b.length) {
-            if (a[i] === b[j]) {
-                result.push(a[i]);
-                i++;
-                j++;
-            }
-            else if (a[i] < b[j]) {
-                i++;
-            }
-            else {
-                j++;
-            }
-        }
-        return new Uint32Array(result);
-    }
-    /**
-     * Get memory usage statistics.
-     */
-    getMemoryUsage() {
-        let postingListBytes = 0;
-        let termCount = 0;
-        if (this.finalized) {
-            for (const arr of this.postingLists.values()) {
-                // Uint32Array uses 4 bytes per element
-                postingListBytes += arr.byteLength;
-                termCount++;
-            }
-        }
-        else {
-            for (const list of this.tempPostingLists.values()) {
-                // Regular array uses 8 bytes per element (64-bit numbers in V8)
-                // Plus array overhead
-                postingListBytes += list.length * 8 + 32; // Approximate overhead
-                termCount++;
-            }
-        }
-        // Estimate ID map overhead
-        // Map has ~100 bytes overhead + ~50 bytes per entry for string keys
-        const idMapBytes = 100 +
-            this.entityToId.size * 50 +
-            this.idToEntity.size * 8; // number key is ~8 bytes
-        // Estimate term index overhead
-        // ~50 bytes per term entry (key + pointer)
-        const termIndexBytes = termCount * 50;
-        return {
-            postingListBytes,
-            idMapBytes,
-            termIndexBytes,
-            totalBytes: postingListBytes + idMapBytes + termIndexBytes,
-            termCount,
-            documentCount: this.entityToId.size,
-        };
-    }
-    /**
-     * Clear the entire index.
-     */
-    clear() {
-        this.entityToId.clear();
-        this.idToEntity.clear();
-        this.postingLists.clear();
-        this.tempPostingLists.clear();
-        this.nextId = 0;
-        this.finalized = false;
-    }
-    /**
-     * Get the number of documents in the index.
-     */
-    get documentCount() {
-        return this.entityToId.size;
-    }
-    /**
-     * Get the number of unique terms in the index.
-     */
-    get termCount() {
-        return this.finalized
-            ? this.postingLists.size
-            : this.tempPostingLists.size;
-    }
-    /**
-     * Check if an entity is indexed.
-     */
-    hasDocument(entityName) {
-        return this.entityToId.has(entityName);
-    }
-    /**
-     * Check if a term exists in the index.
-     */
-    hasTerm(term) {
-        return this.finalized
-            ? this.postingLists.has(term)
-            : this.tempPostingLists.has(term);
-    }
-}
-//# sourceMappingURL=OptimizedInvertedIndex.js.map

package/dist/search/OptimizedInvertedIndex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"OptimizedInvertedIndex.js","sourceRoot":"","sources":["../../src/search/OptimizedInvertedIndex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AA8BH;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,MAAM,OAAO,sBAAsB;IACjC,yCAAyC;IACjC,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEpD,yCAAyC;IACjC,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEpD,wBAAwB;IAChB,MAAM,GAAW,CAAC,CAAC;IAE3B,2DAA2D;IACnD,YAAY,GAA6B,IAAI,GAAG,EAAE,CAAC;IAE3D,oDAAoD;IAC5C,gBAAgB,GAA0B,IAAI,GAAG,EAAE,CAAC;IAE5D,8EAA8E;IACtE,SAAS,GAAY,KAAK,CAAC;IAEnC;;;;;OAKG;IACH,WAAW,CAAC,UAAkB,EAAE,KAAe;QAC7C,+DAA+D;QAC/D,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,CAAC;QAED,4BAA4B;QAC5B,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACtB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACvC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACzC,CAAC;QAED,oCAAoC;QACpC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAClC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAEpB,IAAI,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClD,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjB,WAAW,GAAG,EAAE,CAAC;gBACjB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;YAC/C,CAAC;YAED,6EAA6E;YAC7E,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBAC9E,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,UAAkB;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC9C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,uBAAuB;QACvB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,CAAC;QAED,gCAAgC;QAChC,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACxD,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACvC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;gBACf,WAAW,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC3B,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC7B,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACnC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAE9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,QAAQ;QACN,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAE3B,qDAAqD;QACrD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACjD,kCAAkC;YAClC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACnC,CAAC;QAED,0CAA0C;QAC1C,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;IACxB,CAAC;IAED;;OAEG;IACK,UAAU;QAChB,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO;QAE5B,6CAA6C;QAC7C,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC5C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,CAAC;QAED,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACH,cAAc,CAAC,IAAY;QACzB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,GAAG;gBAAE,OAAO,IAAI,CAAC;YACtB,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI;gBAAE,OAAO,IAAI,CAAC;YACvB,iCAAiC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;QACnD,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACH,SAAS,CAAC,KAAe;QACvB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,2CAA2C;QAC3C,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QAED,kCAAkC;QAClC,MAAM,YAAY,GAAkB,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC/B,yDAAyD;gBACzD,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,wDAAwD;QACxD,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAEjD,wCAAwC;QACxC,IAAI,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YACpD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;IAChE,CAAC;IAED;;;;;;;OAOG;IACH,KAAK,CAAC,KAAe;QACnB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,2CAA2C;QAC3C,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;QAED,kCAAkC;QAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,IAAI,EAAE,CAAC;gBACT,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;IAChE,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,IAAY;QACjB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI;gBAAE,OAAO,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;QAClD,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,CAAc,EAAE,CAAc;QACjD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClB,CAAC,EAAE,CAAC;gBACJ,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,CAAC;gBACN,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QAED,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC7C,uCAAuC;gBACvC,gBAAgB,IAAI,GAAG,CAAC,UAAU,CAAC;gBACnC,SAAS,EAAE,CAAC;YACd,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;gBAClD,gEAAgE;gBAChE,sBAAsB;gBACtB,gBAAgB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,uBAAuB;gBACjE,SAAS,EAAE,CAAC;YACd,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,oEAAoE;QACpE,MAAM,UAAU,GACd,GAAG;YACH,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,EAAE;YACzB,IAAI,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,yBAAyB;QAErD,+BAA+B;QAC/B,2CAA2C;QAC3C,MAAM,cAAc,GAAG,SAAS,GAAG,EAAE,CAAC;QAEtC,OAAO;YACL,gBAAgB;YAChB,UAAU;YACV,cAAc;YACd,UAAU,EAAE,gBAAgB,GAAG,UAAU,GAAG,cAAc;YAC1D,SAAS;YACT,aAAa,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;SACpC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,SAAS;YACnB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI;YACxB,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC;IACjC,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,UAAkB;QAC5B,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY;QAClB,OAAO,IAAI,CAAC,SAAS;YACnB,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC;YAC7B,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;CACF"}