@hazeljs/rag 0.2.0-alpha.1

package/dist/graph/graph.types.d.ts

@@ -0,0 +1,186 @@
+/**
+ * GraphRAG Types
+ *
+ * GraphRAG (Graph Retrieval-Augmented Generation) extends traditional vector
+ * search by building a knowledge graph of entities and relationships extracted
+ * from documents. This enables two retrieval modes that outperform flat cosine
+ * similarity:
+ *
+ *  - Local search  — entity-centric; great for specific "who/what/how" questions
+ *  - Global search — community-centric; great for broad thematic questions that
+ *                    span the entire corpus
+ *
+ * Architecture (mirrors Microsoft Research GraphRAG paper):
+ *  Documents → Text Chunks → Entity/Relationship Extraction (LLM)
+ *           → KnowledgeGraph → Community Detection (LPA)
+ *           → Community Reports (LLM) → Retrieval → Answer
+ */
+export type EntityType = 'CONCEPT' | 'TECHNOLOGY' | 'PERSON' | 'ORGANIZATION' | 'PROCESS' | 'FEATURE' | 'EVENT' | 'LOCATION' | 'OTHER';
+export interface GraphEntity {
+    id: string;
+    /** Canonical name used for deduplication and matching. */
+    name: string;
+    type: EntityType;
+    description: string;
+    /** IDs of source documents this entity was extracted from. */
+    sourceDocIds: string[];
+    /** Optional embedding of `name + description` for similarity-based entity linking. */
+    embedding?: number[];
+    metadata?: Record<string, unknown>;
+}
+export type RelationshipType = 'USES' | 'IMPLEMENTS' | 'CREATED_BY' | 'PART_OF' | 'DEPENDS_ON' | 'RELATED_TO' | 'EXTENDS' | 'CONFIGURES' | 'TRIGGERS' | 'PRODUCES' | 'REPLACES' | 'OTHER';
+export interface GraphRelationship {
+    id: string;
+    /** Source entity id. */
+    sourceId: string;
+    /** Target entity id. */
+    targetId: string;
+    type: RelationshipType;
+    description: string;
+    /** Importance weight 1–10 assigned by the LLM extractor. */
+    weight: number;
+    sourceDocIds: string[];
+}
+export interface GraphCommunity {
+    id: string;
+    /** Entity IDs belonging to this community. */
+    entityIds: string[];
+    /**
+     * Hierarchical level (0 = leaf, higher = more coarse-grained).
+     * Level 0 communities are used for local search; higher levels for global.
+     */
+    level: number;
+}
+export interface CommunityReport {
+    communityId: string;
+    /** One-line title summarising the community's theme. */
+    title: string;
+    /** 2–4 paragraph narrative summary generated by the LLM. */
+    summary: string;
+    /** Key findings / bullet points extracted by the LLM. */
+    findings: string[];
+    /** LLM-assigned importance score 1–10. */
+    rating: number;
+    entityIds: string[];
+}
+export interface KnowledgeGraph {
+    entities: Map<string, GraphEntity>;
+    relationships: Map<string, GraphRelationship>;
+    /** Adjacency list: entityId → Set<entityId> (undirected for traversal). */
+    adjacency: Map<string, Set<string>>;
+    communities: GraphCommunity[];
+    communityReports: Map<string, CommunityReport>;
+}
+/** Raw extraction result from the LLM for a single text chunk. */
+export interface ExtractionResult {
+    entities: Array<{
+        name: string;
+        type: EntityType;
+        description: string;
+    }>;
+    relationships: Array<{
+        source: string;
+        target: string;
+        type: RelationshipType;
+        description: string;
+        weight: number;
+    }>;
+}
+export interface GraphRAGConfig {
+    /**
+     * Function to call the LLM for extraction and summarisation.
+     * Signature: (prompt: string) => Promise<string>
+     */
+    llm: (prompt: string) => Promise<string>;
+    /**
+     * Optional embedding provider for entity-similarity linking.
+     * When provided, near-duplicate entities (e.g. "HazelJS" / "Hazel Framework")
+     * are merged before graph construction.
+     */
+    embeddings?: {
+        embed(text: string): Promise<number[]>;
+    };
+    /**
+     * Max text length sent to the LLM in a single extraction call.
+     * Shorter = cheaper; longer = fewer API calls but may miss details.
+     * Default: 2000 characters.
+     */
+    extractionChunkSize?: number;
+    /**
+     * Number of LPA (Label Propagation Algorithm) iterations for community detection.
+     * Default: 10.
+     */
+    communityIterations?: number;
+    /**
+     * Whether to generate LLM community reports (costs tokens).
+     * Default: true.
+     */
+    generateCommunityReports?: boolean;
+    /**
+     * Maximum community size before splitting into sub-communities.
+     * Default: 10.
+     */
+    maxCommunitySize?: number;
+    /**
+     * Number of graph hops to traverse during local search.
+     * Default: 2.
+     */
+    localSearchDepth?: number;
+    /**
+     * Top-K entities to seed local search from.
+     * Default: 5.
+     */
+    localSearchTopK?: number;
+    /**
+     * Top-K community reports to include in global search context.
+     * Default: 5.
+     */
+    globalSearchTopK?: number;
+}
+export type GraphSearchMode = 'local' | 'global' | 'hybrid';
+export interface GraphSearchOptions {
+    mode?: GraphSearchMode;
+    topK?: number;
+    depth?: number;
+    /** Include raw entities and relationships in the result. */
+    includeGraph?: boolean;
+    /** Include community reports in the result. */
+    includeCommunities?: boolean;
+}
+export interface GraphSearchResult {
+    mode: GraphSearchMode;
+    query: string;
+    answer: string;
+    /** Entities that seeded or appeared during the search. */
+    entities: GraphEntity[];
+    /** Relationships traversed during local search. */
+    relationships: GraphRelationship[];
+    /** Community reports used in global/hybrid search. */
+    communities: CommunityReport[];
+    /** The assembled context string sent to the LLM. */
+    context: string;
+    duration: number;
+}
+export interface GraphBuildStats {
+    documentsProcessed: number;
+    entitiesExtracted: number;
+    entitiesMerged: number;
+    relationshipsExtracted: number;
+    communitiesDetected: number;
+    communityReportsGenerated: number;
+    duration: number;
+}
+export interface GraphStats {
+    totalEntities: number;
+    totalRelationships: number;
+    totalCommunities: number;
+    entityTypeBreakdown: Record<string, number>;
+    relationshipTypeBreakdown: Record<string, number>;
+    avgRelationshipsPerEntity: number;
+    topEntities: Array<{
+        name: string;
+        type: string;
+        connections: number;
+    }>;
+}
+//# sourceMappingURL=graph.types.d.ts.map

package/dist/graph/graph.types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.types.d.ts","sourceRoot":"","sources":["../../src/graph/graph.types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,MAAM,MAAM,UAAU,GAClB,SAAS,GACT,YAAY,GACZ,QAAQ,GACR,cAAc,GACd,SAAS,GACT,SAAS,GACT,OAAO,GACP,UAAU,GACV,OAAO,CAAC;AAEZ,MAAM,WAAW,WAAW;IAC1B,EAAE,EAAE,MAAM,CAAC;IACX,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,UAAU,CAAC;IACjB,WAAW,EAAE,MAAM,CAAC;IACpB,8DAA8D;IAC9D,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,sFAAsF;IACtF,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAID,MAAM,MAAM,gBAAgB,GACxB,MAAM,GACN,YAAY,GACZ,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,UAAU,GACV,UAAU,GACV,UAAU,GACV,OAAO,CAAC;AAEZ,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,wBAAwB;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,wBAAwB;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,gBAAgB,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,4DAA4D;IAC5D,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAID,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,8CAA8C;IAC9C,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB;;;OAGG;IACH,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,eAAe;IAC9B,WAAW,EAAE,MAAM,CAAC;IACpB,wDAAwD;IACxD,KAAK,EAAE,MAAM,CAAC;IACd,4DAA4D;IAC5D,OAAO,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,0CAA0C;IAC1C,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAID,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACnC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAC9C,2EAA2E;IAC3E,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACpC,WAAW,EAAE,cAAc,EAAE,CAAC;IAC9B,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;CAChD;AAID,kEAAkE;AAClE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,EAAE,KAAK,CAAC;QACd,IAAI,EAAE,MAAM,CAAC;QACb,IAAI,EAAE,UAAU,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC,CAAC;IACH,aAAa,EAAE,KAAK,CAAC;QACnB,MAAM,EAAE,MAAM,CAAC;QACf,MAAM,EAAE,MAAM,CAAC;QACf,IAAI,EAAE,gBAAgB,CAAC;QACvB,WAAW,EAAE,MAAM,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;KAChB,CAAC,CAAC;CACJ;AAID,MAAM,WAAW,cAAc;IAC7B;;;OAGG;IACH,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC;IACzC;;;;OAIG;IACH,UAAU,CAAC,EAAE;QACX,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;KACxC,CAAC;IACF;;;;OAIG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;OAGG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;OAGG;IACH,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B;;;OAGG;IACH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAID,MAAM,MAAM,eAAe,GAAG,OAAO,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAE5D,MAAM,WAAW,kBAAkB;IACjC,IAAI,CAAC,EAAE,eAAe,CAAC;IACvB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,4DAA4D;IAC5D,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,+CAA+C;IAC/C,kBAAkB,CAAC,EAAE,OAAO,CAAC;CAC9B;AAED,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,eAAe,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,0DAA0D;IAC1D,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,mDAAmD;IACnD,aAAa,EAAE,iBAAiB,EAAE,CAAC;IACnC,sDAAsD;IACtD,WAAW,EAAE,eAAe,EAAE,CAAC;IAC/B,oDAAoD;IACpD,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAID,MAAM,WAAW,eAAe;IAC9B,kBAAkB,EAAE,MAAM,CAAC;IAC3B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,sBAAsB,EAAE,MAAM,CAAC;IAC/B,mBAAmB,EAAE,MAAM,CAAC;IAC5B,yBAAyB,EAAE,MAAM,CAAC;IAClC,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,UAAU;IACzB,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,mBAAmB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5C,yBAAyB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClD,yBAAyB,EAAE,MAAM,CAAC;IAClC,WAAW,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACzE"}

package/dist/graph/graph.types.js

@@ -0,0 +1,20 @@
+"use strict";
+/**
+ * GraphRAG Types
+ *
+ * GraphRAG (Graph Retrieval-Augmented Generation) extends traditional vector
+ * search by building a knowledge graph of entities and relationships extracted
+ * from documents. This enables two retrieval modes that outperform flat cosine
+ * similarity:
+ *
+ *  - Local search  — entity-centric; great for specific "who/what/how" questions
+ *  - Global search — community-centric; great for broad thematic questions that
+ *                    span the entire corpus
+ *
+ * Architecture (mirrors Microsoft Research GraphRAG paper):
+ *  Documents → Text Chunks → Entity/Relationship Extraction (LLM)
+ *           → KnowledgeGraph → Community Detection (LPA)
+ *           → Community Reports (LLM) → Retrieval → Answer
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=graph.types.js.map

package/dist/graph/graph.types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.types.js","sourceRoot":"","sources":["../../src/graph/graph.types.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;GAgBG"}

package/dist/graph/index.d.ts

@@ -0,0 +1,15 @@
+/**
+ * @hazeljs/rag — GraphRAG
+ *
+ * Graph-based Retrieval-Augmented Generation.
+ * Extends traditional vector search with a knowledge graph of entities and
+ * relationships, enabling both entity-centric (local) and thematic (global)
+ * retrieval that outperforms flat cosine similarity for complex questions.
+ */
+export * from './graph.types';
+export * from './knowledge-graph';
+export * from './entity-extractor';
+export * from './community-detector';
+export * from './community-summarizer';
+export * from './graph-rag-pipeline';
+//# sourceMappingURL=index.d.ts.map

package/dist/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC;AACnC,cAAc,sBAAsB,CAAC;AACrC,cAAc,wBAAwB,CAAC;AACvC,cAAc,sBAAsB,CAAC"}

package/dist/graph/index.js

@@ -0,0 +1,31 @@
+"use strict";
+/**
+ * @hazeljs/rag — GraphRAG
+ *
+ * Graph-based Retrieval-Augmented Generation.
+ * Extends traditional vector search with a knowledge graph of entities and
+ * relationships, enabling both entity-centric (local) and thematic (global)
+ * retrieval that outperforms flat cosine similarity for complex questions.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./graph.types"), exports);
+__exportStar(require("./knowledge-graph"), exports);
+__exportStar(require("./entity-extractor"), exports);
+__exportStar(require("./community-detector"), exports);
+__exportStar(require("./community-summarizer"), exports);
+__exportStar(require("./graph-rag-pipeline"), exports);
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;;;;;;;;;;;;;;AAEH,gDAA8B;AAC9B,oDAAkC;AAClC,qDAAmC;AACnC,uDAAqC;AACrC,yDAAuC;AACvC,uDAAqC"}

package/dist/graph/knowledge-graph.d.ts

@@ -0,0 +1,57 @@
+/**
+ * KnowledgeGraph
+ *
+ * In-memory directed graph that stores GraphRAG entities and relationships.
+ * Uses Map-based adjacency lists for O(1) neighbour lookup.
+ *
+ * Key operations:
+ *  - addEntity / addRelationship — incremental loading
+ *  - mergeEntity — fold a duplicate entity into an existing one
+ *  - bfsNeighbours — breadth-first traversal for local context
+ *  - findEntitiesByName — fuzzy substring + exact matching for query seeding
+ *  - getStats — live graph metrics
+ */
+import type { GraphEntity, GraphRelationship, GraphCommunity, CommunityReport, KnowledgeGraph, GraphStats } from './graph.types';
+export declare class GraphStore implements KnowledgeGraph {
+    readonly entities: Map<string, GraphEntity>;
+    readonly relationships: Map<string, GraphRelationship>;
+    /** Undirected adjacency: entityId → Set<entityId> */
+    readonly adjacency: Map<string, Set<string>>;
+    communities: GraphCommunity[];
+    readonly communityReports: Map<string, CommunityReport>;
+    addEntity(entity: GraphEntity): GraphEntity;
+    mergeEntity(existingId: string, incoming: Partial<GraphEntity>): GraphEntity;
+    /** Look up an entity by exact (case-insensitive) name. */
+    findEntityByName(name: string): GraphEntity | undefined;
+    /**
+     * Fuzzy-match entities whose name contains `query` (case-insensitive).
+     * Returns up to `limit` results sorted by name length (exact-ish first).
+     */
+    findEntitiesByName(query: string, limit?: number): GraphEntity[];
+    addRelationship(rel: GraphRelationship): GraphRelationship;
+    /** Get all relationships connected to a given entity (as source or target). */
+    getEntityRelationships(entityId: string): GraphRelationship[];
+    /**
+     * Breadth-first search from a set of seed entity IDs.
+     * Returns all entities and relationships within `depth` hops,
+     * plus the seed entities themselves.
+     */
+    bfsNeighbours(seedIds: string[], depth?: number): {
+        entities: GraphEntity[];
+        relationships: GraphRelationship[];
+    };
+    setCommunities(communities: GraphCommunity[]): void;
+    addCommunityReport(report: CommunityReport): void;
+    getCommunityForEntity(entityId: string): GraphCommunity | undefined;
+    getStats(): GraphStats;
+    /** Returns a plain-object snapshot useful for JSON serialisation / API responses. */
+    toJSON(): {
+        entities: GraphEntity[];
+        relationships: GraphRelationship[];
+        communities: GraphCommunity[];
+        communityReports: CommunityReport[];
+        stats: GraphStats;
+    };
+    clear(): void;
+}
+//# sourceMappingURL=knowledge-graph.d.ts.map

package/dist/graph/knowledge-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.d.ts","sourceRoot":"","sources":["../../src/graph/knowledge-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EACV,WAAW,EACX,iBAAiB,EACjB,cAAc,EACd,eAAe,EACf,cAAc,EACd,UAAU,EACX,MAAM,eAAe,CAAC;AAEvB,qBAAa,UAAW,YAAW,cAAc;IAC/C,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAa;IACxD,QAAQ,CAAC,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAa;IACnE,qDAAqD;IACrD,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAa;IACzD,WAAW,EAAE,cAAc,EAAE,CAAM;IACnC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,eAAe,CAAC,CAAa;IAIpE,SAAS,CAAC,MAAM,EAAE,WAAW,GAAG,WAAW;IAY3C,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,WAAW,CAAC,GAAG,WAAW;IAiB5E,0DAA0D;IAC1D,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAQvD;;;OAGG;IACH,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,SAAK,GAAG,WAAW,EAAE;IAe5D,eAAe,CAAC,GAAG,EAAE,iBAAiB,GAAG,iBAAiB;IAgB1D,+EAA+E;IAC/E,sBAAsB,CAAC,QAAQ,EAAE,MAAM,GAAG,iBAAiB,EAAE;IAY7D;;;;OAIG;IACH,aAAa,CACX,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,SAAI,GACR;QAAE,QAAQ,EAAE,WAAW,EAAE,CAAC;QAAC,aAAa,EAAE,iBAAiB,EAAE,CAAA;KAAE;IA0ClE,cAAc,CAAC,WAAW,EAAE,cAAc,EAAE,GAAG,IAAI;IAInD,kBAAkB,CAAC,MAAM,EAAE,eAAe,GAAG,IAAI;IAIjD,qBAAqB,CAAC,QAAQ,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAMnE,QAAQ,IAAI,UAAU;IAsCtB,qFAAqF;IACrF,MAAM,IAAI;QACR,QAAQ,EAAE,WAAW,EAAE,CAAC;QACxB,aAAa,EAAE,iBAAiB,EAAE,CAAC;QACnC,WAAW,EAAE,cAAc,EAAE,CAAC;QAC9B,gBAAgB,EAAE,eAAe,EAAE,CAAC;QACpC,KAAK,EAAE,UAAU,CAAC;KACnB;IAUD,KAAK,IAAI,IAAI;CAOd"}

package/dist/graph/knowledge-graph.js

@@ -0,0 +1,198 @@
+"use strict";
+/**
+ * KnowledgeGraph
+ *
+ * In-memory directed graph that stores GraphRAG entities and relationships.
+ * Uses Map-based adjacency lists for O(1) neighbour lookup.
+ *
+ * Key operations:
+ *  - addEntity / addRelationship — incremental loading
+ *  - mergeEntity — fold a duplicate entity into an existing one
+ *  - bfsNeighbours — breadth-first traversal for local context
+ *  - findEntitiesByName — fuzzy substring + exact matching for query seeding
+ *  - getStats — live graph metrics
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphStore = void 0;
+class GraphStore {
+    constructor() {
+        this.entities = new Map();
+        this.relationships = new Map();
+        /** Undirected adjacency: entityId → Set<entityId> */
+        this.adjacency = new Map();
+        this.communities = [];
+        this.communityReports = new Map();
+    }
+    // ── Entities ──────────────────────────────────────────────────────────────
+    addEntity(entity) {
+        const existing = this.entities.get(entity.id);
+        if (existing) {
+            return this.mergeEntity(entity.id, entity);
+        }
+        this.entities.set(entity.id, entity);
+        if (!this.adjacency.has(entity.id)) {
+            this.adjacency.set(entity.id, new Set());
+        }
+        return entity;
+    }
+    mergeEntity(existingId, incoming) {
+        const existing = this.entities.get(existingId);
+        if (!existing)
+            throw new Error(`Entity ${existingId} not found`);
+        const merged = {
+            ...existing,
+            description: incoming.description
+                ? `${existing.description}. ${incoming.description}`
+                : existing.description,
+            sourceDocIds: [...new Set([...existing.sourceDocIds, ...(incoming.sourceDocIds ?? [])])],
+            metadata: { ...existing.metadata, ...incoming.metadata },
+        };
+        this.entities.set(existingId, merged);
+        return merged;
+    }
+    /** Look up an entity by exact (case-insensitive) name. */
+    findEntityByName(name) {
+        const normalized = name.toLowerCase().trim();
+        for (const entity of this.entities.values()) {
+            if (entity.name.toLowerCase().trim() === normalized)
+                return entity;
+        }
+        return undefined;
+    }
+    /**
+     * Fuzzy-match entities whose name contains `query` (case-insensitive).
+     * Returns up to `limit` results sorted by name length (exact-ish first).
+     */
+    findEntitiesByName(query, limit = 10) {
+        const normalized = query.toLowerCase().trim();
+        const results = [];
+        for (const entity of this.entities.values()) {
+            if (entity.name.toLowerCase().includes(normalized)) {
+                results.push(entity);
+            }
+        }
+        return results.sort((a, b) => a.name.length - b.name.length).slice(0, limit);
+    }
+    // ── Relationships ─────────────────────────────────────────────────────────
+    addRelationship(rel) {
+        this.relationships.set(rel.id, rel);
+        // Update undirected adjacency
+        const srcAdj = this.adjacency.get(rel.sourceId) ?? new Set();
+        const tgtAdj = this.adjacency.get(rel.targetId) ?? new Set();
+        srcAdj.add(rel.targetId);
+        tgtAdj.add(rel.sourceId);
+        this.adjacency.set(rel.sourceId, srcAdj);
+        this.adjacency.set(rel.targetId, tgtAdj);
+        return rel;
+    }
+    /** Get all relationships connected to a given entity (as source or target). */
+    getEntityRelationships(entityId) {
+        const results = [];
+        for (const rel of this.relationships.values()) {
+            if (rel.sourceId === entityId || rel.targetId === entityId) {
+                results.push(rel);
+            }
+        }
+        return results;
+    }
+    // ── Graph Traversal ───────────────────────────────────────────────────────
+    /**
+     * Breadth-first search from a set of seed entity IDs.
+     * Returns all entities and relationships within `depth` hops,
+     * plus the seed entities themselves.
+     */
+    bfsNeighbours(seedIds, depth = 2) {
+        const visitedEntities = new Set(seedIds);
+        const visitedRelationships = new Set();
+        let frontier = [...seedIds];
+        for (let hop = 0; hop < depth; hop++) {
+            const nextFrontier = [];
+            for (const entityId of frontier) {
+                const neighbours = this.adjacency.get(entityId) ?? new Set();
+                for (const neighbourId of neighbours) {
+                    if (!visitedEntities.has(neighbourId)) {
+                        visitedEntities.add(neighbourId);
+                        nextFrontier.push(neighbourId);
+                    }
+                }
+            }
+            frontier = nextFrontier;
+            if (frontier.length === 0)
+                break;
+        }
+        // Collect relationships that connect any two visited entities
+        for (const rel of this.relationships.values()) {
+            if (visitedEntities.has(rel.sourceId) && visitedEntities.has(rel.targetId)) {
+                visitedRelationships.add(rel.id);
+            }
+        }
+        const entities = [...visitedEntities]
+            .map((id) => this.entities.get(id))
+            .filter((e) => e !== undefined);
+        const relationships = [...visitedRelationships]
+            .map((id) => this.relationships.get(id))
+            .filter((r) => r !== undefined);
+        return { entities, relationships };
+    }
+    // ── Communities ───────────────────────────────────────────────────────────
+    setCommunities(communities) {
+        this.communities = communities;
+    }
+    addCommunityReport(report) {
+        this.communityReports.set(report.communityId, report);
+    }
+    getCommunityForEntity(entityId) {
+        return this.communities.find((c) => c.entityIds.includes(entityId));
+    }
+    // ── Stats ─────────────────────────────────────────────────────────────────
+    getStats() {
+        const entityTypeBreakdown = {};
+        const relationshipTypeBreakdown = {};
+        for (const entity of this.entities.values()) {
+            entityTypeBreakdown[entity.type] = (entityTypeBreakdown[entity.type] ?? 0) + 1;
+        }
+        for (const rel of this.relationships.values()) {
+            relationshipTypeBreakdown[rel.type] = (relationshipTypeBreakdown[rel.type] ?? 0) + 1;
+        }
+        // Top connected entities
+        const topEntities = [...this.entities.values()]
+            .map((e) => ({
+            name: e.name,
+            type: e.type,
+            connections: this.adjacency.get(e.id)?.size ?? 0,
+        }))
+            .sort((a, b) => b.connections - a.connections)
+            .slice(0, 10);
+        const totalRelationships = this.relationships.size;
+        const totalEntities = this.entities.size;
+        return {
+            totalEntities,
+            totalRelationships,
+            totalCommunities: this.communities.length,
+            entityTypeBreakdown,
+            relationshipTypeBreakdown,
+            avgRelationshipsPerEntity: totalEntities > 0 ? (totalRelationships * 2) / totalEntities : 0,
+            topEntities,
+        };
+    }
+    // ── Serialisation ─────────────────────────────────────────────────────────
+    /** Returns a plain-object snapshot useful for JSON serialisation / API responses. */
+    toJSON() {
+        return {
+            entities: [...this.entities.values()],
+            relationships: [...this.relationships.values()],
+            communities: this.communities,
+            communityReports: [...this.communityReports.values()],
+            stats: this.getStats(),
+        };
+    }
+    clear() {
+        this.entities.clear();
+        this.relationships.clear();
+        this.adjacency.clear();
+        this.communities = [];
+        this.communityReports.clear();
+    }
+}
+exports.GraphStore = GraphStore;
+//# sourceMappingURL=knowledge-graph.js.map

package/dist/graph/knowledge-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.js","sourceRoot":"","sources":["../../src/graph/knowledge-graph.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;AAWH,MAAa,UAAU;IAAvB;QACW,aAAQ,GAA6B,IAAI,GAAG,EAAE,CAAC;QAC/C,kBAAa,GAAmC,IAAI,GAAG,EAAE,CAAC;QACnE,qDAAqD;QAC5C,cAAS,GAA6B,IAAI,GAAG,EAAE,CAAC;QACzD,gBAAW,GAAqB,EAAE,CAAC;QAC1B,qBAAgB,GAAiC,IAAI,GAAG,EAAE,CAAC;IAwNtE,CAAC;IAtNC,6EAA6E;IAE7E,SAAS,CAAC,MAAmB;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC9C,IAAI,QAAQ,EAAE,CAAC;YACb,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,WAAW,CAAC,UAAkB,EAAE,QAA8B;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,KAAK,CAAC,UAAU,UAAU,YAAY,CAAC,CAAC;QAEjE,MAAM,MAAM,GAAgB;YAC1B,GAAG,QAAQ;YACX,WAAW,EAAE,QAAQ,CAAC,WAAW;gBAC/B,CAAC,CAAC,GAAG,QAAQ,CAAC,WAAW,KAAK,QAAQ,CAAC,WAAW,EAAE;gBACpD,CAAC,CAAC,QAAQ,CAAC,WAAW;YACxB,YAAY,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,QAAQ,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YACxF,QAAQ,EAAE,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE;SACzD,CAAC;QAEF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,0DAA0D;IAC1D,gBAAgB,CAAC,IAAY;QAC3B,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,KAAK,UAAU;gBAAE,OAAO,MAAM,CAAC;QACrE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,KAAa,EAAE,KAAK,GAAG,EAAE;QAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAkB,EAAE,CAAC;QAElC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACnD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAC/E,CAAC;IAED,6EAA6E;IAE7E,eAAe,CAAC,GAAsB;QACpC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAEpC,8BAA8B;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACrE,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QAErE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEzB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAEzC,OAAO,GAAG,CAAC;IACb,CAAC;IAED,+EAA+E;IAC/E,sBAAsB,CAAC,QAAgB;QACrC,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,IAAI,GAAG,CAAC,QAAQ,KAAK,QAAQ,IAAI,GAAG,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;gBAC3D,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,6EAA6E;IAE7E;;;;OAIG;IACH,aAAa,CACX,OAAiB,EACjB,KAAK,GAAG,CAAC;QAET,MAAM,eAAe,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,CAAC;QACjD,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/C,IAAI,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAE5B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC;YACrC,MAAM,YAAY,GAAa,EAAE,CAAC;YAElC,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBAChC,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBACrE,KAAK,MAAM,WAAW,IAAI,UAAU,EAAE,CAAC;oBACrC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;wBACtC,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;wBACjC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,QAAQ,GAAG,YAAY,CAAC;YACxB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;QACnC,CAAC;QAED,8DAA8D;QAC9D,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC3E,oBAAoB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,CAAC,GAAG,eAAe,CAAC;aAClC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAClC,MAAM,CAAC,CAAC,CAAC,EAAoB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;QAEpD,MAAM,aAAa,GAAG,CAAC,GAAG,oBAAoB,CAAC;aAC5C,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aACvC,MAAM,CAAC,CAAC,CAAC,EAA0B,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;QAE1D,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,CAAC;IACrC,CAAC;IAED,6EAA6E;IAE7E,cAAc,CAAC,WAA6B;QAC1C,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,kBAAkB,CAAC,MAAuB;QACxC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACxD,CAAC;IAED,qBAAqB,CAAC,QAAgB;QACpC,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,6EAA6E;IAE7E,QAAQ;QACN,MAAM,mBAAmB,GAA2B,EAAE,CAAC;QACvD,MAAM,yBAAyB,GAA2B,EAAE,CAAC;QAE7D,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjF,CAAC;QAED,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,yBAAyB,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,yBAAyB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvF,CAAC;QAED,yBAAyB;QACzB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;aAC5C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC;SACjD,CAAC,CAAC;aACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;aAC7C,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAEhB,MAAM,kBAAkB,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC;QACnD,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;QAEzC,OAAO;YACL,aAAa;YACb,kBAAkB;YAClB,gBAAgB,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM;YACzC,mBAAmB;YACnB,yBAAyB;YACzB,yBAAyB,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,kBAAkB,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;YAC3F,WAAW;SACZ,CAAC;IACJ,CAAC;IAED,6EAA6E;IAE7E,qFAAqF;IACrF,MAAM;QAOJ,OAAO;YACL,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACrC,aAAa,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;YAC/C,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,gBAAgB,EAAE,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC;YACrD,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE;SACvB,CAAC;IACJ,CAAC;IAED,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;CACF;AA9ND,gCA8NC"}

package/dist/index.d.ts

@@ -0,0 +1,29 @@
+/**
+ * @hazeljs/rag - Retrieval-Augmented Generation
+ * Vector search and RAG capabilities for HazelJS
+ */
+export * from './types';
+export * from './rag-pipeline';
+export * from './rag.service';
+export * from './rag.module';
+export * from './decorators/rag.decorator';
+export * from './decorators/embeddable.decorator';
+export * from './decorators/semantic-search.decorator';
+export * from './embeddings/openai-embeddings';
+export * from './embeddings/cohere-embeddings';
+export * from './vector-stores/memory-vector-store';
+export * from './vector-stores/pinecone.store';
+export * from './vector-stores/qdrant.store';
+export * from './vector-stores/weaviate.store';
+export * from './vector-stores/chroma.store';
+export * from './text-splitters/recursive-text-splitter';
+export * from './loaders';
+export * from './retrieval/bm25';
+export * from './retrieval/hybrid-search';
+export * from './retrieval/multi-query';
+export * from './utils/similarity';
+export * from './memory';
+export * from './rag-pipeline-with-memory';
+export * from './agentic';
+export * from './graph';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,cAAc,SAAS,CAAC;AAGxB,cAAc,gBAAgB,CAAC;AAG/B,cAAc,eAAe,CAAC;AAC9B,cAAc,cAAc,CAAC;AAG7B,cAAc,4BAA4B,CAAC;AAC3C,cAAc,mCAAmC,CAAC;AAClD,cAAc,wCAAwC,CAAC;AAGvD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,gCAAgC,CAAC;AAG/C,cAAc,qCAAqC,CAAC;AACpD,cAAc,gCAAgC,CAAC;AAC/C,cAAc,8BAA8B,CAAC;AAC7C,cAAc,gCAAgC,CAAC;AAC/C,cAAc,8BAA8B,CAAC;AAG7C,cAAc,0CAA0C,CAAC;AAGzD,cAAc,WAAW,CAAC;AAG1B,cAAc,kBAAkB,CAAC;AACjC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,yBAAyB,CAAC;AAGxC,cAAc,oBAAoB,CAAC;AAGnC,cAAc,UAAU,CAAC;AACzB,cAAc,4BAA4B,CAAC;AAG3C,cAAc,WAAW,CAAC;AAG1B,cAAc,SAAS,CAAC"}

package/dist/index.js

@@ -0,0 +1,58 @@
+"use strict";
+/**
+ * @hazeljs/rag - Retrieval-Augmented Generation
+ * Vector search and RAG capabilities for HazelJS
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+// Core types
+__exportStar(require("./types"), exports);
+// RAG Pipeline
+__exportStar(require("./rag-pipeline"), exports);
+// RAG Service & Module
+__exportStar(require("./rag.service"), exports);
+__exportStar(require("./rag.module"), exports);
+// Decorators
+__exportStar(require("./decorators/rag.decorator"), exports);
+__exportStar(require("./decorators/embeddable.decorator"), exports);
+__exportStar(require("./decorators/semantic-search.decorator"), exports);
+// Embeddings
+__exportStar(require("./embeddings/openai-embeddings"), exports);
+__exportStar(require("./embeddings/cohere-embeddings"), exports);
+// Vector Stores
+__exportStar(require("./vector-stores/memory-vector-store"), exports);
+__exportStar(require("./vector-stores/pinecone.store"), exports);
+__exportStar(require("./vector-stores/qdrant.store"), exports);
+__exportStar(require("./vector-stores/weaviate.store"), exports);
+__exportStar(require("./vector-stores/chroma.store"), exports);
+// Text Splitters
+__exportStar(require("./text-splitters/recursive-text-splitter"), exports);
+// Document Loaders
+__exportStar(require("./loaders"), exports);
+// Retrieval Strategies
+__exportStar(require("./retrieval/bm25"), exports);
+__exportStar(require("./retrieval/hybrid-search"), exports);
+__exportStar(require("./retrieval/multi-query"), exports);
+// Utils
+__exportStar(require("./utils/similarity"), exports);
+// Memory
+__exportStar(require("./memory"), exports);
+__exportStar(require("./rag-pipeline-with-memory"), exports);
+// Agentic RAG - Advanced autonomous retrieval capabilities
+__exportStar(require("./agentic"), exports);
+// GraphRAG - Knowledge graph-based retrieval (entity + community search)
+__exportStar(require("./graph"), exports);
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;AAEH,aAAa;AACb,0CAAwB;AAExB,eAAe;AACf,iDAA+B;AAE/B,uBAAuB;AACvB,gDAA8B;AAC9B,+CAA6B;AAE7B,aAAa;AACb,6DAA2C;AAC3C,oEAAkD;AAClD,yEAAuD;AAEvD,aAAa;AACb,iEAA+C;AAC/C,iEAA+C;AAE/C,gBAAgB;AAChB,sEAAoD;AACpD,iEAA+C;AAC/C,+DAA6C;AAC7C,iEAA+C;AAC/C,+DAA6C;AAE7C,iBAAiB;AACjB,2EAAyD;AAEzD,mBAAmB;AACnB,4CAA0B;AAE1B,uBAAuB;AACvB,mDAAiC;AACjC,4DAA0C;AAC1C,0DAAwC;AAExC,QAAQ;AACR,qDAAmC;AAEnC,SAAS;AACT,2CAAyB;AACzB,6DAA2C;AAE3C,2DAA2D;AAC3D,4CAA0B;AAE1B,yEAAyE;AACzE,0CAAwB"}