filecat 1.0.30 → 1.0.32

package/build/file.worker.js

@@ -0,0 +1,100 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+const worker_threads_1 = require("worker_threads");
+const fs = require("fs");
+function copySubarray(buffer, start, end) {
+    const length = end - start;
+    const newBuffer = Buffer.alloc(length);
+    buffer.copy(newBuffer, 0, start, end);
+    return newBuffer;
+}
+function buildBadCharTable(pattern) {
+    const table = {};
+    const m = pattern.length;
+    for (let i = 0; i < m; i++) {
+        table[pattern[i]] = i;
+    }
+    return table;
+}
+function boyerMooreSearch(text, pattern, list) {
+    const badCharTable = buildBadCharTable(pattern);
+    const text_len = text.length;
+    const pattern_len = pattern.length;
+    const text_len_pattern_len = text_len - pattern_len;
+    let i = 0;
+    while (i <= text_len_pattern_len) {
+        let last_p_i = pattern_len - 1;
+        while (last_p_i >= 0 && text[i + last_p_i] === pattern[last_p_i]) {
+            last_p_i--;
+        }
+        if (last_p_i < 0) {
+            list.push(i);
+            i += (i + pattern_len < text_len) ?
+                pattern_len - badCharTable[text[i + pattern_len]] || pattern_len
+                : 1;
+        }
+        else {
+            const badCharLast = badCharTable[text[i + last_p_i]];
+            const badCharShift = badCharLast !== undefined
+                ? last_p_i - badCharLast
+                : last_p_i + 1;
+            i += Math.max(badCharShift, 1);
+        }
+    }
+}
+let done = false;
+worker_threads_1.parentPort.on("message", (message) => __awaiter(void 0, void 0, void 0, function* () {
+    try {
+        switch (message.type) {
+            case 1:
+                {
+                    const { start, end, file_path, query_text_buffer } = message;
+                    let haveReadSize = 0;
+                    let bufferContent = Buffer.alloc(0);
+                    const fd = fs.openSync(file_path, "r");
+                    const read_len = 1024 * 1024 * 2;
+                    let text_start_index = 0;
+                    while (haveReadSize < end) {
+                        if (done)
+                            break;
+                        const buffer = Buffer.alloc(read_len);
+                        let bytesRead = fs.readSync(fd, buffer, 0, buffer.length, haveReadSize);
+                        if (bytesRead === 0)
+                            break;
+                        haveReadSize += bytesRead;
+                        bufferContent = Buffer.concat([bufferContent, buffer.subarray(0, bytesRead)]);
+                        worker_threads_1.parentPort.postMessage({ type: 5, progress: (haveReadSize * 100 / end).toFixed(0) });
+                        const r_list = [];
+                        boyerMooreSearch(bufferContent, query_text_buffer, r_list);
+                        if (r_list.length > 0) {
+                            for (let i = 0; i < r_list.length; i++) {
+                                r_list[i] += text_start_index;
+                            }
+                            worker_threads_1.parentPort.postMessage({ type: 2, find_index: r_list });
+                        }
+                        text_start_index += (bufferContent.length - query_text_buffer.length);
+                        bufferContent = copySubarray(bufferContent, bufferContent.length - query_text_buffer.length, bufferContent.length);
+                    }
+                    worker_threads_1.parentPort.postMessage({ type: 3 });
+                    fs.closeSync(fd);
+                }
+                break;
+            case 4:
+                done = true;
+                break;
+        }
+    }
+    catch (e) {
+        console.log(e);
+    }
+}));
+//# sourceMappingURL=file.worker.js.map