@hazeljs/rag 0.2.0-alpha.1

package/dist/graph/community-detector.js

@@ -0,0 +1,153 @@
+"use strict";
+/**
+ * CommunityDetector
+ *
+ * Detects communities (clusters of closely-related entities) in the knowledge
+ * graph using the **Label Propagation Algorithm (LPA)**.
+ *
+ * Why LPA?
+ *  - O(V + E) per iteration → scales well to thousands of entities
+ *  - No parameters to tune (unlike Louvain's resolution parameter)
+ *  - Converges in ~5–10 iterations for most real-world graphs
+ *
+ * Algorithm:
+ *  1. Assign each entity its own unique community label.
+ *  2. Shuffle entity iteration order (breaks symmetry for better convergence).
+ *  3. Each entity adopts the most frequent label among its neighbours,
+ *     weighted by relationship strength.
+ *  4. Repeat until labels stabilise or max iterations reached.
+ *  5. Groups entities that share the same label into communities.
+ *
+ * Large-community splitting:
+ *  If a community exceeds `maxCommunitySize`, it is recursively split by
+ *  running LPA on the sub-graph of its members only.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CommunityDetector = void 0;
+class CommunityDetector {
+    constructor(config = {}) {
+        this.maxIterations = config.maxIterations ?? 10;
+        this.maxCommunitySize = config.maxCommunitySize ?? 15;
+    }
+    /**
+     * Run community detection on the full graph.
+     * Returns a flat list of GraphCommunity objects (level 0 = leaf communities).
+     */
+    detect(graph) {
+        const entityIds = [...graph.entities.keys()];
+        if (entityIds.length === 0)
+            return [];
+        // Build weight map: entityId → [{ neighbourId, weight }]
+        const weightedAdj = this.buildWeightedAdjacency(graph);
+        const labels = this.runLPA(entityIds, weightedAdj);
+        const rawCommunities = this.groupByLabel(labels);
+        // Split oversized communities
+        const finalCommunities = this.splitOversized(rawCommunities, graph, 0);
+        return finalCommunities.map((memberIds, idx) => ({
+            id: `community_${idx}`,
+            entityIds: memberIds,
+            level: 0,
+        }));
+    }
+    // ── Private ───────────────────────────────────────────────────────────────
+    buildWeightedAdjacency(graph) {
+        const adj = new Map();
+        for (const entityId of graph.entities.keys()) {
+            adj.set(entityId, []);
+        }
+        for (const rel of graph.relationships.values()) {
+            const srcList = adj.get(rel.sourceId) ?? [];
+            const tgtList = adj.get(rel.targetId) ?? [];
+            srcList.push({ id: rel.targetId, weight: rel.weight });
+            tgtList.push({ id: rel.sourceId, weight: rel.weight });
+            adj.set(rel.sourceId, srcList);
+            adj.set(rel.targetId, tgtList);
+        }
+        return adj;
+    }
+    runLPA(entityIds, adj) {
+        // Initialise: each entity is its own community
+        const labels = new Map();
+        for (const id of entityIds)
+            labels.set(id, id);
+        for (let iter = 0; iter < this.maxIterations; iter++) {
+            const order = this.shuffle([...entityIds]);
+            let changed = false;
+            for (const entityId of order) {
+                const neighbours = adj.get(entityId) ?? [];
+                if (neighbours.length === 0)
+                    continue;
+                // Tally label weights from neighbours
+                const labelWeights = new Map();
+                for (const { id, weight } of neighbours) {
+                    const neighbourLabel = labels.get(id);
+                    labelWeights.set(neighbourLabel, (labelWeights.get(neighbourLabel) ?? 0) + weight);
+                }
+                // Choose the label with the highest total weight
+                let bestLabel = labels.get(entityId);
+                let bestWeight = 0;
+                for (const [label, weight] of labelWeights.entries()) {
+                    if (weight > bestWeight) {
+                        bestWeight = weight;
+                        bestLabel = label;
+                    }
+                }
+                if (bestLabel !== labels.get(entityId)) {
+                    labels.set(entityId, bestLabel);
+                    changed = true;
+                }
+            }
+            if (!changed)
+                break;
+        }
+        return labels;
+    }
+    groupByLabel(labels) {
+        const groups = new Map();
+        for (const [entityId, label] of labels.entries()) {
+            const group = groups.get(label) ?? [];
+            group.push(entityId);
+            groups.set(label, group);
+        }
+        return [...groups.values()];
+    }
+    splitOversized(communities, graph, level) {
+        const result = [];
+        for (const community of communities) {
+            if (community.length <= this.maxCommunitySize || level >= 3) {
+                result.push(community);
+                continue;
+            }
+            // Build sub-graph adjacency for just this community's members
+            const memberSet = new Set(community);
+            const subAdj = new Map();
+            for (const id of community)
+                subAdj.set(id, []);
+            for (const rel of graph.relationships.values()) {
+                if (!memberSet.has(rel.sourceId) || !memberSet.has(rel.targetId))
+                    continue;
+                subAdj.get(rel.sourceId).push({ id: rel.targetId, weight: rel.weight });
+                subAdj.get(rel.targetId).push({ id: rel.sourceId, weight: rel.weight });
+            }
+            const subLabels = this.runLPA(community, subAdj);
+            const subCommunities = this.groupByLabel(subLabels);
+            // Only split if we actually produced smaller groups
+            if (subCommunities.length > 1) {
+                result.push(...this.splitOversized(subCommunities, graph, level + 1));
+            }
+            else {
+                result.push(community);
+            }
+        }
+        return result;
+    }
+    shuffle(arr) {
+        for (let i = arr.length - 1; i > 0; i--) {
+            const j = Math.floor(Math.random() * (i + 1));
+            [arr[i], arr[j]] = [arr[j], arr[i]];
+        }
+        return arr;
+    }
+}
+exports.CommunityDetector = CommunityDetector;
+//# sourceMappingURL=community-detector.js.map

package/dist/graph/community-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-detector.js","sourceRoot":"","sources":["../../src/graph/community-detector.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;AAUH,MAAa,iBAAiB;IAI5B,YAAY,SAAkC,EAAE;QAC9C,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,IAAI,EAAE,CAAC;QAChD,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,EAAE,CAAC;IACxD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAiB;QACtB,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEtC,yDAAyD;QACzD,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAEvD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAEjD,8BAA8B;QAC9B,MAAM,gBAAgB,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;QAEvE,OAAO,gBAAgB,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YAC/C,EAAE,EAAE,aAAa,GAAG,EAAE;YACtB,SAAS,EAAE,SAAS;YACpB,KAAK,EAAE,CAAC;SACT,CAAC,CAAC,CAAC;IACN,CAAC;IAED,6EAA6E;IAErE,sBAAsB,CAC5B,KAAiB;QAEjB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAiD,CAAC;QAErE,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YAC7C,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACxB,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC5C,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YAC5C,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YACvD,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YACvD,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC/B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,MAAM,CACZ,SAAmB,EACnB,GAAuD;QAEvD,+CAA+C;QAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,SAAS;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAE/C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YACrD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;YAC3C,IAAI,OAAO,GAAG,KAAK,CAAC;YAEpB,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;gBAC7B,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;gBAC3C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;oBAAE,SAAS;gBAEtC,sCAAsC;gBACtC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;gBAC/C,KAAK,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;oBACxC,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;oBACvC,YAAY,CAAC,GAAG,CAAC,cAAc,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;gBACrF,CAAC;gBAED,iDAAiD;gBACjD,IAAI,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gBACtC,IAAI,UAAU,GAAG,CAAC,CAAC;gBAEnB,KAAK,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;oBACrD,IAAI,MAAM,GAAG,UAAU,EAAE,CAAC;wBACxB,UAAU,GAAG,MAAM,CAAC;wBACpB,SAAS,GAAG,KAAK,CAAC;oBACpB,CAAC;gBACH,CAAC;gBAED,IAAI,SAAS,KAAK,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACvC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;oBAChC,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;YAED,IAAI,CAAC,OAAO;gBAAE,MAAM;QACtB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,YAAY,CAAC,MAA2B;QAC9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YACjD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC9B,CAAC;IAEO,cAAc,CAAC,WAAuB,EAAE,KAAiB,EAAE,KAAa;QAC9E,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,KAAK,MAAM,SAAS,IAAI,WAAW,EAAE,CAAC;YACpC,IAAI,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,gBAAgB,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;gBAC5D,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACvB,SAAS;YACX,CAAC;YAED,8DAA8D;YAC9D,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiD,CAAC;YACxE,KAAK,MAAM,EAAE,IAAI,SAAS;gBAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAE/C,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC/C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,SAAS;gBAC3E,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;gBACzE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YAC3E,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YACjD,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YAEpD,oDAAoD;YACpD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YACxE,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,OAAO,CAAI,GAAQ;QACzB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAzJD,8CAyJC"}

package/dist/graph/community-summarizer.d.ts

@@ -0,0 +1,41 @@
+/**
+ * CommunitySummarizer
+ *
+ * Generates LLM-powered community reports for each detected community.
+ * Each report contains:
+ *  - A one-line title capturing the community's central theme
+ *  - A 2-4 paragraph narrative summary
+ *  - Bullet-point key findings
+ *  - An importance rating 1–10
+ *
+ * These reports are the foundation of GraphRAG's **global search** mode:
+ * instead of searching raw text, the system searches community reports,
+ * which capture cross-document themes that are invisible to chunk-level
+ * vector search.
+ *
+ * Performance note: reports are generated in parallel (Promise.all) with
+ * a configurable concurrency limit so we don't overwhelm the LLM rate limit.
+ */
+import type { GraphCommunity, CommunityReport } from './graph.types';
+import type { GraphStore } from './knowledge-graph';
+import '../prompts/community-summary.prompt';
+export interface CommunitySummarizerConfig {
+    llm: (prompt: string) => Promise<string>;
+    /** Max concurrent LLM calls. Default: 3. */
+    concurrency?: number;
+}
+export declare class CommunitySummarizer {
+    private readonly llm;
+    private readonly concurrency;
+    constructor(config: CommunitySummarizerConfig);
+    /**
+     * Generate a CommunityReport for every community in `communities`.
+     * Returns the reports in the same order as the input array.
+     */
+    summarizeAll(communities: GraphCommunity[], graph: GraphStore): Promise<CommunityReport[]>;
+    private summarizeCommunity;
+    private buildSummaryPrompt;
+    private parseReport;
+    private buildFallbackReport;
+}
+//# sourceMappingURL=community-summarizer.d.ts.map

package/dist/graph/community-summarizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-summarizer.d.ts","sourceRoot":"","sources":["../../src/graph/community-summarizer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,eAAe,CAAC;AACrE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,OAAO,qCAAqC,CAAC;AAG7C,MAAM,WAAW,yBAAyB;IACxC,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IACzC,4CAA4C;IAC5C,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAsC;IAC1D,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;gBAEzB,MAAM,EAAE,yBAAyB;IAK7C;;;OAGG;IACG,YAAY,CAAC,WAAW,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;YAkBlF,kBAAkB;IAyChC,OAAO,CAAC,kBAAkB;IAkB1B,OAAO,CAAC,WAAW;IA2BnB,OAAO,CAAC,mBAAmB;CAU5B"}

package/dist/graph/community-summarizer.js

@@ -0,0 +1,119 @@
+"use strict";
+/**
+ * CommunitySummarizer
+ *
+ * Generates LLM-powered community reports for each detected community.
+ * Each report contains:
+ *  - A one-line title capturing the community's central theme
+ *  - A 2-4 paragraph narrative summary
+ *  - Bullet-point key findings
+ *  - An importance rating 1–10
+ *
+ * These reports are the foundation of GraphRAG's **global search** mode:
+ * instead of searching raw text, the system searches community reports,
+ * which capture cross-document themes that are invisible to chunk-level
+ * vector search.
+ *
+ * Performance note: reports are generated in parallel (Promise.all) with
+ * a configurable concurrency limit so we don't overwhelm the LLM rate limit.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CommunitySummarizer = void 0;
+const prompts_1 = require("@hazeljs/prompts");
+require("../prompts/community-summary.prompt");
+const community_summary_prompt_1 = require("../prompts/community-summary.prompt");
+class CommunitySummarizer {
+    constructor(config) {
+        this.llm = config.llm;
+        this.concurrency = config.concurrency ?? 3;
+    }
+    /**
+     * Generate a CommunityReport for every community in `communities`.
+     * Returns the reports in the same order as the input array.
+     */
+    async summarizeAll(communities, graph) {
+        if (communities.length === 0)
+            return [];
+        const results = [];
+        // Process in batches respecting concurrency limit
+        for (let i = 0; i < communities.length; i += this.concurrency) {
+            const batch = communities.slice(i, i + this.concurrency);
+            const batchResults = await Promise.all(batch.map((community) => this.summarizeCommunity(community, graph)));
+            results.push(...batchResults);
+        }
+        return results;
+    }
+    // ── Private ───────────────────────────────────────────────────────────────
+    async summarizeCommunity(community, graph) {
+        const entities = community.entityIds
+            .map((id) => graph.entities.get(id))
+            .filter((e) => e !== undefined);
+        const relDescriptions = [];
+        for (const rel of graph.relationships.values()) {
+            if (community.entityIds.includes(rel.sourceId) &&
+                community.entityIds.includes(rel.targetId)) {
+                const src = graph.entities.get(rel.sourceId);
+                const tgt = graph.entities.get(rel.targetId);
+                if (src && tgt) {
+                    relDescriptions.push(`${src.name} ${rel.type} ${tgt.name}: ${rel.description} (weight: ${rel.weight})`);
+                }
+            }
+        }
+        const entityDescriptions = entities.map((e) => `- ${e.name} [${e.type}]: ${e.description}`);
+        const prompt = this.buildSummaryPrompt('', entityDescriptions, relDescriptions);
+        try {
+            const raw = await this.llm(prompt);
+            return this.parseReport(community.id, community.entityIds, raw);
+        }
+        catch {
+            // Fallback: build a simple report without LLM
+            return this.buildFallbackReport(community, entities.map((e) => e.name));
+        }
+    }
+    buildSummaryPrompt(_communityId, entityDescriptions, relDescriptions) {
+        const relText = relDescriptions.length > 0
+            ? relDescriptions.join('\n')
+            : '(no intra-community relationships found)';
+        return prompts_1.PromptRegistry.get(community_summary_prompt_1.COMMUNITY_SUMMARY_KEY).render({
+            entityDescriptions: entityDescriptions.join('\n'),
+            relDescriptions: relText,
+        });
+    }
+    parseReport(communityId, entityIds, raw) {
+        const cleaned = raw
+            .replace(/```json\s*/gi, '')
+            .replace(/```\s*/g, '')
+            .trim();
+        let parsed;
+        try {
+            parsed = JSON.parse(cleaned);
+        }
+        catch {
+            const match = cleaned.match(/\{[\s\S]*\}/);
+            if (!match)
+                throw new Error('No JSON in community summary response');
+            parsed = JSON.parse(match[0]);
+        }
+        const obj = parsed;
+        return {
+            communityId,
+            title: String(obj.title ?? 'Untitled Community'),
+            summary: String(obj.summary ?? ''),
+            findings: Array.isArray(obj.findings) ? obj.findings.map(String) : [],
+            rating: Math.min(10, Math.max(1, Number(obj.rating) || 5)),
+            entityIds,
+        };
+    }
+    buildFallbackReport(community, entityNames) {
+        return {
+            communityId: community.id,
+            title: `Community: ${entityNames.slice(0, 3).join(', ')}${entityNames.length > 3 ? '...' : ''}`,
+            summary: `This community contains ${entityNames.length} related entities: ${entityNames.join(', ')}.`,
+            findings: entityNames.map((name) => `Contains entity: ${name}`),
+            rating: 5,
+            entityIds: community.entityIds,
+        };
+    }
+}
+exports.CommunitySummarizer = CommunitySummarizer;
+//# sourceMappingURL=community-summarizer.js.map

package/dist/graph/community-summarizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"community-summarizer.js","sourceRoot":"","sources":["../../src/graph/community-summarizer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;GAiBG;;;AAIH,8CAAkD;AAClD,+CAA6C;AAC7C,kFAA4E;AAQ5E,MAAa,mBAAmB;IAI9B,YAAY,MAAiC;QAC3C,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,YAAY,CAAC,WAA6B,EAAE,KAAiB;QACjE,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAExC,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,kDAAkD;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAC9D,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;YACzD,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,GAAG,CACpC,KAAK,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC,CACpE,CAAC;YACF,OAAO,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QAChC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,6EAA6E;IAErE,KAAK,CAAC,kBAAkB,CAC9B,SAAyB,EACzB,KAAiB;QAEjB,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS;aACjC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,EAA8B,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;QAE9D,MAAM,eAAe,GAAa,EAAE,CAAC;QAErC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,IACE,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAC1C,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAC1C,CAAC;gBACD,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC7C,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;oBACf,eAAe,CAAC,IAAI,CAClB,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,WAAW,aAAa,GAAG,CAAC,MAAM,GAAG,CAClF,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,kBAAkB,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QAE5F,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,kBAAkB,EAAE,eAAe,CAAC,CAAC;QAEhF,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnC,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAClE,CAAC;QAAC,MAAM,CAAC;YACP,8CAA8C;YAC9C,OAAO,IAAI,CAAC,mBAAmB,CAC7B,SAAS,EACT,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAC5B,CAAC;QACJ,CAAC;IACH,CAAC;IAEO,kBAAkB,CACxB,YAAoB,EACpB,kBAA4B,EAC5B,eAAyB;QAEzB,MAAM,OAAO,GACX,eAAe,CAAC,MAAM,GAAG,CAAC;YACxB,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;YAC5B,CAAC,CAAC,0CAA0C,CAAC;QAEjD,OAAO,wBAAc,CAAC,GAAG,CACvB,gDAAqB,CACtB,CAAC,MAAM,CAAC;YACP,kBAAkB,EAAE,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC;YACjD,eAAe,EAAE,OAAO;SACzB,CAAC,CAAC;IACL,CAAC;IAEO,WAAW,CAAC,WAAmB,EAAE,SAAmB,EAAE,GAAW;QACvE,MAAM,OAAO,GAAG,GAAG;aAChB,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC;aAC3B,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;aACtB,IAAI,EAAE,CAAC;QAEV,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC3C,IAAI,CAAC,KAAK;gBAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;YACrE,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,MAAM,GAAG,GAAG,MAAiC,CAAC;QAE9C,OAAO;YACL,WAAW;YACX,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,oBAAoB,CAAC;YAChD,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC;YAClC,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,QAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YACpF,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1D,SAAS;SACV,CAAC;IACJ,CAAC;IAEO,mBAAmB,CAAC,SAAyB,EAAE,WAAqB;QAC1E,OAAO;YACL,WAAW,EAAE,SAAS,CAAC,EAAE;YACzB,KAAK,EAAE,cAAc,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE;YAC/F,OAAO,EAAE,2BAA2B,WAAW,CAAC,MAAM,sBAAsB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YACrG,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,oBAAoB,IAAI,EAAE,CAAC;YAC/D,MAAM,EAAE,CAAC;YACT,SAAS,EAAE,SAAS,CAAC,SAAS;SAC/B,CAAC;IACJ,CAAC;CACF;AA/HD,kDA+HC"}

package/dist/graph/entity-extractor.d.ts

@@ -0,0 +1,47 @@
+/**
+ * EntityExtractor
+ *
+ * Uses an LLM to extract (entity, type, description) nodes and
+ * (source, type, target, description, weight) relationship edges from raw text.
+ *
+ * The extractor:
+ *  1. Splits the input into chunks of `chunkSize` characters.
+ *  2. Sends each chunk to the LLM with a structured JSON extraction prompt.
+ *  3. Parses and validates the JSON response.
+ *  4. Deduplicates entities by normalized name (case-insensitive).
+ *  5. Merges relationships that reference the same entity pair+type.
+ *
+ * LLM output contract — the model MUST return valid JSON matching:
+ * {
+ *   "entities": [{ "name": string, "type": EntityType, "description": string }],
+ *   "relationships": [{ "source": string, "target": string, "type": RelType, "description": string, "weight": 1-10 }]
+ * }
+ */
+import type { ExtractionResult } from './graph.types';
+import '../prompts/entity-extraction.prompt';
+export interface EntityExtractorConfig {
+    llm: (prompt: string) => Promise<string>;
+    chunkSize?: number;
+}
+export declare class EntityExtractor {
+    private readonly llm;
+    private readonly chunkSize;
+    constructor(config: EntityExtractorConfig);
+    /**
+     * Extract entities and relationships from an array of text chunks.
+     * Returns a merged ExtractionResult with deduplicated entities.
+     */
+    extract(texts: string[], _sourceDocId: string): Promise<ExtractionResult>;
+    private extractFromSegment;
+    private buildExtractionPrompt;
+    private parseResponse;
+    private normalizeEntityType;
+    private normalizeRelType;
+    /**
+     * Merge multiple extraction results, deduplicating entities by
+     * normalized (lower-case, trimmed) name and combining descriptions.
+     */
+    private mergeResults;
+    private splitText;
+}
+//# sourceMappingURL=entity-extractor.d.ts.map

package/dist/graph/entity-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-extractor.d.ts","sourceRoot":"","sources":["../../src/graph/entity-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAgC,MAAM,eAAe,CAAC;AAEpF,OAAO,qCAAqC,CAAC;AA8B7C,MAAM,WAAW,qBAAqB;IACpC,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IACzC,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAsC;IAC1D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;gBAEvB,MAAM,EAAE,qBAAqB;IAKzC;;;OAGG;IACG,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC;YAuBjE,kBAAkB;IAMhC,OAAO,CAAC,qBAAqB;IAU7B,OAAO,CAAC,aAAa;IA0DrB,OAAO,CAAC,mBAAmB;IAK3B,OAAO,CAAC,gBAAgB;IAKxB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAyEpB,OAAO,CAAC,SAAS;CAmBlB"}

package/dist/graph/entity-extractor.js

@@ -0,0 +1,224 @@
+"use strict";
+/**
+ * EntityExtractor
+ *
+ * Uses an LLM to extract (entity, type, description) nodes and
+ * (source, type, target, description, weight) relationship edges from raw text.
+ *
+ * The extractor:
+ *  1. Splits the input into chunks of `chunkSize` characters.
+ *  2. Sends each chunk to the LLM with a structured JSON extraction prompt.
+ *  3. Parses and validates the JSON response.
+ *  4. Deduplicates entities by normalized name (case-insensitive).
+ *  5. Merges relationships that reference the same entity pair+type.
+ *
+ * LLM output contract — the model MUST return valid JSON matching:
+ * {
+ *   "entities": [{ "name": string, "type": EntityType, "description": string }],
+ *   "relationships": [{ "source": string, "target": string, "type": RelType, "description": string, "weight": 1-10 }]
+ * }
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EntityExtractor = void 0;
+const prompts_1 = require("@hazeljs/prompts");
+require("../prompts/entity-extraction.prompt");
+const entity_extraction_prompt_1 = require("../prompts/entity-extraction.prompt");
+const ENTITY_TYPES = [
+    'CONCEPT',
+    'TECHNOLOGY',
+    'PERSON',
+    'ORGANIZATION',
+    'PROCESS',
+    'FEATURE',
+    'EVENT',
+    'LOCATION',
+    'OTHER',
+];
+const RELATIONSHIP_TYPES = [
+    'USES',
+    'IMPLEMENTS',
+    'CREATED_BY',
+    'PART_OF',
+    'DEPENDS_ON',
+    'RELATED_TO',
+    'EXTENDS',
+    'CONFIGURES',
+    'TRIGGERS',
+    'PRODUCES',
+    'REPLACES',
+    'OTHER',
+];
+class EntityExtractor {
+    constructor(config) {
+        this.llm = config.llm;
+        this.chunkSize = config.chunkSize ?? 2000;
+    }
+    /**
+     * Extract entities and relationships from an array of text chunks.
+     * Returns a merged ExtractionResult with deduplicated entities.
+     */
+    async extract(texts, _sourceDocId) {
+        const allResults = [];
+        for (const text of texts) {
+            // Further split if text exceeds chunkSize
+            const segments = this.splitText(text, this.chunkSize);
+            for (const segment of segments) {
+                try {
+                    const result = await this.extractFromSegment(segment);
+                    allResults.push(result);
+                }
+                catch {
+                    // Silently skip unparseable LLM responses — the graph will still be
+                    // populated from other chunks.
+                }
+            }
+        }
+        return this.mergeResults(allResults);
+    }
+    // ── Private helpers ───────────────────────────────────────────────────────
+    async extractFromSegment(text) {
+        const prompt = this.buildExtractionPrompt(text);
+        const raw = await this.llm(prompt);
+        return this.parseResponse(raw);
+    }
+    buildExtractionPrompt(text) {
+        return prompts_1.PromptRegistry.get(entity_extraction_prompt_1.ENTITY_EXTRACTION_KEY).render({
+            text,
+            entityTypes: ENTITY_TYPES.join(', '),
+            relationshipTypes: RELATIONSHIP_TYPES.join(', '),
+        });
+    }
+    parseResponse(raw) {
+        // Strip markdown code fences if present
+        const cleaned = raw
+            .replace(/```json\s*/gi, '')
+            .replace(/```\s*/g, '')
+            .trim();
+        let parsed;
+        try {
+            parsed = JSON.parse(cleaned);
+        }
+        catch {
+            // Try to extract JSON object from the response using a regex
+            const match = cleaned.match(/\{[\s\S]*\}/);
+            if (!match)
+                throw new Error('No JSON object found in LLM response');
+            parsed = JSON.parse(match[0]);
+        }
+        if (typeof parsed !== 'object' ||
+            parsed === null ||
+            !Array.isArray(parsed.entities) ||
+            !Array.isArray(parsed.relationships)) {
+            throw new Error('Invalid extraction response shape');
+        }
+        const raw_ = parsed;
+        return {
+            entities: raw_.entities
+                .filter((e) => e.name && e.type && e.description)
+                .map((e) => ({
+                name: String(e.name).trim(),
+                type: this.normalizeEntityType(String(e.type)),
+                description: String(e.description).trim(),
+            })),
+            relationships: raw_.relationships
+                .filter((r) => r.source && r.target && r.type && r.description)
+                .map((r) => ({
+                source: String(r.source).trim(),
+                target: String(r.target).trim(),
+                type: this.normalizeRelType(String(r.type)),
+                description: String(r.description).trim(),
+                weight: Math.min(10, Math.max(1, Number(r.weight) || 5)),
+            })),
+        };
+    }
+    normalizeEntityType(raw) {
+        const upper = raw.toUpperCase();
+        return ENTITY_TYPES.includes(upper) ? upper : 'OTHER';
+    }
+    normalizeRelType(raw) {
+        const upper = raw.toUpperCase();
+        return RELATIONSHIP_TYPES.includes(upper) ? upper : 'OTHER';
+    }
+    /**
+     * Merge multiple extraction results, deduplicating entities by
+     * normalized (lower-case, trimmed) name and combining descriptions.
+     */
+    mergeResults(results) {
+        // Deduplicate entities
+        const entityMap = new Map();
+        for (const result of results) {
+            for (const entity of result.entities) {
+                const key = entity.name.toLowerCase().trim();
+                const existing = entityMap.get(key);
+                if (existing) {
+                    // Merge descriptions when they add new information
+                    if (!existing.description.includes(entity.description)) {
+                        existing.description = `${existing.description}. ${entity.description}`;
+                    }
+                }
+                else {
+                    entityMap.set(key, { ...entity });
+                }
+            }
+        }
+        // Build a canonical name map (normalized → canonical)
+        const canonicalName = new Map();
+        for (const [key, entity] of entityMap.entries()) {
+            canonicalName.set(key, entity.name);
+        }
+        // Deduplicate and normalise relationships
+        const relMap = new Map();
+        for (const result of results) {
+            for (const rel of result.relationships) {
+                const srcKey = rel.source.toLowerCase().trim();
+                const tgtKey = rel.target.toLowerCase().trim();
+                const srcCanon = canonicalName.get(srcKey) ?? rel.source;
+                const tgtCanon = canonicalName.get(tgtKey) ?? rel.target;
+                // Only keep relationships between known entities
+                if (!canonicalName.has(srcKey) || !canonicalName.has(tgtKey))
+                    continue;
+                const relKey = `${srcCanon}::${tgtCanon}::${rel.type}`;
+                const existing = relMap.get(relKey);
+                if (existing) {
+                    existing.weight = Math.max(existing.weight, rel.weight);
+                    if (!existing.description.includes(rel.description)) {
+                        existing.description = `${existing.description}. ${rel.description}`;
+                    }
+                }
+                else {
+                    relMap.set(relKey, {
+                        source: srcCanon,
+                        target: tgtCanon,
+                        type: rel.type,
+                        description: rel.description,
+                        weight: rel.weight,
+                    });
+                }
+            }
+        }
+        return {
+            entities: [...entityMap.values()],
+            relationships: [...relMap.values()],
+        };
+    }
+    splitText(text, maxLen) {
+        if (text.length <= maxLen)
+            return [text];
+        const chunks = [];
+        let start = 0;
+        while (start < text.length) {
+            let end = Math.min(start + maxLen, text.length);
+            // Try to break at a paragraph boundary
+            if (end < text.length) {
+                const breakAt = text.lastIndexOf('\n\n', end);
+                if (breakAt > start + maxLen * 0.5)
+                    end = breakAt + 2;
+            }
+            chunks.push(text.slice(start, end).trim());
+            start = end;
+        }
+        return chunks.filter((c) => c.length > 0);
+    }
+}
+exports.EntityExtractor = EntityExtractor;
+//# sourceMappingURL=entity-extractor.js.map

package/dist/graph/entity-extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-extractor.js","sourceRoot":"","sources":["../../src/graph/entity-extractor.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;;AAGH,8CAAkD;AAClD,+CAA6C;AAC7C,kFAA4E;AAE5E,MAAM,YAAY,GAAiB;IACjC,SAAS;IACT,YAAY;IACZ,QAAQ;IACR,cAAc;IACd,SAAS;IACT,SAAS;IACT,OAAO;IACP,UAAU;IACV,OAAO;CACR,CAAC;AAEF,MAAM,kBAAkB,GAAuB;IAC7C,MAAM;IACN,YAAY;IACZ,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,UAAU;IACV,UAAU;IACV,UAAU;IACV,OAAO;CACR,CAAC;AAOF,MAAa,eAAe;IAI1B,YAAY,MAA6B;QACvC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,KAAe,EAAE,YAAoB;QACjD,MAAM,UAAU,GAAuB,EAAE,CAAC;QAE1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,0CAA0C;YAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;YAEtD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;oBACtD,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,CAAC;gBAAC,MAAM,CAAC;oBACP,oEAAoE;oBACpE,+BAA+B;gBACjC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC;IAED,6EAA6E;IAErE,KAAK,CAAC,kBAAkB,CAAC,IAAY;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;IACjC,CAAC;IAEO,qBAAqB,CAAC,IAAY;QACxC,OAAO,wBAAc,CAAC,GAAG,CACvB,gDAAqB,CACtB,CAAC,MAAM,CAAC;YACP,IAAI;YACJ,WAAW,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YACpC,iBAAiB,EAAE,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC;SACjD,CAAC,CAAC;IACL,CAAC;IAEO,aAAa,CAAC,GAAW;QAC/B,wCAAwC;QACxC,MAAM,OAAO,GAAG,GAAG;aAChB,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC;aAC3B,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;aACtB,IAAI,EAAE,CAAC;QAEV,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,6DAA6D;YAC7D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC3C,IAAI,CAAC,KAAK;gBAAE,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;YACpE,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,IACE,OAAO,MAAM,KAAK,QAAQ;YAC1B,MAAM,KAAK,IAAI;YACf,CAAC,KAAK,CAAC,OAAO,CAAE,MAAkC,CAAC,QAAQ,CAAC;YAC5D,CAAC,KAAK,CAAC,OAAO,CAAE,MAAkC,CAAC,aAAa,CAAC,EACjE,CAAC;YACD,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,IAAI,GAAG,MASZ,CAAC;QAEF,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,QAAQ;iBACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC;iBAChD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACX,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE;gBAC3B,IAAI,EAAE,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC9C,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE;aAC1C,CAAC,CAAC;YAEL,aAAa,EAAE,IAAI,CAAC,aAAa;iBAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,WAAW,CAAC;iBAC9D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACX,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE;gBAC/B,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE;gBAC/B,IAAI,EAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC3C,WAAW,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE;gBACzC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;aACzD,CAAC,CAAC;SACN,CAAC;IACJ,CAAC;IAEO,mBAAmB,CAAC,GAAW;QACrC,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAgB,CAAC;QAC9C,OAAO,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;IACxD,CAAC;IAEO,gBAAgB,CAAC,GAAW;QAClC,MAAM,KAAK,GAAG,GAAG,CAAC,WAAW,EAAsB,CAAC;QACpD,OAAO,kBAAkB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;IAC9D,CAAC;IAED;;;OAGG;IACK,YAAY,CAAC,OAA2B;QAC9C,uBAAuB;QACvB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAmE,CAAC;QAE7F,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACrC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;gBAC7C,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACpC,IAAI,QAAQ,EAAE,CAAC;oBACb,mDAAmD;oBACnD,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC;wBACvD,QAAQ,CAAC,WAAW,GAAG,GAAG,QAAQ,CAAC,WAAW,KAAK,MAAM,CAAC,WAAW,EAAE,CAAC;oBAC1E,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,MAAM,EAAE,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,0CAA0C;QAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EASnB,CAAC;QAEJ,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;gBAC/C,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;gBAE/C,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC;gBACzD,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC;gBAEzD,iDAAiD;gBACjD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAEvE,MAAM,MAAM,GAAG,GAAG,QAAQ,KAAK,QAAQ,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;gBACvD,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpC,IAAI,QAAQ,EAAE,CAAC;oBACb,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;oBACxD,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;wBACpD,QAAQ,CAAC,WAAW,GAAG,GAAG,QAAQ,CAAC,WAAW,KAAK,GAAG,CAAC,WAAW,EAAE,CAAC;oBACvE,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE;wBACjB,MAAM,EAAE,QAAQ;wBAChB,MAAM,EAAE,QAAQ;wBAChB,IAAI,EAAE,GAAG,CAAC,IAAI;wBACd,WAAW,EAAE,GAAG,CAAC,WAAW;wBAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;qBACnB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;YACjC,aAAa,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;SACpC,CAAC;IACJ,CAAC;IAEO,SAAS,CAAC,IAAY,EAAE,MAAc;QAC5C,IAAI,IAAI,CAAC,MAAM,IAAI,MAAM;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAEzC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAChD,uCAAuC;YACvC,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBACtB,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;gBAC9C,IAAI,OAAO,GAAG,KAAK,GAAG,MAAM,GAAG,GAAG;oBAAE,GAAG,GAAG,OAAO,GAAG,CAAC,CAAC;YACxD,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3C,KAAK,GAAG,GAAG,CAAC;QACd,CAAC;QAED,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;CACF;AAxND,0CAwNC"}