@framers/agentos 0.1.120 → 0.1.122

package/dist/rag/raptor/RaptorTree.js

@@ -0,0 +1,443 @@
+/**
+ * @fileoverview RAPTOR — Recursive Abstractive Processing for Tree-Organized Retrieval.
+ *
+ * Based on: Sarthi et al. 2024 "RAPTOR: Recursive Abstractive Processing for
+ * Tree-Organized Retrieval"
+ *
+ * Builds a hierarchical summary tree over document chunks:
+ * - **Layer 0**: Original chunks (leaf nodes)
+ * - **Layer 1**: Summaries of 5-10 related chunks (cluster -> summarize)
+ * - **Layer 2**: Summaries of layer 1 summaries
+ * - **Layer N**: Single corpus-level summary (root)
+ *
+ * At retrieval time, ALL layers are searched simultaneously. This enables:
+ * - Detail queries -> match leaf chunks (layer 0)
+ * - Theme queries -> match cluster summaries (layer 1-2)
+ * - "Big picture" queries -> match high-level summaries (layer N)
+ *
+ * The tree construction pipeline:
+ * 1. **Cluster** similar chunks using k-means on embeddings
+ * 2. **Summarize** each cluster using an LLM with chain-of-thought reasoning
+ * 3. **Embed** each summary
+ * 4. **Store** summaries in the vector store with layer metadata
+ * 5. **Repeat** — treat summaries as new chunks, cluster and summarize again
+ *
+ * @module agentos/rag/raptor/RaptorTree
+ * @see RetrievalAugmentor for integration with the RAG pipeline
+ */
+// ── K-Means Clustering ──────────────────────────────────────────────────
+/**
+ * Simple k-means clustering implementation for grouping embeddings.
+ *
+ * Uses random centroid initialization with iterative Lloyd's algorithm.
+ * Converges when centroids stop moving or max iterations reached.
+ *
+ * @param {number[][]} embeddings - Array of embedding vectors.
+ * @param {number} k - Number of clusters.
+ * @param {number} [maxIterations=20] - Maximum iterations before stopping.
+ * @returns {number[][]} Array of cluster assignments — each inner array contains
+ *   the indices of embeddings assigned to that cluster.
+ */
+function kMeansClustering(embeddings, k, maxIterations = 20) {
+    if (embeddings.length === 0 || k <= 0)
+        return [];
+    if (embeddings.length <= k) {
+        // Each embedding is its own cluster
+        return embeddings.map((_, i) => [i]);
+    }
+    const dim = embeddings[0].length;
+    // Initialize centroids using random selection (without replacement)
+    const centroidIndices = new Set();
+    while (centroidIndices.size < k) {
+        centroidIndices.add(Math.floor(Math.random() * embeddings.length));
+    }
+    const centroids = Array.from(centroidIndices).map((i) => [...embeddings[i]]);
+    let assignments = new Array(embeddings.length).fill(0);
+    for (let iter = 0; iter < maxIterations; iter++) {
+        // Assignment step: assign each point to nearest centroid
+        const newAssignments = [];
+        for (const embedding of embeddings) {
+            let bestCluster = 0;
+            let bestDist = Infinity;
+            for (let c = 0; c < centroids.length; c++) {
+                const dist = euclideanDistanceSq(embedding, centroids[c]);
+                if (dist < bestDist) {
+                    bestDist = dist;
+                    bestCluster = c;
+                }
+            }
+            newAssignments.push(bestCluster);
+        }
+        // Check for convergence
+        let changed = false;
+        for (let i = 0; i < newAssignments.length; i++) {
+            if (newAssignments[i] !== assignments[i]) {
+                changed = true;
+                break;
+            }
+        }
+        assignments = newAssignments;
+        if (!changed)
+            break;
+        // Update step: recompute centroids
+        for (let c = 0; c < k; c++) {
+            const members = assignments
+                .map((a, i) => (a === c ? i : -1))
+                .filter((i) => i >= 0);
+            if (members.length === 0)
+                continue;
+            const newCentroid = new Array(dim).fill(0);
+            for (const mi of members) {
+                for (let d = 0; d < dim; d++) {
+                    newCentroid[d] += embeddings[mi][d];
+                }
+            }
+            for (let d = 0; d < dim; d++) {
+                newCentroid[d] /= members.length;
+            }
+            centroids[c] = newCentroid;
+        }
+    }
+    // Build cluster groups
+    const clusters = Array.from({ length: k }, () => []);
+    for (let i = 0; i < assignments.length; i++) {
+        clusters[assignments[i]].push(i);
+    }
+    // Filter out empty clusters
+    return clusters.filter((c) => c.length > 0);
+}
+/**
+ * Squared Euclidean distance between two vectors (avoids sqrt for comparison).
+ *
+ * @param {number[]} a - First vector.
+ * @param {number[]} b - Second vector.
+ * @returns {number} Squared Euclidean distance.
+ */
+function euclideanDistanceSq(a, b) {
+    let sum = 0;
+    for (let i = 0; i < a.length; i++) {
+        const diff = a[i] - b[i];
+        sum += diff * diff;
+    }
+    return sum;
+}
+// ── RAPTOR Tree ───────────────────────────────────────────────────────────
+/**
+ * RAPTOR — Recursive Abstractive Processing for Tree-Organized Retrieval.
+ *
+ * Builds a hierarchical summary tree over document chunks, enabling retrieval
+ * at multiple levels of abstraction. Leaf nodes contain original chunks while
+ * higher layers contain progressively more abstract summaries.
+ *
+ * @example Building and searching a RAPTOR tree
+ * ```typescript
+ * const raptor = new RaptorTree({
+ *   llmCaller: async (prompt) => {
+ *     const response = await openai.chat.completions.create({
+ *       model: 'gpt-4o-mini',
+ *       messages: [{ role: 'user', content: prompt }],
+ *     });
+ *     return response.choices[0].message.content ?? '';
+ *   },
+ *   embeddingManager: myEmbeddingManager,
+ *   vectorStore: myVectorStore,
+ *   clusterSize: 8,
+ *   maxDepth: 3,
+ * });
+ *
+ * // Build tree from 100 document chunks
+ * const stats = await raptor.build(chunks);
+ * console.log(`Built ${stats.totalLayers} layers with ${stats.totalNodes} total nodes`);
+ *
+ * // Search all layers simultaneously
+ * const results = await raptor.search('What are the main themes?', 10);
+ * for (const r of results) {
+ *   console.log(`[Layer ${r.layer}] ${r.id}: ${r.score.toFixed(3)} — ${r.text.slice(0, 80)}...`);
+ * }
+ * ```
+ */
+export class RaptorTree {
+    /**
+     * Creates a new RaptorTree.
+     *
+     * @param {RaptorTreeConfig} config - Configuration including LLM caller,
+     *   embedding manager, vector store, and clustering parameters.
+     *
+     * @example
+     * ```typescript
+     * const raptor = new RaptorTree({
+     *   llmCaller: myLlm,
+     *   embeddingManager: myEmbeddings,
+     *   vectorStore: myStore,
+     *   clusterSize: 8,
+     *   maxDepth: 4,
+     * });
+     * ```
+     */
+    constructor(config) {
+        this.llmCaller = config.llmCaller;
+        this.embeddingManager = config.embeddingManager;
+        this.vectorStore = config.vectorStore;
+        this.collectionName = config.collectionName ?? 'raptor-tree';
+        this.clusterSize = config.clusterSize ?? 8;
+        this.maxDepth = config.maxDepth ?? 4;
+        this.minChunksForLayer = config.minChunksForLayer ?? 3;
+        this.stats = {
+            totalLayers: 0,
+            nodesPerLayer: {},
+            totalNodes: 0,
+            totalClusters: 0,
+            buildTimeMs: 0,
+        };
+    }
+    /**
+     * Builds the RAPTOR tree from a set of leaf chunks.
+     *
+     * Pipeline for each layer:
+     * 1. Embed all current-layer chunks
+     * 2. Cluster similar chunks using k-means
+     * 3. Summarize each cluster using the LLM with chain-of-thought
+     * 4. Embed summaries and store in vector store with layer metadata
+     * 5. Treat summaries as the next layer's input and repeat
+     *
+     * Stops when:
+     * - Fewer than `minChunksForLayer` summaries were produced
+     * - Maximum depth is reached
+     * - Only one cluster remains (root summary)
+     *
+     * @param {RaptorInputChunk[]} chunks - Leaf chunks to build the tree from.
+     * @returns {Promise<RaptorTreeStats>} Statistics about the constructed tree.
+     * @throws {Error} If embedding or storage fails critically.
+     *
+     * @example
+     * ```typescript
+     * const chunks = documents.map((doc, i) => ({
+     *   id: `chunk-${i}`,
+     *   text: doc.content,
+     *   metadata: { source: doc.source },
+     * }));
+     * const stats = await raptor.build(chunks);
+     * console.log(`Tree has ${stats.totalLayers} layers`);
+     * ```
+     */
+    async build(chunks) {
+        const startTime = Date.now();
+        this.stats = {
+            totalLayers: 0,
+            nodesPerLayer: {},
+            totalNodes: 0,
+            totalClusters: 0,
+            buildTimeMs: 0,
+        };
+        if (chunks.length === 0) {
+            this.stats.buildTimeMs = Date.now() - startTime;
+            return this.stats;
+        }
+        // Layer 0: Store original leaf chunks
+        await this.storeChunks(chunks, 0, false);
+        this.stats.nodesPerLayer[0] = chunks.length;
+        this.stats.totalNodes += chunks.length;
+        this.stats.totalLayers = 1;
+        // Build subsequent layers
+        let currentLayerChunks = [...chunks];
+        let layerIndex = 1;
+        while (layerIndex <= this.maxDepth &&
+            currentLayerChunks.length >= this.minChunksForLayer) {
+            // Step 1: Embed current layer chunks
+            const embeddingResponse = await this.embeddingManager.generateEmbeddings({
+                texts: currentLayerChunks.map((c) => c.text),
+            });
+            if (!embeddingResponse.embeddings || embeddingResponse.embeddings.length === 0) {
+                console.warn(`RaptorTree: Failed to embed layer ${layerIndex - 1} chunks. Stopping tree construction.`);
+                break;
+            }
+            // Step 2: Cluster
+            const numClusters = Math.max(1, Math.ceil(currentLayerChunks.length / this.clusterSize));
+            const clusters = kMeansClustering(embeddingResponse.embeddings, numClusters);
+            this.stats.totalClusters += clusters.length;
+            // Step 3: Summarize each cluster
+            const summaries = [];
+            for (let ci = 0; ci < clusters.length; ci++) {
+                const clusterIndices = clusters[ci];
+                const clusterTexts = clusterIndices.map((idx) => currentLayerChunks[idx].text);
+                const summary = await this.summarizeCluster(clusterTexts, layerIndex, ci);
+                summaries.push({
+                    id: `raptor-l${layerIndex}-c${ci}-${Date.now()}`,
+                    text: summary,
+                    metadata: {
+                        raptorLayer: layerIndex,
+                        raptorCluster: ci,
+                        childCount: clusterIndices.length,
+                        childIds: clusterIndices.map((idx) => currentLayerChunks[idx].id),
+                    },
+                });
+            }
+            if (summaries.length === 0)
+                break;
+            // Step 4: Store summaries
+            await this.storeChunks(summaries, layerIndex, true);
+            this.stats.nodesPerLayer[layerIndex] = summaries.length;
+            this.stats.totalNodes += summaries.length;
+            this.stats.totalLayers = layerIndex + 1;
+            // Step 5: Repeat with summaries as next input
+            currentLayerChunks = summaries;
+            layerIndex++;
+            // Stop if we've condensed to a single summary (root)
+            if (summaries.length <= 1)
+                break;
+        }
+        this.stats.buildTimeMs = Date.now() - startTime;
+        return { ...this.stats };
+    }
+    /**
+     * Searches ALL layers of the RAPTOR tree simultaneously.
+     *
+     * This is the key advantage of RAPTOR: a detail query will match leaf
+     * chunks, while a thematic query will match higher-layer summaries.
+     * Both types of results are returned together, sorted by relevance.
+     *
+     * @param {string} query - The search query.
+     * @param {number} [topK=10] - Maximum number of results across all layers.
+     * @returns {Promise<RaptorResult[]>} Results from all layers, sorted by score.
+     * @throws {Error} If embedding or vector search fails.
+     *
+     * @example
+     * ```typescript
+     * const results = await raptor.search('authentication architecture', 10);
+     * // May return:
+     * // - Layer 0 chunks about specific auth implementations
+     * // - Layer 1 summaries about auth patterns
+     * // - Layer 2 high-level summary about security architecture
+     * ```
+     */
+    async search(query, topK = 10) {
+        // Embed the query
+        const embeddingResponse = await this.embeddingManager.generateEmbeddings({
+            texts: [query],
+        });
+        if (!embeddingResponse.embeddings?.[0] ||
+            embeddingResponse.embeddings[0].length === 0) {
+            return [];
+        }
+        const queryEmbedding = embeddingResponse.embeddings[0];
+        // Search all layers by querying the vector store (all nodes are in the same collection)
+        // Fetch more candidates than topK to ensure good coverage across layers
+        const result = await this.vectorStore.query(this.collectionName, queryEmbedding, {
+            topK: topK * 2,
+            includeTextContent: true,
+            includeMetadata: true,
+        });
+        // Convert to RaptorResult with layer information
+        const raptorResults = result.documents.map((doc) => ({
+            id: doc.id,
+            text: doc.textContent ?? '',
+            score: doc.similarityScore,
+            layer: doc.metadata?.raptorLayer ?? 0,
+            isSummary: doc.metadata?.raptorIsSummary === true,
+            metadata: doc.metadata,
+        }));
+        // Sort by score descending and return top K
+        raptorResults.sort((a, b) => b.score - a.score);
+        return raptorResults.slice(0, topK);
+    }
+    /**
+     * Returns statistics about the last tree build.
+     *
+     * @returns {RaptorTreeStats} Tree statistics including layer counts, node counts,
+     *   cluster counts, and build time.
+     *
+     * @example
+     * ```typescript
+     * const stats = raptor.getStats();
+     * console.log(`Layers: ${stats.totalLayers}, Nodes: ${stats.totalNodes}`);
+     * ```
+     */
+    getStats() {
+        return { ...this.stats };
+    }
+    /**
+     * Generates a summary of a cluster of documents using chain-of-thought reasoning.
+     *
+     * The prompt instructs the LLM to:
+     * 1. Identify key themes across the documents
+     * 2. Consider what information would be lost in summarization
+     * 3. Note relationships between documents
+     * 4. Write a comprehensive summary preserving the most important information
+     *
+     * @param {string[]} texts - Texts in the cluster to summarize.
+     * @param {number} layer - Current layer index (for context in the prompt).
+     * @param {number} clusterIndex - Cluster index within the layer.
+     * @returns {Promise<string>} The generated summary.
+     */
+    async summarizeCluster(texts, layer, clusterIndex) {
+        const combinedTexts = texts
+            .map((t, i) => `--- Document ${i + 1} ---\n${t}`)
+            .join('\n\n');
+        const prompt = [
+            'Read the following documents carefully. Think step by step about:',
+            '',
+            '1. What are the key themes across these documents?',
+            '2. What information would be lost if these were summarized?',
+            '3. What relationships exist between these documents?',
+            '4. What terminology and concepts are shared?',
+            '',
+            'Then write a comprehensive summary that:',
+            '- Preserves the most important information and key details',
+            '- Captures the main themes and relationships between documents',
+            '- Uses the same technical vocabulary as the source documents',
+            '- Is suitable for semantic search retrieval',
+            `- Is concise but thorough (aim for ${Math.min(texts.length * 50, 500)} words)`,
+            '',
+            `This is a Layer ${layer} summary (clustering ${texts.length} related documents).`,
+            '',
+            combinedTexts,
+            '',
+            'Comprehensive summary:',
+        ].join('\n');
+        return (await this.llmCaller(prompt)).trim();
+    }
+    /**
+     * Stores chunks/summaries in the vector store with layer metadata.
+     *
+     * Generates embeddings for all texts, then upserts them into the vector
+     * store with metadata indicating their layer and summary status.
+     *
+     * @param {RaptorInputChunk[]} chunks - Chunks to store.
+     * @param {number} layer - Layer index in the RAPTOR tree.
+     * @param {boolean} isSummary - Whether these are summary nodes.
+     */
+    async storeChunks(chunks, layer, isSummary) {
+        if (chunks.length === 0)
+            return;
+        // Generate embeddings
+        const embeddingResponse = await this.embeddingManager.generateEmbeddings({
+            texts: chunks.map((c) => c.text),
+        });
+        if (!embeddingResponse.embeddings || embeddingResponse.embeddings.length === 0) {
+            console.warn(`RaptorTree: Failed to embed ${chunks.length} chunks for layer ${layer}.`);
+            return;
+        }
+        // Build vector documents
+        const vectorDocs = chunks
+            .map((chunk, i) => {
+            const embedding = embeddingResponse.embeddings[i];
+            if (!embedding || embedding.length === 0)
+                return null;
+            return {
+                id: chunk.id,
+                embedding,
+                textContent: chunk.text,
+                metadata: {
+                    ...chunk.metadata,
+                    raptorLayer: layer,
+                    raptorIsSummary: isSummary,
+                },
+            };
+        })
+            .filter(Boolean);
+        if (vectorDocs.length > 0) {
+            await this.vectorStore.upsert(this.collectionName, vectorDocs);
+        }
+    }
+}
+//# sourceMappingURL=RaptorTree.js.map

package/dist/rag/raptor/RaptorTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RaptorTree.js","sourceRoot":"","sources":["../../../src/rag/raptor/RaptorTree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AA6FH,2EAA2E;AAE3E;;;;;;;;;;;GAWG;AACH,SAAS,gBAAgB,CACvB,UAAsB,EACtB,CAAS,EACT,gBAAwB,EAAE;IAE1B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACjD,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QAC3B,oCAAoC;QACpC,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAEjC,oEAAoE;IACpE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAC1C,OAAO,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAChC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE7E,IAAI,WAAW,GAAa,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEjE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;QAChD,yDAAyD;QACzD,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,IAAI,QAAQ,GAAG,QAAQ,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,IAAI,GAAG,mBAAmB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1D,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;oBACpB,QAAQ,GAAG,IAAI,CAAC;oBAChB,WAAW,GAAG,CAAC,CAAC;gBAClB,CAAC;YACH,CAAC;YACD,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,wBAAwB;QACxB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzC,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;QACH,CAAC;QACD,WAAW,GAAG,cAAc,CAAC;QAE7B,IAAI,CAAC,OAAO;YAAE,MAAM;QAEpB,mCAAmC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,WAAW;iBACxB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACjC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAEzB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEnC,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3C,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,WAAW,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,WAAW,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC;YACnC,CAAC;YACD,SAAS,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,uBAAuB;IACvB,MAAM,QAAQ,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,4BAA4B;IAC5B,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,mBAAmB,CAAC,CAAW,EAAE,CAAW;IACnD,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;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,6EAA6E;AAE7E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,MAAM,OAAO,UAAU;IAyBrB;;;;;;;;;;;;;;;;OAgBG;IACH,YAAY,MAAwB;QAClC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAClC,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,CAAC;QACtC,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,aAAa,CAAC;QAC7D,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC;QACrC,IAAI,CAAC,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,IAAI,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,GAAG;YACX,WAAW,EAAE,CAAC;YACd,aAAa,EAAE,EAAE;YACjB,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,CAAC;SACf,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACH,KAAK,CAAC,KAAK,CACT,MAA0B;QAE1B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG;YACX,WAAW,EAAE,CAAC;YACd,aAAa,EAAE,EAAE;YACjB,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,CAAC;YAChB,WAAW,EAAE,CAAC;SACf,CAAC;QAEF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAChD,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;QAED,sCAAsC;QACtC,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,MAAM,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC;QAE3B,0BAA0B;QAC1B,IAAI,kBAAkB,GAAuB,CAAC,GAAG,MAAM,CAAC,CAAC;QACzD,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OACE,UAAU,IAAI,IAAI,CAAC,QAAQ;YAC3B,kBAAkB,CAAC,MAAM,IAAI,IAAI,CAAC,iBAAiB,EACnD,CAAC;YACD,qCAAqC;YACrC,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,kBAAkB,CAAC;gBACvE,KAAK,EAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;aAC7C,CAAC,CAAC;YAEH,IAAI,CAAC,iBAAiB,CAAC,UAAU,IAAI,iBAAiB,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC/E,OAAO,CAAC,IAAI,CACV,qCAAqC,UAAU,GAAG,CAAC,sCAAsC,CAC1F,CAAC;gBACF,MAAM;YACR,CAAC;YAED,kBAAkB;YAClB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAC1B,CAAC,EACD,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CACxD,CAAC;YACF,MAAM,QAAQ,GAAG,gBAAgB,CAC/B,iBAAiB,CAAC,UAAU,EAC5B,WAAW,CACZ,CAAC;YAEF,IAAI,CAAC,KAAK,CAAC,aAAa,IAAI,QAAQ,CAAC,MAAM,CAAC;YAE5C,iCAAiC;YACjC,MAAM,SAAS,GAAuB,EAAE,CAAC;YACzC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;gBAC5C,MAAM,cAAc,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACpC,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,CACrC,CAAC,GAAG,EAAE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,IAAI,CACtC,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;gBAC1E,SAAS,CAAC,IAAI,CAAC;oBACb,EAAE,EAAE,WAAW,UAAU,KAAK,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE;oBAChD,IAAI,EAAE,OAAO;oBACb,QAAQ,EAAE;wBACR,WAAW,EAAE,UAAU;wBACvB,aAAa,EAAE,EAAE;wBACjB,UAAU,EAAE,cAAc,CAAC,MAAM;wBACjC,QAAQ,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;qBAClE;iBACF,CAAC,CAAC;YACL,CAAC;YAED,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAElC,0BAA0B;YAC1B,MAAM,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;YACxD,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,SAAS,CAAC,MAAM,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,UAAU,GAAG,CAAC,CAAC;YAExC,8CAA8C;YAC9C,kBAAkB,GAAG,SAAS,CAAC;YAC/B,UAAU,EAAE,CAAC;YAEb,qDAAqD;YACrD,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC;gBAAE,MAAM;QACnC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAChD,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,KAAK,CAAC,MAAM,CAAC,KAAa,EAAE,OAAe,EAAE;QAC3C,kBAAkB;QAClB,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,kBAAkB,CAAC;YACvE,KAAK,EAAE,CAAC,KAAK,CAAC;SACf,CAAC,CAAC;QAEH,IACE,CAAC,iBAAiB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAClC,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,EAC5C,CAAC;YACD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,cAAc,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAEvD,wFAAwF;QACxF,wEAAwE;QACxE,MAAM,MAAM,GAAgB,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,CACtD,IAAI,CAAC,cAAc,EACnB,cAAc,EACd;YACE,IAAI,EAAE,IAAI,GAAG,CAAC;YACd,kBAAkB,EAAE,IAAI;YACxB,eAAe,EAAE,IAAI;SACtB,CACF,CAAC;QAEF,iDAAiD;QACjD,MAAM,aAAa,GAAmB,MAAM,CAAC,SAAS,CAAC,GAAG,CACxD,CAAC,GAA4B,EAAE,EAAE,CAAC,CAAC;YACjC,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,WAAW,IAAI,EAAE;YAC3B,KAAK,EAAE,GAAG,CAAC,eAAe;YAC1B,KAAK,EAAG,GAAG,CAAC,QAAQ,EAAE,WAAsB,IAAI,CAAC;YACjD,SAAS,EAAE,GAAG,CAAC,QAAQ,EAAE,eAAe,KAAK,IAAI;YACjD,QAAQ,EAAE,GAAG,CAAC,QAAmC;SAClD,CAAC,CACH,CAAC;QAEF,4CAA4C;QAC5C,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAChD,OAAO,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,QAAQ;QACN,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;;;;;;;;;OAaG;IACK,KAAK,CAAC,gBAAgB,CAC5B,KAAe,EACf,KAAa,EACb,YAAoB;QAEpB,MAAM,aAAa,GAAG,KAAK;aACxB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;aAChD,IAAI,CAAC,MAAM,CAAC,CAAC;QAEhB,MAAM,MAAM,GAAG;YACb,mEAAmE;YACnE,EAAE;YACF,oDAAoD;YACpD,6DAA6D;YAC7D,sDAAsD;YACtD,8CAA8C;YAC9C,EAAE;YACF,0CAA0C;YAC1C,4DAA4D;YAC5D,gEAAgE;YAChE,8DAA8D;YAC9D,6CAA6C;YAC7C,sCAAsC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,EAAE,GAAG,CAAC,SAAS;YAC/E,EAAE;YACF,mBAAmB,KAAK,wBAAwB,KAAK,CAAC,MAAM,sBAAsB;YAClF,EAAE;YACF,aAAa;YACb,EAAE;YACF,wBAAwB;SACzB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEb,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/C,CAAC;IAED;;;;;;;;;OASG;IACK,KAAK,CAAC,WAAW,CACvB,MAA0B,EAC1B,KAAa,EACb,SAAkB;QAElB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEhC,sBAAsB;QACtB,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,kBAAkB,CAAC;YACvE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SACjC,CAAC,CAAC;QAEH,IAAI,CAAC,iBAAiB,CAAC,UAAU,IAAI,iBAAiB,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/E,OAAO,CAAC,IAAI,CAAC,+BAA+B,MAAM,CAAC,MAAM,qBAAqB,KAAK,GAAG,CAAC,CAAC;YACxF,OAAO;QACT,CAAC;QAED,yBAAyB;QACzB,MAAM,UAAU,GAAG,MAAM;aACtB,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YAChB,MAAM,SAAS,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAClD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YAEtD,OAAO;gBACL,EAAE,EAAE,KAAK,CAAC,EAAE;gBACZ,SAAS;gBACT,WAAW,EAAE,KAAK,CAAC,IAAI;gBACvB,QAAQ,EAAE;oBACR,GAAG,KAAK,CAAC,QAAQ;oBACjB,WAAW,EAAE,KAAK;oBAClB,eAAe,EAAE,SAAS;iBAC3B;aACF,CAAC;QACJ,CAAC,CAAC;aACD,MAAM,CAAC,OAAO,CAAqB,CAAC;QAEvC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;QACjE,CAAC;IACH,CAAC;CACF"}

package/dist/rag/raptor/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * @fileoverview RAPTOR (Recursive Abstractive Processing for Tree-Organized Retrieval)
+ * module for hierarchical corpus summarization.
+ *
+ * Exports:
+ * - {@link RaptorTree} — Builds and searches hierarchical summary trees
+ *
+ * @module agentos/rag/raptor
+ */
+export { RaptorTree, type RaptorTreeConfig, type RaptorInputChunk, type RaptorTreeStats, type RaptorResult, } from './RaptorTree.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/rag/raptor/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/rag/raptor/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,UAAU,EACV,KAAK,gBAAgB,EACrB,KAAK,gBAAgB,EACrB,KAAK,eAAe,EACpB,KAAK,YAAY,GAClB,MAAM,iBAAiB,CAAC"}

package/dist/rag/raptor/index.js

@@ -0,0 +1,11 @@
+/**
+ * @fileoverview RAPTOR (Recursive Abstractive Processing for Tree-Organized Retrieval)
+ * module for hierarchical corpus summarization.
+ *
+ * Exports:
+ * - {@link RaptorTree} — Builds and searches hierarchical summary trees
+ *
+ * @module agentos/rag/raptor
+ */
+export { RaptorTree, } from './RaptorTree.js';
+//# sourceMappingURL=index.js.map

package/dist/rag/raptor/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/rag/raptor/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EACL,UAAU,GAKX,MAAM,iBAAiB,CAAC"}

package/dist/rag/reranking/providers/CohereReranker.js.map

@@ -1 +1 @@
-{"version":3,"file":"CohereReranker.js","sourceRoot":"","sources":["../../../../src/rag/reranking/providers/CohereReranker.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAoCH;;GAEG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG;IACpC,6CAA6C;IAC7C,iBAAiB;IACjB,kBAAkB;IAClB,aAAa;IACb,uCAAuC;IACvC,qBAAqB;IACrB,0BAA0B;IAC1B,qBAAqB;IACrB,0BAA0B;CAClB,CAAC;AAIX;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,cAAc;IAQzB,YAAY,MAA4B;QAPxB,eAAU,GAAG,QAAiB,CAAC;QAQ7C,uDAAuD;QACvD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,uBAAuB,CAAC;QACzD,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,aAAa,CAAC;QAC7D,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,KAAK,CAAC;IAC3D,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,WAAW;QACtB,IAAI,CAAC;YACH,uCAAuC;YACvC,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACI,kBAAkB;QACvB,OAAO,CAAC,GAAG,sBAAsB,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,MAAM,CACjB,KAAoB,EACpB,MAA6B;QAE7B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;QACtE,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC;QACtD,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC,gBAAgB,CAAC;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,uBAAuB;QACvB,MAAM,WAAW,GAAG;YAClB,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YAChD,KAAK,EAAE,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM;YAC5C,gBAAgB,EAAE,KAAK;YACvB,GAAI,MAAM,CAAC,MAAkC;SAC9C,CAAC;QAEF,sCAAsC;QACtC,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;QAElE,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,YAAY,EAAE;gBACxD,MAAM,EAAE,MAAM;gBACd,OAAO,EAAE;oBACP,eAAe,EAAE,UAAU,IAAI,CAAC,MAAM,EAAE;oBACxC,cAAc,EAAE,kBAAkB;oBAClC,eAAe,EAAE,SAAS;iBAC3B;gBACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC;gBACjC,MAAM,EAAE,UAAU,CAAC,MAAM;aAC1B,CAAC,CAAC;YAEH,YAAY,CAAC,SAAS,CAAC,CAAC;YAExB,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;gBACjB,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CAAC,qBAAqB,QAAQ,CAAC,MAAM,MAAM,SAAS,EAAE,CAAC,CAAC;YACzE,CAAC;YAED,MAAM,IAAI,GAAyB,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;YACzD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAEzC,yDAAyD;YACzD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACrC,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrC,OAAO;oBACL,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,cAAc,EAAE,CAAC,CAAC,eAAe;oBACjC,aAAa,EAAE,GAAG,CAAC,aAAa;oBAChC,QAAQ,EAAE,GAAG,CAAC,QAAQ;iBACvB,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,OAAO;gBACL,OAAO;gBACP,WAAW,EAAE;oBACX,OAAO;oBACP,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,SAAS;oBACT,kBAAkB,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM;oBAC1C,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY;oBACjD,eAAe,EAAE;wBACf,eAAe,EAAE,IAAI,CAAC,EAAE;wBACxB,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO;qBAC5C;iBACF;aACF,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,YAAY,CAAC,SAAS,CAAC,CAAC;YAExB,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,2CAA2C,SAAS,IAAI,CAAC,CAAC;YAC5E,CAAC;YAED,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;CACF"}
+{"version":3,"file":"CohereReranker.js","sourceRoot":"","sources":["../../../../src/rag/reranking/providers/CohereReranker.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAoCH;;GAEG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG;IACpC,6CAA6C;IAC7C,iBAAiB;IACjB,kBAAkB;IAClB,aAAa;IACb,uCAAuC;IACvC,qBAAqB;IACrB,0BAA0B;IAC1B,qBAAqB;IACrB,0BAA0B;CAClB,CAAC;AAIX;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,cAAc;IAQzB,YAAY,MAA4B;QAPxB,eAAU,GAAG,QAAiB,CAAC;QAQ7C,uDAAuD;QACvD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,uBAAuB,CAAC;QACzD,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,aAAa,CAAC;QAC7D,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,KAAK,CAAC;IAC3D,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,WAAW;QACtB,IAAI,CAAC;YACH,uCAAuC;YACvC,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAChC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;OAEG;IACI,kBAAkB;QACvB,OAAO,CAAC,GAAG,sBAAsB,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,MAAM,CACjB,KAAoB,EACpB,MAA6B;QAE7B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAC;QACtE,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC;QACtD,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC,gBAAgB,CAAC;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,uBAAuB;QACvB,MAAM,WAAW,GAAG;YAClB,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;YAChD,KAAK,EAAE,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM;YAC5C,gBAAgB,EAAE,KAAK;YACvB,GAAI,MAAM,CAAC,MAAkC;SAC9C,CAAC;QAEF,sCAAsC;QACtC,MAAM,UAAU,GAAG,IAAI,eAAe,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,CAAC;QAElE,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,YAAY,EAAE;gBACxD,MAAM,EAAE,MAAM;gBACd,OAAO,EAAE;oBACP,eAAe,EAAE,UAAU,IAAI,CAAC,MAAM,EAAE;oBACxC,cAAc,EAAE,kBAAkB;oBAClC,eAAe,EAAE,SAAS;iBAC3B;gBACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC;gBACjC,MAAM,EAAE,UAAU,CAAC,MAAM;aAC1B,CAAC,CAAC;YAEH,YAAY,CAAC,SAAS,CAAC,CAAC;YAExB,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;gBACjB,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,IAAI,EAAE,CAAC;gBACxC,MAAM,IAAI,KAAK,CAAC,qBAAqB,QAAQ,CAAC,MAAM,MAAM,SAAS,EAAE,CAAC,CAAC;YACzE,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,EAA0B,CAAC;YAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAEzC,yDAAyD;YACzD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACrC,MAAM,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACrC,OAAO;oBACL,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,cAAc,EAAE,CAAC,CAAC,eAAe;oBACjC,aAAa,EAAE,GAAG,CAAC,aAAa;oBAChC,QAAQ,EAAE,GAAG,CAAC,QAAQ;iBACvB,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,OAAO;gBACL,OAAO;gBACP,WAAW,EAAE;oBACX,OAAO;oBACP,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,SAAS;oBACT,kBAAkB,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM;oBAC1C,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY;oBACjD,eAAe,EAAE;wBACf,eAAe,EAAE,IAAI,CAAC,EAAE;wBACxB,UAAU,EAAE,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,OAAO;qBAC5C;iBACF;aACF,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,YAAY,CAAC,SAAS,CAAC,CAAC;YAExB,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;gBAC1D,MAAM,IAAI,KAAK,CAAC,2CAA2C,SAAS,IAAI,CAAC,CAAC;YAC5E,CAAC;YAED,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;CACF"}