@hazeljs/rag 0.2.0-alpha.1

package/dist/graph/graph-rag-pipeline.d.ts

@@ -0,0 +1,83 @@
+/**
+ * GraphRAGPipeline
+ *
+ * The main entry point for GraphRAG. Orchestrates:
+ *  1. Entity/relationship extraction (EntityExtractor)
+ *  2. Knowledge graph construction (GraphStore)
+ *  3. Community detection (CommunityDetector — LPA)
+ *  4. Community report generation (CommunitySummarizer)
+ *  5. Local and global search with LLM synthesis
+ *
+ * Search modes:
+ * ┌──────────────┬────────────────────────────────────────────────────────┐
+ * │ LOCAL        │ Finds entities matching the query, traverses K hops of │
+ * │              │ the graph, assembles entity+relationship context, then  │
+ * │              │ synthesises an answer. Best for specific questions.     │
+ * ├──────────────┼────────────────────────────────────────────────────────┤
+ * │ GLOBAL       │ Searches community reports by keyword/relevance, ranks  │
+ * │              │ them, assembles a map-reduce-style context, then        │
+ * │              │ synthesises a holistic answer. Best for broad questions.│
+ * ├──────────────┼────────────────────────────────────────────────────────┤
+ * │ HYBRID       │ Runs both local and global, merges contexts, and asks   │
+ * │              │ the LLM to produce a unified answer.                   │
+ * └──────────────┴────────────────────────────────────────────────────────┘
+ *
+ * Quick start:
+ *   const pipeline = new GraphRAGPipeline({ llm: async (p) => openai.chat(p) });
+ *   await pipeline.build(documents);
+ *   const result = await pipeline.search('What is HazelJS dependency injection?');
+ */
+import type { Document } from '../types';
+import type { GraphRAGConfig, GraphBuildStats, GraphSearchOptions, GraphSearchResult, GraphStats } from './graph.types';
+import { GraphStore } from './knowledge-graph';
+import '../prompts/graph-search.prompt';
+export declare class GraphRAGPipeline {
+    private readonly config;
+    private readonly graph;
+    private readonly extractor;
+    private readonly communityDetector;
+    private readonly communitySummarizer;
+    constructor(config: GraphRAGConfig);
+    /**
+     * Build (or rebuild) the entire knowledge graph from an array of Documents.
+     * Clears any existing graph state before building.
+     */
+    build(documents: Document[]): Promise<GraphBuildStats>;
+    /**
+     * Incrementally add more documents to an existing graph.
+     * New entities are merged with existing ones if names match.
+     */
+    addDocuments(documents: Document[]): Promise<GraphBuildStats>;
+    /** Unified search entry point. Defaults to 'hybrid' mode. */
+    search(query: string, options?: GraphSearchOptions): Promise<GraphSearchResult>;
+    /**
+     * Entity-centric local search.
+     * 1. Find entities whose names match the query keywords.
+     * 2. Traverse up to `depth` hops in the knowledge graph.
+     * 3. Assemble entity + relationship context.
+     * 4. Synthesise an answer with the LLM.
+     */
+    localSearch(query: string, options?: GraphSearchOptions): Promise<GraphSearchResult>;
+    /**
+     * Community-report global search.
+     * 1. Score community reports by query relevance (keyword overlap + rating).
+     * 2. Assemble the top-K report summaries as context.
+     * 3. Synthesise a holistic answer.
+     */
+    globalSearch(query: string, options?: GraphSearchOptions): Promise<GraphSearchResult>;
+    /**
+     * Combines local and global search.
+     * Both searches run in parallel; their contexts are merged before the final
+     * LLM synthesis call, giving the best of both modes.
+     */
+    hybridSearch(query: string, options?: GraphSearchOptions): Promise<GraphSearchResult>;
+    getGraph(): GraphStore;
+    getStats(): GraphStats;
+    clear(): void;
+    private findSeedEntities;
+    private rankCommunityReports;
+    private buildLocalContext;
+    private buildGlobalContext;
+    private synthesise;
+}
+//# sourceMappingURL=graph-rag-pipeline.d.ts.map

package/dist/graph/graph-rag-pipeline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-rag-pipeline.d.ts","sourceRoot":"","sources":["../../src/graph/graph-rag-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,KAAK,EACV,cAAc,EACd,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EAKjB,UAAU,EACX,MAAM,eAAe,CAAC;AACvB,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAK/C,OAAO,gCAAgC,CAAC;AAaxC,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAiB;IACxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAa;IACnC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAkB;IAC5C,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAoB;IACtD,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAsB;gBAE9C,MAAM,EAAE,cAAc;IA+BlC;;;OAGG;IACG,KAAK,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,eAAe,CAAC;IAO5D;;;OAGG;IACG,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,eAAe,CAAC;IAoFnE,6DAA6D;IACvD,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAgBzF;;;;;;OAMG;IACG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC,iBAAiB,CAAC;IA6B9F;;;;;OAKG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC,iBAAiB,CAAC;IA+B/F;;;;OAIG;IACG,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAwC/F,QAAQ,IAAI,UAAU;IAItB,QAAQ,IAAI,UAAU;IAItB,KAAK,IAAI,IAAI;IAQb,OAAO,CAAC,gBAAgB;IA+BxB,OAAO,CAAC,oBAAoB;IA4B5B,OAAO,CAAC,iBAAiB;IA8BzB,OAAO,CAAC,kBAAkB;YAkBZ,UAAU;CAezB"}

package/dist/graph/graph-rag-pipeline.js

@@ -0,0 +1,390 @@
+"use strict";
+/**
+ * GraphRAGPipeline
+ *
+ * The main entry point for GraphRAG. Orchestrates:
+ *  1. Entity/relationship extraction (EntityExtractor)
+ *  2. Knowledge graph construction (GraphStore)
+ *  3. Community detection (CommunityDetector — LPA)
+ *  4. Community report generation (CommunitySummarizer)
+ *  5. Local and global search with LLM synthesis
+ *
+ * Search modes:
+ * ┌──────────────┬────────────────────────────────────────────────────────┐
+ * │ LOCAL        │ Finds entities matching the query, traverses K hops of │
+ * │              │ the graph, assembles entity+relationship context, then  │
+ * │              │ synthesises an answer. Best for specific questions.     │
+ * ├──────────────┼────────────────────────────────────────────────────────┤
+ * │ GLOBAL       │ Searches community reports by keyword/relevance, ranks  │
+ * │              │ them, assembles a map-reduce-style context, then        │
+ * │              │ synthesises a holistic answer. Best for broad questions.│
+ * ├──────────────┼────────────────────────────────────────────────────────┤
+ * │ HYBRID       │ Runs both local and global, merges contexts, and asks   │
+ * │              │ the LLM to produce a unified answer.                   │
+ * └──────────────┴────────────────────────────────────────────────────────┘
+ *
+ * Quick start:
+ *   const pipeline = new GraphRAGPipeline({ llm: async (p) => openai.chat(p) });
+ *   await pipeline.build(documents);
+ *   const result = await pipeline.search('What is HazelJS dependency injection?');
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphRAGPipeline = void 0;
+const knowledge_graph_1 = require("./knowledge-graph");
+const entity_extractor_1 = require("./entity-extractor");
+const community_detector_1 = require("./community-detector");
+const community_summarizer_1 = require("./community-summarizer");
+const prompts_1 = require("@hazeljs/prompts");
+require("../prompts/graph-search.prompt");
+const graph_search_prompt_1 = require("../prompts/graph-search.prompt");
+let entityCounter = 0;
+let relCounter = 0;
+function nextEntityId() {
+    return `entity_${++entityCounter}_${Date.now()}`;
+}
+function nextRelId() {
+    return `rel_${++relCounter}_${Date.now()}`;
+}
+class GraphRAGPipeline {
+    constructor(config) {
+        this.config = {
+            extractionChunkSize: 2000,
+            communityIterations: 10,
+            generateCommunityReports: true,
+            maxCommunitySize: 15,
+            localSearchDepth: 2,
+            localSearchTopK: 5,
+            globalSearchTopK: 5,
+            ...config,
+        };
+        this.graph = new knowledge_graph_1.GraphStore();
+        this.extractor = new entity_extractor_1.EntityExtractor({
+            llm: config.llm,
+            chunkSize: this.config.extractionChunkSize,
+        });
+        this.communityDetector = new community_detector_1.CommunityDetector({
+            maxIterations: this.config.communityIterations,
+            maxCommunitySize: this.config.maxCommunitySize,
+        });
+        this.communitySummarizer = new community_summarizer_1.CommunitySummarizer({
+            llm: config.llm,
+        });
+    }
+    // ── Build ─────────────────────────────────────────────────────────────────
+    /**
+     * Build (or rebuild) the entire knowledge graph from an array of Documents.
+     * Clears any existing graph state before building.
+     */
+    async build(documents) {
+        this.graph.clear();
+        entityCounter = 0;
+        relCounter = 0;
+        return this.addDocuments(documents);
+    }
+    /**
+     * Incrementally add more documents to an existing graph.
+     * New entities are merged with existing ones if names match.
+     */
+    async addDocuments(documents) {
+        const start = Date.now();
+        const totalEntitiesBefore = this.graph.entities.size;
+        const totalRelsBefore = this.graph.relationships.size;
+        // ── Step 1: Extract entities and relationships from all documents ────────
+        for (const doc of documents) {
+            const docId = doc.id ?? `doc_${Date.now()}`;
+            const extraction = await this.extractor.extract([doc.content], docId);
+            // ── Step 2: Add entities to the graph (merge duplicates) ───────────────
+            const entityNameToId = new Map();
+            for (const extracted of extraction.entities) {
+                // Check if entity already exists
+                const existing = this.graph.findEntityByName(extracted.name);
+                if (existing) {
+                    this.graph.mergeEntity(existing.id, {
+                        description: extracted.description,
+                        sourceDocIds: [docId],
+                    });
+                    entityNameToId.set(extracted.name.toLowerCase(), existing.id);
+                }
+                else {
+                    const entity = this.graph.addEntity({
+                        id: nextEntityId(),
+                        name: extracted.name,
+                        type: extracted.type,
+                        description: extracted.description,
+                        sourceDocIds: [docId],
+                    });
+                    entityNameToId.set(extracted.name.toLowerCase(), entity.id);
+                }
+            }
+            // ── Step 3: Add relationships ──────────────────────────────────────────
+            for (const rel of extraction.relationships) {
+                const sourceId = entityNameToId.get(rel.source.toLowerCase());
+                const targetId = entityNameToId.get(rel.target.toLowerCase());
+                if (!sourceId || !targetId)
+                    continue;
+                this.graph.addRelationship({
+                    id: nextRelId(),
+                    sourceId,
+                    targetId,
+                    type: rel.type,
+                    description: rel.description,
+                    weight: rel.weight,
+                    sourceDocIds: [docId],
+                });
+            }
+        }
+        const entitiesExtracted = this.graph.entities.size - totalEntitiesBefore;
+        const entitiesMerged = documents.length * 2; // rough heuristic
+        const relsExtracted = this.graph.relationships.size - totalRelsBefore;
+        // ── Step 4: Community detection ───────────────────────────────────────────
+        const communities = this.communityDetector.detect(this.graph);
+        this.graph.setCommunities(communities);
+        // ── Step 5: Community report generation ───────────────────────────────────
+        let reportsGenerated = 0;
+        if (this.config.generateCommunityReports) {
+            const reports = await this.communitySummarizer.summarizeAll(communities, this.graph);
+            for (const report of reports) {
+                this.graph.addCommunityReport(report);
+            }
+            reportsGenerated = reports.length;
+        }
+        return {
+            documentsProcessed: documents.length,
+            entitiesExtracted,
+            entitiesMerged,
+            relationshipsExtracted: relsExtracted,
+            communitiesDetected: communities.length,
+            communityReportsGenerated: reportsGenerated,
+            duration: Date.now() - start,
+        };
+    }
+    // ── Search ────────────────────────────────────────────────────────────────
+    /** Unified search entry point. Defaults to 'hybrid' mode. */
+    async search(query, options = {}) {
+        const mode = options.mode ?? 'hybrid';
+        switch (mode) {
+            case 'local':
+                return this.localSearch(query, options);
+            case 'global':
+                return this.globalSearch(query, options);
+            case 'hybrid':
+            default:
+                return this.hybridSearch(query, options);
+        }
+    }
+    // ── Local Search ──────────────────────────────────────────────────────────
+    /**
+     * Entity-centric local search.
+     * 1. Find entities whose names match the query keywords.
+     * 2. Traverse up to `depth` hops in the knowledge graph.
+     * 3. Assemble entity + relationship context.
+     * 4. Synthesise an answer with the LLM.
+     */
+    async localSearch(query, options = {}) {
+        const start = Date.now();
+        const depth = options.depth ?? this.config.localSearchDepth ?? 2;
+        const topK = options.topK ?? this.config.localSearchTopK ?? 5;
+        // Seed entities matching the query
+        const seedEntities = this.findSeedEntities(query, topK);
+        const seedIds = seedEntities.map((e) => e.id);
+        // BFS traversal
+        const { entities, relationships } = this.graph.bfsNeighbours(seedIds, depth);
+        const context = this.buildLocalContext(query, entities, relationships);
+        const answer = await this.synthesise(query, context, 'local');
+        return {
+            mode: 'local',
+            query,
+            answer,
+            entities: options.includeGraph !== false ? entities : [],
+            relationships: options.includeGraph !== false ? relationships : [],
+            communities: [],
+            context,
+            duration: Date.now() - start,
+        };
+    }
+    // ── Global Search ─────────────────────────────────────────────────────────
+    /**
+     * Community-report global search.
+     * 1. Score community reports by query relevance (keyword overlap + rating).
+     * 2. Assemble the top-K report summaries as context.
+     * 3. Synthesise a holistic answer.
+     */
+    async globalSearch(query, options = {}) {
+        const start = Date.now();
+        const topK = options.topK ?? this.config.globalSearchTopK ?? 5;
+        const rankedReports = this.rankCommunityReports(query, topK);
+        const context = this.buildGlobalContext(query, rankedReports);
+        const answer = await this.synthesise(query, context, 'global');
+        // Collect entities referenced in top communities
+        const entityIds = new Set();
+        for (const report of rankedReports) {
+            for (const id of report.entityIds)
+                entityIds.add(id);
+        }
+        const entities = [...entityIds]
+            .map((id) => this.graph.entities.get(id))
+            .filter((e) => e !== undefined);
+        return {
+            mode: 'global',
+            query,
+            answer,
+            entities: options.includeGraph !== false ? entities : [],
+            relationships: [],
+            communities: options.includeCommunities !== false ? rankedReports : [],
+            context,
+            duration: Date.now() - start,
+        };
+    }
+    // ── Hybrid Search ─────────────────────────────────────────────────────────
+    /**
+     * Combines local and global search.
+     * Both searches run in parallel; their contexts are merged before the final
+     * LLM synthesis call, giving the best of both modes.
+     */
+    async hybridSearch(query, options = {}) {
+        const start = Date.now();
+        const [local, global_] = await Promise.all([
+            this.localSearch(query, { ...options, mode: 'local' }),
+            this.globalSearch(query, { ...options, mode: 'global' }),
+        ]);
+        const mergedContext = [
+            '=== LOCAL KNOWLEDGE GRAPH CONTEXT ===',
+            local.context,
+            '',
+            '=== GLOBAL COMMUNITY CONTEXT ===',
+            global_.context,
+        ].join('\n');
+        const answer = await this.synthesise(query, mergedContext, 'hybrid');
+        const allEntityIds = new Set([
+            ...local.entities.map((e) => e.id),
+            ...global_.entities.map((e) => e.id),
+        ]);
+        const mergedEntities = [...allEntityIds]
+            .map((id) => this.graph.entities.get(id))
+            .filter((e) => e !== undefined);
+        return {
+            mode: 'hybrid',
+            query,
+            answer,
+            entities: options.includeGraph !== false ? mergedEntities : [],
+            relationships: options.includeGraph !== false ? local.relationships : [],
+            communities: options.includeCommunities !== false ? global_.communities : [],
+            context: mergedContext,
+            duration: Date.now() - start,
+        };
+    }
+    // ── Graph Access ──────────────────────────────────────────────────────────
+    getGraph() {
+        return this.graph;
+    }
+    getStats() {
+        return this.graph.getStats();
+    }
+    clear() {
+        this.graph.clear();
+        entityCounter = 0;
+        relCounter = 0;
+    }
+    // ── Private helpers ───────────────────────────────────────────────────────
+    findSeedEntities(query, topK) {
+        // Extract keywords from the query (simple tokenisation)
+        const keywords = query
+            .toLowerCase()
+            .replace(/[^\w\s]/g, '')
+            .split(/\s+/)
+            .filter((w) => w.length > 2);
+        const scored = new Map();
+        for (const keyword of keywords) {
+            const matches = this.graph.findEntitiesByName(keyword, 20);
+            for (const entity of matches) {
+                const existing = scored.get(entity.id);
+                // Score: +2 for exact match, +1 for partial
+                const isExact = entity.name.toLowerCase() === keyword;
+                const delta = isExact ? 2 : 1;
+                if (existing) {
+                    existing.score += delta;
+                }
+                else {
+                    scored.set(entity.id, { entity, score: delta });
+                }
+            }
+        }
+        return [...scored.values()]
+            .sort((a, b) => b.score - a.score)
+            .slice(0, topK)
+            .map((v) => v.entity);
+    }
+    rankCommunityReports(query, topK) {
+        const keywords = query
+            .toLowerCase()
+            .replace(/[^\w\s]/g, '')
+            .split(/\s+/)
+            .filter((w) => w.length > 2);
+        const scored = [];
+        for (const report of this.graph.communityReports.values()) {
+            const text = `${report.title} ${report.summary} ${report.findings.join(' ')}`.toLowerCase();
+            let score = 0;
+            for (const kw of keywords) {
+                // Count occurrences of each keyword
+                const matches = (text.match(new RegExp(kw, 'g')) ?? []).length;
+                score += matches;
+            }
+            // Boost by LLM importance rating
+            score = score * (1 + report.rating / 10);
+            scored.push({ report, score });
+        }
+        return scored
+            .sort((a, b) => b.score - a.score)
+            .slice(0, topK)
+            .map((v) => v.report);
+    }
+    buildLocalContext(query, entities, relationships) {
+        if (entities.length === 0) {
+            return 'No relevant entities found in the knowledge graph for this query.';
+        }
+        const entitySection = entities
+            .map((e) => `• ${e.name} [${e.type}]: ${e.description}`)
+            .join('\n');
+        const relSection = relationships
+            .map((r) => {
+            const src = this.graph.entities.get(r.sourceId)?.name ?? r.sourceId;
+            const tgt = this.graph.entities.get(r.targetId)?.name ?? r.targetId;
+            return `  ${src} → [${r.type}] → ${tgt}: ${r.description}`;
+        })
+            .join('\n');
+        return [
+            `ENTITIES related to "${query}":`,
+            entitySection,
+            '',
+            'RELATIONSHIPS:',
+            relSection || '  (none found)',
+        ].join('\n');
+    }
+    buildGlobalContext(query, reports) {
+        if (reports.length === 0) {
+            return 'No community reports available. Please build the graph first using GraphRAGPipeline.build().';
+        }
+        return reports
+            .map((r, i) => {
+            const findings = r.findings.map((f) => `  - ${f}`).join('\n');
+            return [
+                `[Community ${i + 1}] ${r.title} (importance: ${r.rating}/10)`,
+                r.summary,
+                'Key findings:',
+                findings,
+            ].join('\n');
+        })
+            .join('\n\n---\n\n');
+    }
+    async synthesise(query, context, mode) {
+        const modeHint = {
+            local: 'Use the entity and relationship graph context to give a precise, specific answer.',
+            global: 'Use the community summaries to give a broad, thematic answer covering the full scope.',
+            hybrid: 'Combine the specific entity details and the broad community themes for a comprehensive answer.',
+        };
+        const prompt = prompts_1.PromptRegistry.get(graph_search_prompt_1.GRAPH_SEARCH_KEY).render({ modeHint: modeHint[mode], context, query });
+        return this.config.llm(prompt);
+    }
+}
+exports.GraphRAGPipeline = GraphRAGPipeline;
+//# sourceMappingURL=graph-rag-pipeline.js.map

package/dist/graph/graph-rag-pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-rag-pipeline.js","sourceRoot":"","sources":["../../src/graph/graph-rag-pipeline.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;;;AAcH,uDAA+C;AAC/C,yDAAqD;AACrD,6DAAyD;AACzD,iEAA6D;AAC7D,8CAAkD;AAClD,0CAAwC;AACxC,wEAAkE;AAElE,IAAI,aAAa,GAAG,CAAC,CAAC;AACtB,IAAI,UAAU,GAAG,CAAC,CAAC;AAEnB,SAAS,YAAY;IACnB,OAAO,UAAU,EAAE,aAAa,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;AACnD,CAAC;AACD,SAAS,SAAS;IAChB,OAAO,OAAO,EAAE,UAAU,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;AAC7C,CAAC;AAED,MAAa,gBAAgB;IAO3B,YAAY,MAAsB;QAChC,IAAI,CAAC,MAAM,GAAG;YACZ,mBAAmB,EAAE,IAAI;YACzB,mBAAmB,EAAE,EAAE;YACvB,wBAAwB,EAAE,IAAI;YAC9B,gBAAgB,EAAE,EAAE;YACpB,gBAAgB,EAAE,CAAC;YACnB,eAAe,EAAE,CAAC;YAClB,gBAAgB,EAAE,CAAC;YACnB,GAAG,MAAM;SACV,CAAC;QAEF,IAAI,CAAC,KAAK,GAAG,IAAI,4BAAU,EAAE,CAAC;QAE9B,IAAI,CAAC,SAAS,GAAG,IAAI,kCAAe,CAAC;YACnC,GAAG,EAAE,MAAM,CAAC,GAAG;YACf,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,mBAAmB;SAC3C,CAAC,CAAC;QAEH,IAAI,CAAC,iBAAiB,GAAG,IAAI,sCAAiB,CAAC;YAC7C,aAAa,EAAE,IAAI,CAAC,MAAM,CAAC,mBAAmB;YAC9C,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,gBAAgB;SAC/C,CAAC,CAAC;QAEH,IAAI,CAAC,mBAAmB,GAAG,IAAI,0CAAmB,CAAC;YACjD,GAAG,EAAE,MAAM,CAAC,GAAG;SAChB,CAAC,CAAC;IACL,CAAC;IAED,6EAA6E;IAE7E;;;OAGG;IACH,KAAK,CAAC,KAAK,CAAC,SAAqB;QAC/B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,aAAa,GAAG,CAAC,CAAC;QAClB,UAAU,GAAG,CAAC,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAC,SAAqB;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;QACrD,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC;QAEtD,4EAA4E;QAC5E,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,GAAG,CAAC,EAAE,IAAI,OAAO,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;YAC5C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC;YAEtE,0EAA0E;YAC1E,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;YAEjD,KAAK,MAAM,SAAS,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;gBAC5C,iCAAiC;gBACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC7D,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,EAAE;wBAClC,WAAW,EAAE,SAAS,CAAC,WAAW;wBAClC,YAAY,EAAE,CAAC,KAAK,CAAC;qBACtB,CAAC,CAAC;oBACH,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAChE,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC;wBAClC,EAAE,EAAE,YAAY,EAAE;wBAClB,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,IAAI,EAAE,SAAS,CAAC,IAAI;wBACpB,WAAW,EAAE,SAAS,CAAC,WAAW;wBAClC,YAAY,EAAE,CAAC,KAAK,CAAC;qBACtB,CAAC,CAAC;oBACH,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC9D,CAAC;YACH,CAAC;YAED,0EAA0E;YAC1E,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,aAAa,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;gBAC9D,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;gBAE9D,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAErC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC;oBACzB,EAAE,EAAE,SAAS,EAAE;oBACf,QAAQ;oBACR,QAAQ;oBACR,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,WAAW,EAAE,GAAG,CAAC,WAAW;oBAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;oBAClB,YAAY,EAAE,CAAC,KAAK,CAAC;iBACtB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,mBAAmB,CAAC;QACzE,MAAM,cAAc,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,kBAAkB;QAC/D,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,GAAG,eAAe,CAAC;QAEtE,6EAA6E;QAC7E,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;QAEvC,6EAA6E;QAC7E,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,MAAM,CAAC,wBAAwB,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACrF,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;YACxC,CAAC;YACD,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC;QACpC,CAAC;QAED,OAAO;YACL,kBAAkB,EAAE,SAAS,CAAC,MAAM;YACpC,iBAAiB;YACjB,cAAc;YACd,sBAAsB,EAAE,aAAa;YACrC,mBAAmB,EAAE,WAAW,CAAC,MAAM;YACvC,yBAAyB,EAAE,gBAAgB;YAC3C,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SAC7B,CAAC;IACJ,CAAC;IAED,6EAA6E;IAE7E,6DAA6D;IAC7D,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,UAA8B,EAAE;QAC1D,MAAM,IAAI,GAAoB,OAAO,CAAC,IAAI,IAAI,QAAQ,CAAC;QAEvD,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,OAAO;gBACV,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1C,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC3C,KAAK,QAAQ,CAAC;YACd;gBACE,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,6EAA6E;IAE7E;;;;;;OAMG;IACH,KAAK,CAAC,WAAW,CAAC,KAAa,EAAE,UAA8B,EAAE;QAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,gBAAgB,IAAI,CAAC,CAAC;QACjE,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,IAAI,CAAC,CAAC;QAE9D,mCAAmC;QACnC,MAAM,YAAY,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACxD,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAE9C,gBAAgB;QAChB,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAE7E,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAE9D,OAAO;YACL,IAAI,EAAE,OAAO;YACb,KAAK;YACL,MAAM;YACN,QAAQ,EAAE,OAAO,CAAC,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YACxD,aAAa,EAAE,OAAO,CAAC,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE;YAClE,WAAW,EAAE,EAAE;YACf,OAAO;YACP,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SAC7B,CAAC;IACJ,CAAC;IAED,6EAA6E;IAE7E;;;;;OAKG;IACH,KAAK,CAAC,YAAY,CAAC,KAAa,EAAE,UAA8B,EAAE;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,gBAAgB,IAAI,CAAC,CAAC;QAE/D,MAAM,aAAa,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7D,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QAE/D,iDAAiD;QACjD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,SAAS;gBAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,MAAM,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC;aAC5B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACxC,MAAM,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;QAEpD,OAAO;YACL,IAAI,EAAE,QAAQ;YACd,KAAK;YACL,MAAM;YACN,QAAQ,EAAE,OAAO,CAAC,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YACxD,aAAa,EAAE,EAAE;YACjB,WAAW,EAAE,OAAO,CAAC,kBAAkB,KAAK,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE;YACtE,OAAO;YACP,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SAC7B,CAAC;IACJ,CAAC;IAED,6EAA6E;IAE7E;;;;OAIG;IACH,KAAK,CAAC,YAAY,CAAC,KAAa,EAAE,UAA8B,EAAE;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEzB,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACzC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;YACtD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;SACzD,CAAC,CAAC;QAEH,MAAM,aAAa,GAAG;YACpB,uCAAuC;YACvC,KAAK,CAAC,OAAO;YACb,EAAE;YACF,kCAAkC;YAClC,OAAO,CAAC,OAAO;SAChB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;QAErE,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC;YAC3B,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClC,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACrC,CAAC,CAAC;QACH,MAAM,cAAc,GAAG,CAAC,GAAG,YAAY,CAAC;aACrC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACxC,MAAM,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;QAEpD,OAAO;YACL,IAAI,EAAE,QAAQ;YACd,KAAK;YACL,MAAM;YACN,QAAQ,EAAE,OAAO,CAAC,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE;YAC9D,aAAa,EAAE,OAAO,CAAC,YAAY,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE;YACxE,WAAW,EAAE,OAAO,CAAC,kBAAkB,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE;YAC5E,OAAO,EAAE,aAAa;YACtB,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SAC7B,CAAC;IACJ,CAAC;IAED,6EAA6E;IAE7E,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,aAAa,GAAG,CAAC,CAAC;QAClB,UAAU,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,6EAA6E;IAErE,gBAAgB,CAAC,KAAa,EAAE,IAAY;QAClD,wDAAwD;QACxD,MAAM,QAAQ,GAAG,KAAK;aACnB,WAAW,EAAE;aACb,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;aACvB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE/B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkD,CAAC;QAEzE,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YAC3D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACvC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,OAAO,CAAC;gBACtD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,KAAK,IAAI,KAAK,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;aACxB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;aACd,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAEO,oBAAoB,CAAC,KAAa,EAAE,IAAY;QACtD,MAAM,QAAQ,GAAG,KAAK;aACnB,WAAW,EAAE;aACb,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;aACvB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAE/B,MAAM,MAAM,GAAsD,EAAE,CAAC;QAErE,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,MAAM,IAAI,GAAG,GAAG,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,OAAO,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;YAC5F,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,oCAAoC;gBACpC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;gBAC/D,KAAK,IAAI,OAAO,CAAC;YACnB,CAAC;YACD,iCAAiC;YACjC,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,MAAM;aACV,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;aACd,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAEO,iBAAiB,CACvB,KAAa,EACb,QAAuB,EACvB,aAAkC;QAElC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,mEAAmE,CAAC;QAC7E,CAAC;QAED,MAAM,aAAa,GAAG,QAAQ;aAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;aACvD,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,MAAM,UAAU,GAAG,aAAa;aAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC;YACpE,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC;YACpE,OAAO,KAAK,GAAG,OAAO,CAAC,CAAC,IAAI,OAAO,GAAG,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC7D,CAAC,CAAC;aACD,IAAI,CAAC,IAAI,CAAC,CAAC;QAEd,OAAO;YACL,wBAAwB,KAAK,IAAI;YACjC,aAAa;YACb,EAAE;YACF,gBAAgB;YAChB,UAAU,IAAI,gBAAgB;SAC/B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACf,CAAC;IAEO,kBAAkB,CAAC,KAAa,EAAE,OAA0B;QAClE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,8FAA8F,CAAC;QACxG,CAAC;QAED,OAAO,OAAO;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACZ,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9D,OAAO;gBACL,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,iBAAiB,CAAC,CAAC,MAAM,MAAM;gBAC9D,CAAC,CAAC,OAAO;gBACT,eAAe;gBACf,QAAQ;aACT,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACf,CAAC,CAAC;aACD,IAAI,CAAC,aAAa,CAAC,CAAC;IACzB,CAAC;IAEO,KAAK,CAAC,UAAU,CAAC,KAAa,EAAE,OAAe,EAAE,IAAqB;QAC5E,MAAM,QAAQ,GAAoC;YAChD,KAAK,EAAE,mFAAmF;YAC1F,MAAM,EACJ,uFAAuF;YACzF,MAAM,EACJ,gGAAgG;SACnG,CAAC;QAEF,MAAM,MAAM,GAAG,wBAAc,CAAC,GAAG,CAC/B,sCAAgB,CACjB,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAEvD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;CACF;AA1ZD,4CA0ZC"}