@hazeljs/rag 0.2.0-alpha.1

package/dist/retrieval/multi-query.js

@@ -0,0 +1,135 @@
+"use strict";
+/**
+ * Multi-Query Retrieval
+ * Generates multiple search queries from a single question to improve retrieval
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MultiQueryRetrieval = void 0;
+class MultiQueryRetrieval {
+    constructor(vectorStore, config = {}) {
+        this.vectorStore = vectorStore;
+        this.config = {
+            numQueries: config.numQueries || 3,
+            llmProvider: config.llmProvider || 'openai',
+            ...config,
+        };
+    }
+    /**
+     * Perform multi-query retrieval
+     */
+    async retrieve(question, options) {
+        // Generate multiple queries
+        const queries = await this.generateQueries(question);
+        // Search with each query
+        const allResults = [];
+        const seenIds = new Set();
+        for (const query of queries) {
+            const results = await this.vectorStore.search(query, options);
+            // Deduplicate results
+            for (const result of results) {
+                if (!seenIds.has(result.id)) {
+                    seenIds.add(result.id);
+                    allResults.push(result);
+                }
+            }
+        }
+        // Re-rank by average score across queries
+        const rankedResults = this.rankResults(allResults, queries);
+        // Return top K
+        const topK = options?.topK || 5;
+        return rankedResults.slice(0, topK);
+    }
+    /**
+     * Generate multiple search queries from a single question
+     */
+    async generateQueries(question) {
+        const numQueries = this.config.numQueries;
+        // Use custom generator if provided
+        if (this.config.customGenerator) {
+            return this.config.customGenerator(question, numQueries);
+        }
+        // Use LLM to generate queries
+        if (this.config.llmProvider === 'openai') {
+            return this.generateWithOpenAI(question, numQueries);
+        }
+        // Fallback: simple query variations
+        return this.generateSimpleVariations(question, numQueries);
+    }
+    /**
+     * Generate queries using OpenAI
+     */
+    async generateWithOpenAI(question, numQueries) {
+        try {
+            // eslint-disable-next-line @typescript-eslint/no-require-imports
+            const { OpenAI } = require('openai');
+            const client = new OpenAI({ apiKey: this.config.apiKey });
+            const prompt = `You are a helpful assistant that generates search queries. 
+Given a question, generate ${numQueries} different search queries that could help find relevant information.
+Each query should approach the question from a different angle.
+
+Question: ${question}
+
+Generate ${numQueries} search queries (one per line):`;
+            const response = await client.chat.completions.create({
+                model: this.config.model || 'gpt-3.5-turbo',
+                messages: [{ role: 'user', content: prompt }],
+                temperature: 0.7,
+            });
+            const content = response.choices[0].message.content || '';
+            const queries = content
+                .split('\n')
+                .map((q) => q.replace(/^\d+\.\s*/, '').trim())
+                .filter((q) => q.length > 0)
+                .slice(0, numQueries);
+            // Include original question
+            return [question, ...queries].slice(0, numQueries + 1);
+        }
+        catch {
+            // Fallback to simple variations on error
+            return this.generateSimpleVariations(question, numQueries);
+        }
+    }
+    /**
+     * Generate simple query variations (fallback)
+     */
+    generateSimpleVariations(question, numQueries) {
+        const queries = [question];
+        // Add variations
+        const variations = [
+            `What is ${question.toLowerCase()}`,
+            `Explain ${question.toLowerCase()}`,
+            `How does ${question.toLowerCase()} work`,
+            `${question} details`,
+            `${question} information`,
+        ];
+        queries.push(...variations.slice(0, numQueries - 1));
+        return queries.slice(0, numQueries);
+    }
+    /**
+     * Rank results by frequency and average score
+     */
+    rankResults(results, queries) {
+        // Group results by ID and calculate average score
+        const scoreMap = new Map();
+        for (const result of results) {
+            if (!scoreMap.has(result.id)) {
+                scoreMap.set(result.id, { result, scores: [] });
+            }
+            scoreMap.get(result.id).scores.push(result.score);
+        }
+        // Calculate average score and frequency bonus
+        const rankedResults = Array.from(scoreMap.values()).map(({ result, scores }) => {
+            const avgScore = scores.reduce((sum, s) => sum + s, 0) / scores.length;
+            const frequencyBonus = scores.length / queries.length; // 0 to 1
+            const finalScore = avgScore * 0.7 + frequencyBonus * 0.3;
+            return {
+                ...result,
+                score: finalScore,
+            };
+        });
+        // Sort by final score
+        return rankedResults.sort((a, b) => b.score - a.score);
+    }
+}
+exports.MultiQueryRetrieval = MultiQueryRetrieval;
+//# sourceMappingURL=multi-query.js.map

package/dist/retrieval/multi-query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"multi-query.js","sourceRoot":"","sources":["../../src/retrieval/multi-query.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAYH,MAAa,mBAAmB;IAI9B,YAAY,WAAwB,EAAE,SAA2B,EAAE;QACjE,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG;YACZ,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,CAAC;YAClC,WAAW,EAAE,MAAM,CAAC,WAAW,IAAI,QAAQ;YAC3C,GAAG,MAAM;SACV,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,QAAgB,EAAE,OAAsB;QACrD,4BAA4B;QAC5B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAErD,yBAAyB;QACzB,MAAM,UAAU,GAAmB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAE9D,sBAAsB;YACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC5B,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBACvB,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QAE5D,eAAe;QACf,MAAM,IAAI,GAAG,OAAO,EAAE,IAAI,IAAI,CAAC,CAAC;QAChC,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,eAAe,CAAC,QAAgB;QAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,UAAW,CAAC;QAE3C,mCAAmC;QACnC,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC3D,CAAC;QAED,8BAA8B;QAC9B,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;YACzC,OAAO,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QACvD,CAAC;QAED,oCAAoC;QACpC,OAAO,IAAI,CAAC,wBAAwB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAAC,QAAgB,EAAE,UAAkB;QACnE,IAAI,CAAC;YACH,iEAAiE;YACjE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;YACrC,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YAE1D,MAAM,MAAM,GAAG;6BACQ,UAAU;;;YAG3B,QAAQ;;WAET,UAAU,iCAAiC,CAAC;YAEjD,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;gBACpD,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,eAAe;gBAC3C,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;gBAC7C,WAAW,EAAE,GAAG;aACjB,CAAC,CAAC;YAEH,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC;YAC1D,MAAM,OAAO,GAAG,OAAO;iBACpB,KAAK,CAAC,IAAI,CAAC;iBACX,GAAG,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;iBACrD,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;iBACnC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAExB,4BAA4B;YAC5B,OAAO,CAAC,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC;QACzD,CAAC;QAAC,MAAM,CAAC;YACP,yCAAyC;YACzC,OAAO,IAAI,CAAC,wBAAwB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED;;OAEG;IACK,wBAAwB,CAAC,QAAgB,EAAE,UAAkB;QACnE,MAAM,OAAO,GAAG,CAAC,QAAQ,CAAC,CAAC;QAE3B,iBAAiB;QACjB,MAAM,UAAU,GAAG;YACjB,WAAW,QAAQ,CAAC,WAAW,EAAE,EAAE;YACnC,WAAW,QAAQ,CAAC,WAAW,EAAE,EAAE;YACnC,YAAY,QAAQ,CAAC,WAAW,EAAE,OAAO;YACzC,GAAG,QAAQ,UAAU;YACrB,GAAG,QAAQ,cAAc;SAC1B,CAAC;QAEF,OAAO,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;QACrD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,OAAuB,EAAE,OAAiB;QAC5D,kDAAkD;QAClD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsD,CAAC;QAE/E,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7B,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;YAClD,CAAC;YACD,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC;QAED,8CAA8C;QAC9C,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE;YAC7E,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;YACvE,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,SAAS;YAChE,MAAM,UAAU,GAAG,QAAQ,GAAG,GAAG,GAAG,cAAc,GAAG,GAAG,CAAC;YAEzD,OAAO;gBACL,GAAG,MAAM;gBACT,KAAK,EAAE,UAAU;aAClB,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,sBAAsB;QACtB,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;CACF;AAtJD,kDAsJC"}

package/dist/text-splitters/recursive-text-splitter.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Recursive Text Splitter
+ * Splits text recursively by different separators
+ */
+import { TextSplitter, Document } from '../types';
+export interface RecursiveTextSplitterConfig {
+    chunkSize?: number;
+    chunkOverlap?: number;
+    separators?: string[];
+}
+export declare class RecursiveTextSplitter implements TextSplitter {
+    private chunkSize;
+    private chunkOverlap;
+    private separators;
+    constructor(config?: RecursiveTextSplitterConfig);
+    split(text: string): string[];
+    splitDocuments(documents: Document[]): Document[];
+    private splitTextRecursive;
+    private addOverlap;
+}
+//# sourceMappingURL=recursive-text-splitter.d.ts.map

package/dist/text-splitters/recursive-text-splitter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursive-text-splitter.d.ts","sourceRoot":"","sources":["../../src/text-splitters/recursive-text-splitter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AAElD,MAAM,WAAW,2BAA2B;IAC1C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,EAAE,CAAC;CACvB;AAED,qBAAa,qBAAsB,YAAW,YAAY;IACxD,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,UAAU,CAAW;gBAEjB,MAAM,GAAE,2BAAgC;IAMpD,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAI7B,cAAc,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE;IAsBjD,OAAO,CAAC,kBAAkB;IA+C1B,OAAO,CAAC,UAAU;CAsBnB"}

package/dist/text-splitters/recursive-text-splitter.js

@@ -0,0 +1,95 @@
+"use strict";
+/**
+ * Recursive Text Splitter
+ * Splits text recursively by different separators
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RecursiveTextSplitter = void 0;
+class RecursiveTextSplitter {
+    constructor(config = {}) {
+        this.chunkSize = config.chunkSize || 1000;
+        this.chunkOverlap = config.chunkOverlap || 200;
+        this.separators = config.separators || ['\n\n', '\n', '. ', ' ', ''];
+    }
+    split(text) {
+        return this.splitTextRecursive(text, this.separators);
+    }
+    splitDocuments(documents) {
+        const chunks = [];
+        for (const doc of documents) {
+            const textChunks = this.split(doc.content);
+            for (let i = 0; i < textChunks.length; i++) {
+                chunks.push({
+                    content: textChunks[i],
+                    metadata: {
+                        ...doc.metadata,
+                        chunkIndex: i,
+                        totalChunks: textChunks.length,
+                        sourceDocId: doc.id,
+                    },
+                });
+            }
+        }
+        return chunks;
+    }
+    splitTextRecursive(text, separators) {
+        const finalChunks = [];
+        // Get the first separator
+        const separator = separators[0];
+        let newSeparators;
+        if (separator === '') {
+            newSeparators = [];
+        }
+        else {
+            newSeparators = separators.slice(1);
+        }
+        // Split by separator
+        const splits = separator === '' ? text.split('') : text.split(separator);
+        // Merge splits into chunks
+        let currentChunk = '';
+        for (const split of splits) {
+            const potentialChunk = currentChunk + (currentChunk ? separator : '') + split;
+            if (potentialChunk.length <= this.chunkSize) {
+                currentChunk = potentialChunk;
+            }
+            else {
+                if (currentChunk) {
+                    finalChunks.push(currentChunk);
+                }
+                // If split is still too large and we have more separators, recurse
+                if (split.length > this.chunkSize && newSeparators.length > 0) {
+                    const subChunks = this.splitTextRecursive(split, newSeparators);
+                    finalChunks.push(...subChunks);
+                    currentChunk = '';
+                }
+                else {
+                    currentChunk = split;
+                }
+            }
+        }
+        if (currentChunk) {
+            finalChunks.push(currentChunk);
+        }
+        // Add overlap
+        return this.addOverlap(finalChunks);
+    }
+    addOverlap(chunks) {
+        if (this.chunkOverlap === 0 || chunks.length <= 1) {
+            return chunks;
+        }
+        const overlappedChunks = [];
+        for (let i = 0; i < chunks.length; i++) {
+            let chunk = chunks[i];
+            // Add overlap from previous chunk
+            if (i > 0) {
+                const prevChunk = chunks[i - 1];
+                const overlapText = prevChunk.slice(-this.chunkOverlap);
+                chunk = overlapText + chunk;
+            }
+            overlappedChunks.push(chunk);
+        }
+        return overlappedChunks;
+    }
+}
+exports.RecursiveTextSplitter = RecursiveTextSplitter;
+//# sourceMappingURL=recursive-text-splitter.js.map

package/dist/text-splitters/recursive-text-splitter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursive-text-splitter.js","sourceRoot":"","sources":["../../src/text-splitters/recursive-text-splitter.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAUH,MAAa,qBAAqB;IAKhC,YAAY,SAAsC,EAAE;QAClD,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC;QAC1C,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,YAAY,IAAI,GAAG,CAAC;QAC/C,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,KAAK,CAAC,IAAY;QAChB,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACxD,CAAC;IAED,cAAc,CAAC,SAAqB;QAClC,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;YAC5B,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,CAAC,IAAI,CAAC;oBACV,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;oBACtB,QAAQ,EAAE;wBACR,GAAG,GAAG,CAAC,QAAQ;wBACf,UAAU,EAAE,CAAC;wBACb,WAAW,EAAE,UAAU,CAAC,MAAM;wBAC9B,WAAW,EAAE,GAAG,CAAC,EAAE;qBACpB;iBACF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,kBAAkB,CAAC,IAAY,EAAE,UAAoB;QAC3D,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,0BAA0B;QAC1B,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,aAAuB,CAAC;QAE5B,IAAI,SAAS,KAAK,EAAE,EAAE,CAAC;YACrB,aAAa,GAAG,EAAE,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,aAAa,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QAED,qBAAqB;QACrB,MAAM,MAAM,GAAG,SAAS,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAEzE,2BAA2B;QAC3B,IAAI,YAAY,GAAG,EAAE,CAAC;QACtB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,cAAc,GAAG,YAAY,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;YAE9E,IAAI,cAAc,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC5C,YAAY,GAAG,cAAc,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,IAAI,YAAY,EAAE,CAAC;oBACjB,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACjC,CAAC;gBAED,mEAAmE;gBACnE,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;oBAChE,WAAW,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;oBAC/B,YAAY,GAAG,EAAE,CAAC;gBACpB,CAAC;qBAAM,CAAC;oBACN,YAAY,GAAG,KAAK,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,YAAY,EAAE,CAAC;YACjB,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,CAAC;QAED,cAAc;QACd,OAAO,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAEO,UAAU,CAAC,MAAgB;QACjC,IAAI,IAAI,CAAC,YAAY,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAClD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,gBAAgB,GAAa,EAAE,CAAC;QAEtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAEtB,kCAAkC;YAClC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACV,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAChC,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACxD,KAAK,GAAG,WAAW,GAAG,KAAK,CAAC;YAC9B,CAAC;YAED,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO,gBAAgB,CAAC;IAC1B,CAAC;CACF;AA1GD,sDA0GC"}

package/dist/types/index.d.ts

@@ -0,0 +1,144 @@
+/**
+ * Core types for RAG package
+ */
+/**
+ * Document to be indexed
+ */
+export interface Document {
+    id?: string;
+    content: string;
+    metadata?: Record<string, unknown>;
+    embedding?: number[];
+}
+/**
+ * Search result with similarity score
+ */
+export interface SearchResult {
+    id: string;
+    content: string;
+    metadata?: Record<string, unknown>;
+    score: number;
+    embedding?: number[];
+}
+/**
+ * Query options for vector search
+ */
+export interface QueryOptions {
+    topK?: number;
+    filter?: Record<string, unknown>;
+    includeMetadata?: boolean;
+    includeEmbedding?: boolean;
+    minScore?: number;
+}
+/**
+ * Embedding provider interface
+ */
+export interface EmbeddingProvider {
+    /**
+     * Generate embeddings for text
+     */
+    embed(text: string): Promise<number[]>;
+    /**
+     * Generate embeddings for multiple texts
+     */
+    embedBatch(texts: string[]): Promise<number[][]>;
+    /**
+     * Get the dimension of embeddings
+     */
+    getDimension(): number;
+}
+/**
+ * Vector store interface
+ */
+export interface VectorStore {
+    /**
+     * Initialize the vector store
+     */
+    initialize(): Promise<void>;
+    /**
+     * Add documents to the store
+     */
+    addDocuments(documents: Document[]): Promise<string[]>;
+    /**
+     * Search for similar documents
+     */
+    search(query: string, options?: QueryOptions): Promise<SearchResult[]>;
+    /**
+     * Search using embedding vector
+     */
+    searchByVector(embedding: number[], options?: QueryOptions): Promise<SearchResult[]>;
+    /**
+     * Delete documents by IDs
+     */
+    deleteDocuments(ids: string[]): Promise<void>;
+    /**
+     * Update a document
+     */
+    updateDocument(id: string, document: Partial<Document>): Promise<void>;
+    /**
+     * Get document by ID
+     */
+    getDocument(id: string): Promise<Document | null>;
+    /**
+     * Clear all documents
+     */
+    clear(): Promise<void>;
+}
+/**
+ * Text splitter interface
+ */
+export interface TextSplitter {
+    /**
+     * Split text into chunks
+     */
+    split(text: string): string[];
+    /**
+     * Split documents into chunks
+     */
+    splitDocuments(documents: Document[]): Document[];
+}
+/**
+ * Document loader interface
+ */
+export interface DocumentLoader {
+    /**
+     * Load documents from source
+     */
+    load(): Promise<Document[]>;
+}
+/**
+ * RAG configuration
+ */
+export interface RAGConfig {
+    vectorStore: VectorStore;
+    embeddingProvider: EmbeddingProvider;
+    textSplitter?: TextSplitter;
+    chunkSize?: number;
+    chunkOverlap?: number;
+    topK?: number;
+}
+/**
+ * Retrieval strategy
+ */
+export declare enum RetrievalStrategy {
+    SIMILARITY = "similarity",
+    MMR = "mmr",// Maximal Marginal Relevance
+    HYBRID = "hybrid"
+}
+/**
+ * RAG query options
+ */
+export interface RAGQueryOptions extends QueryOptions {
+    strategy?: RetrievalStrategy;
+    llmPrompt?: string;
+    includeContext?: boolean;
+}
+/**
+ * RAG response
+ */
+export interface RAGResponse {
+    answer: string;
+    sources: SearchResult[];
+    context: string;
+}
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnC,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACnC,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC;;OAEG;IACH,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAEvC;;OAEG;IACH,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAEjD;;OAEG;IACH,YAAY,IAAI,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B;;OAEG;IACH,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAE5B;;OAEG;IACH,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAEvD;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAEvE;;OAEG;IACH,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAErF;;OAEG;IACH,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE9C;;OAEG;IACH,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAEvE;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC;IAElD;;OAEG;IACH,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;OAEG;IACH,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IAE9B;;OAEG;IACH,cAAc,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE,CAAC;CACnD;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,IAAI,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,WAAW,EAAE,WAAW,CAAC;IACzB,iBAAiB,EAAE,iBAAiB,CAAC;IACrC,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,oBAAY,iBAAiB;IAC3B,UAAU,eAAe;IACzB,GAAG,QAAQ,CAAE,6BAA6B;IAC1C,MAAM,WAAW;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,eAAgB,SAAQ,YAAY;IACnD,QAAQ,CAAC,EAAE,iBAAiB,CAAC;IAC7B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,cAAc,CAAC,EAAE,OAAO,CAAC;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,OAAO,EAAE,MAAM,CAAC;CACjB"}

package/dist/types/index.js

@@ -0,0 +1,16 @@
+"use strict";
+/**
+ * Core types for RAG package
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RetrievalStrategy = void 0;
+/**
+ * Retrieval strategy
+ */
+var RetrievalStrategy;
+(function (RetrievalStrategy) {
+    RetrievalStrategy["SIMILARITY"] = "similarity";
+    RetrievalStrategy["MMR"] = "mmr";
+    RetrievalStrategy["HYBRID"] = "hybrid";
+})(RetrievalStrategy || (exports.RetrievalStrategy = RetrievalStrategy = {}));
+//# sourceMappingURL=index.js.map

package/dist/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AAwIH;;GAEG;AACH,IAAY,iBAIX;AAJD,WAAY,iBAAiB;IAC3B,8CAAyB,CAAA;IACzB,gCAAW,CAAA;IACX,sCAAiB,CAAA;AACnB,CAAC,EAJW,iBAAiB,iCAAjB,iBAAiB,QAI5B"}

package/dist/utils/similarity.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Similarity calculation utilities
+ */
+/**
+ * Calculate cosine similarity between two vectors
+ */
+export declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Calculate Euclidean distance between two vectors
+ */
+export declare function euclideanDistance(a: number[], b: number[]): number;
+/**
+ * Calculate dot product between two vectors
+ */
+export declare function dotProduct(a: number[], b: number[]): number;
+//# sourceMappingURL=similarity.d.ts.map

package/dist/utils/similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.d.ts","sourceRoot":"","sources":["../../src/utils/similarity.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAuBjE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAYlE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAW3D"}

package/dist/utils/similarity.js

@@ -0,0 +1,58 @@
+"use strict";
+/**
+ * Similarity calculation utilities
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cosineSimilarity = cosineSimilarity;
+exports.euclideanDistance = euclideanDistance;
+exports.dotProduct = dotProduct;
+/**
+ * Calculate cosine similarity between two vectors
+ */
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length) {
+        throw new Error('Vectors must have the same length');
+    }
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    normA = Math.sqrt(normA);
+    normB = Math.sqrt(normB);
+    if (normA === 0 || normB === 0) {
+        return 0;
+    }
+    return dotProduct / (normA * normB);
+}
+/**
+ * Calculate Euclidean distance between two vectors
+ */
+function euclideanDistance(a, b) {
+    if (a.length !== b.length) {
+        throw new Error('Vectors must have the same length');
+    }
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        const diff = a[i] - b[i];
+        sum += diff * diff;
+    }
+    return Math.sqrt(sum);
+}
+/**
+ * Calculate dot product between two vectors
+ */
+function dotProduct(a, b) {
+    if (a.length !== b.length) {
+        throw new Error('Vectors must have the same length');
+    }
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        sum += a[i] * b[i];
+    }
+    return sum;
+}
+//# sourceMappingURL=similarity.js.map

package/dist/utils/similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"similarity.js","sourceRoot":"","sources":["../../src/utils/similarity.ts"],"names":[],"mappings":";AAAA;;GAEG;;AAKH,4CAuBC;AAKD,8CAYC;AAKD,gCAWC;AA3DD;;GAEG;AACH,SAAgB,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAEzB,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,OAAO,UAAU,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAAC,CAAW,EAAE,CAAW;IACxD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,CAAW,EAAE,CAAW;IACjD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/vector-stores/chroma.store.d.ts

@@ -0,0 +1,42 @@
+/**
+ * ChromaDB Vector Store
+ * Lightweight, embedded vector database
+ */
+import { VectorStore, Document, SearchResult, QueryOptions } from '../types';
+import { EmbeddingProvider } from '../types';
+export interface ChromaConfig {
+    url?: string;
+    collectionName: string;
+    auth?: {
+        provider: 'token';
+        credentials: string;
+    };
+}
+export declare class ChromaVectorStore implements VectorStore {
+    private client;
+    private collection;
+    private embeddingProvider;
+    private collectionName;
+    private initialized;
+    constructor(embeddingProvider: EmbeddingProvider, config: ChromaConfig);
+    initialize(): Promise<void>;
+    addDocuments(documents: Document[]): Promise<string[]>;
+    search(query: string, options?: QueryOptions): Promise<SearchResult[]>;
+    searchByVector(embedding: number[], options?: QueryOptions): Promise<SearchResult[]>;
+    deleteDocuments(ids: string[]): Promise<void>;
+    updateDocument(id: string, document: Partial<Document>): Promise<void>;
+    getDocument(id: string): Promise<Document | null>;
+    clear(): Promise<void>;
+    /**
+     * Get collection statistics
+     */
+    getStats(): Promise<{
+        count: number;
+    }>;
+    /**
+     * Peek at first N documents
+     */
+    peek(limit?: number): Promise<Document[]>;
+    private generateId;
+}
+//# sourceMappingURL=chroma.store.d.ts.map

package/dist/vector-stores/chroma.store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chroma.store.d.ts","sourceRoot":"","sources":["../../src/vector-stores/chroma.store.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAC7E,OAAO,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AAQ7C,MAAM,WAAW,YAAY;IAC3B,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,cAAc,EAAE,MAAM,CAAC;IACvB,IAAI,CAAC,EAAE;QACL,QAAQ,EAAE,OAAO,CAAC;QAClB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;CACH;AAED,qBAAa,iBAAkB,YAAW,WAAW;IACnD,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,UAAU,CAA2B;IAC7C,OAAO,CAAC,iBAAiB,CAAoB;IAC7C,OAAO,CAAC,cAAc,CAAS;IAC/B,OAAO,CAAC,WAAW,CAAkB;gBAEzB,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,EAAE,YAAY;IAmBhE,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAc3B,YAAY,CAAC,SAAS,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAmCtD,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAOtE,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,YAAY,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAyDpF,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAc7C,cAAc,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAkCtE,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;IA0BjD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB5B;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAa5C;;OAEG;IACG,IAAI,CAAC,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;IA0BnD,OAAO,CAAC,UAAU;CAGnB"}