illuma-agents 1.0.2

package/dist/esm/tools/search/highlights.mjs

@@ -0,0 +1,243 @@
+// 2. Pre-compile all regular expressions (only do this once)
+// Group patterns by priority for early returns
+const priorityPatterns = [
+    // High priority patterns (structural)
+    [
+        { regex: /\n\n/g }, // Double newline (paragraph break)
+        { regex: /\n/g }, // Single newline
+        { regex: /={3,}\s*\n|-{3,}\s*\n/g }, // Section separators
+    ],
+    // Medium priority (semantic)
+    [
+        { regex: /[.!?][")\]]?\s/g }, // End of sentence
+        { regex: /;\s/g }, // Semicolon
+        { regex: /:\s/g }, // Colon
+    ],
+    // Low priority (any breaks)
+    [
+        { regex: /,\s/g }, // Comma
+        { regex: /\s-\s/g }, // Dash surrounded by spaces
+        { regex: /\s/g }, // Any space
+    ],
+];
+function findFirstMatch(text, regex) {
+    // Reset regex
+    regex.lastIndex = 0;
+    // For very long texts, try chunking
+    if (text.length > 10000) {
+        const chunkSize = 2000;
+        let position = 0;
+        while (position < text.length) {
+            const chunk = text.substring(position, position + chunkSize);
+            regex.lastIndex = 0;
+            const match = regex.exec(chunk);
+            if (match) {
+                return position + match.index;
+            }
+            // Move to next chunk with some overlap
+            position += chunkSize - 100;
+            if (position >= text.length)
+                break;
+        }
+        return -1;
+    }
+    // For shorter texts, normal regex search
+    const match = regex.exec(text);
+    return match ? match.index : -1;
+}
+// 3. Optimized boundary finding functions
+function findLastMatch(text, regex) {
+    // Reset regex state
+    regex.lastIndex = 0;
+    let lastIndex = -1;
+    let lastLength = 0;
+    let match;
+    // For very long texts, use a different approach to avoid regex engine slowdowns
+    if (text.length > 10000) {
+        // Try dividing the text into chunks for faster processing
+        const chunkSize = 2000;
+        let startPosition = Math.max(0, text.length - chunkSize);
+        while (startPosition >= 0) {
+            const chunk = text.substring(startPosition, startPosition + chunkSize);
+            regex.lastIndex = 0;
+            let chunkLastIndex = -1;
+            let chunkLastLength = 0;
+            while ((match = regex.exec(chunk)) !== null) {
+                chunkLastIndex = match.index;
+                chunkLastLength = match[0].length;
+            }
+            if (chunkLastIndex !== -1) {
+                return startPosition + chunkLastIndex + chunkLastLength;
+            }
+            // Move to previous chunk with some overlap
+            startPosition = Math.max(0, startPosition - chunkSize + 100) - 1;
+            if (startPosition <= 0)
+                break;
+        }
+        return -1;
+    }
+    // For shorter texts, normal regex search
+    while ((match = regex.exec(text)) !== null) {
+        lastIndex = match.index;
+        lastLength = match[0].length;
+    }
+    return lastIndex === -1 ? -1 : lastIndex + lastLength;
+}
+// 4. Find the best boundary with priority groups
+function findBestBoundary(text, direction = 'backward') {
+    if (!text || text.length === 0)
+        return 0;
+    // Try each priority group
+    for (const patternGroup of priorityPatterns) {
+        for (const pattern of patternGroup) {
+            const position = direction === 'backward'
+                ? findLastMatch(text, pattern.regex)
+                : findFirstMatch(text, pattern.regex);
+            if (position !== -1) {
+                return position;
+            }
+        }
+    }
+    // No match found, use character boundary
+    return direction === 'backward' ? text.length : 0;
+}
+/**
+ * Tracks references used in a highlight without changing their numbers
+ */
+function trackReferencesInHighlight(text, sourceResult // Source containing the original references
+) {
+    // Track used references
+    const references = [];
+    if (!text || text.length === 0 || !text.includes('#')) {
+        return { references }; // Early return
+    }
+    // Quick check for reference markers
+    if (!text.includes('link#') &&
+        !text.includes('image#') &&
+        !text.includes('video#')) {
+        return { references };
+    }
+    // Get references from the source if available
+    const sourceRefs = sourceResult.references || {
+        links: [],
+        images: [],
+        videos: [],
+    };
+    // Find references but don't modify text
+    const refRegex = /\((link|image|video)#(\d+)(?:\s+"([^"]*)")?\)/g;
+    let match;
+    while ((match = refRegex.exec(text)) !== null) {
+        const [, type, indexStr] = match;
+        const originalIndex = parseInt(indexStr, 10) - 1; // Convert to 0-based
+        // Get the source array for this type
+        const refType = type;
+        const sourceArray = sourceRefs[`${refType}s`];
+        // Skip if invalid reference
+        if (!sourceArray ||
+            originalIndex < 0 ||
+            originalIndex >= sourceArray.length) {
+            continue; // Skip invalid references
+        }
+        // Get original reference
+        const reference = sourceArray[originalIndex];
+        // Track if not already tracked
+        const alreadyTracked = references.some((ref) => ref.type === refType && ref.originalIndex === originalIndex);
+        if (!alreadyTracked) {
+            references.push({
+                type: refType,
+                originalIndex,
+                reference,
+            });
+        }
+    }
+    return { references };
+}
+/**
+ * Expand highlights in search results using smart boundary detection.
+ *
+ * This implementation finds natural text boundaries like paragraphs, sentences,
+ * and phrases to provide context while maintaining readability.
+ *
+ * @param searchResults - Search results object
+ * @param mainExpandBy - Primary expansion size on each side (default: 300)
+ * @param separatorExpandBy - Additional range to look for separators (default: 150)
+ * @returns Copy of search results with expanded highlights and tracked references
+ */
+function expandHighlights(searchResults, mainExpandBy = 300, separatorExpandBy = 150) {
+    // Avoid deep copy - only copy what we modify
+    const resultCopy = { ...searchResults };
+    if (resultCopy.organic)
+        resultCopy.organic = [...resultCopy.organic];
+    if (resultCopy.topStories)
+        resultCopy.topStories = [...resultCopy.topStories];
+    // Process the results efficiently
+    const processResultTypes = ['organic', 'topStories'];
+    for (const resultType of processResultTypes) {
+        if (!resultCopy[resultType])
+            continue;
+        // Map results to new array with modified highlights
+        resultCopy[resultType] = resultCopy[resultType]?.map((result) => {
+            if (result.content == null ||
+                result.content === '' ||
+                !result.highlights ||
+                result.highlights.length === 0) {
+                return result; // No modification needed
+            }
+            // Create a shallow copy with expanded highlights
+            const resultCopy = { ...result };
+            const content = result.content;
+            const highlights = [];
+            // Process each highlight
+            for (const highlight of result.highlights) {
+                const { references } = trackReferencesInHighlight(highlight.text, result);
+                let startPos = content.indexOf(highlight.text);
+                let highlightLen = highlight.text.length;
+                if (startPos === -1) {
+                    // Try with stripped whitespace
+                    const strippedHighlight = highlight.text.trim();
+                    startPos = content.indexOf(strippedHighlight);
+                    if (startPos === -1) {
+                        highlights.push({
+                            text: highlight.text,
+                            score: highlight.score,
+                            references,
+                        });
+                        continue;
+                    }
+                    highlightLen = strippedHighlight.length;
+                }
+                // Calculate boundaries
+                const mainStart = Math.max(0, startPos - mainExpandBy);
+                const mainEnd = Math.min(content.length, startPos + highlightLen + mainExpandBy);
+                const separatorStart = Math.max(0, mainStart - separatorExpandBy);
+                const separatorEnd = Math.min(content.length, mainEnd + separatorExpandBy);
+                // Extract text segments
+                const headText = content.substring(separatorStart, mainStart);
+                const tailText = content.substring(mainEnd, separatorEnd);
+                // Find natural boundaries
+                const bestHeadBoundary = findBestBoundary(headText, 'backward');
+                const bestTailBoundary = findBestBoundary(tailText, 'forward');
+                // Calculate final positions
+                const finalStart = separatorStart + bestHeadBoundary;
+                const finalEnd = mainEnd + bestTailBoundary;
+                // Extract the expanded highlight
+                const expandedHighlightText = content
+                    .substring(finalStart, finalEnd)
+                    .trim();
+                highlights.push({
+                    text: expandedHighlightText,
+                    score: highlight.score,
+                    references,
+                });
+            }
+            resultCopy.highlights = highlights;
+            delete resultCopy.content;
+            delete resultCopy.references;
+            return resultCopy;
+        });
+    }
+    return resultCopy;
+}
+
+export { expandHighlights };
+//# sourceMappingURL=highlights.mjs.map

package/dist/esm/tools/search/highlights.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"highlights.mjs","sources":["../../../../src/tools/search/highlights.ts"],"sourcesContent":["import type * as t from './types';\r\n\r\n// 2. Pre-compile all regular expressions (only do this once)\r\n// Group patterns by priority for early returns\r\nconst priorityPatterns = [\r\n  // High priority patterns (structural)\r\n  [\r\n    { regex: /\\n\\n/g }, // Double newline (paragraph break)\r\n    { regex: /\\n/g }, // Single newline\r\n    { regex: /={3,}\\s*\\n|-{3,}\\s*\\n/g }, // Section separators\r\n  ],\r\n  // Medium priority (semantic)\r\n  [\r\n    { regex: /[.!?][\")\\]]?\\s/g }, // End of sentence\r\n    { regex: /;\\s/g }, // Semicolon\r\n    { regex: /:\\s/g }, // Colon\r\n  ],\r\n  // Low priority (any breaks)\r\n  [\r\n    { regex: /,\\s/g }, // Comma\r\n    { regex: /\\s-\\s/g }, // Dash surrounded by spaces\r\n    { regex: /\\s/g }, // Any space\r\n  ],\r\n];\r\n\r\nfunction findFirstMatch(text: string, regex: RegExp): number {\r\n  // Reset regex\r\n  regex.lastIndex = 0;\r\n\r\n  // For very long texts, try chunking\r\n  if (text.length > 10000) {\r\n    const chunkSize = 2000;\r\n    let position = 0;\r\n\r\n    while (position < text.length) {\r\n      const chunk = text.substring(position, position + chunkSize);\r\n      regex.lastIndex = 0;\r\n\r\n      const match = regex.exec(chunk);\r\n      if (match) {\r\n        return position + match.index;\r\n      }\r\n\r\n      // Move to next chunk with some overlap\r\n      position += chunkSize - 100;\r\n      if (position >= text.length) break;\r\n    }\r\n    return -1;\r\n  }\r\n\r\n  // For shorter texts, normal regex search\r\n  const match = regex.exec(text);\r\n  return match ? match.index : -1;\r\n}\r\n\r\n// 3. Optimized boundary finding functions\r\nfunction findLastMatch(text: string, regex: RegExp): number {\r\n  // Reset regex state\r\n  regex.lastIndex = 0;\r\n\r\n  let lastIndex = -1;\r\n  let lastLength = 0;\r\n  let match;\r\n\r\n  // For very long texts, use a different approach to avoid regex engine slowdowns\r\n  if (text.length > 10000) {\r\n    // Try dividing the text into chunks for faster processing\r\n    const chunkSize = 2000;\r\n    let startPosition = Math.max(0, text.length - chunkSize);\r\n\r\n    while (startPosition >= 0) {\r\n      const chunk = text.substring(startPosition, startPosition + chunkSize);\r\n      regex.lastIndex = 0;\r\n\r\n      let chunkLastIndex = -1;\r\n      let chunkLastLength = 0;\r\n\r\n      while ((match = regex.exec(chunk)) !== null) {\r\n        chunkLastIndex = match.index;\r\n        chunkLastLength = match[0].length;\r\n      }\r\n\r\n      if (chunkLastIndex !== -1) {\r\n        return startPosition + chunkLastIndex + chunkLastLength;\r\n      }\r\n\r\n      // Move to previous chunk with some overlap\r\n      startPosition = Math.max(0, startPosition - chunkSize + 100) - 1;\r\n      if (startPosition <= 0) break;\r\n    }\r\n    return -1;\r\n  }\r\n\r\n  // For shorter texts, normal regex search\r\n  while ((match = regex.exec(text)) !== null) {\r\n    lastIndex = match.index;\r\n    lastLength = match[0].length;\r\n  }\r\n\r\n  return lastIndex === -1 ? -1 : lastIndex + lastLength;\r\n}\r\n\r\n// 4. Find the best boundary with priority groups\r\nfunction findBestBoundary(text: string, direction = 'backward'): number {\r\n  if (!text || text.length === 0) return 0;\r\n\r\n  // Try each priority group\r\n  for (const patternGroup of priorityPatterns) {\r\n    for (const pattern of patternGroup) {\r\n      const position =\r\n        direction === 'backward'\r\n          ? findLastMatch(text, pattern.regex)\r\n          : findFirstMatch(text, pattern.regex);\r\n\r\n      if (position !== -1) {\r\n        return position;\r\n      }\r\n    }\r\n  }\r\n\r\n  // No match found, use character boundary\r\n  return direction === 'backward' ? text.length : 0;\r\n}\r\n\r\n/**\r\n * Tracks references used in a highlight without changing their numbers\r\n */\r\nfunction trackReferencesInHighlight(\r\n  text: string,\r\n  sourceResult: t.ValidSource // Source containing the original references\r\n): {\r\n  references: {\r\n    type: 'link' | 'image' | 'video';\r\n    originalIndex: number;\r\n    reference: t.MediaReference; // Original reference object\r\n  }[];\r\n} {\r\n  // Track used references\r\n  const references: {\r\n    type: 'link' | 'image' | 'video';\r\n    originalIndex: number;\r\n    reference: t.MediaReference;\r\n  }[] = [];\r\n\r\n  if (!text || text.length === 0 || !text.includes('#')) {\r\n    return { references }; // Early return\r\n  }\r\n\r\n  // Quick check for reference markers\r\n  if (\r\n    !text.includes('link#') &&\r\n    !text.includes('image#') &&\r\n    !text.includes('video#')\r\n  ) {\r\n    return { references };\r\n  }\r\n\r\n  // Get references from the source if available\r\n  const sourceRefs = sourceResult.references || {\r\n    links: [],\r\n    images: [],\r\n    videos: [],\r\n  };\r\n\r\n  // Find references but don't modify text\r\n  const refRegex = /\\((link|image|video)#(\\d+)(?:\\s+\"([^\"]*)\")?\\)/g;\r\n  let match;\r\n\r\n  while ((match = refRegex.exec(text)) !== null) {\r\n    const [, type, indexStr] = match;\r\n    const originalIndex = parseInt(indexStr, 10) - 1; // Convert to 0-based\r\n\r\n    // Get the source array for this type\r\n    const refType = type as 'link' | 'image' | 'video';\r\n    const sourceArray = sourceRefs[`${refType}s`] as\r\n      | t.MediaReference[]\r\n      | undefined;\r\n\r\n    // Skip if invalid reference\r\n    if (\r\n      !sourceArray ||\r\n      originalIndex < 0 ||\r\n      originalIndex >= sourceArray.length\r\n    ) {\r\n      continue; // Skip invalid references\r\n    }\r\n\r\n    // Get original reference\r\n    const reference = sourceArray[originalIndex];\r\n\r\n    // Track if not already tracked\r\n    const alreadyTracked = references.some(\r\n      (ref) => ref.type === refType && ref.originalIndex === originalIndex\r\n    );\r\n\r\n    if (!alreadyTracked) {\r\n      references.push({\r\n        type: refType,\r\n        originalIndex,\r\n        reference,\r\n      });\r\n    }\r\n  }\r\n\r\n  return { references };\r\n}\r\n\r\n/**\r\n * Expand highlights in search results using smart boundary detection.\r\n *\r\n * This implementation finds natural text boundaries like paragraphs, sentences,\r\n * and phrases to provide context while maintaining readability.\r\n *\r\n * @param searchResults - Search results object\r\n * @param mainExpandBy - Primary expansion size on each side (default: 300)\r\n * @param separatorExpandBy - Additional range to look for separators (default: 150)\r\n * @returns Copy of search results with expanded highlights and tracked references\r\n */\r\nexport function expandHighlights(\r\n  searchResults: t.SearchResultData,\r\n  mainExpandBy = 300,\r\n  separatorExpandBy = 150\r\n): t.SearchResultData {\r\n  // Avoid deep copy - only copy what we modify\r\n  const resultCopy = { ...searchResults };\r\n  if (resultCopy.organic) resultCopy.organic = [...resultCopy.organic];\r\n  if (resultCopy.topStories) resultCopy.topStories = [...resultCopy.topStories];\r\n\r\n  // Process the results efficiently\r\n  const processResultTypes = ['organic', 'topStories'] as const;\r\n\r\n  for (const resultType of processResultTypes) {\r\n    if (!resultCopy[resultType as 'organic' | 'topStories']) continue;\r\n\r\n    // Map results to new array with modified highlights\r\n    resultCopy[resultType] = resultCopy[resultType]?.map((result) => {\r\n      if (\r\n        result.content == null ||\r\n        result.content === '' ||\r\n        !result.highlights ||\r\n        result.highlights.length === 0\r\n      ) {\r\n        return result; // No modification needed\r\n      }\r\n\r\n      // Create a shallow copy with expanded highlights\r\n      const resultCopy = { ...result };\r\n      const content = result.content;\r\n      const highlights = [];\r\n      // Process each highlight\r\n      for (const highlight of result.highlights) {\r\n        const { references } = trackReferencesInHighlight(\r\n          highlight.text,\r\n          result\r\n        );\r\n\r\n        let startPos = content.indexOf(highlight.text);\r\n        let highlightLen = highlight.text.length;\r\n\r\n        if (startPos === -1) {\r\n          // Try with stripped whitespace\r\n          const strippedHighlight = highlight.text.trim();\r\n          startPos = content.indexOf(strippedHighlight);\r\n\r\n          if (startPos === -1) {\r\n            highlights.push({\r\n              text: highlight.text,\r\n              score: highlight.score,\r\n              references,\r\n            });\r\n            continue;\r\n          }\r\n          highlightLen = strippedHighlight.length;\r\n        }\r\n\r\n        // Calculate boundaries\r\n        const mainStart = Math.max(0, startPos - mainExpandBy);\r\n        const mainEnd = Math.min(\r\n          content.length,\r\n          startPos + highlightLen + mainExpandBy\r\n        );\r\n\r\n        const separatorStart = Math.max(0, mainStart - separatorExpandBy);\r\n        const separatorEnd = Math.min(\r\n          content.length,\r\n          mainEnd + separatorExpandBy\r\n        );\r\n\r\n        // Extract text segments\r\n        const headText = content.substring(separatorStart, mainStart);\r\n        const tailText = content.substring(mainEnd, separatorEnd);\r\n\r\n        // Find natural boundaries\r\n        const bestHeadBoundary = findBestBoundary(headText, 'backward');\r\n        const bestTailBoundary = findBestBoundary(tailText, 'forward');\r\n\r\n        // Calculate final positions\r\n        const finalStart = separatorStart + bestHeadBoundary;\r\n        const finalEnd = mainEnd + bestTailBoundary;\r\n\r\n        // Extract the expanded highlight\r\n        const expandedHighlightText = content\r\n          .substring(finalStart, finalEnd)\r\n          .trim();\r\n        highlights.push({\r\n          text: expandedHighlightText,\r\n          score: highlight.score,\r\n          references,\r\n        });\r\n      }\r\n\r\n      resultCopy.highlights = highlights;\r\n      delete resultCopy.content;\r\n      delete resultCopy.references;\r\n      return resultCopy;\r\n    });\r\n  }\r\n\r\n  return resultCopy;\r\n}\r\n"],"names":[],"mappings":"AAEA;AACA;AACA,MAAM,gBAAgB,GAAG;;AAEvB,IAAA;AACE,QAAA,EAAE,KAAK,EAAE,OAAO,EAAE;AAClB,QAAA,EAAE,KAAK,EAAE,KAAK,EAAE;AAChB,QAAA,EAAE,KAAK,EAAE,wBAAwB,EAAE;AACpC,KAAA;;AAED,IAAA;AACE,QAAA,EAAE,KAAK,EAAE,iBAAiB,EAAE;AAC5B,QAAA,EAAE,KAAK,EAAE,MAAM,EAAE;AACjB,QAAA,EAAE,KAAK,EAAE,MAAM,EAAE;AAClB,KAAA;;AAED,IAAA;AACE,QAAA,EAAE,KAAK,EAAE,MAAM,EAAE;AACjB,QAAA,EAAE,KAAK,EAAE,QAAQ,EAAE;AACnB,QAAA,EAAE,KAAK,EAAE,KAAK,EAAE;AACjB,KAAA;CACF;AAED,SAAS,cAAc,CAAC,IAAY,EAAE,KAAa,EAAA;;AAEjD,IAAA,KAAK,CAAC,SAAS,GAAG,CAAC;;AAGnB,IAAA,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,EAAE;QACvB,MAAM,SAAS,GAAG,IAAI;QACtB,IAAI,QAAQ,GAAG,CAAC;AAEhB,QAAA,OAAO,QAAQ,GAAG,IAAI,CAAC,MAAM,EAAE;AAC7B,YAAA,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,GAAG,SAAS,CAAC;AAC5D,YAAA,KAAK,CAAC,SAAS,GAAG,CAAC;YAEnB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;YAC/B,IAAI,KAAK,EAAE;AACT,gBAAA,OAAO,QAAQ,GAAG,KAAK,CAAC,KAAK;;;AAI/B,YAAA,QAAQ,IAAI,SAAS,GAAG,GAAG;AAC3B,YAAA,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM;gBAAE;;QAE/B,OAAO,EAAE;;;IAIX,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;AAC9B,IAAA,OAAO,KAAK,GAAG,KAAK,CAAC,KAAK,GAAG,EAAE;AACjC;AAEA;AACA,SAAS,aAAa,CAAC,IAAY,EAAE,KAAa,EAAA;;AAEhD,IAAA,KAAK,CAAC,SAAS,GAAG,CAAC;AAEnB,IAAA,IAAI,SAAS,GAAG,EAAE;IAClB,IAAI,UAAU,GAAG,CAAC;AAClB,IAAA,IAAI,KAAK;;AAGT,IAAA,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,EAAE;;QAEvB,MAAM,SAAS,GAAG,IAAI;AACtB,QAAA,IAAI,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;AAExD,QAAA,OAAO,aAAa,IAAI,CAAC,EAAE;AACzB,YAAA,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,aAAa,EAAE,aAAa,GAAG,SAAS,CAAC;AACtE,YAAA,KAAK,CAAC,SAAS,GAAG,CAAC;AAEnB,YAAA,IAAI,cAAc,GAAG,EAAE;YACvB,IAAI,eAAe,GAAG,CAAC;AAEvB,YAAA,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,EAAE;AAC3C,gBAAA,cAAc,GAAG,KAAK,CAAC,KAAK;AAC5B,gBAAA,eAAe,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM;;AAGnC,YAAA,IAAI,cAAc,KAAK,EAAE,EAAE;AACzB,gBAAA,OAAO,aAAa,GAAG,cAAc,GAAG,eAAe;;;AAIzD,YAAA,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC;YAChE,IAAI,aAAa,IAAI,CAAC;gBAAE;;QAE1B,OAAO,EAAE;;;AAIX,IAAA,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE;AAC1C,QAAA,SAAS,GAAG,KAAK,CAAC,KAAK;AACvB,QAAA,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM;;AAG9B,IAAA,OAAO,SAAS,KAAK,EAAE,GAAG,EAAE,GAAG,SAAS,GAAG,UAAU;AACvD;AAEA;AACA,SAAS,gBAAgB,CAAC,IAAY,EAAE,SAAS,GAAG,UAAU,EAAA;AAC5D,IAAA,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,CAAC;;AAGxC,IAAA,KAAK,MAAM,YAAY,IAAI,gBAAgB,EAAE;AAC3C,QAAA,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE;AAClC,YAAA,MAAM,QAAQ,GACZ,SAAS,KAAK;kBACV,aAAa,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK;kBACjC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC;AAEzC,YAAA,IAAI,QAAQ,KAAK,EAAE,EAAE;AACnB,gBAAA,OAAO,QAAQ;;;;;AAMrB,IAAA,OAAO,SAAS,KAAK,UAAU,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;AACnD;AAEA;;AAEG;AACH,SAAS,0BAA0B,CACjC,IAAY,EACZ,YAA2B;;;IAS3B,MAAM,UAAU,GAIV,EAAE;AAER,IAAA,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;AACrD,QAAA,OAAO,EAAE,UAAU,EAAE,CAAC;;;AAIxB,IAAA,IACE,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;AACvB,QAAA,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;AACxB,QAAA,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EACxB;QACA,OAAO,EAAE,UAAU,EAAE;;;AAIvB,IAAA,MAAM,UAAU,GAAG,YAAY,CAAC,UAAU,IAAI;AAC5C,QAAA,KAAK,EAAE,EAAE;AACT,QAAA,MAAM,EAAE,EAAE;AACV,QAAA,MAAM,EAAE,EAAE;KACX;;IAGD,MAAM,QAAQ,GAAG,gDAAgD;AACjE,IAAA,IAAI,KAAK;AAET,IAAA,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE;QAC7C,MAAM,GAAG,IAAI,EAAE,QAAQ,CAAC,GAAG,KAAK;AAChC,QAAA,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;;QAGjD,MAAM,OAAO,GAAG,IAAkC;QAClD,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,OAAO,CAAA,CAAA,CAAG,CAE/B;;AAGb,QAAA,IACE,CAAC,WAAW;AACZ,YAAA,aAAa,GAAG,CAAC;AACjB,YAAA,aAAa,IAAI,WAAW,CAAC,MAAM,EACnC;AACA,YAAA,SAAS;;;AAIX,QAAA,MAAM,SAAS,GAAG,WAAW,CAAC,aAAa,CAAC;;QAG5C,MAAM,cAAc,GAAG,UAAU,CAAC,IAAI,CACpC,CAAC,GAAG,KAAK,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,GAAG,CAAC,aAAa,KAAK,aAAa,CACrE;QAED,IAAI,CAAC,cAAc,EAAE;YACnB,UAAU,CAAC,IAAI,CAAC;AACd,gBAAA,IAAI,EAAE,OAAO;gBACb,aAAa;gBACb,SAAS;AACV,aAAA,CAAC;;;IAIN,OAAO,EAAE,UAAU,EAAE;AACvB;AAEA;;;;;;;;;;AAUG;AACG,SAAU,gBAAgB,CAC9B,aAAiC,EACjC,YAAY,GAAG,GAAG,EAClB,iBAAiB,GAAG,GAAG,EAAA;;AAGvB,IAAA,MAAM,UAAU,GAAG,EAAE,GAAG,aAAa,EAAE;IACvC,IAAI,UAAU,CAAC,OAAO;QAAE,UAAU,CAAC,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC;IACpE,IAAI,UAAU,CAAC,UAAU;QAAE,UAAU,CAAC,UAAU,GAAG,CAAC,GAAG,UAAU,CAAC,UAAU,CAAC;;AAG7E,IAAA,MAAM,kBAAkB,GAAG,CAAC,SAAS,EAAE,YAAY,CAAU;AAE7D,IAAA,KAAK,MAAM,UAAU,IAAI,kBAAkB,EAAE;AAC3C,QAAA,IAAI,CAAC,UAAU,CAAC,UAAsC,CAAC;YAAE;;AAGzD,QAAA,UAAU,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,CAAC,MAAM,KAAI;AAC9D,YAAA,IACE,MAAM,CAAC,OAAO,IAAI,IAAI;gBACtB,MAAM,CAAC,OAAO,KAAK,EAAE;gBACrB,CAAC,MAAM,CAAC,UAAU;AAClB,gBAAA,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAC9B;gBACA,OAAO,MAAM,CAAC;;;AAIhB,YAAA,MAAM,UAAU,GAAG,EAAE,GAAG,MAAM,EAAE;AAChC,YAAA,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO;YAC9B,MAAM,UAAU,GAAG,EAAE;;AAErB,YAAA,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,UAAU,EAAE;AACzC,gBAAA,MAAM,EAAE,UAAU,EAAE,GAAG,0BAA0B,CAC/C,SAAS,CAAC,IAAI,EACd,MAAM,CACP;gBAED,IAAI,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC;AAC9C,gBAAA,IAAI,YAAY,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM;AAExC,gBAAA,IAAI,QAAQ,KAAK,EAAE,EAAE;;oBAEnB,MAAM,iBAAiB,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE;AAC/C,oBAAA,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,iBAAiB,CAAC;AAE7C,oBAAA,IAAI,QAAQ,KAAK,EAAE,EAAE;wBACnB,UAAU,CAAC,IAAI,CAAC;4BACd,IAAI,EAAE,SAAS,CAAC,IAAI;4BACpB,KAAK,EAAE,SAAS,CAAC,KAAK;4BACtB,UAAU;AACX,yBAAA,CAAC;wBACF;;AAEF,oBAAA,YAAY,GAAG,iBAAiB,CAAC,MAAM;;;AAIzC,gBAAA,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,YAAY,CAAC;AACtD,gBAAA,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CACtB,OAAO,CAAC,MAAM,EACd,QAAQ,GAAG,YAAY,GAAG,YAAY,CACvC;AAED,gBAAA,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,iBAAiB,CAAC;AACjE,gBAAA,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,OAAO,CAAC,MAAM,EACd,OAAO,GAAG,iBAAiB,CAC5B;;gBAGD,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,CAAC;gBAC7D,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,YAAY,CAAC;;gBAGzD,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,QAAQ,EAAE,UAAU,CAAC;gBAC/D,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC;;AAG9D,gBAAA,MAAM,UAAU,GAAG,cAAc,GAAG,gBAAgB;AACpD,gBAAA,MAAM,QAAQ,GAAG,OAAO,GAAG,gBAAgB;;gBAG3C,MAAM,qBAAqB,GAAG;AAC3B,qBAAA,SAAS,CAAC,UAAU,EAAE,QAAQ;AAC9B,qBAAA,IAAI,EAAE;gBACT,UAAU,CAAC,IAAI,CAAC;AACd,oBAAA,IAAI,EAAE,qBAAqB;oBAC3B,KAAK,EAAE,SAAS,CAAC,KAAK;oBACtB,UAAU;AACX,iBAAA,CAAC;;AAGJ,YAAA,UAAU,CAAC,UAAU,GAAG,UAAU;YAClC,OAAO,UAAU,CAAC,OAAO;YACzB,OAAO,UAAU,CAAC,UAAU;AAC5B,YAAA,OAAO,UAAU;AACnB,SAAC,CAAC;;AAGJ,IAAA,OAAO,UAAU;AACnB;;;;"}

package/dist/esm/tools/search/rerankers.mjs

@@ -0,0 +1,168 @@
+import axios from 'axios';
+import { createDefaultLogger } from './utils.mjs';
+
+class BaseReranker {
+    apiKey;
+    logger;
+    constructor(logger) {
+        // Each specific reranker will set its API key
+        this.logger = logger || createDefaultLogger();
+    }
+    getDefaultRanking(documents, topK) {
+        return documents
+            .slice(0, Math.min(topK, documents.length))
+            .map((doc) => ({ text: doc, score: 0 }));
+    }
+}
+class JinaReranker extends BaseReranker {
+    apiUrl;
+    constructor({ apiKey = process.env.JINA_API_KEY, apiUrl = process.env.JINA_API_URL || 'https://api.jina.ai/v1/rerank', logger, }) {
+        super(logger);
+        this.apiKey = apiKey;
+        this.apiUrl = apiUrl;
+    }
+    async rerank(query, documents, topK = 5) {
+        this.logger.debug(`Reranking ${documents.length} chunks with Jina using API URL: ${this.apiUrl}`);
+        try {
+            if (this.apiKey == null || this.apiKey === '') {
+                this.logger.warn('JINA_API_KEY is not set. Using default ranking.');
+                return this.getDefaultRanking(documents, topK);
+            }
+            const requestData = {
+                model: 'jina-reranker-v2-base-multilingual',
+                query: query,
+                top_n: topK,
+                documents: documents,
+                return_documents: true,
+            };
+            const response = await axios.post(this.apiUrl, requestData, {
+                headers: {
+                    'Content-Type': 'application/json',
+                    Authorization: `Bearer ${this.apiKey}`,
+                },
+            });
+            this.logger.debug('Jina API Model:', response.data?.model);
+            this.logger.debug('Jina API Usage:', response.data?.usage);
+            if (response.data && response.data.results.length) {
+                return response.data.results.map((result) => {
+                    const docIndex = result.index;
+                    const score = result.relevance_score;
+                    let text = '';
+                    // If return_documents is true, the document field will be present
+                    if (result.document != null) {
+                        const doc = result.document;
+                        if (typeof doc === 'object' && 'text' in doc) {
+                            text = doc.text;
+                        }
+                        else if (typeof doc === 'string') {
+                            text = doc;
+                        }
+                    }
+                    else {
+                        // Otherwise, use the index to get the document
+                        text = documents[docIndex];
+                    }
+                    return { text, score };
+                });
+            }
+            else {
+                this.logger.warn('Unexpected response format from Jina API. Using default ranking.');
+                return this.getDefaultRanking(documents, topK);
+            }
+        }
+        catch (error) {
+            this.logger.error('Error using Jina reranker:', error);
+            // Fallback to default ranking on error
+            return this.getDefaultRanking(documents, topK);
+        }
+    }
+}
+class CohereReranker extends BaseReranker {
+    constructor({ apiKey = process.env.COHERE_API_KEY, logger, }) {
+        super(logger);
+        this.apiKey = apiKey;
+    }
+    async rerank(query, documents, topK = 5) {
+        this.logger.debug(`Reranking ${documents.length} chunks with Cohere`);
+        try {
+            if (this.apiKey == null || this.apiKey === '') {
+                this.logger.warn('COHERE_API_KEY is not set. Using default ranking.');
+                return this.getDefaultRanking(documents, topK);
+            }
+            const requestData = {
+                model: 'rerank-v3.5',
+                query: query,
+                top_n: topK,
+                documents: documents,
+            };
+            const response = await axios.post('https://api.cohere.com/v2/rerank', requestData, {
+                headers: {
+                    'Content-Type': 'application/json',
+                    Authorization: `Bearer ${this.apiKey}`,
+                },
+            });
+            this.logger.debug('Cohere API ID:', response.data?.id);
+            this.logger.debug('Cohere API Meta:', response.data?.meta);
+            if (response.data && response.data.results.length) {
+                return response.data.results.map((result) => {
+                    const docIndex = result.index;
+                    const score = result.relevance_score;
+                    const text = documents[docIndex];
+                    return { text, score };
+                });
+            }
+            else {
+                this.logger.warn('Unexpected response format from Cohere API. Using default ranking.');
+                return this.getDefaultRanking(documents, topK);
+            }
+        }
+        catch (error) {
+            this.logger.error('Error using Cohere reranker:', error);
+            // Fallback to default ranking on error
+            return this.getDefaultRanking(documents, topK);
+        }
+    }
+}
+class InfinityReranker extends BaseReranker {
+    constructor(logger) {
+        super(logger);
+        // No API key needed for the placeholder implementation
+    }
+    async rerank(query, documents, topK = 5) {
+        this.logger.debug(`Reranking ${documents.length} chunks with Infinity (placeholder)`);
+        // This would be replaced with actual Infinity reranker implementation
+        return this.getDefaultRanking(documents, topK);
+    }
+}
+/**
+ * Creates the appropriate reranker based on type and configuration
+ */
+const createReranker = (config) => {
+    const { rerankerType, jinaApiKey, jinaApiUrl, cohereApiKey, logger } = config;
+    // Create a default logger if none is provided
+    const defaultLogger = logger || createDefaultLogger();
+    switch (rerankerType.toLowerCase()) {
+        case 'jina':
+            return new JinaReranker({ apiKey: jinaApiKey, apiUrl: jinaApiUrl, logger: defaultLogger });
+        case 'cohere':
+            return new CohereReranker({
+                apiKey: cohereApiKey,
+                logger: defaultLogger,
+            });
+        case 'infinity':
+            return new InfinityReranker(defaultLogger);
+        case 'none':
+            defaultLogger.debug('Skipping reranking as reranker is set to "none"');
+            return undefined;
+        default:
+            defaultLogger.warn(`Unknown reranker type: ${rerankerType}. Defaulting to InfinityReranker.`);
+            return new JinaReranker({ apiKey: jinaApiKey, apiUrl: jinaApiUrl, logger: defaultLogger });
+    }
+};
+// Example usage:
+// const jinaReranker = new JinaReranker();
+// const cohereReranker = new CohereReranker();
+// const infinityReranker = new InfinityReranker();
+
+export { BaseReranker, CohereReranker, InfinityReranker, JinaReranker, createReranker };
+//# sourceMappingURL=rerankers.mjs.map

package/dist/esm/tools/search/rerankers.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"rerankers.mjs","sources":["../../../../src/tools/search/rerankers.ts"],"sourcesContent":["import axios from 'axios';\r\nimport type * as t from './types';\r\nimport { createDefaultLogger } from './utils';\r\n\r\nexport abstract class BaseReranker {\r\n  protected apiKey: string | undefined;\r\n  protected logger: t.Logger;\r\n\r\n  constructor(logger?: t.Logger) {\r\n    // Each specific reranker will set its API key\r\n    this.logger = logger || createDefaultLogger();\r\n  }\r\n\r\n  abstract rerank(\r\n    query: string,\r\n    documents: string[],\r\n    topK?: number\r\n  ): Promise<t.Highlight[]>;\r\n\r\n  protected getDefaultRanking(\r\n    documents: string[],\r\n    topK: number\r\n  ): t.Highlight[] {\r\n    return documents\r\n      .slice(0, Math.min(topK, documents.length))\r\n      .map((doc) => ({ text: doc, score: 0 }));\r\n  }\r\n}\r\n\r\nexport class JinaReranker extends BaseReranker {\r\n  private apiUrl: string;\r\n\r\n  constructor({\r\n    apiKey = process.env.JINA_API_KEY,\r\n    apiUrl = process.env.JINA_API_URL || 'https://api.jina.ai/v1/rerank',\r\n    logger,\r\n  }: {\r\n    apiKey?: string;\r\n    apiUrl?: string;\r\n    logger?: t.Logger;\r\n  }) {\r\n    super(logger);\r\n    this.apiKey = apiKey;\r\n    this.apiUrl = apiUrl;\r\n  }\r\n\r\n  async rerank(\r\n    query: string,\r\n    documents: string[],\r\n    topK: number = 5\r\n  ): Promise<t.Highlight[]> {\r\n    this.logger.debug(`Reranking ${documents.length} chunks with Jina using API URL: ${this.apiUrl}`);\r\n\r\n    try {\r\n      if (this.apiKey == null || this.apiKey === '') {\r\n        this.logger.warn('JINA_API_KEY is not set. Using default ranking.');\r\n        return this.getDefaultRanking(documents, topK);\r\n      }\r\n\r\n      const requestData = {\r\n        model: 'jina-reranker-v2-base-multilingual',\r\n        query: query,\r\n        top_n: topK,\r\n        documents: documents,\r\n        return_documents: true,\r\n      };\r\n\r\n      const response = await axios.post<t.JinaRerankerResponse | undefined>(\r\n        this.apiUrl,\r\n        requestData,\r\n        {\r\n          headers: {\r\n            'Content-Type': 'application/json',\r\n            Authorization: `Bearer ${this.apiKey}`,\r\n          },\r\n        }\r\n      );\r\n\r\n      this.logger.debug('Jina API Model:', response.data?.model);\r\n      this.logger.debug('Jina API Usage:', response.data?.usage);\r\n\r\n      if (response.data && response.data.results.length) {\r\n        return response.data.results.map((result) => {\r\n          const docIndex = result.index;\r\n          const score = result.relevance_score;\r\n          let text = '';\r\n\r\n          // If return_documents is true, the document field will be present\r\n          if (result.document != null) {\r\n            const doc = result.document;\r\n            if (typeof doc === 'object' && 'text' in doc) {\r\n              text = doc.text;\r\n            } else if (typeof doc === 'string') {\r\n              text = doc;\r\n            }\r\n          } else {\r\n            // Otherwise, use the index to get the document\r\n            text = documents[docIndex];\r\n          }\r\n\r\n          return { text, score };\r\n        });\r\n      } else {\r\n        this.logger.warn(\r\n          'Unexpected response format from Jina API. Using default ranking.'\r\n        );\r\n        return this.getDefaultRanking(documents, topK);\r\n      }\r\n    } catch (error) {\r\n      this.logger.error('Error using Jina reranker:', error);\r\n      // Fallback to default ranking on error\r\n      return this.getDefaultRanking(documents, topK);\r\n    }\r\n  }\r\n}\r\n\r\nexport class CohereReranker extends BaseReranker {\r\n  constructor({\r\n    apiKey = process.env.COHERE_API_KEY,\r\n    logger,\r\n  }: {\r\n    apiKey?: string;\r\n    logger?: t.Logger;\r\n  }) {\r\n    super(logger);\r\n    this.apiKey = apiKey;\r\n  }\r\n\r\n  async rerank(\r\n    query: string,\r\n    documents: string[],\r\n    topK: number = 5\r\n  ): Promise<t.Highlight[]> {\r\n    this.logger.debug(`Reranking ${documents.length} chunks with Cohere`);\r\n\r\n    try {\r\n      if (this.apiKey == null || this.apiKey === '') {\r\n        this.logger.warn('COHERE_API_KEY is not set. Using default ranking.');\r\n        return this.getDefaultRanking(documents, topK);\r\n      }\r\n\r\n      const requestData = {\r\n        model: 'rerank-v3.5',\r\n        query: query,\r\n        top_n: topK,\r\n        documents: documents,\r\n      };\r\n\r\n      const response = await axios.post<t.CohereRerankerResponse | undefined>(\r\n        'https://api.cohere.com/v2/rerank',\r\n        requestData,\r\n        {\r\n          headers: {\r\n            'Content-Type': 'application/json',\r\n            Authorization: `Bearer ${this.apiKey}`,\r\n          },\r\n        }\r\n      );\r\n\r\n      this.logger.debug('Cohere API ID:', response.data?.id);\r\n      this.logger.debug('Cohere API Meta:', response.data?.meta);\r\n\r\n      if (response.data && response.data.results.length) {\r\n        return response.data.results.map((result) => {\r\n          const docIndex = result.index;\r\n          const score = result.relevance_score;\r\n          const text = documents[docIndex];\r\n          return { text, score };\r\n        });\r\n      } else {\r\n        this.logger.warn(\r\n          'Unexpected response format from Cohere API. Using default ranking.'\r\n        );\r\n        return this.getDefaultRanking(documents, topK);\r\n      }\r\n    } catch (error) {\r\n      this.logger.error('Error using Cohere reranker:', error);\r\n      // Fallback to default ranking on error\r\n      return this.getDefaultRanking(documents, topK);\r\n    }\r\n  }\r\n}\r\n\r\nexport class InfinityReranker extends BaseReranker {\r\n  constructor(logger?: t.Logger) {\r\n    super(logger);\r\n    // No API key needed for the placeholder implementation\r\n  }\r\n\r\n  async rerank(\r\n    query: string,\r\n    documents: string[],\r\n    topK: number = 5\r\n  ): Promise<t.Highlight[]> {\r\n    this.logger.debug(\r\n      `Reranking ${documents.length} chunks with Infinity (placeholder)`\r\n    );\r\n    // This would be replaced with actual Infinity reranker implementation\r\n    return this.getDefaultRanking(documents, topK);\r\n  }\r\n}\r\n\r\n/**\r\n * Creates the appropriate reranker based on type and configuration\r\n */\r\nexport const createReranker = (config: {\r\n  rerankerType: t.RerankerType;\r\n  jinaApiKey?: string;\r\n  jinaApiUrl?: string;\r\n  cohereApiKey?: string;\r\n  logger?: t.Logger;\r\n}): BaseReranker | undefined => {\r\n  const { rerankerType, jinaApiKey, jinaApiUrl, cohereApiKey, logger } = config;\r\n\r\n  // Create a default logger if none is provided\r\n  const defaultLogger = logger || createDefaultLogger();\r\n\r\n  switch (rerankerType.toLowerCase()) {\r\n  case 'jina':\r\n    return new JinaReranker({ apiKey: jinaApiKey, apiUrl: jinaApiUrl, logger: defaultLogger });\r\n  case 'cohere':\r\n    return new CohereReranker({\r\n      apiKey: cohereApiKey,\r\n      logger: defaultLogger,\r\n    });\r\n  case 'infinity':\r\n    return new InfinityReranker(defaultLogger);\r\n  case 'none':\r\n    defaultLogger.debug('Skipping reranking as reranker is set to \"none\"');\r\n    return undefined;\r\n  default:\r\n    defaultLogger.warn(\r\n      `Unknown reranker type: ${rerankerType}. Defaulting to InfinityReranker.`\r\n    );\r\n    return new JinaReranker({ apiKey: jinaApiKey, apiUrl: jinaApiUrl, logger: defaultLogger });\r\n  }\r\n};\r\n\r\n// Example usage:\r\n// const jinaReranker = new JinaReranker();\r\n// const cohereReranker = new CohereReranker();\r\n// const infinityReranker = new InfinityReranker();\r\n"],"names":[],"mappings":";;;MAIsB,YAAY,CAAA;AACtB,IAAA,MAAM;AACN,IAAA,MAAM;AAEhB,IAAA,WAAA,CAAY,MAAiB,EAAA;;AAE3B,QAAA,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,mBAAmB,EAAE;;IASrC,iBAAiB,CACzB,SAAmB,EACnB,IAAY,EAAA;AAEZ,QAAA,OAAO;AACJ,aAAA,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC;AACzC,aAAA,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;;AAE7C;AAEK,MAAO,YAAa,SAAQ,YAAY,CAAA;AACpC,IAAA,MAAM;IAEd,WAAY,CAAA,EACV,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,EACjC,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,YAAY,IAAI,+BAA+B,EACpE,MAAM,GAKP,EAAA;QACC,KAAK,CAAC,MAAM,CAAC;AACb,QAAA,IAAI,CAAC,MAAM,GAAG,MAAM;AACpB,QAAA,IAAI,CAAC,MAAM,GAAG,MAAM;;IAGtB,MAAM,MAAM,CACV,KAAa,EACb,SAAmB,EACnB,OAAe,CAAC,EAAA;AAEhB,QAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAa,UAAA,EAAA,SAAS,CAAC,MAAM,oCAAoC,IAAI,CAAC,MAAM,CAAA,CAAE,CAAC;AAEjG,QAAA,IAAI;AACF,YAAA,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE;AAC7C,gBAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iDAAiD,CAAC;gBACnE,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;;AAGhD,YAAA,MAAM,WAAW,GAAG;AAClB,gBAAA,KAAK,EAAE,oCAAoC;AAC3C,gBAAA,KAAK,EAAE,KAAK;AACZ,gBAAA,KAAK,EAAE,IAAI;AACX,gBAAA,SAAS,EAAE,SAAS;AACpB,gBAAA,gBAAgB,EAAE,IAAI;aACvB;AAED,YAAA,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,IAAI,CAC/B,IAAI,CAAC,MAAM,EACX,WAAW,EACX;AACE,gBAAA,OAAO,EAAE;AACP,oBAAA,cAAc,EAAE,kBAAkB;AAClC,oBAAA,aAAa,EAAE,CAAA,OAAA,EAAU,IAAI,CAAC,MAAM,CAAE,CAAA;AACvC,iBAAA;AACF,aAAA,CACF;AAED,YAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;AAC1D,YAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;AAE1D,YAAA,IAAI,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;gBACjD,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,KAAI;AAC1C,oBAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK;AAC7B,oBAAA,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe;oBACpC,IAAI,IAAI,GAAG,EAAE;;AAGb,oBAAA,IAAI,MAAM,CAAC,QAAQ,IAAI,IAAI,EAAE;AAC3B,wBAAA,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ;wBAC3B,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,MAAM,IAAI,GAAG,EAAE;AAC5C,4BAAA,IAAI,GAAG,GAAG,CAAC,IAAI;;AACV,6BAAA,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;4BAClC,IAAI,GAAG,GAAG;;;yBAEP;;AAEL,wBAAA,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC;;AAG5B,oBAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE;AACxB,iBAAC,CAAC;;iBACG;AACL,gBAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CACd,kEAAkE,CACnE;gBACD,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;;;QAEhD,OAAO,KAAK,EAAE;YACd,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,4BAA4B,EAAE,KAAK,CAAC;;YAEtD,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;;;AAGnD;AAEK,MAAO,cAAe,SAAQ,YAAY,CAAA;IAC9C,WAAY,CAAA,EACV,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,EACnC,MAAM,GAIP,EAAA;QACC,KAAK,CAAC,MAAM,CAAC;AACb,QAAA,IAAI,CAAC,MAAM,GAAG,MAAM;;IAGtB,MAAM,MAAM,CACV,KAAa,EACb,SAAmB,EACnB,OAAe,CAAC,EAAA;QAEhB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAa,UAAA,EAAA,SAAS,CAAC,MAAM,CAAqB,mBAAA,CAAA,CAAC;AAErE,QAAA,IAAI;AACF,YAAA,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,EAAE,EAAE;AAC7C,gBAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,mDAAmD,CAAC;gBACrE,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;;AAGhD,YAAA,MAAM,WAAW,GAAG;AAClB,gBAAA,KAAK,EAAE,aAAa;AACpB,gBAAA,KAAK,EAAE,KAAK;AACZ,gBAAA,KAAK,EAAE,IAAI;AACX,gBAAA,SAAS,EAAE,SAAS;aACrB;YAED,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,IAAI,CAC/B,kCAAkC,EAClC,WAAW,EACX;AACE,gBAAA,OAAO,EAAE;AACP,oBAAA,cAAc,EAAE,kBAAkB;AAClC,oBAAA,aAAa,EAAE,CAAA,OAAA,EAAU,IAAI,CAAC,MAAM,CAAE,CAAA;AACvC,iBAAA;AACF,aAAA,CACF;AAED,YAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;AACtD,YAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,kBAAkB,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;AAE1D,YAAA,IAAI,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;gBACjD,OAAO,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,KAAI;AAC1C,oBAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK;AAC7B,oBAAA,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe;AACpC,oBAAA,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC;AAChC,oBAAA,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE;AACxB,iBAAC,CAAC;;iBACG;AACL,gBAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CACd,oEAAoE,CACrE;gBACD,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;;;QAEhD,OAAO,KAAK,EAAE;YACd,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,8BAA8B,EAAE,KAAK,CAAC;;YAExD,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;;;AAGnD;AAEK,MAAO,gBAAiB,SAAQ,YAAY,CAAA;AAChD,IAAA,WAAA,CAAY,MAAiB,EAAA;QAC3B,KAAK,CAAC,MAAM,CAAC;;;IAIf,MAAM,MAAM,CACV,KAAa,EACb,SAAmB,EACnB,OAAe,CAAC,EAAA;QAEhB,IAAI,CAAC,MAAM,CAAC,KAAK,CACf,CAAa,UAAA,EAAA,SAAS,CAAC,MAAM,CAAqC,mCAAA,CAAA,CACnE;;QAED,OAAO,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC;;AAEjD;AAED;;AAEG;AACU,MAAA,cAAc,GAAG,CAAC,MAM9B,KAA8B;AAC7B,IAAA,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,EAAE,GAAG,MAAM;;AAG7E,IAAA,MAAM,aAAa,GAAG,MAAM,IAAI,mBAAmB,EAAE;AAErD,IAAA,QAAQ,YAAY,CAAC,WAAW,EAAE;AAClC,QAAA,KAAK,MAAM;AACT,YAAA,OAAO,IAAI,YAAY,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;AAC5F,QAAA,KAAK,QAAQ;YACX,OAAO,IAAI,cAAc,CAAC;AACxB,gBAAA,MAAM,EAAE,YAAY;AACpB,gBAAA,MAAM,EAAE,aAAa;AACtB,aAAA,CAAC;AACJ,QAAA,KAAK,UAAU;AACb,YAAA,OAAO,IAAI,gBAAgB,CAAC,aAAa,CAAC;AAC5C,QAAA,KAAK,MAAM;AACT,YAAA,aAAa,CAAC,KAAK,CAAC,iDAAiD,CAAC;AACtE,YAAA,OAAO,SAAS;AAClB,QAAA;AACE,YAAA,aAAa,CAAC,IAAI,CAChB,0BAA0B,YAAY,CAAA,iCAAA,CAAmC,CAC1E;AACD,YAAA,OAAO,IAAI,YAAY,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;;AAE9F;AAEA;AACA;AACA;AACA;;;;"}

package/dist/esm/tools/search/schema.mjs

@@ -0,0 +1,61 @@
+import { z } from 'zod';
+
+var DATE_RANGE;
+(function (DATE_RANGE) {
+    DATE_RANGE["PAST_HOUR"] = "h";
+    DATE_RANGE["PAST_24_HOURS"] = "d";
+    DATE_RANGE["PAST_WEEK"] = "w";
+    DATE_RANGE["PAST_MONTH"] = "m";
+    DATE_RANGE["PAST_YEAR"] = "y";
+})(DATE_RANGE || (DATE_RANGE = {}));
+const DEFAULT_QUERY_DESCRIPTION = `
+GUIDELINES:
+- Start broad, then narrow: Begin with key concepts, then refine with specifics
+- Think like sources: Use terminology experts would use in the field
+- Consider perspective: Frame queries from different viewpoints for better results
+- Quality over quantity: A precise 3-4 word query often beats lengthy sentences
+
+TECHNIQUES (combine for power searches):
+- EXACT PHRASES: Use quotes ("climate change report")
+- EXCLUDE TERMS: Use minus to remove unwanted results (-wikipedia)
+- SITE-SPECIFIC: Restrict to websites (site:edu research)
+- FILETYPE: Find specific documents (filetype:pdf study)
+- OR OPERATOR: Find alternatives (electric OR hybrid cars)
+- DATE RANGE: Recent information (data after:2020)
+- WILDCARDS: Use * for unknown terms (how to * bread)
+- SPECIFIC QUESTIONS: Use who/what/when/where/why/how
+- DOMAIN TERMS: Include technical terminology for specialized topics
+- CONCISE TERMS: Prioritize keywords over sentences
+`.trim();
+const DEFAULT_COUNTRY_DESCRIPTION = `Country code to localize search results.
+Use standard 2-letter country codes: "us", "uk", "ca", "de", "fr", "jp", "br", etc.
+Provide this when the search should return results specific to a particular country.
+Examples:
+- "us" for United States (default)
+- "de" for Germany
+- "in" for India
+`.trim();
+const querySchema = z.string().describe(DEFAULT_QUERY_DESCRIPTION);
+const dateSchema = z
+    .nativeEnum(DATE_RANGE)
+    .optional()
+    .describe('Date range for search results.');
+const countrySchema = z
+    .string()
+    .optional()
+    .describe(DEFAULT_COUNTRY_DESCRIPTION);
+const imagesSchema = z
+    .boolean()
+    .optional()
+    .describe('Whether to also run an image search.');
+const videosSchema = z
+    .boolean()
+    .optional()
+    .describe('Whether to also run a video search.');
+const newsSchema = z
+    .boolean()
+    .optional()
+    .describe('Whether to also run a news search.');
+
+export { DATE_RANGE, DEFAULT_COUNTRY_DESCRIPTION, DEFAULT_QUERY_DESCRIPTION, countrySchema, dateSchema, imagesSchema, newsSchema, querySchema, videosSchema };
+//# sourceMappingURL=schema.mjs.map

package/dist/esm/tools/search/schema.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.mjs","sources":["../../../../src/tools/search/schema.ts"],"sourcesContent":["import { z } from 'zod';\r\n\r\nexport enum DATE_RANGE {\r\n  PAST_HOUR = 'h',\r\n  PAST_24_HOURS = 'd',\r\n  PAST_WEEK = 'w',\r\n  PAST_MONTH = 'm',\r\n  PAST_YEAR = 'y',\r\n}\r\n\r\nexport const DEFAULT_QUERY_DESCRIPTION = `\r\nGUIDELINES:\r\n- Start broad, then narrow: Begin with key concepts, then refine with specifics\r\n- Think like sources: Use terminology experts would use in the field\r\n- Consider perspective: Frame queries from different viewpoints for better results\r\n- Quality over quantity: A precise 3-4 word query often beats lengthy sentences\r\n\r\nTECHNIQUES (combine for power searches):\r\n- EXACT PHRASES: Use quotes (\"climate change report\")\r\n- EXCLUDE TERMS: Use minus to remove unwanted results (-wikipedia)\r\n- SITE-SPECIFIC: Restrict to websites (site:edu research)\r\n- FILETYPE: Find specific documents (filetype:pdf study)\r\n- OR OPERATOR: Find alternatives (electric OR hybrid cars)\r\n- DATE RANGE: Recent information (data after:2020)\r\n- WILDCARDS: Use * for unknown terms (how to * bread)\r\n- SPECIFIC QUESTIONS: Use who/what/when/where/why/how\r\n- DOMAIN TERMS: Include technical terminology for specialized topics\r\n- CONCISE TERMS: Prioritize keywords over sentences\r\n`.trim();\r\n\r\nexport const DEFAULT_COUNTRY_DESCRIPTION =\r\n  `Country code to localize search results.\r\nUse standard 2-letter country codes: \"us\", \"uk\", \"ca\", \"de\", \"fr\", \"jp\", \"br\", etc.\r\nProvide this when the search should return results specific to a particular country.\r\nExamples:\r\n- \"us\" for United States (default)\r\n- \"de\" for Germany\r\n- \"in\" for India\r\n`.trim();\r\n\r\nexport const querySchema = z.string().describe(DEFAULT_QUERY_DESCRIPTION);\r\nexport const dateSchema = z\r\n  .nativeEnum(DATE_RANGE)\r\n  .optional()\r\n  .describe('Date range for search results.');\r\nexport const countrySchema = z\r\n  .string()\r\n  .optional()\r\n  .describe(DEFAULT_COUNTRY_DESCRIPTION);\r\nexport const imagesSchema = z\r\n  .boolean()\r\n  .optional()\r\n  .describe('Whether to also run an image search.');\r\n\r\nexport const videosSchema = z\r\n  .boolean()\r\n  .optional()\r\n  .describe('Whether to also run a video search.');\r\n\r\nexport const newsSchema = z\r\n  .boolean()\r\n  .optional()\r\n  .describe('Whether to also run a news search.');\r\n"],"names":[],"mappings":";;IAEY;AAAZ,CAAA,UAAY,UAAU,EAAA;AACpB,IAAA,UAAA,CAAA,WAAA,CAAA,GAAA,GAAe;AACf,IAAA,UAAA,CAAA,eAAA,CAAA,GAAA,GAAmB;AACnB,IAAA,UAAA,CAAA,WAAA,CAAA,GAAA,GAAe;AACf,IAAA,UAAA,CAAA,YAAA,CAAA,GAAA,GAAgB;AAChB,IAAA,UAAA,CAAA,WAAA,CAAA,GAAA,GAAe;AACjB,CAAC,EANW,UAAU,KAAV,UAAU,GAMrB,EAAA,CAAA,CAAA;AAEY,MAAA,yBAAyB,GAAG,CAAA;;;;;;;;;;;;;;;;;;CAkBxC,CAAC,IAAI;AAEO,MAAA,2BAA2B,GACtC,CAAA;;;;;;;CAOD,CAAC,IAAI;AAEC,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,yBAAyB;AACjE,MAAM,UAAU,GAAG;KACvB,UAAU,CAAC,UAAU;AACrB,KAAA,QAAQ;KACR,QAAQ,CAAC,gCAAgC;AACrC,MAAM,aAAa,GAAG;AAC1B,KAAA,MAAM;AACN,KAAA,QAAQ;KACR,QAAQ,CAAC,2BAA2B;AAChC,MAAM,YAAY,GAAG;AACzB,KAAA,OAAO;AACP,KAAA,QAAQ;KACR,QAAQ,CAAC,sCAAsC;AAE3C,MAAM,YAAY,GAAG;AACzB,KAAA,OAAO;AACP,KAAA,QAAQ;KACR,QAAQ,CAAC,qCAAqC;AAE1C,MAAM,UAAU,GAAG;AACvB,KAAA,OAAO;AACP,KAAA,QAAQ;KACR,QAAQ,CAAC,oCAAoC;;;;"}