@danielsimonjr/memoryjs 1.0.0

package/dist/utils/taskScheduler.js

@@ -0,0 +1,487 @@
+/**
+ * Task Scheduler
+ *
+ * Advanced task scheduling utilities using workerpool.
+ * Phase 8 Sprint 4: Priority queues, concurrency control, progress tracking.
+ *
+ * **SECURITY WARNING:** TaskQueue uses `new Function()` internally for worker serialization.
+ * Task functions MUST be real function objects, never user-provided strings.
+ * Runtime validation ensures only function objects are accepted.
+ *
+ * @module utils/taskScheduler
+ */
+import workerpool from '@danielsimonjr/workerpool';
+/**
+ * Validates that the input is a real function object.
+ * Prevents code injection through string masquerading as functions.
+ *
+ * @param fn - Function to validate
+ * @param paramName - Parameter name for error message
+ * @throws {TypeError} If fn is not a function
+ * @internal
+ */
+function validateFunction(fn, paramName) {
+    if (typeof fn !== 'function') {
+        throw new TypeError(`${paramName} must be a function, got ${typeof fn}`);
+    }
+}
+// ==================== Types ====================
+/**
+ * Task priority levels.
+ * Higher priority tasks are executed first.
+ */
+export var TaskPriority;
+(function (TaskPriority) {
+    TaskPriority[TaskPriority["LOW"] = 0] = "LOW";
+    TaskPriority[TaskPriority["NORMAL"] = 1] = "NORMAL";
+    TaskPriority[TaskPriority["HIGH"] = 2] = "HIGH";
+    TaskPriority[TaskPriority["CRITICAL"] = 3] = "CRITICAL";
+})(TaskPriority || (TaskPriority = {}));
+/**
+ * Task status in the queue.
+ */
+export var TaskStatus;
+(function (TaskStatus) {
+    TaskStatus["PENDING"] = "pending";
+    TaskStatus["RUNNING"] = "running";
+    TaskStatus["COMPLETED"] = "completed";
+    TaskStatus["FAILED"] = "failed";
+    TaskStatus["CANCELLED"] = "cancelled";
+})(TaskStatus || (TaskStatus = {}));
+/**
+ * Priority Task Queue with advanced scheduling.
+ *
+ * Features:
+ * - Priority-based execution (CRITICAL > HIGH > NORMAL > LOW)
+ * - Configurable concurrency limits
+ * - Progress tracking
+ * - Graceful error handling
+ * - Task cancellation
+ *
+ * @example
+ * ```typescript
+ * const queue = new TaskQueue({ concurrency: 4 });
+ *
+ * // Add tasks with different priorities
+ * queue.enqueue({
+ *   id: 'task1',
+ *   priority: TaskPriority.HIGH,
+ *   fn: (x: number) => x * 2,
+ *   input: 5,
+ * });
+ *
+ * // Process all tasks
+ * const results = await queue.processAll();
+ * ```
+ */
+export class TaskQueue {
+    queue = [];
+    running = new Map();
+    completed = [];
+    pool = null;
+    concurrency;
+    defaultTimeout;
+    isProcessing = false;
+    totalExecutionTime = 0;
+    totalProcessed = 0;
+    useWorkerPool;
+    constructor(options = {}) {
+        this.concurrency = options.concurrency ?? Math.max(1, workerpool.cpus - 1);
+        this.defaultTimeout = options.timeout ?? 30000;
+        this.useWorkerPool = options.useWorkerPool ?? true;
+    }
+    /**
+     * Get or create the worker pool.
+     */
+    getPool() {
+        if (!this.pool) {
+            this.pool = workerpool.pool({
+                maxWorkers: this.concurrency,
+                workerType: 'thread',
+            });
+        }
+        return this.pool;
+    }
+    /**
+     * Add a task to the queue.
+     *
+     * @param task - Task to add
+     * @returns Promise that resolves when the task completes
+     */
+    enqueue(task) {
+        // Security: Validate that task.fn is a real function, not a user-provided string
+        validateFunction(task.fn, 'task.fn');
+        return new Promise((resolve, reject) => {
+            const queuedTask = {
+                ...task,
+                status: TaskStatus.PENDING,
+                addedAt: Date.now(),
+                resolve: resolve,
+                reject,
+            };
+            // Insert based on priority (higher priority first)
+            const insertIndex = this.queue.findIndex(t => t.priority < task.priority);
+            if (insertIndex === -1) {
+                this.queue.push(queuedTask);
+            }
+            else {
+                this.queue.splice(insertIndex, 0, queuedTask);
+            }
+            // Start processing if not already running
+            if (!this.isProcessing) {
+                this.processNext();
+            }
+        });
+    }
+    /**
+     * Process the next task in the queue.
+     */
+    async processNext() {
+        if (this.running.size >= this.concurrency || this.queue.length === 0) {
+            if (this.running.size === 0 && this.queue.length === 0) {
+                this.isProcessing = false;
+            }
+            return;
+        }
+        this.isProcessing = true;
+        const task = this.queue.shift();
+        if (!task)
+            return;
+        task.status = TaskStatus.RUNNING;
+        this.running.set(task.id, task);
+        const startTime = Date.now();
+        try {
+            // Execute task - try worker pool first, fall back to direct execution
+            let result;
+            if (this.useWorkerPool) {
+                try {
+                    const pool = this.getPool();
+                    const fnString = task.fn.toString();
+                    const timeout = task.timeout ?? this.defaultTimeout;
+                    result = await pool
+                        .exec((input, fnStr) => {
+                        // eslint-disable-next-line no-new-func
+                        const fn = new Function('return ' + fnStr)();
+                        return fn(input);
+                    }, [task.input, fnString])
+                        .timeout(timeout);
+                }
+                catch {
+                    // Fall back to direct execution
+                    result = await Promise.resolve(task.fn(task.input));
+                }
+            }
+            else {
+                // Direct execution without worker pool
+                result = await Promise.resolve(task.fn(task.input));
+            }
+            const endTime = Date.now();
+            const duration = endTime - startTime;
+            const taskResult = {
+                id: task.id,
+                status: TaskStatus.COMPLETED,
+                result,
+                duration,
+                startedAt: startTime,
+                completedAt: endTime,
+            };
+            this.totalExecutionTime += duration;
+            this.totalProcessed++;
+            this.completed.push(taskResult);
+            this.running.delete(task.id);
+            task.resolve(taskResult);
+        }
+        catch (error) {
+            const endTime = Date.now();
+            const duration = endTime - startTime;
+            const taskResult = {
+                id: task.id,
+                status: TaskStatus.FAILED,
+                error: error instanceof Error ? error : new Error(String(error)),
+                duration,
+                startedAt: startTime,
+                completedAt: endTime,
+            };
+            this.totalProcessed++;
+            this.completed.push(taskResult);
+            this.running.delete(task.id);
+            task.resolve(taskResult);
+        }
+        // Process next task
+        this.processNext();
+    }
+    /**
+     * Cancel a pending task.
+     *
+     * @param taskId - ID of the task to cancel
+     * @returns True if task was cancelled, false if not found or already running
+     */
+    cancel(taskId) {
+        const index = this.queue.findIndex(t => t.id === taskId);
+        if (index === -1)
+            return false;
+        const task = this.queue.splice(index, 1)[0];
+        task.status = TaskStatus.CANCELLED;
+        const result = {
+            id: task.id,
+            status: TaskStatus.CANCELLED,
+            duration: 0,
+            startedAt: Date.now(),
+            completedAt: Date.now(),
+        };
+        task.resolve(result);
+        return true;
+    }
+    /**
+     * Wait for all tasks to complete.
+     *
+     * @returns Array of all task results
+     */
+    async drain() {
+        // Wait for queue to empty and all running tasks to complete
+        while (this.queue.length > 0 || this.running.size > 0) {
+            await new Promise(resolve => setTimeout(resolve, 10));
+        }
+        return [...this.completed];
+    }
+    /**
+     * Get queue statistics.
+     */
+    getStats() {
+        return {
+            pending: this.queue.length,
+            running: this.running.size,
+            completed: this.completed.filter(r => r.status === TaskStatus.COMPLETED).length,
+            failed: this.completed.filter(r => r.status === TaskStatus.FAILED).length,
+            averageExecutionTime: this.totalProcessed > 0 ? this.totalExecutionTime / this.totalProcessed : 0,
+            totalProcessed: this.totalProcessed,
+        };
+    }
+    /**
+     * Clear all completed results.
+     */
+    clearCompleted() {
+        this.completed = [];
+    }
+    /**
+     * Shutdown the task queue and release resources.
+     */
+    async shutdown() {
+        // Cancel all pending tasks
+        for (const task of this.queue) {
+            task.status = TaskStatus.CANCELLED;
+            task.resolve({
+                id: task.id,
+                status: TaskStatus.CANCELLED,
+                duration: 0,
+                startedAt: Date.now(),
+                completedAt: Date.now(),
+            });
+        }
+        this.queue = [];
+        // Terminate worker pool
+        if (this.pool) {
+            await this.pool.terminate();
+            this.pool = null;
+        }
+        this.isProcessing = false;
+    }
+}
+// ==================== Batch Processing Utilities ====================
+/**
+ * Process items in parallel batches with progress tracking.
+ *
+ * Unlike parallelMap, this provides:
+ * - Progress callbacks
+ * - Configurable concurrency
+ * - Error handling options
+ * - Task-level timeouts
+ *
+ * @template T - Input item type
+ * @template R - Output item type
+ * @param items - Array of items to process
+ * @param fn - Processing function (must be serializable)
+ * @param options - Batch processing options
+ * @returns Array of results (or errors if stopOnError is false)
+ *
+ * @example
+ * ```typescript
+ * const results = await batchProcess(
+ *   urls,
+ *   (url: string) => fetch(url).then(r => r.json()),
+ *   {
+ *     concurrency: 5,
+ *     timeout: 10000,
+ *     onProgress: ({ completed, total, percentage }) => {
+ *       console.log(`Progress: ${percentage.toFixed(1)}%`);
+ *     },
+ *   }
+ * );
+ * ```
+ */
+export async function batchProcess(items, fn, options = {}) {
+    const { concurrency = Math.max(1, workerpool.cpus - 1), timeout = 30000, onProgress, stopOnError = false, } = options;
+    const results = [];
+    let completed = 0;
+    const total = items.length;
+    // Process in batches respecting concurrency
+    for (let i = 0; i < items.length; i += concurrency) {
+        const batch = items.slice(i, i + concurrency);
+        const batchPromises = batch.map(async (item, batchIndex) => {
+            const itemIndex = i + batchIndex;
+            try {
+                // Execute with timeout
+                const result = await Promise.race([
+                    Promise.resolve(fn(item)),
+                    new Promise((_, reject) => setTimeout(() => reject(new Error('Task timeout')), timeout)),
+                ]);
+                results[itemIndex] = { success: true, result };
+            }
+            catch (error) {
+                const err = error instanceof Error ? error : new Error(String(error));
+                results[itemIndex] = { success: false, error: err };
+                if (stopOnError) {
+                    throw err;
+                }
+            }
+            finally {
+                completed++;
+                if (onProgress) {
+                    onProgress({
+                        completed,
+                        total,
+                        percentage: (completed / total) * 100,
+                        currentTaskId: `item-${itemIndex}`,
+                    });
+                }
+            }
+        });
+        await Promise.all(batchPromises);
+    }
+    return results;
+}
+/**
+ * Execute tasks with rate limiting.
+ *
+ * Ensures tasks don't exceed a specified rate (tasks per second).
+ *
+ * @template T - Input item type
+ * @template R - Output item type
+ * @param items - Items to process
+ * @param fn - Processing function
+ * @param rateLimit - Maximum tasks per second
+ * @returns Array of results
+ *
+ * @example
+ * ```typescript
+ * // Process max 10 items per second
+ * const results = await rateLimitedProcess(
+ *   items,
+ *   (item) => processItem(item),
+ *   10
+ * );
+ * ```
+ */
+export async function rateLimitedProcess(items, fn, rateLimit) {
+    const results = [];
+    const minInterval = 1000 / rateLimit;
+    let lastExecutionTime = 0;
+    for (const item of items) {
+        // Calculate wait time
+        const now = Date.now();
+        const timeSinceLast = now - lastExecutionTime;
+        if (timeSinceLast < minInterval) {
+            await new Promise(resolve => setTimeout(resolve, minInterval - timeSinceLast));
+        }
+        lastExecutionTime = Date.now();
+        const result = await fn(item);
+        results.push(result);
+    }
+    return results;
+}
+/**
+ * Retry a function with exponential backoff.
+ *
+ * @template T - Return type
+ * @param fn - Function to retry
+ * @param options - Retry options
+ * @returns Result of the function
+ *
+ * @example
+ * ```typescript
+ * const result = await withRetry(
+ *   () => fetchData(),
+ *   { maxRetries: 3, baseDelay: 1000 }
+ * );
+ * ```
+ */
+export async function withRetry(fn, options = {}) {
+    const { maxRetries = 3, baseDelay = 1000, maxDelay = 30000, onRetry } = options;
+    let lastError;
+    for (let attempt = 0; attempt <= maxRetries; attempt++) {
+        try {
+            return await fn();
+        }
+        catch (error) {
+            lastError = error instanceof Error ? error : new Error(String(error));
+            if (attempt < maxRetries) {
+                const delay = Math.min(baseDelay * Math.pow(2, attempt), maxDelay);
+                if (onRetry) {
+                    onRetry(lastError, attempt + 1);
+                }
+                await new Promise(resolve => setTimeout(resolve, delay));
+            }
+        }
+    }
+    throw lastError;
+}
+/**
+ * Create a debounced version of a function.
+ *
+ * @template T - Function arguments type
+ * @template R - Return type
+ * @param fn - Function to debounce
+ * @param delay - Delay in milliseconds
+ * @returns Debounced function
+ */
+export function debounce(fn, delay) {
+    let timeoutId = null;
+    let pendingResolve = null;
+    return (...args) => {
+        return new Promise(resolve => {
+            if (timeoutId) {
+                clearTimeout(timeoutId);
+            }
+            pendingResolve = resolve;
+            timeoutId = setTimeout(() => {
+                const result = fn(...args);
+                if (pendingResolve) {
+                    pendingResolve(result);
+                }
+                timeoutId = null;
+                pendingResolve = null;
+            }, delay);
+        });
+    };
+}
+/**
+ * Create a throttled version of a function.
+ *
+ * @template T - Function arguments type
+ * @template R - Return type
+ * @param fn - Function to throttle
+ * @param limit - Minimum time between calls in milliseconds
+ * @returns Throttled function
+ */
+export function throttle(fn, limit) {
+    let lastCall = 0;
+    return (...args) => {
+        const now = Date.now();
+        if (now - lastCall >= limit) {
+            lastCall = now;
+            return fn(...args);
+        }
+        return undefined;
+    };
+}
+//# sourceMappingURL=taskScheduler.js.map

package/dist/utils/taskScheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"taskScheduler.js","sourceRoot":"","sources":["../../src/utils/taskScheduler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,UAAU,MAAM,2BAA2B,CAAC;AAEnD;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CAAC,EAAW,EAAE,SAAiB;IACtD,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;QAC7B,MAAM,IAAI,SAAS,CAAC,GAAG,SAAS,4BAA4B,OAAO,EAAE,EAAE,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC;AAED,kDAAkD;AAElD;;;GAGG;AACH,MAAM,CAAN,IAAY,YAKX;AALD,WAAY,YAAY;IACtB,6CAAO,CAAA;IACP,mDAAU,CAAA;IACV,+CAAQ,CAAA;IACR,uDAAY,CAAA;AACd,CAAC,EALW,YAAY,KAAZ,YAAY,QAKvB;AAED;;GAEG;AACH,MAAM,CAAN,IAAY,UAMX;AAND,WAAY,UAAU;IACpB,iCAAmB,CAAA;IACnB,iCAAmB,CAAA;IACnB,qCAAuB,CAAA;IACvB,+BAAiB,CAAA;IACjB,qCAAuB,CAAA;AACzB,CAAC,EANW,UAAU,KAAV,UAAU,QAMrB;AA8FD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,OAAO,SAAS;IACZ,KAAK,GAAiB,EAAE,CAAC;IACzB,OAAO,GAA4B,IAAI,GAAG,EAAE,CAAC;IAC7C,SAAS,GAAiB,EAAE,CAAC;IAC7B,IAAI,GAA2B,IAAI,CAAC;IACpC,WAAW,CAAS;IACpB,cAAc,CAAS;IACvB,YAAY,GAAG,KAAK,CAAC;IACrB,kBAAkB,GAAG,CAAC,CAAC;IACvB,cAAc,GAAG,CAAC,CAAC;IACnB,aAAa,CAAU;IAE/B,YAAY,UAA+E,EAAE;QAC3F,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC3E,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,OAAO,IAAI,KAAK,CAAC;QAC/C,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,IAAI,CAAC;IACrD,CAAC;IAED;;OAEG;IACK,OAAO;QACb,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC;gBAC1B,UAAU,EAAE,IAAI,CAAC,WAAW;gBAC5B,UAAU,EAAE,QAAQ;aACrB,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAO,IAAgB;QAC5B,iFAAiF;QACjF,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAErC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACrC,MAAM,UAAU,GAAqB;gBACnC,GAAG,IAAI;gBACP,MAAM,EAAE,UAAU,CAAC,OAAO;gBAC1B,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;gBACnB,OAAO,EAAE,OAAgD;gBACzD,MAAM;aACP,CAAC;YAEF,mDAAmD;YACnD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAwB,CAAC,CAAC;YAC5C,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,EAAE,UAAwB,CAAC,CAAC;YAC9D,CAAC;YAED,0CAA0C;YAC1C,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;gBACvB,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW;QACvB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrE,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvD,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;YAC5B,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAEhC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,IAAI,CAAC;YACH,sEAAsE;YACtE,IAAI,MAAe,CAAC;YAEpB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBACvB,IAAI,CAAC;oBACH,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;oBAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;oBACpC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,cAAc,CAAC;oBAEpD,MAAM,GAAG,MAAM,IAAI;yBAChB,IAAI,CACH,CAAC,KAAc,EAAE,KAAa,EAAE,EAAE;wBAChC,uCAAuC;wBACvC,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,SAAS,GAAG,KAAK,CAAC,EAAE,CAAC;wBAC7C,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC;oBACnB,CAAC,EACD,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CACvB;yBACA,OAAO,CAAC,OAAO,CAAC,CAAC;gBACtB,CAAC;gBAAC,MAAM,CAAC;oBACP,gCAAgC;oBAChC,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,uCAAuC;gBACvC,MAAM,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACtD,CAAC;YAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;YAErC,MAAM,UAAU,GAAe;gBAC7B,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,MAAM,EAAE,UAAU,CAAC,SAAS;gBAC5B,MAAM;gBACN,QAAQ;gBACR,SAAS,EAAE,SAAS;gBACpB,WAAW,EAAE,OAAO;aACrB,CAAC;YAEF,IAAI,CAAC,kBAAkB,IAAI,QAAQ,CAAC;YACpC,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC3B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,OAAO,GAAG,SAAS,CAAC;YAErC,MAAM,UAAU,GAAe;gBAC7B,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,MAAM,EAAE,UAAU,CAAC,MAAM;gBACzB,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChE,QAAQ;gBACR,SAAS,EAAE,SAAS;gBACpB,WAAW,EAAE,OAAO;aACrB,CAAC;YAEF,IAAI,CAAC,cAAc,EAAE,CAAC;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAChC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC3B,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,WAAW,EAAE,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,MAAc;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QACzD,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAE/B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC;QAEnC,MAAM,MAAM,GAAe;YACzB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,MAAM,EAAE,UAAU,CAAC,SAAS;YAC5B,QAAQ,EAAE,CAAC;YACX,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;SACxB,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,KAAK;QACT,4DAA4D;QAC5D,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM;YAC1B,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;YAC1B,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC,MAAM;YAC/E,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,CAAC,CAAC,MAAM;YACzE,oBAAoB,EAClB,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YAC7E,cAAc,EAAE,IAAI,CAAC,cAAc;SACpC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,cAAc;QACZ,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QACZ,2BAA2B;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,SAAS,CAAC;YACnC,IAAI,CAAC,OAAO,CAAC;gBACX,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,MAAM,EAAE,UAAU,CAAC,SAAS;gBAC5B,QAAQ,EAAE,CAAC;gBACX,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE;aACxB,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAEhB,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACnB,CAAC;QAED,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IAC5B,CAAC;CACF;AAED,uEAAuE;AAEvE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,KAAU,EACV,EAA+B,EAC/B,UAA4B,EAAE;IAE9B,MAAM,EACJ,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,GAAG,CAAC,CAAC,EAC9C,OAAO,GAAG,KAAK,EACf,UAAU,EACV,WAAW,GAAG,KAAK,GACpB,GAAG,OAAO,CAAC;IAEZ,MAAM,OAAO,GAA2E,EAAE,CAAC;IAC3F,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAE3B,4CAA4C;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC;QACnD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC;QAE9C,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE;YACzD,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,CAAC;YAEjC,IAAI,CAAC;gBACH,uBAAuB;gBACvB,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC;oBAChC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;oBACzB,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAC/B,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAC7D;iBACF,CAAC,CAAC;gBAEH,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;YACjD,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,MAAM,GAAG,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtE,OAAO,CAAC,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;gBAEpD,IAAI,WAAW,EAAE,CAAC;oBAChB,MAAM,GAAG,CAAC;gBACZ,CAAC;YACH,CAAC;oBAAS,CAAC;gBACT,SAAS,EAAE,CAAC;gBACZ,IAAI,UAAU,EAAE,CAAC;oBACf,UAAU,CAAC;wBACT,SAAS;wBACT,KAAK;wBACL,UAAU,EAAE,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,GAAG;wBACrC,aAAa,EAAE,QAAQ,SAAS,EAAE;qBACnC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,KAAU,EACV,EAA+B,EAC/B,SAAiB;IAEjB,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,WAAW,GAAG,IAAI,GAAG,SAAS,CAAC;IACrC,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,sBAAsB;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,GAAG,GAAG,iBAAiB,CAAC;QAC9C,IAAI,aAAa,GAAG,WAAW,EAAE,CAAC;YAChC,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC;QACjF,CAAC;QAED,iBAAiB,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,EAAwB,EACxB,UAKI,EAAE;IAEN,MAAM,EAAE,UAAU,GAAG,CAAC,EAAE,SAAS,GAAG,IAAI,EAAE,QAAQ,GAAG,KAAK,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;IAEhF,IAAI,SAA4B,CAAC;IAEjC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;QACvD,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,SAAS,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAEtE,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;gBACnE,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,CAAC,SAAS,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;gBAClC,CAAC;gBACD,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,SAAS,CAAC;AAClB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CACtB,EAAqB,EACrB,KAAa;IAEb,IAAI,SAAS,GAA0B,IAAI,CAAC;IAC5C,IAAI,cAAc,GAAgC,IAAI,CAAC;IAEvD,OAAO,CAAC,GAAG,IAAO,EAAc,EAAE;QAChC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE;YAC3B,IAAI,SAAS,EAAE,CAAC;gBACd,YAAY,CAAC,SAAS,CAAC,CAAC;YAC1B,CAAC;YACD,cAAc,GAAG,OAAO,CAAC;YAEzB,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC1B,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC3B,IAAI,cAAc,EAAE,CAAC;oBACnB,cAAc,CAAC,MAAM,CAAC,CAAC;gBACzB,CAAC;gBACD,SAAS,GAAG,IAAI,CAAC;gBACjB,cAAc,GAAG,IAAI,CAAC;YACxB,CAAC,EAAE,KAAK,CAAC,CAAC;QACZ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CACtB,EAAqB,EACrB,KAAa;IAEb,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,OAAO,CAAC,GAAG,IAAO,EAAiB,EAAE;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,GAAG,GAAG,QAAQ,IAAI,KAAK,EAAE,CAAC;YAC5B,QAAQ,GAAG,GAAG,CAAC;YACf,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;AACJ,CAAC"}

package/dist/workers/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Workers Module
+ *
+ * Worker thread utilities for parallel processing.
+ * Phase 8: Uses workerpool library for worker management.
+ *
+ * @module workers
+ */
+export type { Pool, PoolStats } from '@danielsimonjr/workerpool';
+export type { WorkerInput, MatchResult } from './levenshteinWorker.js';
+export { levenshteinDistance, similarity, searchEntities } from './levenshteinWorker.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/workers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/workers/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAGjE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,wBAAwB,CAAC;AACvE,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC"}

package/dist/workers/index.js

@@ -0,0 +1,10 @@
+/**
+ * Workers Module
+ *
+ * Worker thread utilities for parallel processing.
+ * Phase 8: Uses workerpool library for worker management.
+ *
+ * @module workers
+ */
+export { levenshteinDistance, similarity, searchEntities } from './levenshteinWorker.js';
+//# sourceMappingURL=index.js.map

package/dist/workers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/workers/index.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAOH,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC"}

package/dist/workers/levenshteinWorker.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Levenshtein Worker
+ *
+ * Worker thread for calculating Levenshtein distances in parallel.
+ * Uses workerpool for worker management.
+ *
+ * @module workers/levenshteinWorker
+ */
+/**
+ * Input data structure for the worker.
+ */
+export interface WorkerInput {
+    /** Search query string */
+    query: string;
+    /** Array of entities to search */
+    entities: Array<{
+        name: string;
+        nameLower: string;
+        observations: string[];
+    }>;
+    /** Similarity threshold (0.0 to 1.0) */
+    threshold: number;
+}
+/**
+ * Match result returned by the worker.
+ */
+export interface MatchResult {
+    /** Entity name that matched */
+    name: string;
+    /** Similarity score (0.0 to 1.0) */
+    score: number;
+    /** Where the match occurred */
+    matchedIn: 'name' | 'observation';
+}
+/**
+ * Calculate Levenshtein distance between two strings.
+ *
+ * Uses dynamic programming matrix for efficient computation.
+ *
+ * @param s1 - First string
+ * @param s2 - Second string
+ * @returns Levenshtein distance (number of edits)
+ */
+export declare function levenshteinDistance(s1: string, s2: string): number;
+/**
+ * Calculate similarity score between two strings.
+ *
+ * @param s1 - First string
+ * @param s2 - Second string
+ * @returns Similarity score (0.0 to 1.0, where 1.0 is identical)
+ */
+export declare function similarity(s1: string, s2: string): number;
+/**
+ * Search entities for fuzzy matches.
+ *
+ * @param data - Worker input containing query, entities, and threshold
+ * @returns Array of match results
+ */
+export declare function searchEntities(data: WorkerInput): MatchResult[];
+//# sourceMappingURL=levenshteinWorker.d.ts.map

package/dist/workers/levenshteinWorker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"levenshteinWorker.d.ts","sourceRoot":"","sources":["../../src/workers/levenshteinWorker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,0BAA0B;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,kCAAkC;IAClC,QAAQ,EAAE,KAAK,CAAC;QACd,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,MAAM,EAAE,CAAC;KACxB,CAAC,CAAC;IACH,wCAAwC;IACxC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,oCAAoC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,+BAA+B;IAC/B,SAAS,EAAE,MAAM,GAAG,aAAa,CAAC;CACnC;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAgClE;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAWzD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,WAAW,GAAG,WAAW,EAAE,CAwB/D"}