@librechat/agents 3.2.32 → 3.2.33

package/dist/cjs/tools/search/highlights.cjs

@@ -1,245 +1,178 @@
-'use strict';
-
-// 2. Pre-compile all regular expressions (only do this once)
-// Group patterns by priority for early returns
+//#region src/tools/search/highlights.ts
 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
-    ],
+	[
+		{ regex: /\n\n/g },
+		{ regex: /\n/g },
+		{ regex: /={3,}\s*\n|-{3,}\s*\n/g }
+	],
+	[
+		{ regex: /[.!?][")\]]?\s/g },
+		{ regex: /;\s/g },
+		{ regex: /:\s/g }
+	],
+	[
+		{ regex: /,\s/g },
+		{ regex: /\s-\s/g },
+		{ regex: /\s/g }
+	]
 ];
 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;
+	regex.lastIndex = 0;
+	if (text.length > 1e4) {
+		const chunkSize = 2e3;
+		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;
+			position += chunkSize - 100;
+			if (position >= text.length) break;
+		}
+		return -1;
+	}
+	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;
+	regex.lastIndex = 0;
+	let lastIndex = -1;
+	let lastLength = 0;
+	let match;
+	if (text.length > 1e4) {
+		const chunkSize = 2e3;
+		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;
+			startPosition = Math.max(0, startPosition - chunkSize + 100) - 1;
+			if (startPosition <= 0) break;
+		}
+		return -1;
+	}
+	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;
+function findBestBoundary(text, direction = "backward") {
+	if (!text || text.length === 0) return 0;
+	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;
+	}
+	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 };
+* Tracks references used in a highlight without changing their numbers
+*/
+function trackReferencesInHighlight(text, sourceResult) {
+	const references = [];
+	if (!text || text.length === 0 || !text.includes("#")) return { references };
+	if (!text.includes("link#") && !text.includes("image#") && !text.includes("video#")) return { references };
+	const sourceRefs = sourceResult.references || {
+		links: [],
+		images: [],
+		videos: []
+	};
+	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;
+		const refType = type;
+		const sourceArray = sourceRefs[`${refType}s`];
+		if (!sourceArray || originalIndex < 0 || originalIndex >= sourceArray.length) continue;
+		const reference = sourceArray[originalIndex];
+		if (!references.some((ref) => ref.type === refType && ref.originalIndex === originalIndex)) 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
- */
+* 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;
+	const resultCopy = { ...searchResults };
+	if (resultCopy.organic) resultCopy.organic = [...resultCopy.organic];
+	if (resultCopy.topStories) resultCopy.topStories = [...resultCopy.topStories];
+	for (const resultType of ["organic", "topStories"]) {
+		if (!resultCopy[resultType]) continue;
+		resultCopy[resultType] = resultCopy[resultType]?.map((result) => {
+			if (result.content == null || result.content === "" || !result.highlights || result.highlights.length === 0) {
+				if (result.content == null && result.references == null) return result;
+				/** Raw scraped content must never leave this function — without
+				* highlights to expand, strip it instead of passing it downstream */
+				const strippedResult = { ...result };
+				delete strippedResult.content;
+				delete strippedResult.references;
+				return strippedResult;
+			}
+			const resultCopy = { ...result };
+			const content = result.content;
+			const highlights = [];
+			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) {
+					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;
+				}
+				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);
+				const headText = content.substring(separatorStart, mainStart);
+				const tailText = content.substring(mainEnd, separatorEnd);
+				const bestHeadBoundary = findBestBoundary(headText, "backward");
+				const bestTailBoundary = findBestBoundary(tailText, "forward");
+				const finalStart = separatorStart + bestHeadBoundary;
+				const finalEnd = mainEnd + bestTailBoundary;
+				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;
 }
-
+//#endregion
 exports.expandHighlights = expandHighlights;
-//# sourceMappingURL=highlights.cjs.map
+
+//# sourceMappingURL=highlights.cjs.map

package/dist/cjs/tools/search/highlights.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"highlights.cjs","sources":["../../../../src/tools/search/highlights.ts"],"sourcesContent":["import type * as t from './types';\n\n// 2. Pre-compile all regular expressions (only do this once)\n// Group patterns by priority for early returns\nconst priorityPatterns = [\n  // High priority patterns (structural)\n  [\n    { regex: /\\n\\n/g }, // Double newline (paragraph break)\n    { regex: /\\n/g }, // Single newline\n    { regex: /={3,}\\s*\\n|-{3,}\\s*\\n/g }, // Section separators\n  ],\n  // Medium priority (semantic)\n  [\n    { regex: /[.!?][\")\\]]?\\s/g }, // End of sentence\n    { regex: /;\\s/g }, // Semicolon\n    { regex: /:\\s/g }, // Colon\n  ],\n  // Low priority (any breaks)\n  [\n    { regex: /,\\s/g }, // Comma\n    { regex: /\\s-\\s/g }, // Dash surrounded by spaces\n    { regex: /\\s/g }, // Any space\n  ],\n];\n\nfunction findFirstMatch(text: string, regex: RegExp): number {\n  // Reset regex\n  regex.lastIndex = 0;\n\n  // For very long texts, try chunking\n  if (text.length > 10000) {\n    const chunkSize = 2000;\n    let position = 0;\n\n    while (position < text.length) {\n      const chunk = text.substring(position, position + chunkSize);\n      regex.lastIndex = 0;\n\n      const match = regex.exec(chunk);\n      if (match) {\n        return position + match.index;\n      }\n\n      // Move to next chunk with some overlap\n      position += chunkSize - 100;\n      if (position >= text.length) break;\n    }\n    return -1;\n  }\n\n  // For shorter texts, normal regex search\n  const match = regex.exec(text);\n  return match ? match.index : -1;\n}\n\n// 3. Optimized boundary finding functions\nfunction findLastMatch(text: string, regex: RegExp): number {\n  // Reset regex state\n  regex.lastIndex = 0;\n\n  let lastIndex = -1;\n  let lastLength = 0;\n  let match;\n\n  // For very long texts, use a different approach to avoid regex engine slowdowns\n  if (text.length > 10000) {\n    // Try dividing the text into chunks for faster processing\n    const chunkSize = 2000;\n    let startPosition = Math.max(0, text.length - chunkSize);\n\n    while (startPosition >= 0) {\n      const chunk = text.substring(startPosition, startPosition + chunkSize);\n      regex.lastIndex = 0;\n\n      let chunkLastIndex = -1;\n      let chunkLastLength = 0;\n\n      while ((match = regex.exec(chunk)) !== null) {\n        chunkLastIndex = match.index;\n        chunkLastLength = match[0].length;\n      }\n\n      if (chunkLastIndex !== -1) {\n        return startPosition + chunkLastIndex + chunkLastLength;\n      }\n\n      // Move to previous chunk with some overlap\n      startPosition = Math.max(0, startPosition - chunkSize + 100) - 1;\n      if (startPosition <= 0) break;\n    }\n    return -1;\n  }\n\n  // For shorter texts, normal regex search\n  while ((match = regex.exec(text)) !== null) {\n    lastIndex = match.index;\n    lastLength = match[0].length;\n  }\n\n  return lastIndex === -1 ? -1 : lastIndex + lastLength;\n}\n\n// 4. Find the best boundary with priority groups\nfunction findBestBoundary(text: string, direction = 'backward'): number {\n  if (!text || text.length === 0) return 0;\n\n  // Try each priority group\n  for (const patternGroup of priorityPatterns) {\n    for (const pattern of patternGroup) {\n      const position =\n        direction === 'backward'\n          ? findLastMatch(text, pattern.regex)\n          : findFirstMatch(text, pattern.regex);\n\n      if (position !== -1) {\n        return position;\n      }\n    }\n  }\n\n  // No match found, use character boundary\n  return direction === 'backward' ? text.length : 0;\n}\n\n/**\n * Tracks references used in a highlight without changing their numbers\n */\nfunction trackReferencesInHighlight(\n  text: string,\n  sourceResult: t.ValidSource // Source containing the original references\n): {\n  references: {\n    type: 'link' | 'image' | 'video';\n    originalIndex: number;\n    reference: t.MediaReference; // Original reference object\n  }[];\n} {\n  // Track used references\n  const references: {\n    type: 'link' | 'image' | 'video';\n    originalIndex: number;\n    reference: t.MediaReference;\n  }[] = [];\n\n  if (!text || text.length === 0 || !text.includes('#')) {\n    return { references }; // Early return\n  }\n\n  // Quick check for reference markers\n  if (\n    !text.includes('link#') &&\n    !text.includes('image#') &&\n    !text.includes('video#')\n  ) {\n    return { references };\n  }\n\n  // Get references from the source if available\n  const sourceRefs = sourceResult.references || {\n    links: [],\n    images: [],\n    videos: [],\n  };\n\n  // Find references but don't modify text\n  const refRegex = /\\((link|image|video)#(\\d+)(?:\\s+\"([^\"]*)\")?\\)/g;\n  let match;\n\n  while ((match = refRegex.exec(text)) !== null) {\n    const [, type, indexStr] = match;\n    const originalIndex = parseInt(indexStr, 10) - 1; // Convert to 0-based\n\n    // Get the source array for this type\n    const refType = type as 'link' | 'image' | 'video';\n    const sourceArray = sourceRefs[`${refType}s`] as\n      | t.MediaReference[]\n      | undefined;\n\n    // Skip if invalid reference\n    if (\n      !sourceArray ||\n      originalIndex < 0 ||\n      originalIndex >= sourceArray.length\n    ) {\n      continue; // Skip invalid references\n    }\n\n    // Get original reference\n    const reference = sourceArray[originalIndex];\n\n    // Track if not already tracked\n    const alreadyTracked = references.some(\n      (ref) => ref.type === refType && ref.originalIndex === originalIndex\n    );\n\n    if (!alreadyTracked) {\n      references.push({\n        type: refType,\n        originalIndex,\n        reference,\n      });\n    }\n  }\n\n  return { references };\n}\n\n/**\n * Expand highlights in search results using smart boundary detection.\n *\n * This implementation finds natural text boundaries like paragraphs, sentences,\n * and phrases to provide context while maintaining readability.\n *\n * @param searchResults - Search results object\n * @param mainExpandBy - Primary expansion size on each side (default: 300)\n * @param separatorExpandBy - Additional range to look for separators (default: 150)\n * @returns Copy of search results with expanded highlights and tracked references\n */\nexport function expandHighlights(\n  searchResults: t.SearchResultData,\n  mainExpandBy = 300,\n  separatorExpandBy = 150\n): t.SearchResultData {\n  // Avoid deep copy - only copy what we modify\n  const resultCopy = { ...searchResults };\n  if (resultCopy.organic) resultCopy.organic = [...resultCopy.organic];\n  if (resultCopy.topStories) resultCopy.topStories = [...resultCopy.topStories];\n\n  // Process the results efficiently\n  const processResultTypes = ['organic', 'topStories'] as const;\n\n  for (const resultType of processResultTypes) {\n    if (!resultCopy[resultType as 'organic' | 'topStories']) continue;\n\n    // Map results to new array with modified highlights\n    resultCopy[resultType] = resultCopy[resultType]?.map((result) => {\n      if (\n        result.content == null ||\n        result.content === '' ||\n        !result.highlights ||\n        result.highlights.length === 0\n      ) {\n        return result; // No modification needed\n      }\n\n      // Create a shallow copy with expanded highlights\n      const resultCopy = { ...result };\n      const content = result.content;\n      const highlights = [];\n      // Process each highlight\n      for (const highlight of result.highlights) {\n        const { references } = trackReferencesInHighlight(\n          highlight.text,\n          result\n        );\n\n        let startPos = content.indexOf(highlight.text);\n        let highlightLen = highlight.text.length;\n\n        if (startPos === -1) {\n          // Try with stripped whitespace\n          const strippedHighlight = highlight.text.trim();\n          startPos = content.indexOf(strippedHighlight);\n\n          if (startPos === -1) {\n            highlights.push({\n              text: highlight.text,\n              score: highlight.score,\n              references,\n            });\n            continue;\n          }\n          highlightLen = strippedHighlight.length;\n        }\n\n        // Calculate boundaries\n        const mainStart = Math.max(0, startPos - mainExpandBy);\n        const mainEnd = Math.min(\n          content.length,\n          startPos + highlightLen + mainExpandBy\n        );\n\n        const separatorStart = Math.max(0, mainStart - separatorExpandBy);\n        const separatorEnd = Math.min(\n          content.length,\n          mainEnd + separatorExpandBy\n        );\n\n        // Extract text segments\n        const headText = content.substring(separatorStart, mainStart);\n        const tailText = content.substring(mainEnd, separatorEnd);\n\n        // Find natural boundaries\n        const bestHeadBoundary = findBestBoundary(headText, 'backward');\n        const bestTailBoundary = findBestBoundary(tailText, 'forward');\n\n        // Calculate final positions\n        const finalStart = separatorStart + bestHeadBoundary;\n        const finalEnd = mainEnd + bestTailBoundary;\n\n        // Extract the expanded highlight\n        const expandedHighlightText = content\n          .substring(finalStart, finalEnd)\n          .trim();\n        highlights.push({\n          text: expandedHighlightText,\n          score: highlight.score,\n          references,\n        });\n      }\n\n      resultCopy.highlights = highlights;\n      delete resultCopy.content;\n      delete resultCopy.references;\n      return resultCopy;\n    });\n  }\n\n  return resultCopy;\n}\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;YAC/B;;AAGA,YAAA,QAAQ,IAAI,SAAS,GAAG,GAAG;AAC3B,YAAA,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM;gBAAE;QAC/B;QACA,OAAO,EAAE;IACX;;IAGA,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;YACnC;AAEA,YAAA,IAAI,cAAc,KAAK,EAAE,EAAE;AACzB,gBAAA,OAAO,aAAa,GAAG,cAAc,GAAG,eAAe;YACzD;;AAGA,YAAA,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC;YAChE,IAAI,aAAa,IAAI,CAAC;gBAAE;QAC1B;QACA,OAAO,EAAE;IACX;;AAGA,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;IAC9B;AAEA,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;YACjB;QACF;IACF;;AAGA,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;IACxB;;AAGA,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;IACvB;;AAGA,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;QACX;;AAGA,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;QACJ;IACF;IAEA,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;YAChB;;AAGA,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;oBACF;AACA,oBAAA,YAAY,GAAG,iBAAiB,CAAC,MAAM;gBACzC;;AAGA,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;YACJ;AAEA,YAAA,UAAU,CAAC,UAAU,GAAG,UAAU;YAClC,OAAO,UAAU,CAAC,OAAO;YACzB,OAAO,UAAU,CAAC,UAAU;AAC5B,YAAA,OAAO,UAAU;AACnB,QAAA,CAAC,CAAC;IACJ;AAEA,IAAA,OAAO,UAAU;AACnB;;;;"}
+{"version":3,"file":"highlights.cjs","names":[],"sources":["../../../../src/tools/search/highlights.ts"],"sourcesContent":["import type * as t from './types';\n\n// 2. Pre-compile all regular expressions (only do this once)\n// Group patterns by priority for early returns\nconst priorityPatterns = [\n  // High priority patterns (structural)\n  [\n    { regex: /\\n\\n/g }, // Double newline (paragraph break)\n    { regex: /\\n/g }, // Single newline\n    { regex: /={3,}\\s*\\n|-{3,}\\s*\\n/g }, // Section separators\n  ],\n  // Medium priority (semantic)\n  [\n    { regex: /[.!?][\")\\]]?\\s/g }, // End of sentence\n    { regex: /;\\s/g }, // Semicolon\n    { regex: /:\\s/g }, // Colon\n  ],\n  // Low priority (any breaks)\n  [\n    { regex: /,\\s/g }, // Comma\n    { regex: /\\s-\\s/g }, // Dash surrounded by spaces\n    { regex: /\\s/g }, // Any space\n  ],\n];\n\nfunction findFirstMatch(text: string, regex: RegExp): number {\n  // Reset regex\n  regex.lastIndex = 0;\n\n  // For very long texts, try chunking\n  if (text.length > 10000) {\n    const chunkSize = 2000;\n    let position = 0;\n\n    while (position < text.length) {\n      const chunk = text.substring(position, position + chunkSize);\n      regex.lastIndex = 0;\n\n      const match = regex.exec(chunk);\n      if (match) {\n        return position + match.index;\n      }\n\n      // Move to next chunk with some overlap\n      position += chunkSize - 100;\n      if (position >= text.length) break;\n    }\n    return -1;\n  }\n\n  // For shorter texts, normal regex search\n  const match = regex.exec(text);\n  return match ? match.index : -1;\n}\n\n// 3. Optimized boundary finding functions\nfunction findLastMatch(text: string, regex: RegExp): number {\n  // Reset regex state\n  regex.lastIndex = 0;\n\n  let lastIndex = -1;\n  let lastLength = 0;\n  let match;\n\n  // For very long texts, use a different approach to avoid regex engine slowdowns\n  if (text.length > 10000) {\n    // Try dividing the text into chunks for faster processing\n    const chunkSize = 2000;\n    let startPosition = Math.max(0, text.length - chunkSize);\n\n    while (startPosition >= 0) {\n      const chunk = text.substring(startPosition, startPosition + chunkSize);\n      regex.lastIndex = 0;\n\n      let chunkLastIndex = -1;\n      let chunkLastLength = 0;\n\n      while ((match = regex.exec(chunk)) !== null) {\n        chunkLastIndex = match.index;\n        chunkLastLength = match[0].length;\n      }\n\n      if (chunkLastIndex !== -1) {\n        return startPosition + chunkLastIndex + chunkLastLength;\n      }\n\n      // Move to previous chunk with some overlap\n      startPosition = Math.max(0, startPosition - chunkSize + 100) - 1;\n      if (startPosition <= 0) break;\n    }\n    return -1;\n  }\n\n  // For shorter texts, normal regex search\n  while ((match = regex.exec(text)) !== null) {\n    lastIndex = match.index;\n    lastLength = match[0].length;\n  }\n\n  return lastIndex === -1 ? -1 : lastIndex + lastLength;\n}\n\n// 4. Find the best boundary with priority groups\nfunction findBestBoundary(text: string, direction = 'backward'): number {\n  if (!text || text.length === 0) return 0;\n\n  // Try each priority group\n  for (const patternGroup of priorityPatterns) {\n    for (const pattern of patternGroup) {\n      const position =\n        direction === 'backward'\n          ? findLastMatch(text, pattern.regex)\n          : findFirstMatch(text, pattern.regex);\n\n      if (position !== -1) {\n        return position;\n      }\n    }\n  }\n\n  // No match found, use character boundary\n  return direction === 'backward' ? text.length : 0;\n}\n\n/**\n * Tracks references used in a highlight without changing their numbers\n */\nfunction trackReferencesInHighlight(\n  text: string,\n  sourceResult: t.ValidSource // Source containing the original references\n): {\n  references: {\n    type: 'link' | 'image' | 'video';\n    originalIndex: number;\n    reference: t.MediaReference; // Original reference object\n  }[];\n} {\n  // Track used references\n  const references: {\n    type: 'link' | 'image' | 'video';\n    originalIndex: number;\n    reference: t.MediaReference;\n  }[] = [];\n\n  if (!text || text.length === 0 || !text.includes('#')) {\n    return { references }; // Early return\n  }\n\n  // Quick check for reference markers\n  if (\n    !text.includes('link#') &&\n    !text.includes('image#') &&\n    !text.includes('video#')\n  ) {\n    return { references };\n  }\n\n  // Get references from the source if available\n  const sourceRefs = sourceResult.references || {\n    links: [],\n    images: [],\n    videos: [],\n  };\n\n  // Find references but don't modify text\n  const refRegex = /\\((link|image|video)#(\\d+)(?:\\s+\"([^\"]*)\")?\\)/g;\n  let match;\n\n  while ((match = refRegex.exec(text)) !== null) {\n    const [, type, indexStr] = match;\n    const originalIndex = parseInt(indexStr, 10) - 1; // Convert to 0-based\n\n    // Get the source array for this type\n    const refType = type as 'link' | 'image' | 'video';\n    const sourceArray = sourceRefs[`${refType}s`] as\n      | t.MediaReference[]\n      | undefined;\n\n    // Skip if invalid reference\n    if (\n      !sourceArray ||\n      originalIndex < 0 ||\n      originalIndex >= sourceArray.length\n    ) {\n      continue; // Skip invalid references\n    }\n\n    // Get original reference\n    const reference = sourceArray[originalIndex];\n\n    // Track if not already tracked\n    const alreadyTracked = references.some(\n      (ref) => ref.type === refType && ref.originalIndex === originalIndex\n    );\n\n    if (!alreadyTracked) {\n      references.push({\n        type: refType,\n        originalIndex,\n        reference,\n      });\n    }\n  }\n\n  return { references };\n}\n\n/**\n * Expand highlights in search results using smart boundary detection.\n *\n * This implementation finds natural text boundaries like paragraphs, sentences,\n * and phrases to provide context while maintaining readability.\n *\n * @param searchResults - Search results object\n * @param mainExpandBy - Primary expansion size on each side (default: 300)\n * @param separatorExpandBy - Additional range to look for separators (default: 150)\n * @returns Copy of search results with expanded highlights and tracked references\n */\nexport function expandHighlights(\n  searchResults: t.SearchResultData,\n  mainExpandBy = 300,\n  separatorExpandBy = 150\n): t.SearchResultData {\n  // Avoid deep copy - only copy what we modify\n  const resultCopy = { ...searchResults };\n  if (resultCopy.organic) resultCopy.organic = [...resultCopy.organic];\n  if (resultCopy.topStories) resultCopy.topStories = [...resultCopy.topStories];\n\n  // Process the results efficiently\n  const processResultTypes = ['organic', 'topStories'] as const;\n\n  for (const resultType of processResultTypes) {\n    if (!resultCopy[resultType as 'organic' | 'topStories']) continue;\n\n    // Map results to new array with modified highlights\n    resultCopy[resultType] = resultCopy[resultType]?.map((result) => {\n      if (\n        result.content == null ||\n        result.content === '' ||\n        !result.highlights ||\n        result.highlights.length === 0\n      ) {\n        if (result.content == null && result.references == null) {\n          return result;\n        }\n        /** Raw scraped content must never leave this function — without\n         * highlights to expand, strip it instead of passing it downstream */\n        const strippedResult = { ...result };\n        delete strippedResult.content;\n        delete strippedResult.references;\n        return strippedResult;\n      }\n\n      // Create a shallow copy with expanded highlights\n      const resultCopy = { ...result };\n      const content = result.content;\n      const highlights = [];\n      // Process each highlight\n      for (const highlight of result.highlights) {\n        const { references } = trackReferencesInHighlight(\n          highlight.text,\n          result\n        );\n\n        let startPos = content.indexOf(highlight.text);\n        let highlightLen = highlight.text.length;\n\n        if (startPos === -1) {\n          // Try with stripped whitespace\n          const strippedHighlight = highlight.text.trim();\n          startPos = content.indexOf(strippedHighlight);\n\n          if (startPos === -1) {\n            highlights.push({\n              text: highlight.text,\n              score: highlight.score,\n              references,\n            });\n            continue;\n          }\n          highlightLen = strippedHighlight.length;\n        }\n\n        // Calculate boundaries\n        const mainStart = Math.max(0, startPos - mainExpandBy);\n        const mainEnd = Math.min(\n          content.length,\n          startPos + highlightLen + mainExpandBy\n        );\n\n        const separatorStart = Math.max(0, mainStart - separatorExpandBy);\n        const separatorEnd = Math.min(\n          content.length,\n          mainEnd + separatorExpandBy\n        );\n\n        // Extract text segments\n        const headText = content.substring(separatorStart, mainStart);\n        const tailText = content.substring(mainEnd, separatorEnd);\n\n        // Find natural boundaries\n        const bestHeadBoundary = findBestBoundary(headText, 'backward');\n        const bestTailBoundary = findBestBoundary(tailText, 'forward');\n\n        // Calculate final positions\n        const finalStart = separatorStart + bestHeadBoundary;\n        const finalEnd = mainEnd + bestTailBoundary;\n\n        // Extract the expanded highlight\n        const expandedHighlightText = content\n          .substring(finalStart, finalEnd)\n          .trim();\n        highlights.push({\n          text: expandedHighlightText,\n          score: highlight.score,\n          references,\n        });\n      }\n\n      resultCopy.highlights = highlights;\n      delete resultCopy.content;\n      delete resultCopy.references;\n      return resultCopy;\n    });\n  }\n\n  return resultCopy;\n}\n"],"mappings":";AAIA,MAAM,mBAAmB;CAEvB;EACE,EAAE,OAAO,QAAQ;EACjB,EAAE,OAAO,MAAM;EACf,EAAE,OAAO,yBAAyB;CACpC;CAEA;EACE,EAAE,OAAO,kBAAkB;EAC3B,EAAE,OAAO,OAAO;EAChB,EAAE,OAAO,OAAO;CAClB;CAEA;EACE,EAAE,OAAO,OAAO;EAChB,EAAE,OAAO,SAAS;EAClB,EAAE,OAAO,MAAM;CACjB;AACF;AAEA,SAAS,eAAe,MAAc,OAAuB;CAE3D,MAAM,YAAY;CAGlB,IAAI,KAAK,SAAS,KAAO;EACvB,MAAM,YAAY;EAClB,IAAI,WAAW;EAEf,OAAO,WAAW,KAAK,QAAQ;GAC7B,MAAM,QAAQ,KAAK,UAAU,UAAU,WAAW,SAAS;GAC3D,MAAM,YAAY;GAElB,MAAM,QAAQ,MAAM,KAAK,KAAK;GAC9B,IAAI,OACF,OAAO,WAAW,MAAM;GAI1B,YAAY,YAAY;GACxB,IAAI,YAAY,KAAK,QAAQ;EAC/B;EACA,OAAO;CACT;CAGA,MAAM,QAAQ,MAAM,KAAK,IAAI;CAC7B,OAAO,QAAQ,MAAM,QAAQ;AAC/B;AAGA,SAAS,cAAc,MAAc,OAAuB;CAE1D,MAAM,YAAY;CAElB,IAAI,YAAY;CAChB,IAAI,aAAa;CACjB,IAAI;CAGJ,IAAI,KAAK,SAAS,KAAO;EAEvB,MAAM,YAAY;EAClB,IAAI,gBAAgB,KAAK,IAAI,GAAG,KAAK,SAAS,SAAS;EAEvD,OAAO,iBAAiB,GAAG;GACzB,MAAM,QAAQ,KAAK,UAAU,eAAe,gBAAgB,SAAS;GACrE,MAAM,YAAY;GAElB,IAAI,iBAAiB;GACrB,IAAI,kBAAkB;GAEtB,QAAQ,QAAQ,MAAM,KAAK,KAAK,OAAO,MAAM;IAC3C,iBAAiB,MAAM;IACvB,kBAAkB,MAAM,EAAE,CAAC;GAC7B;GAEA,IAAI,mBAAmB,IACrB,OAAO,gBAAgB,iBAAiB;GAI1C,gBAAgB,KAAK,IAAI,GAAG,gBAAgB,YAAY,GAAG,IAAI;GAC/D,IAAI,iBAAiB,GAAG;EAC1B;EACA,OAAO;CACT;CAGA,QAAQ,QAAQ,MAAM,KAAK,IAAI,OAAO,MAAM;EAC1C,YAAY,MAAM;EAClB,aAAa,MAAM,EAAE,CAAC;CACxB;CAEA,OAAO,cAAc,KAAK,KAAK,YAAY;AAC7C;AAGA,SAAS,iBAAiB,MAAc,YAAY,YAAoB;CACtE,IAAI,CAAC,QAAQ,KAAK,WAAW,GAAG,OAAO;CAGvC,KAAK,MAAM,gBAAgB,kBACzB,KAAK,MAAM,WAAW,cAAc;EAClC,MAAM,WACJ,cAAc,aACV,cAAc,MAAM,QAAQ,KAAK,IACjC,eAAe,MAAM,QAAQ,KAAK;EAExC,IAAI,aAAa,IACf,OAAO;CAEX;CAIF,OAAO,cAAc,aAAa,KAAK,SAAS;AAClD;;;;AAKA,SAAS,2BACP,MACA,cAOA;CAEA,MAAM,aAIA,CAAC;CAEP,IAAI,CAAC,QAAQ,KAAK,WAAW,KAAK,CAAC,KAAK,SAAS,GAAG,GAClD,OAAO,EAAE,WAAW;CAItB,IACE,CAAC,KAAK,SAAS,OAAO,KACtB,CAAC,KAAK,SAAS,QAAQ,KACvB,CAAC,KAAK,SAAS,QAAQ,GAEvB,OAAO,EAAE,WAAW;CAItB,MAAM,aAAa,aAAa,cAAc;EAC5C,OAAO,CAAC;EACR,QAAQ,CAAC;EACT,QAAQ,CAAC;CACX;CAGA,MAAM,WAAW;CACjB,IAAI;CAEJ,QAAQ,QAAQ,SAAS,KAAK,IAAI,OAAO,MAAM;EAC7C,MAAM,GAAG,MAAM,YAAY;EAC3B,MAAM,gBAAgB,SAAS,UAAU,EAAE,IAAI;EAG/C,MAAM,UAAU;EAChB,MAAM,cAAc,WAAW,GAAG,QAAQ;EAK1C,IACE,CAAC,eACD,gBAAgB,KAChB,iBAAiB,YAAY,QAE7B;EAIF,MAAM,YAAY,YAAY;EAO9B,IAAI,CAJmB,WAAW,MAC/B,QAAQ,IAAI,SAAS,WAAW,IAAI,kBAAkB,aAGvC,GAChB,WAAW,KAAK;GACd,MAAM;GACN;GACA;EACF,CAAC;CAEL;CAEA,OAAO,EAAE,WAAW;AACtB;;;;;;;;;;;;AAaA,SAAgB,iBACd,eACA,eAAe,KACf,oBAAoB,KACA;CAEpB,MAAM,aAAa,EAAE,GAAG,cAAc;CACtC,IAAI,WAAW,SAAS,WAAW,UAAU,CAAC,GAAG,WAAW,OAAO;CACnE,IAAI,WAAW,YAAY,WAAW,aAAa,CAAC,GAAG,WAAW,UAAU;CAK5E,KAAK,MAAM,cAAc,CAFG,WAAW,YAEG,GAAG;EAC3C,IAAI,CAAC,WAAW,aAAyC;EAGzD,WAAW,cAAc,WAAW,WAAW,EAAE,KAAK,WAAW;GAC/D,IACE,OAAO,WAAW,QAClB,OAAO,YAAY,MACnB,CAAC,OAAO,cACR,OAAO,WAAW,WAAW,GAC7B;IACA,IAAI,OAAO,WAAW,QAAQ,OAAO,cAAc,MACjD,OAAO;;;IAIT,MAAM,iBAAiB,EAAE,GAAG,OAAO;IACnC,OAAO,eAAe;IACtB,OAAO,eAAe;IACtB,OAAO;GACT;GAGA,MAAM,aAAa,EAAE,GAAG,OAAO;GAC/B,MAAM,UAAU,OAAO;GACvB,MAAM,aAAa,CAAC;GAEpB,KAAK,MAAM,aAAa,OAAO,YAAY;IACzC,MAAM,EAAE,eAAe,2BACrB,UAAU,MACV,MACF;IAEA,IAAI,WAAW,QAAQ,QAAQ,UAAU,IAAI;IAC7C,IAAI,eAAe,UAAU,KAAK;IAElC,IAAI,aAAa,IAAI;KAEnB,MAAM,oBAAoB,UAAU,KAAK,KAAK;KAC9C,WAAW,QAAQ,QAAQ,iBAAiB;KAE5C,IAAI,aAAa,IAAI;MACnB,WAAW,KAAK;OACd,MAAM,UAAU;OAChB,OAAO,UAAU;OACjB;MACF,CAAC;MACD;KACF;KACA,eAAe,kBAAkB;IACnC;IAGA,MAAM,YAAY,KAAK,IAAI,GAAG,WAAW,YAAY;IACrD,MAAM,UAAU,KAAK,IACnB,QAAQ,QACR,WAAW,eAAe,YAC5B;IAEA,MAAM,iBAAiB,KAAK,IAAI,GAAG,YAAY,iBAAiB;IAChE,MAAM,eAAe,KAAK,IACxB,QAAQ,QACR,UAAU,iBACZ;IAGA,MAAM,WAAW,QAAQ,UAAU,gBAAgB,SAAS;IAC5D,MAAM,WAAW,QAAQ,UAAU,SAAS,YAAY;IAGxD,MAAM,mBAAmB,iBAAiB,UAAU,UAAU;IAC9D,MAAM,mBAAmB,iBAAiB,UAAU,SAAS;IAG7D,MAAM,aAAa,iBAAiB;IACpC,MAAM,WAAW,UAAU;IAG3B,MAAM,wBAAwB,QAC3B,UAAU,YAAY,QAAQ,CAAC,CAC/B,KAAK;IACR,WAAW,KAAK;KACd,MAAM;KACN,OAAO,UAAU;KACjB;IACF,CAAC;GACH;GAEA,WAAW,aAAa;GACxB,OAAO,WAAW;GAClB,OAAO,WAAW;GAClB,OAAO;EACT,CAAC;CACH;CAEA,OAAO;AACT"}

package/dist/cjs/tools/search/index.cjs

@@ -0,0 +1,2 @@
+require("./schema.cjs");
+require("./tool.cjs");