@danielsimonjr/memoryjs 1.0.0

package/dist/features/CompressionManager.js

@@ -0,0 +1,470 @@
+/**
+ * Compression Manager
+ *
+ * Handles duplicate detection, entity merging, and graph compression.
+ * Extracted from SearchManager (Phase 4: Consolidate God Objects).
+ *
+ * @module features/CompressionManager
+ */
+import { levenshteinDistance, checkCancellation, createProgressReporter, createProgress, fnv1aHash, } from '../utils/index.js';
+import { EntityNotFoundError, InsufficientEntitiesError } from '../utils/errors.js';
+import { SIMILARITY_WEIGHTS, DEFAULT_DUPLICATE_THRESHOLD } from '../utils/constants.js';
+/**
+ * Manages compression operations for the knowledge graph.
+ */
+export class CompressionManager {
+    storage;
+    constructor(storage) {
+        this.storage = storage;
+    }
+    /**
+     * Prepare an entity for efficient similarity comparisons.
+     * Pre-computes all normalized data to avoid repeated computation.
+     *
+     * Phase 12 Sprint 1: Added nameHash for fast bucketing.
+     *
+     * @param entity - The entity to prepare
+     * @returns PreparedEntity with pre-computed data including hash
+     */
+    prepareEntity(entity) {
+        const nameLower = entity.name.toLowerCase();
+        return {
+            entity,
+            nameLower,
+            typeLower: entity.entityType.toLowerCase(),
+            observationSet: new Set(entity.observations.map(o => o.toLowerCase())),
+            tagSet: new Set((entity.tags ?? []).map(t => t.toLowerCase())),
+            nameHash: fnv1aHash(nameLower),
+        };
+    }
+    /**
+     * Prepare multiple entities for efficient similarity comparisons.
+     * Use this before batch comparison operations.
+     *
+     * @param entities - Entities to prepare
+     * @returns Map of entity name to PreparedEntity
+     */
+    prepareEntities(entities) {
+        const prepared = new Map();
+        for (const entity of entities) {
+            prepared.set(entity.name, this.prepareEntity(entity));
+        }
+        return prepared;
+    }
+    /**
+     * Calculate similarity between two entities using multiple heuristics.
+     *
+     * Uses configurable weights defined in SIMILARITY_WEIGHTS constant.
+     * See SIMILARITY_WEIGHTS for the breakdown of scoring factors.
+     *
+     * NOTE: For batch comparisons, use prepareEntities() + calculatePreparedSimilarity() for better performance.
+     *
+     * @param e1 - First entity
+     * @param e2 - Second entity
+     * @returns Similarity score from 0 (completely different) to 1 (identical)
+     */
+    calculateEntitySimilarity(e1, e2) {
+        let score = 0;
+        let factors = 0;
+        // Name similarity (Levenshtein-based)
+        const nameDistance = levenshteinDistance(e1.name.toLowerCase(), e2.name.toLowerCase());
+        const maxNameLength = Math.max(e1.name.length, e2.name.length);
+        const nameSimilarity = 1 - nameDistance / maxNameLength;
+        score += nameSimilarity * SIMILARITY_WEIGHTS.NAME;
+        factors += SIMILARITY_WEIGHTS.NAME;
+        // Type similarity (exact match)
+        if (e1.entityType.toLowerCase() === e2.entityType.toLowerCase()) {
+            score += SIMILARITY_WEIGHTS.TYPE;
+        }
+        factors += SIMILARITY_WEIGHTS.TYPE;
+        // Observation overlap (Jaccard similarity)
+        const obs1Set = new Set(e1.observations.map(o => o.toLowerCase()));
+        const obs2Set = new Set(e2.observations.map(o => o.toLowerCase()));
+        const intersection = new Set([...obs1Set].filter(x => obs2Set.has(x)));
+        const union = new Set([...obs1Set, ...obs2Set]);
+        const observationSimilarity = union.size > 0 ? intersection.size / union.size : 0;
+        score += observationSimilarity * SIMILARITY_WEIGHTS.OBSERVATIONS;
+        factors += SIMILARITY_WEIGHTS.OBSERVATIONS;
+        // Tag overlap (Jaccard similarity)
+        if (e1.tags && e2.tags && (e1.tags.length > 0 || e2.tags.length > 0)) {
+            const tags1Set = new Set(e1.tags.map(t => t.toLowerCase()));
+            const tags2Set = new Set(e2.tags.map(t => t.toLowerCase()));
+            const tagIntersection = new Set([...tags1Set].filter(x => tags2Set.has(x)));
+            const tagUnion = new Set([...tags1Set, ...tags2Set]);
+            const tagSimilarity = tagUnion.size > 0 ? tagIntersection.size / tagUnion.size : 0;
+            score += tagSimilarity * SIMILARITY_WEIGHTS.TAGS;
+            factors += SIMILARITY_WEIGHTS.TAGS;
+        }
+        return factors > 0 ? score / factors : 0;
+    }
+    /**
+     * Efficiently calculate intersection size of two Sets without creating a new Set.
+     * Iterates over the smaller set for O(min(m,n)) complexity.
+     */
+    setIntersectionSize(a, b) {
+        // Always iterate over smaller set
+        const [smaller, larger] = a.size <= b.size ? [a, b] : [b, a];
+        let count = 0;
+        for (const item of smaller) {
+            if (larger.has(item))
+                count++;
+        }
+        return count;
+    }
+    /**
+     * Calculate similarity between two prepared entities.
+     * OPTIMIZED: Uses pre-computed Sets to avoid O(n) set creation per comparison.
+     *
+     * @param p1 - First prepared entity
+     * @param p2 - Second prepared entity
+     * @returns Similarity score from 0 (completely different) to 1 (identical)
+     */
+    calculatePreparedSimilarity(p1, p2) {
+        let score = 0;
+        let factors = 0;
+        // Name similarity (Levenshtein-based) - use pre-computed lowercase
+        const nameDistance = levenshteinDistance(p1.nameLower, p2.nameLower);
+        const maxNameLength = Math.max(p1.nameLower.length, p2.nameLower.length);
+        const nameSimilarity = 1 - nameDistance / maxNameLength;
+        score += nameSimilarity * SIMILARITY_WEIGHTS.NAME;
+        factors += SIMILARITY_WEIGHTS.NAME;
+        // Type similarity (exact match) - use pre-computed lowercase
+        if (p1.typeLower === p2.typeLower) {
+            score += SIMILARITY_WEIGHTS.TYPE;
+        }
+        factors += SIMILARITY_WEIGHTS.TYPE;
+        // Observation overlap (Jaccard similarity) - use pre-computed Sets
+        const obsIntersectionSize = this.setIntersectionSize(p1.observationSet, p2.observationSet);
+        const obsUnionSize = p1.observationSet.size + p2.observationSet.size - obsIntersectionSize;
+        const observationSimilarity = obsUnionSize > 0 ? obsIntersectionSize / obsUnionSize : 0;
+        score += observationSimilarity * SIMILARITY_WEIGHTS.OBSERVATIONS;
+        factors += SIMILARITY_WEIGHTS.OBSERVATIONS;
+        // Tag overlap (Jaccard similarity) - use pre-computed Sets
+        if (p1.tagSet.size > 0 || p2.tagSet.size > 0) {
+            const tagIntersectionSize = this.setIntersectionSize(p1.tagSet, p2.tagSet);
+            const tagUnionSize = p1.tagSet.size + p2.tagSet.size - tagIntersectionSize;
+            const tagSimilarity = tagUnionSize > 0 ? tagIntersectionSize / tagUnionSize : 0;
+            score += tagSimilarity * SIMILARITY_WEIGHTS.TAGS;
+            factors += SIMILARITY_WEIGHTS.TAGS;
+        }
+        return factors > 0 ? score / factors : 0;
+    }
+    /**
+     * Find duplicate entities in the graph based on similarity threshold.
+     *
+     * OPTIMIZED: Uses bucketing strategies to reduce O(n²) comparisons:
+     * 1. Buckets entities by entityType (only compare same types)
+     * 2. Within each type, buckets by name prefix (first 2 chars normalized)
+     * 3. Only compares entities within same or adjacent buckets
+     *
+     * Phase 9B: Supports progress tracking and cancellation via LongRunningOperationOptions.
+     *
+     * Complexity: O(n·k) where k is average bucket size (typically << n)
+     *
+     * @param threshold - Similarity threshold (0.0 to 1.0), default DEFAULT_DUPLICATE_THRESHOLD
+     * @param options - Optional progress/cancellation options (Phase 9B)
+     * @returns Array of duplicate groups (each group has similar entities)
+     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
+     */
+    async findDuplicates(threshold = DEFAULT_DUPLICATE_THRESHOLD, options) {
+        // Check for early cancellation
+        checkCancellation(options?.signal, 'findDuplicates');
+        const graph = await this.storage.loadGraph();
+        const duplicateGroups = [];
+        const processed = new Set();
+        // Setup progress reporter
+        const reportProgress = createProgressReporter(options?.onProgress);
+        const totalEntities = graph.entities.length;
+        let processedCount = 0;
+        reportProgress?.(createProgress(0, totalEntities, 'findDuplicates'));
+        // OPTIMIZATION: Pre-prepare all entities once before comparisons
+        const preparedEntities = this.prepareEntities(graph.entities);
+        // Step 1: Bucket entities by type (reduces comparisons drastically)
+        const typeMap = new Map();
+        for (const entity of graph.entities) {
+            const normalizedType = entity.entityType.toLowerCase();
+            if (!typeMap.has(normalizedType)) {
+                typeMap.set(normalizedType, []);
+            }
+            typeMap.get(normalizedType).push(entity);
+        }
+        // Step 2: For each type bucket, sub-bucket by name prefix
+        for (const entities of typeMap.values()) {
+            // Check for cancellation between type buckets
+            checkCancellation(options?.signal, 'findDuplicates');
+            // Skip single-entity types (no duplicates possible)
+            if (entities.length < 2) {
+                processedCount += entities.length;
+                reportProgress?.(createProgress(processedCount, totalEntities, 'findDuplicates'));
+                continue;
+            }
+            // Create name prefix buckets (first 2 chars, normalized)
+            const prefixMap = new Map();
+            for (const entity of entities) {
+                const prefix = entity.name.toLowerCase().slice(0, 2);
+                if (!prefixMap.has(prefix)) {
+                    prefixMap.set(prefix, []);
+                }
+                prefixMap.get(prefix).push(entity);
+            }
+            // Step 3: Compare only within buckets (or adjacent buckets for fuzzy matching)
+            const prefixKeys = Array.from(prefixMap.keys()).sort();
+            for (let bucketIdx = 0; bucketIdx < prefixKeys.length; bucketIdx++) {
+                // Check for cancellation between prefix buckets
+                checkCancellation(options?.signal, 'findDuplicates');
+                const currentPrefix = prefixKeys[bucketIdx];
+                const currentBucket = prefixMap.get(currentPrefix);
+                // Collect entities to compare: current bucket + adjacent buckets
+                const candidateEntities = [...currentBucket];
+                // Add next bucket if exists (handles fuzzy prefix matching)
+                if (bucketIdx + 1 < prefixKeys.length) {
+                    candidateEntities.push(...prefixMap.get(prefixKeys[bucketIdx + 1]));
+                }
+                // Compare entities within candidate pool
+                for (let i = 0; i < currentBucket.length; i++) {
+                    const entity1 = currentBucket[i];
+                    if (processed.has(entity1.name))
+                        continue;
+                    // OPTIMIZATION: Use prepared entity for comparison
+                    const prepared1 = preparedEntities.get(entity1.name);
+                    const group = [entity1.name];
+                    for (let j = 0; j < candidateEntities.length; j++) {
+                        const entity2 = candidateEntities[j];
+                        if (entity1.name === entity2.name || processed.has(entity2.name))
+                            continue;
+                        // OPTIMIZATION: Use prepared entity and optimized similarity
+                        const prepared2 = preparedEntities.get(entity2.name);
+                        const similarity = this.calculatePreparedSimilarity(prepared1, prepared2);
+                        if (similarity >= threshold) {
+                            group.push(entity2.name);
+                            processed.add(entity2.name);
+                        }
+                    }
+                    if (group.length > 1) {
+                        duplicateGroups.push(group);
+                        processed.add(entity1.name);
+                    }
+                    processedCount++;
+                    reportProgress?.(createProgress(processedCount, totalEntities, 'findDuplicates'));
+                }
+            }
+        }
+        // Report completion
+        reportProgress?.(createProgress(totalEntities, totalEntities, 'findDuplicates'));
+        return duplicateGroups;
+    }
+    /**
+     * Merge a group of entities into a single entity.
+     *
+     * Merging strategy:
+     * - First entity is kept (or renamed to targetName)
+     * - Observations: Union of all observations
+     * - Tags: Union of all tags
+     * - Importance: Maximum importance value
+     * - createdAt: Earliest date
+     * - lastModified: Current timestamp
+     * - Relations: Redirected to kept entity, duplicates removed
+     *
+     * @param entityNames - Names of entities to merge (first one is kept)
+     * @param targetName - Optional new name for merged entity (default: first entity name)
+     * @param options - Optional configuration
+     * @param options.graph - Pre-loaded graph to use (avoids reload)
+     * @param options.skipSave - If true, don't save (caller will save)
+     * @returns The merged entity
+     * @throws {InsufficientEntitiesError} If less than 2 entities provided
+     * @throws {EntityNotFoundError} If any entity not found
+     */
+    async mergeEntities(entityNames, targetName, options = {}) {
+        if (entityNames.length < 2) {
+            throw new InsufficientEntitiesError('merging', 2, entityNames.length);
+        }
+        // Use provided graph or load fresh
+        const graph = options.graph ?? await this.storage.getGraphForMutation();
+        const entitiesToMerge = entityNames.map(name => {
+            const entity = graph.entities.find(e => e.name === name);
+            if (!entity) {
+                throw new EntityNotFoundError(name);
+            }
+            return entity;
+        });
+        const keepEntity = entitiesToMerge[0];
+        const mergeEntities = entitiesToMerge.slice(1);
+        // Merge observations (unique)
+        const allObservations = new Set();
+        for (const entity of entitiesToMerge) {
+            entity.observations.forEach(obs => allObservations.add(obs));
+        }
+        keepEntity.observations = Array.from(allObservations);
+        // Merge tags (unique)
+        const allTags = new Set();
+        for (const entity of entitiesToMerge) {
+            if (entity.tags) {
+                entity.tags.forEach(tag => allTags.add(tag));
+            }
+        }
+        if (allTags.size > 0) {
+            keepEntity.tags = Array.from(allTags);
+        }
+        // Use highest importance
+        const importances = entitiesToMerge
+            .map(e => e.importance)
+            .filter(imp => imp !== undefined);
+        if (importances.length > 0) {
+            keepEntity.importance = Math.max(...importances);
+        }
+        // Use earliest createdAt
+        const createdDates = entitiesToMerge
+            .map(e => e.createdAt)
+            .filter(date => date !== undefined);
+        if (createdDates.length > 0) {
+            keepEntity.createdAt = createdDates.sort()[0];
+        }
+        // Update lastModified
+        keepEntity.lastModified = new Date().toISOString();
+        // Rename if requested
+        if (targetName && targetName !== keepEntity.name) {
+            // Update all relations pointing to old name
+            graph.relations.forEach(rel => {
+                if (rel.from === keepEntity.name)
+                    rel.from = targetName;
+                if (rel.to === keepEntity.name)
+                    rel.to = targetName;
+            });
+            keepEntity.name = targetName;
+        }
+        // Update relations from merged entities to point to kept entity
+        for (const mergeEntity of mergeEntities) {
+            graph.relations.forEach(rel => {
+                if (rel.from === mergeEntity.name)
+                    rel.from = keepEntity.name;
+                if (rel.to === mergeEntity.name)
+                    rel.to = keepEntity.name;
+            });
+        }
+        // Remove duplicate relations
+        const uniqueRelations = new Map();
+        for (const relation of graph.relations) {
+            const key = `${relation.from}|${relation.to}|${relation.relationType}`;
+            if (!uniqueRelations.has(key)) {
+                uniqueRelations.set(key, relation);
+            }
+        }
+        graph.relations = Array.from(uniqueRelations.values());
+        // Remove merged entities
+        const mergeNames = new Set(mergeEntities.map(e => e.name));
+        graph.entities = graph.entities.filter(e => !mergeNames.has(e.name));
+        // Save unless caller said to skip
+        if (!options.skipSave) {
+            await this.storage.saveGraph(graph);
+        }
+        return keepEntity;
+    }
+    /**
+     * Compress the knowledge graph by finding and merging duplicates.
+     * OPTIMIZED: Loads graph once, performs all merges, saves once.
+     *
+     * Phase 9B: Supports progress tracking and cancellation via LongRunningOperationOptions.
+     *
+     * @param threshold - Similarity threshold for duplicate detection (0.0 to 1.0), default DEFAULT_DUPLICATE_THRESHOLD
+     * @param dryRun - If true, only report what would be compressed without applying changes
+     * @param options - Optional progress/cancellation options (Phase 9B)
+     * @returns Compression result with statistics
+     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
+     */
+    async compressGraph(threshold = DEFAULT_DUPLICATE_THRESHOLD, dryRun = false, options) {
+        // Check for early cancellation
+        checkCancellation(options?.signal, 'compressGraph');
+        // Setup progress reporter (we'll use phases: 50% finding duplicates, 50% merging)
+        const reportProgress = createProgressReporter(options?.onProgress);
+        reportProgress?.(createProgress(0, 100, 'compressGraph'));
+        // Phase 1: Find duplicates (0-50% progress)
+        const duplicateGroups = await this.findDuplicates(threshold, {
+            signal: options?.signal,
+            onProgress: (p) => {
+                // Map findDuplicates progress (0-100%) to compressGraph progress (0-50%)
+                const compressProgress = Math.round(p.percentage * 0.5);
+                reportProgress?.(createProgress(compressProgress, 100, 'finding duplicates'));
+            },
+        });
+        // Check for cancellation after finding duplicates
+        checkCancellation(options?.signal, 'compressGraph');
+        reportProgress?.(createProgress(50, 100, 'compressGraph'));
+        // OPTIMIZATION: Load graph once for all operations
+        const graph = await this.storage.getGraphForMutation();
+        const initialSize = JSON.stringify(graph).length;
+        const result = {
+            duplicatesFound: duplicateGroups.reduce((sum, group) => sum + group.length, 0),
+            entitiesMerged: 0,
+            observationsCompressed: 0,
+            relationsConsolidated: 0,
+            spaceFreed: 0,
+            mergedEntities: [],
+        };
+        if (dryRun) {
+            // Just report what would happen
+            for (const group of duplicateGroups) {
+                result.mergedEntities.push({
+                    kept: group[0],
+                    merged: group.slice(1),
+                });
+                result.entitiesMerged += group.length - 1;
+            }
+            reportProgress?.(createProgress(100, 100, 'compressGraph'));
+            return result;
+        }
+        // Phase 2: Merge duplicates (50-100% progress)
+        const totalGroups = duplicateGroups.length;
+        let mergedGroups = 0;
+        // OPTIMIZATION: Build entity lookup map for O(1) access during merges
+        const entityMap = new Map();
+        for (const entity of graph.entities) {
+            entityMap.set(entity.name, entity);
+        }
+        // Merge all duplicates using the same graph instance
+        for (const group of duplicateGroups) {
+            // Check for cancellation between merges
+            checkCancellation(options?.signal, 'compressGraph');
+            try {
+                // Count observations before merge using O(1) lookup
+                let totalObservationsBefore = 0;
+                for (const name of group) {
+                    const entity = entityMap.get(name);
+                    if (entity) {
+                        totalObservationsBefore += entity.observations.length;
+                    }
+                }
+                // OPTIMIZATION: Pass graph and skip individual saves
+                const mergedEntity = await this.mergeEntities(group, undefined, {
+                    graph,
+                    skipSave: true,
+                });
+                const observationsAfter = mergedEntity.observations.length;
+                result.observationsCompressed += totalObservationsBefore - observationsAfter;
+                result.mergedEntities.push({
+                    kept: group[0],
+                    merged: group.slice(1),
+                });
+                result.entitiesMerged += group.length - 1;
+            }
+            catch (error) {
+                // Skip groups that fail to merge
+                console.error(`Failed to merge group ${group}:`, error);
+            }
+            mergedGroups++;
+            // Map merge progress (0-100%) to compressGraph progress (50-100%)
+            const mergeProgress = totalGroups > 0 ? Math.round(50 + (mergedGroups / totalGroups) * 50) : 100;
+            reportProgress?.(createProgress(mergeProgress, 100, 'merging entities'));
+        }
+        // Check for cancellation before final save
+        checkCancellation(options?.signal, 'compressGraph');
+        // OPTIMIZATION: Save once after all merges complete
+        await this.storage.saveGraph(graph);
+        const finalSize = JSON.stringify(graph).length;
+        result.spaceFreed = initialSize - finalSize;
+        result.relationsConsolidated = result.entitiesMerged;
+        // Report completion
+        reportProgress?.(createProgress(100, 100, 'compressGraph'));
+        return result;
+    }
+}
+//# sourceMappingURL=CompressionManager.js.map

package/dist/features/CompressionManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CompressionManager.js","sourceRoot":"","sources":["../../src/features/CompressionManager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EACL,mBAAmB,EACnB,iBAAiB,EACjB,sBAAsB,EACtB,cAAc,EACd,SAAS,GACV,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,mBAAmB,EAAE,yBAAyB,EAAE,MAAM,oBAAoB,CAAC;AACpF,OAAO,EAAE,kBAAkB,EAAE,2BAA2B,EAAE,MAAM,uBAAuB,CAAC;AAExF;;GAEG;AACH,MAAM,OAAO,kBAAkB;IACT;IAApB,YAAoB,OAAqB;QAArB,YAAO,GAAP,OAAO,CAAc;IAAG,CAAC;IAE7C;;;;;;;;OAQG;IACK,aAAa,CAAC,MAAc;QAClC,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5C,OAAO;YACL,MAAM;YACN,SAAS;YACT,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE;YAC1C,cAAc,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;YACtE,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;YAC9D,QAAQ,EAAE,SAAS,CAAC,SAAS,CAAC;SAC/B,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACK,eAAe,CAAC,QAA2B;QACjD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA0B,CAAC;QACnD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,yBAAyB,CAAC,EAAU,EAAE,EAAU;QAC9C,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,sCAAsC;QACtC,MAAM,YAAY,GAAG,mBAAmB,CAAC,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;QACvF,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,cAAc,GAAG,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC;QACxD,KAAK,IAAI,cAAc,GAAG,kBAAkB,CAAC,IAAI,CAAC;QAClD,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC;QAEnC,gCAAgC;QAChC,IAAI,EAAE,CAAC,UAAU,CAAC,WAAW,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,CAAC;YAChE,KAAK,IAAI,kBAAkB,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC;QAEnC,2CAA2C;QAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACnE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;QAChD,MAAM,qBAAqB,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,KAAK,IAAI,qBAAqB,GAAG,kBAAkB,CAAC,YAAY,CAAC;QACjE,OAAO,IAAI,kBAAkB,CAAC,YAAY,CAAC;QAE3C,mCAAmC;QACnC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YAC5D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;YACrD,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACnF,KAAK,IAAI,aAAa,GAAG,kBAAkB,CAAC,IAAI,CAAC;YACjD,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC;QACrC,CAAC;QAED,OAAO,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACK,mBAAmB,CAAC,CAAc,EAAE,CAAc;QACxD,kCAAkC;QAClC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,KAAK,EAAE,CAAC;QAChC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACK,2BAA2B,CAAC,EAAkB,EAAE,EAAkB;QACxE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,mEAAmE;QACnE,MAAM,YAAY,GAAG,mBAAmB,CAAC,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC;QACrE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACzE,MAAM,cAAc,GAAG,CAAC,GAAG,YAAY,GAAG,aAAa,CAAC;QACxD,KAAK,IAAI,cAAc,GAAG,kBAAkB,CAAC,IAAI,CAAC;QAClD,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC;QAEnC,6DAA6D;QAC7D,IAAI,EAAE,CAAC,SAAS,KAAK,EAAE,CAAC,SAAS,EAAE,CAAC;YAClC,KAAK,IAAI,kBAAkB,CAAC,IAAI,CAAC;QACnC,CAAC;QACD,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC;QAEnC,mEAAmE;QACnE,MAAM,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC;QAC3F,MAAM,YAAY,GAAG,EAAE,CAAC,cAAc,CAAC,IAAI,GAAG,EAAE,CAAC,cAAc,CAAC,IAAI,GAAG,mBAAmB,CAAC;QAC3F,MAAM,qBAAqB,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACxF,KAAK,IAAI,qBAAqB,GAAG,kBAAkB,CAAC,YAAY,CAAC;QACjE,OAAO,IAAI,kBAAkB,CAAC,YAAY,CAAC;QAE3C,2DAA2D;QAC3D,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC7C,MAAM,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;YAC3E,MAAM,YAAY,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,GAAG,mBAAmB,CAAC;YAC3E,MAAM,aAAa,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,KAAK,IAAI,aAAa,GAAG,kBAAkB,CAAC,IAAI,CAAC;YACjD,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC;QACrC,CAAC;QAED,OAAO,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACH,KAAK,CAAC,cAAc,CAClB,YAAoB,2BAA2B,EAC/C,OAAqC;QAErC,+BAA+B;QAC/B,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;QAErD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,eAAe,GAAe,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,0BAA0B;QAC1B,MAAM,cAAc,GAAG,sBAAsB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACnE,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC5C,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,cAAc,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,aAAa,EAAE,gBAAgB,CAAC,CAAC,CAAC;QAErE,iEAAiE;QACjE,MAAM,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAE9D,oEAAoE;QACpE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,cAAc,GAAG,MAAM,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC;YACvD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;gBACjC,OAAO,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;YAClC,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,cAAc,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QAED,0DAA0D;QAC1D,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,8CAA8C;YAC9C,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;YAErD,oDAAoD;YACpD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,cAAc,IAAI,QAAQ,CAAC,MAAM,CAAC;gBAClC,cAAc,EAAE,CAAC,cAAc,CAAC,cAAc,EAAE,aAAa,EAAE,gBAAgB,CAAC,CAAC,CAAC;gBAClF,SAAS;YACX,CAAC;YAED,yDAAyD;YACzD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;YAC9C,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;gBAC5B,CAAC;gBACD,SAAS,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtC,CAAC;YAED,+EAA+E;YAC/E,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAEvD,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,UAAU,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,CAAC;gBACnE,gDAAgD;gBAChD,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;gBAErD,MAAM,aAAa,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC5C,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC;gBAEpD,iEAAiE;gBACjE,MAAM,iBAAiB,GAAa,CAAC,GAAG,aAAa,CAAC,CAAC;gBAEvD,4DAA4D;gBAC5D,IAAI,SAAS,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;oBACtC,iBAAiB,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBACvE,CAAC;gBAED,yCAAyC;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9C,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;wBAAE,SAAS;oBAE1C,mDAAmD;oBACnD,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAE,CAAC;oBACtD,MAAM,KAAK,GAAa,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAClD,MAAM,OAAO,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;wBACrC,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;4BAAE,SAAS;wBAE3E,6DAA6D;wBAC7D,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAE,CAAC;wBACtD,MAAM,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;wBAC1E,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;4BAC5B,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;4BACzB,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;wBAC9B,CAAC;oBACH,CAAC;oBAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACrB,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBAC5B,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAC9B,CAAC;oBAED,cAAc,EAAE,CAAC;oBACjB,cAAc,EAAE,CAAC,cAAc,CAAC,cAAc,EAAE,aAAa,EAAE,gBAAgB,CAAC,CAAC,CAAC;gBACpF,CAAC;YACH,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,cAAc,EAAE,CAAC,cAAc,CAAC,aAAa,EAAE,aAAa,EAAE,gBAAgB,CAAC,CAAC,CAAC;QAEjF,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,KAAK,CAAC,aAAa,CACjB,WAAqB,EACrB,UAAmB,EACnB,UAGI,EAAE;QAEN,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,yBAAyB,CAAC,SAAS,EAAE,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;QACxE,CAAC;QAED,mCAAmC;QACnC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC;QACxE,MAAM,eAAe,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YAC7C,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;YACzD,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC;YACtC,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAE/C,8BAA8B;QAC9B,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;QAC1C,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;YACrC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,UAAU,CAAC,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAEtD,sBAAsB;QACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;YACrC,IAAI,MAAM,CAAC,IAAI,EAAE,CAAC;gBAChB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACrB,UAAU,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;QAED,yBAAyB;QACzB,MAAM,WAAW,GAAG,eAAe;aAChC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;aACtB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,SAAS,CAAa,CAAC;QAChD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,UAAU,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;QACnD,CAAC;QAED,yBAAyB;QACzB,MAAM,YAAY,GAAG,eAAe;aACjC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;aACrB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,SAAS,CAAa,CAAC;QAClD,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,UAAU,CAAC,SAAS,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,sBAAsB;QACtB,UAAU,CAAC,YAAY,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAEnD,sBAAsB;QACtB,IAAI,UAAU,IAAI,UAAU,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC;YACjD,4CAA4C;YAC5C,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBAC5B,IAAI,GAAG,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI;oBAAE,GAAG,CAAC,IAAI,GAAG,UAAU,CAAC;gBACxD,IAAI,GAAG,CAAC,EAAE,KAAK,UAAU,CAAC,IAAI;oBAAE,GAAG,CAAC,EAAE,GAAG,UAAU,CAAC;YACtD,CAAC,CAAC,CAAC;YACH,UAAU,CAAC,IAAI,GAAG,UAAU,CAAC;QAC/B,CAAC;QAED,gEAAgE;QAChE,KAAK,MAAM,WAAW,IAAI,aAAa,EAAE,CAAC;YACxC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBAC5B,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI;oBAAE,GAAG,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC;gBAC9D,IAAI,GAAG,CAAC,EAAE,KAAK,WAAW,CAAC,IAAI;oBAAE,GAAG,CAAC,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC;YAC5D,CAAC,CAAC,CAAC;QACL,CAAC;QAED,6BAA6B;QAC7B,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;QACpD,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,GAAG,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;YACvE,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9B,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,CAAC;QAEvD,yBAAyB;QACzB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3D,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAErE,kCAAkC;QAClC,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,aAAa,CACjB,YAAoB,2BAA2B,EAC/C,SAAkB,KAAK,EACvB,OAAqC;QAErC,+BAA+B;QAC/B,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;QAEpD,kFAAkF;QAClF,MAAM,cAAc,GAAG,sBAAsB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACnE,cAAc,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC,CAAC;QAE1D,4CAA4C;QAC5C,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE;YAC3D,MAAM,EAAE,OAAO,EAAE,MAAM;YACvB,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE;gBAChB,yEAAyE;gBACzE,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;gBACxD,cAAc,EAAE,CAAC,cAAc,CAAC,gBAAgB,EAAE,GAAG,EAAE,oBAAoB,CAAC,CAAC,CAAC;YAChF,CAAC;SACF,CAAC,CAAC;QAEH,kDAAkD;QAClD,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;QACpD,cAAc,EAAE,CAAC,cAAc,CAAC,EAAE,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC,CAAC;QAE3D,mDAAmD;QACnD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC;QACvD,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;QACjD,MAAM,MAAM,GAA2B;YACrC,eAAe,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;YAC9E,cAAc,EAAE,CAAC;YACjB,sBAAsB,EAAE,CAAC;YACzB,qBAAqB,EAAE,CAAC;YACxB,UAAU,EAAE,CAAC;YACb,cAAc,EAAE,EAAE;SACnB,CAAC;QAEF,IAAI,MAAM,EAAE,CAAC;YACX,gCAAgC;YAChC,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;gBACpC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC;oBACzB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;oBACd,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;iBACvB,CAAC,CAAC;gBACH,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5C,CAAC;YACD,cAAc,EAAE,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC,CAAC;YAC5D,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,+CAA+C;QAC/C,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC;QAC3C,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,sEAAsE;QACtE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC;QAED,qDAAqD;QACrD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,wCAAwC;YACxC,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;YAEpD,IAAI,CAAC;gBACH,oDAAoD;gBACpD,IAAI,uBAAuB,GAAG,CAAC,CAAC;gBAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACnC,IAAI,MAAM,EAAE,CAAC;wBACX,uBAAuB,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC;oBACxD,CAAC;gBACH,CAAC;gBAED,qDAAqD;gBACrD,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE;oBAC9D,KAAK;oBACL,QAAQ,EAAE,IAAI;iBACf,CAAC,CAAC;gBAEH,MAAM,iBAAiB,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC;gBAC3D,MAAM,CAAC,sBAAsB,IAAI,uBAAuB,GAAG,iBAAiB,CAAC;gBAE7E,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC;oBACzB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;oBACd,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;iBACvB,CAAC,CAAC;gBACH,MAAM,CAAC,cAAc,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5C,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,iCAAiC;gBACjC,OAAO,CAAC,KAAK,CAAC,yBAAyB,KAAK,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1D,CAAC;YAED,YAAY,EAAE,CAAC;YACf,kEAAkE;YAClE,MAAM,aAAa,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,YAAY,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;YACjG,cAAc,EAAE,CAAC,cAAc,CAAC,aAAa,EAAE,GAAG,EAAE,kBAAkB,CAAC,CAAC,CAAC;QAC3E,CAAC;QAED,2CAA2C;QAC3C,iBAAiB,CAAC,OAAO,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;QAEpD,oDAAoD;QACpD,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAEpC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;QAC/C,MAAM,CAAC,UAAU,GAAG,WAAW,GAAG,SAAS,CAAC;QAC5C,MAAM,CAAC,qBAAqB,GAAG,MAAM,CAAC,cAAc,CAAC;QAErD,oBAAoB;QACpB,cAAc,EAAE,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC,CAAC;QAE5D,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}