273 lines
8.5 KiB
TypeScript
273 lines
8.5 KiB
TypeScript
import { pdfjs } from 'react-pdf';
|
|
import nlp from 'compromise';
|
|
import stringSimilarity from 'string-similarity';
|
|
import type { TextItem } from 'pdfjs-dist/types/src/display/api';
|
|
import type { PDFDocumentProxy } from 'pdfjs-dist';
|
|
|
|
// Set worker from public directory and compatibility mode
|
|
pdfjs.GlobalWorkerOptions.workerSrc = '/pdf.worker.mjs';
|
|
pdfjs.GlobalWorkerOptions.workerPort = null;
|
|
|
|
interface TextMatch {
|
|
elements: HTMLElement[];
|
|
rating: number;
|
|
text: string;
|
|
lengthDiff: number;
|
|
}
|
|
|
|
// URL Conversion functions
|
|
export function convertPDFDataToURL(pdfData: Blob): Promise<string> {
|
|
return new Promise((resolve, reject) => {
|
|
const reader = new FileReader();
|
|
reader.onload = () => resolve(reader.result as string);
|
|
reader.onerror = () => reject(reader.error);
|
|
reader.readAsDataURL(pdfData);
|
|
});
|
|
}
|
|
|
|
// Text Processing functions
|
|
export async function extractTextFromPDF(pdf: PDFDocumentProxy, pageNumber: number): Promise<string> {
|
|
try {
|
|
const page = await pdf.getPage(pageNumber);
|
|
const textContent = await page.getTextContent();
|
|
|
|
const textItems = textContent.items.filter((item): item is TextItem =>
|
|
'str' in item && 'transform' in item
|
|
);
|
|
|
|
const tolerance = 2;
|
|
const lines: TextItem[][] = [];
|
|
let currentLine: TextItem[] = [];
|
|
let currentY: number | null = null;
|
|
|
|
textItems.forEach((item) => {
|
|
const y = item.transform[5];
|
|
if (currentY === null) {
|
|
currentY = y;
|
|
currentLine.push(item);
|
|
} else if (Math.abs(y - currentY) < tolerance) {
|
|
currentLine.push(item);
|
|
} else {
|
|
lines.push(currentLine);
|
|
currentLine = [item];
|
|
currentY = y;
|
|
}
|
|
});
|
|
lines.push(currentLine);
|
|
|
|
let pageText = '';
|
|
for (const line of lines) {
|
|
line.sort((a, b) => a.transform[4] - b.transform[4]);
|
|
let lineText = '';
|
|
let prevItem: TextItem | null = null;
|
|
|
|
for (const item of line) {
|
|
if (!prevItem) {
|
|
lineText = item.str;
|
|
} else {
|
|
const prevEndX = prevItem.transform[4] + (prevItem.width ?? 0);
|
|
const currentStartX = item.transform[4];
|
|
const space = currentStartX - prevEndX;
|
|
|
|
if (space > ((item.width ?? 0) * 0.3)) {
|
|
lineText += ' ' + item.str;
|
|
} else {
|
|
lineText += item.str;
|
|
}
|
|
}
|
|
prevItem = item;
|
|
}
|
|
pageText += lineText + ' ';
|
|
}
|
|
|
|
return pageText.replace(/\s+/g, ' ').trim();
|
|
} catch (error) {
|
|
console.error('Error extracting text from PDF:', error);
|
|
throw new Error('Failed to extract text from PDF');
|
|
}
|
|
}
|
|
|
|
// Highlighting functions
|
|
export function clearHighlights() {
|
|
const textNodes = document.querySelectorAll('.react-pdf__Page__textContent span');
|
|
textNodes.forEach((node) => {
|
|
const element = node as HTMLElement;
|
|
element.style.backgroundColor = '';
|
|
element.style.opacity = '1';
|
|
});
|
|
}
|
|
|
|
export function findBestTextMatch(
|
|
elements: Array<{ element: HTMLElement; text: string }>,
|
|
targetText: string,
|
|
maxCombinedLength: number
|
|
): TextMatch {
|
|
let bestMatch = {
|
|
elements: [] as HTMLElement[],
|
|
rating: 0,
|
|
text: '',
|
|
lengthDiff: Infinity,
|
|
};
|
|
|
|
const SPAN_SEARCH_LIMIT = 10;
|
|
|
|
for (let i = 0; i < elements.length; i++) {
|
|
let combinedText = '';
|
|
const currentElements = [];
|
|
for (let j = i; j < Math.min(i + SPAN_SEARCH_LIMIT, elements.length); j++) {
|
|
const node = elements[j];
|
|
const newText = combinedText ? `${combinedText} ${node.text}` : node.text;
|
|
if (newText.length > maxCombinedLength) break;
|
|
|
|
combinedText = newText;
|
|
currentElements.push(node.element);
|
|
|
|
const similarity = stringSimilarity.compareTwoStrings(targetText, combinedText);
|
|
const lengthDiff = Math.abs(combinedText.length - targetText.length);
|
|
const lengthPenalty = lengthDiff / targetText.length;
|
|
const adjustedRating = similarity * (1 - lengthPenalty * 0.5);
|
|
|
|
if (adjustedRating > bestMatch.rating) {
|
|
bestMatch = {
|
|
elements: [...currentElements],
|
|
rating: adjustedRating,
|
|
text: combinedText,
|
|
lengthDiff,
|
|
};
|
|
}
|
|
}
|
|
}
|
|
|
|
return bestMatch;
|
|
}
|
|
|
|
export function highlightPattern(
|
|
text: string,
|
|
pattern: string,
|
|
containerRef: React.RefObject<HTMLDivElement>
|
|
) {
|
|
clearHighlights();
|
|
|
|
if (!pattern?.trim()) return;
|
|
|
|
const cleanPattern = pattern.trim().replace(/\s+/g, ' ');
|
|
const container = containerRef.current;
|
|
if (!container) return;
|
|
|
|
const textNodes = container.querySelectorAll('.react-pdf__Page__textContent span');
|
|
const allText = Array.from(textNodes).map((node) => ({
|
|
element: node as HTMLElement,
|
|
text: (node.textContent || '').trim(),
|
|
})).filter((node) => node.text.length > 0);
|
|
|
|
const containerRect = container.getBoundingClientRect();
|
|
const visibleTop = container.scrollTop;
|
|
const visibleBottom = visibleTop + containerRect.height;
|
|
const bufferSize = containerRect.height;
|
|
|
|
const visibleNodes = allText.filter(({ element }) => {
|
|
const rect = element.getBoundingClientRect();
|
|
const elementTop = rect.top - containerRect.top + container.scrollTop;
|
|
return elementTop >= (visibleTop - bufferSize) && elementTop <= (visibleBottom + bufferSize);
|
|
});
|
|
|
|
let bestMatch = findBestTextMatch(visibleNodes, cleanPattern, cleanPattern.length * 2);
|
|
|
|
if (bestMatch.rating < 0.3) {
|
|
bestMatch = findBestTextMatch(allText, cleanPattern, cleanPattern.length * 2);
|
|
}
|
|
|
|
const similarityThreshold = bestMatch.lengthDiff < cleanPattern.length * 0.3 ? 0.3 : 0.5;
|
|
|
|
if (bestMatch.rating >= similarityThreshold) {
|
|
bestMatch.elements.forEach((element) => {
|
|
element.style.backgroundColor = 'grey';
|
|
element.style.opacity = '0.4';
|
|
});
|
|
|
|
if (bestMatch.elements.length > 0) {
|
|
const element = bestMatch.elements[0];
|
|
const elementRect = element.getBoundingClientRect();
|
|
const elementTop = elementRect.top - containerRect.top + container.scrollTop;
|
|
|
|
if (elementTop < visibleTop || elementTop > visibleBottom) {
|
|
container.scrollTo({
|
|
top: elementTop - containerRect.height / 3,
|
|
behavior: 'smooth',
|
|
});
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// Text Click Handler
|
|
export function handleTextClick(
|
|
event: MouseEvent,
|
|
pdfText: string,
|
|
containerRef: React.RefObject<HTMLDivElement>,
|
|
stopAndPlayFromIndex: (index: number) => void,
|
|
isProcessing: boolean
|
|
) {
|
|
if (isProcessing) return;
|
|
|
|
const target = event.target as HTMLElement;
|
|
if (!target.matches('.react-pdf__Page__textContent span')) return;
|
|
|
|
const parentElement = target.closest('.react-pdf__Page__textContent');
|
|
if (!parentElement) return;
|
|
|
|
const spans = Array.from(parentElement.querySelectorAll('span'));
|
|
const clickedIndex = spans.indexOf(target);
|
|
const contextWindow = 3;
|
|
const startIndex = Math.max(0, clickedIndex - contextWindow);
|
|
const endIndex = Math.min(spans.length - 1, clickedIndex + contextWindow);
|
|
const contextText = spans
|
|
.slice(startIndex, endIndex + 1)
|
|
.map((span) => span.textContent)
|
|
.join(' ')
|
|
.trim();
|
|
|
|
if (!contextText?.trim()) return;
|
|
|
|
const cleanContext = contextText.trim().replace(/\s+/g, ' ');
|
|
const allText = Array.from(parentElement.querySelectorAll('span')).map((node) => ({
|
|
element: node as HTMLElement,
|
|
text: (node.textContent || '').trim(),
|
|
})).filter((node) => node.text.length > 0);
|
|
|
|
const bestMatch = findBestTextMatch(allText, cleanContext, cleanContext.length * 2);
|
|
const similarityThreshold = bestMatch.lengthDiff < cleanContext.length * 0.3 ? 0.3 : 0.5;
|
|
|
|
if (bestMatch.rating >= similarityThreshold) {
|
|
const matchText = bestMatch.text;
|
|
const sentences = nlp(pdfText).sentences().out('array') as string[];
|
|
let bestSentenceMatch = { sentence: '', rating: 0 };
|
|
|
|
for (const sentence of sentences) {
|
|
const rating = stringSimilarity.compareTwoStrings(matchText, sentence);
|
|
if (rating > bestSentenceMatch.rating) {
|
|
bestSentenceMatch = { sentence, rating };
|
|
}
|
|
}
|
|
|
|
if (bestSentenceMatch.rating >= 0.5) {
|
|
const sentenceIndex = sentences.findIndex((sentence) => sentence === bestSentenceMatch.sentence);
|
|
if (sentenceIndex !== -1) {
|
|
stopAndPlayFromIndex(sentenceIndex);
|
|
highlightPattern(pdfText, bestSentenceMatch.sentence, containerRef);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// Debounce for PDF viewer
|
|
export function debounce<T extends (...args: unknown[]) => unknown>(
|
|
func: T,
|
|
wait: number
|
|
): (...args: Parameters<T>) => void {
|
|
let timeout: NodeJS.Timeout;
|
|
return (...args: Parameters<T>) => {
|
|
clearTimeout(timeout);
|
|
timeout = setTimeout(() => func(...args), wait);
|
|
};
|
|
}
|