@iikareem/litequeue 1.0.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 liteQueue Contributors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,413 @@
+<div align="center">
+
+# liteQueue
+
+**A persistent, zero-infrastructure task queue for Node.js — powered by SQLite.**
+
+[![GitHub](https://img.shields.io/badge/GitHub-iikareem/liteQueue-181717?logo=github)](https://github.com/iikareem/liteQueue)
+[![node](https://img.shields.io/badge/node-%3E%3D18.0.0-339933?logo=nodedotjs)](https://nodejs.org)
+[![license](https://img.shields.io/badge/license-MIT-blue)](./LICENSE)
+[![TypeScript](https://img.shields.io/badge/TypeScript-ready-3178C6?logo=typescript)](https://www.typescriptlang.org)
+[![npm](https://img.shields.io/badge/npm-v1.0.1-CB3837?logo=npm)](https://www.npmjs.com/package/@iikareem/litequeue)
+
+Delayed scheduling · Atomic job locking · Exponential backoff · CPU thread isolation
+
+**No Redis. No Docker. No infrastructure.**
+
+</div>
+
+---
+
+## Why liteQueue?
+
+Most apps don't need Redis. They need a reliable way to run background jobs without spinning up external services, managing connections, or paying for more infrastructure.
+
+| Feature | External Redis/Infra | liteQueue (SQLite) |
+| :--- | :--- | :--- |
+| **Visibility** | No visibility into what's running. | You can inspect, pause, and retry jobs. |
+| **Control** | Wait for the next poll cycle. | Trigger what is available to run right now. |
+| **Performance** | No insight into execution time. | See exactly how much time each job takes. |
+| **History** | Jobs are gone once processed. | Full history of completed and failed jobs. |
+
+**Your data stays local.** Because liteQueue uses SQLite, all job data is stored on your local disk rather than being sent over a network. This eliminates:
+- **Network Latency:** No round-trips to an external database.
+- **TLS Overhead:** No encryption/decryption cycles for every job enqueue.
+- **Connection Complexity:** No connection pooling or TCP handshake failures.
+
+Every external dependency adds a new failure domain. liteQueue eliminates all of it — your queue runs in-process. No TCP connections, no serialization hops, no dropped connections to retry.
+
+liteQueue uses SQLite as a persistent state machine. Jobs survive crashes, restarts, and deploys. Workers are isolated. Retries are automatic. And the entire thing is a single `npm install`.
+
+```
+Your App
+   │
+   ├── queue.register('send-email', handler)  ← runs once at boot
+   │
+   └── sendEmail({ to: 'user@example.com' })  ← runs on demand, anywhere
+              │
+              ▼
+        SQLite (WAL mode)
+              │
+        ┌─────┴─────────┐
+        │               │
+     pending  →  processing  →  completed
+                             └→ failed (after retries exhausted)
+```
+
+---
+
+## Install
+
+```bash
+npm install @iikareem/litequeue
+```
+
+**Requirements:** Node.js ≥ 18.0.0
+
+---
+
+## Quick Start
+
+```typescript
+import { LiteQ } from '@iikareem/litequeue';
+
+const queue = new LiteQ({ storagePath: './jobs.db' });
+
+// Register an I/O handler — returns a typed enqueuer function
+const sendEmail = queue.register<{ to: string; subject: string }>(
+    'send-email',
+    async (job) => {
+        await mailer.send(job.data.to, job.data.subject);
+        return { sent: true };
+    }
+);
+
+// Register a CPU handler — runs in a dedicated worker thread
+const generatePdf = queue.register('generate-pdf', './workers/pdf-worker.js');
+
+// Start the polling engine
+await queue.start();
+
+// Call the enqueuer from anywhere — fully typed, no raw strings
+await sendEmail({ to: 'user@example.com', subject: 'Welcome!' });
+await generatePdf({ orderId: 'ord_123' });
+```
+
+The string `'send-email'` is written **once** inside `register()`. The returned function is typed to your payload — no magic strings, no mismatches.
+
+---
+
+## How It Works
+
+### The Job Lifecycle
+
+| Step | What Happens |
+|---|---|
+| **Register** | `queue.register()` stores the handler and determines the execution type: **I/O** (function arg) or **CPU** (string path arg). Returns a typed enqueuer. |
+| **Enqueue** | Calling the enqueuer writes a row to SQLite with status `'pending'` and the execution type (`'io'` or `'worker'`). |
+| **Poll** | `queue.start()` polls every `pollInterval` ms, running `tryClaimIo()` and `tryClaimCpu()` independently. |
+| **Claim — I/O** | `tryClaimIo()` claims jobs where `type = 'io'`, gated by the `concurrency` counter. The handler runs directly on the main thread. |
+| **Claim — CPU** | `tryClaimCpu()` claims jobs where `type = 'worker'`, gated by the pool's `canAccept` (idle worker or room to spawn). Dispatched to a generic worker thread. |
+| **Success** | Status shifts to `'completed'`. |
+| **Failure** | Status returns to `'pending'`, attempts increment, `run_at` bumps with exponential backoff. |
+| **Dead** | After `max_retries` exhausted, status shifts to `'failed'`. |
+
+I/O and CPU jobs never block each other — they use independent concurrency controls.
+
+### The Generic Worker Pool
+
+CPU-bound jobs run in a pool of reusable worker threads. The pool is not coupled to handler paths — any idle worker can dynamically import and run any handler module.
+
+```
+pool.execute(handlerPath, job)
+       │
+       ├── idle worker? → dispatch(worker, handlerPath, job)
+       │
+       ├── room to spawn? → spawn() → dispatch(newWorker, handlerPath, job)
+       │
+       └── busy + at maxWorkers → queue internally → (dispatched when a worker frees)
+```
+
+When a job completes, the worker is marked idle and the pool drains its internal queue. Excess idle workers above `minWorkers` are automatically trimmed.
+
+### Delivery Guarantee & Crash Recovery
+
+liteQueue provides **at least once** delivery — a job will always run, but in rare cases (crash after execution, before the success is committed) it may retry. This means your handlers must be **idempotent**: running the same job twice should produce the same result as running it once.
+
+On restart, any job stuck in `'processing'` beyond `jobTimeout` is returned to `'pending'` and retried. **No job is ever silently lost.**
+
+---
+
+## API
+
+### Initialization
+
+```typescript
+import { LiteQ } from '@iikareem/litequeue';
+
+const queue = new LiteQ({
+    storagePath: './data/jobs.db', // or ':memory:' for tests
+    concurrency: 4,                // max concurrent I/O jobs (default: 1)
+    pollInterval: 500,             // ms between DB polls (default: 500)
+    jobTimeout: 60_000,            // ms before a stuck job is released (default: 60000)
+    minWorkers: 2,                 // min idle worker threads kept alive (default: 1)
+    maxWorkers: 4,                 // max concurrent worker threads (default: 4)
+});
+```
+
+| Option | Type | Default | Description |
+|---|---|---|---|
+| `storagePath` | `string` | — | SQLite file path (`':memory:'` for tests) |
+| `concurrency` | `number` | `1` | Max concurrent I/O jobs on the main thread |
+| `pollInterval` | `number` | `500` | ms between DB polls |
+| `jobTimeout` | `number` | `60000` | ms before a stuck `'processing'` job is released |
+| `minWorkers` | `number` | `1` | Min idle workers to keep alive |
+| `maxWorkers` | `number` | `4` | Max concurrent worker threads |
+
+---
+
+### `queue.register()` — Register a Handler
+
+Registers a handler and returns a **typed enqueuer function**. The job type string lives only here — never repeated.
+
+#### I/O Bound (async callback)
+
+Use for state-changing operations that **must** be durable: sending emails, SMS, processing payments, or triggering webhooks. These are tasks where you need at-least-once delivery and built-in retry logic to ensure the work is eventually completed without being "lost" or manually retried.
+
+Because liteQueue is **at least once**, a job may retry if a crash happens after execution but before the success is committed. Pass an **idempotency key** (e.g. `job.id`) to the external provider — it skips the work if it already saw that key.
+
+```typescript
+const sendEmail = queue.register<{ email: string; templateId: string }>(
+    'send-transactional-email',
+    async (job) => {
+        // Use job.id as the idempotency key — the provider
+        // guarantees it only processes this once.
+        await emailProvider.send(job.data.email, job.data.templateId, {
+            idempotencyKey: job.id,
+        });
+        return { sent: true };
+    }
+);
+```
+
+Avoid using this for simple, read-only `fetch` calls that don't require persistence or crash recovery.
+
+`register()` detects the function argument and marks this job with `type = 'io'` in the DB. Concurrency is managed by the `concurrency` counter — these run on the main thread.
+
+#### CPU Bound (worker thread)
+
+Pass a file path instead of a callback. liteQueue detects the string, resolves it to an absolute path, and marks the job with `type = 'worker'`. It runs in the generic worker pool, keeping the main event loop unblocked.
+
+Write a **handler module** — a file that exports a default async function. No `worker_threads` API needed.
+
+```typescript
+const generatePdf = queue.register('generate-pdf', './workers/pdf-worker.js');
+```
+
+```typescript
+// workers/pdf-worker.js — runs in an isolated CPU thread
+export default async function (job) {
+    const url = await buildAndUploadPdf(job.data);
+    return { url };
+}
+```
+
+Handler modules are dynamically imported by liteQueue's generic worker. Any idle thread can run any handler — the pool is not coupled to paths. Throw inside the handler and the error automatically propagates to liteQueue's retry logic.
+
+**The `job` object passed to your handler:**
+
+| Property | Type | Description |
+|---|---|---|
+| `job.id` | `string` | UUID |
+| `job.taskType` | `string` | The registered type name |
+| `job.data` | `T` | Your typed payload |
+| `job.attempts` | `number` | How many times this job has run |
+| `job.maxRetries` | `number` | Max attempts before permanent failure |
+
+---
+
+### Enqueueing Jobs
+
+Use the function returned by `register()`.
+
+```typescript
+// Immediate
+await sendEmail({ email: 'user@domain.com', templateId: 'welcome_v2' });
+
+// Delayed — run 1 hour from now
+await checkTrialExpiry({ userId: 'usr_9011' }, { delay: 60 * 60 * 1000 });
+
+// With custom retry config — retries at 1s → 2s → 4s → 8s → 16s
+await syncLedger({ transactionId: 'ch_3Mv1' }, { maxRetries: 5 });
+
+// With priority — runs before lower-priority jobs
+await sendAlert(data, { priority: 100 });
+```
+
+**Options:**
+
+| Option | Type | Default | Description |
+|---|---|---|---|
+| `delay` | `number` | `0` | Milliseconds before the job becomes eligible |
+| `maxRetries` | `number` | `3` | Max retry attempts before permanent failure |
+| `priority` | `number` | `10` | Higher value = runs first |
+
+---
+
+### Lifecycle Methods
+
+```typescript
+await queue.start();  // Begin polling — call once at boot
+
+await queue.stop();   // Graceful shutdown — drains pool, finishes in-flight jobs
+
+const stats = await queue.stats();
+// { pending: 3, processing: 1, completed: 142, failed: 2, total: 148 }
+
+await queue.purge({ olderThan: 7 * 24 * 60 * 60 * 1000 });
+// Removes completed/failed jobs older than 7 days
+```
+
+---
+
+## Recommended Project Setup
+
+```typescript
+// queue.ts — create the instance once
+import { LiteQ } from '@iikareem/litequeue';
+export const queue = new LiteQ({ storagePath: './jobs.db' });
+```
+
+```typescript
+// jobs/index.ts — register all handlers, export enqueuers
+import { queue } from '../queue.js';
+
+export const sendEmail = queue.register<{ to: string }>(
+    'send-email',
+    async (job) => { /* ... */ }
+);
+
+export const generateReport = queue.register(
+    'generate-report',
+    './workers/report.js'
+);
+```
+
+```typescript
+// main.ts — boot
+import { queue } from './queue.js';
+import './jobs/index.js'; // registers all handlers
+
+await queue.start();
+```
+
+```typescript
+// anywhere in your app
+import { sendEmail } from './jobs/index.js';
+
+await sendEmail({ to: 'user@example.com' });
+```
+
+---
+
+## Comparison
+
+| | liteQueue | BullMQ | Bee-Queue |
+|---|---|---|---|
+| Infrastructure required | **None** | Redis | Redis |
+| Persistent jobs | ✅ | ✅ | ❌ |
+| Survives crashes | ✅ | ✅ | ❌ |
+| CPU thread isolation | ✅ | ❌ | ❌ |
+| Delayed scheduling | ✅ | ✅ | ✅ |
+| Exponential backoff | ✅ | ✅ | ✅ |
+| Zero runtime deps | ✅ | ❌ | ❌ |
+| TypeScript built-in | ✅ | ✅ | ❌ |
+| Multi-machine workers | ❌ | ✅ | ✅ |
+
+**liteQueue is the right choice when** you want BullMQ-level reliability without operating Redis. If you need workers across multiple machines, use BullMQ.
+
+---
+
+## Database Internals
+
+liteQueue configures SQLite on startup for maximum concurrency and durability:
+
+```sql
+PRAGMA journal_mode = WAL;      -- concurrent readers, single writer
+PRAGMA busy_timeout = 5000;     -- wait up to 5s on write contention
+PRAGMA synchronous = NORMAL;    -- crash-safe without full fsync overhead
+```
+
+The `type` column distinguishes I/O jobs (main thread) from CPU jobs (worker thread), so each claim path queries only its own job type.
+
+```sql
+CREATE TABLE liteQueue_jobs (
+    id          TEXT     PRIMARY KEY,
+    name        TEXT     NOT NULL,         -- job type name: 'send-email', 'resize-image', etc.
+    type        TEXT     NOT NULL,         -- execution type: 'io' or 'worker'
+    payload     TEXT     NOT NULL,
+    status      TEXT     NOT NULL DEFAULT 'pending',
+    attempts    INTEGER  DEFAULT 0,
+    max_retries INTEGER  DEFAULT 3,
+    priority    INTEGER  DEFAULT 10,
+    run_at      INTEGER  NOT NULL,         -- epoch ms, eligible run time
+    locked_at   INTEGER,                   -- set when status = 'processing'
+    error_log   TEXT
+);
+
+-- Prevents full table scans during high-frequency polling
+CREATE INDEX IF NOT EXISTS idx_liteQueue_polling
+    ON liteQueue_jobs (status, type, run_at, priority DESC);
+```
+
+---
+
+## Roadmap
+
+### ✅ v1.0 — Core Engine
+SQLite WAL persistence · Atomic job locking · I/O + CPU concurrency separation · Generic worker pool with minWorkers/maxWorkers lifecycle · Exponential backoff · Delayed scheduling · Priority queues · Graceful shutdown · Handler modules (no `worker_threads` boilerplate)
+
+### 🔜 v1.1 — Scheduled Jobs
+```typescript
+queue.schedule('0 0 * * *', 'cleanup-sessions', {});
+```
+
+### 🔜 v1.2 — Built-in Idempotency
+```typescript
+await sendSms(data, {
+    uniqueKey: 'sms-verify-+1234567890',
+    uniqueWithin: 5 * 60 * 1000,
+});
+```
+
+### 🔜 v2.0 — Observability Dashboard
+Zero-config HTTP dashboard for queue observability — no external UI framework.
+
+---
+
+## FAQ
+
+**Does this work with multiple processes?**
+Yes. WAL mode supports concurrent readers and `BEGIN IMMEDIATE TRANSACTION` ensures no two processes ever claim the same job, even across separate OS processes on the same machine.
+
+**What happens if my app crashes mid-job?**
+Any job stuck in `'processing'` beyond `jobTimeout` is automatically returned to `'pending'` on the next restart. Because the success may or may not have been committed before the crash, liteQueue provides **at least once** delivery — your handler should use an idempotency key (e.g. `job.id`) to detect and skip duplicates.
+
+**When should I use BullMQ instead?**
+When you need workers distributed across multiple machines, or throughput above tens of thousands of jobs per second. liteQueue is intentionally scoped to single-node deployments.
+
+**Is TypeScript required?**
+No — works with plain JavaScript too. TypeScript types are bundled; no separate `@types` package needed.
+
+---
+
+## Links
+
+- **Source:** [github.com/iikareem/liteQueue](https://github.com/iikareem/liteQueue)
+- **Issues:** [github.com/iikareem/liteQueue/issues](https://github.com/iikareem/liteQueue/issues)
+
+---
+
+## License
+
+MIT © liteQueue Contributors

package/dist/db.d.ts

@@ -0,0 +1,43 @@
+export type ExecType = 'io' | 'worker';
+interface EnqueueRow {
+    id: string;
+    name: string;
+    type: ExecType;
+    payload: string;
+    runAt: number;
+    maxRetries: number;
+    priority: number;
+}
+export interface ClaimedJob {
+    id: string;
+    name: string;
+    type: ExecType;
+    payload: string;
+    attempts: number;
+    maxRetries: number;
+}
+export declare class DB {
+    private db;
+    private readonly enqueueStmt;
+    private readonly selectNextStmt;
+    private readonly lockJobStmt;
+    private readonly lockCrashedJobStmt;
+    private readonly completeStmt;
+    private readonly failStmt;
+    private readonly retryStmt;
+    constructor(storagePath: string);
+    initialize(): void;
+    enqueue(row: EnqueueRow): void;
+    claimNext(now: number, timeout: number, type: ExecType): ClaimedJob | null;
+    complete(jobId: string, completedAt: number): void;
+    fail(jobId: string, errorLog: string, completedAt: number): void;
+    retry(jobId: string, nextRunAt: number): void;
+    stats(): {
+        status: string;
+        count: number;
+    }[];
+    purge(before: number): void;
+    close(): void;
+}
+export {};
+//# sourceMappingURL=db.d.ts.map

package/dist/db.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"db.d.ts","sourceRoot":"","sources":["../src/db.ts"],"names":[],"mappings":"AAEA,MAAM,MAAM,QAAQ,GAAG,IAAI,GAAG,QAAQ,CAAC;AAEvC,UAAU,UAAU;IAChB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;CACpB;AAkBD,MAAM,WAAW,UAAU;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACtB;AAsED,qBAAa,EAAE;IACX,OAAO,CAAC,EAAE,CAAoB;IAC9B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC;IAC7B,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC;IAChC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC;IAC7B,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAC;IACpC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC;IAC9B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC;IAC1B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC;gBAEf,WAAW,EAAE,MAAM;IA6D/B,UAAU,IAAI,IAAI;IAOlB,OAAO,CAAC,GAAG,EAAE,UAAU,GAAG,IAAI;IAI9B,SAAS,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,UAAU,GAAG,IAAI;IAiB1E,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI;IAIlD,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI;IAIhE,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAI7C,KAAK,IAAI;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE;IAM5C,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAM3B,KAAK,IAAI,IAAI;CAGhB"}

package/dist/db.js

@@ -0,0 +1,176 @@
+import Database from 'better-sqlite3';
+const SCHEMA = `
+    DROP TABLE IF EXISTS liteQueue_jobs;
+
+    CREATE TABLE IF NOT EXISTS liteQueue_jobs
+    (
+        id
+        TEXT
+        PRIMARY
+        KEY,
+        name
+        TEXT
+        NOT
+        NULL,
+        type
+        TEXT
+        NOT
+        NULL,
+        payload
+        TEXT
+        NOT
+        NULL,
+        status
+        TEXT
+        NOT
+        NULL
+        DEFAULT
+        'pending',
+        attempts
+        INTEGER
+        DEFAULT
+        0,
+        max_retries
+        INTEGER
+        DEFAULT
+        3,
+        priority
+        INTEGER
+        DEFAULT
+        10,
+        run_at
+        INTEGER
+        NOT
+        NULL,
+        locked_at
+        INTEGER,
+        started_at
+        INTEGER,
+        completed_at
+        INTEGER,
+        error_log
+        TEXT
+    );
+
+    CREATE INDEX IF NOT EXISTS idx_liteQueue_polling
+        ON liteQueue_jobs (status, type, run_at, priority DESC);
+`;
+function toClaimedJob(row) {
+    return {
+        id: row.id,
+        name: row.name,
+        type: row.type,
+        payload: row.payload,
+        attempts: row.attempts,
+        maxRetries: row.max_retries,
+    };
+}
+export class DB {
+    db;
+    enqueueStmt;
+    selectNextStmt;
+    lockJobStmt;
+    lockCrashedJobStmt;
+    completeStmt;
+    failStmt;
+    retryStmt;
+    constructor(storagePath) {
+        this.db = new Database(storagePath);
+        this.initialize();
+        this.enqueueStmt = this.db.prepare(`
+            INSERT INTO liteQueue_jobs (id, name, type, payload, run_at, max_retries, priority)
+            VALUES (@id, @name, @type, @payload, @runAt, @maxRetries, @priority)
+        `);
+        this.selectNextStmt = this.db.prepare(`
+            SELECT *
+            FROM liteQueue_jobs
+            WHERE (status = 'pending' AND run_at <= ? AND type = ?)
+               OR (status = 'processing' AND started_at + ? <= ? AND type = ? AND attempts < max_retries)
+            ORDER BY priority DESC, run_at ASC LIMIT 1
+        `);
+        this.lockJobStmt = this.db.prepare(`
+            UPDATE liteQueue_jobs
+            SET status     = 'processing',
+                locked_at  = ?,
+                started_at = ?
+            WHERE id = ?
+        `);
+        this.lockCrashedJobStmt = this.db.prepare(`
+            UPDATE liteQueue_jobs
+            SET locked_at  = ?,
+                started_at = ?,
+                attempts   = ?
+            WHERE id = ?
+        `);
+        this.completeStmt = this.db.prepare(`
+            UPDATE liteQueue_jobs
+            SET status       = 'completed',
+                completed_at = ?
+            WHERE id = ?
+        `);
+        this.failStmt = this.db.prepare(`
+            UPDATE liteQueue_jobs
+            SET status       = 'failed',
+                error_log    = ?,
+                completed_at = ?
+            WHERE id = ?
+        `);
+        this.retryStmt = this.db.prepare(`
+            UPDATE liteQueue_jobs
+            SET status       = 'pending',
+                attempts     = attempts + 1,
+                locked_at    = NULL,
+                started_at   = NULL,
+                completed_at = NULL,
+                run_at       = ?
+            WHERE id = ?
+        `);
+    }
+    initialize() {
+        this.db.pragma('journal_mode = WAL');
+        this.db.pragma('busy_timeout = 5000');
+        this.db.pragma('synchronous = NORMAL');
+        this.db.exec(SCHEMA);
+    }
+    enqueue(row) {
+        this.enqueueStmt.run(row);
+    }
+    claimNext(now, timeout, type) {
+        const claim = this.db.transaction(() => {
+            const row = this.selectNextStmt.get(now, type, timeout, now, type);
+            if (!row)
+                return null;
+            if (row.status === 'processing') {
+                this.lockCrashedJobStmt.run(now, now, row.attempts + 1, row.id);
+            }
+            else {
+                this.lockJobStmt.run(now, now, row.id);
+            }
+            return row;
+        })();
+        return claim ? toClaimedJob(claim) : null;
+    }
+    complete(jobId, completedAt) {
+        this.completeStmt.run(completedAt, jobId);
+    }
+    fail(jobId, errorLog, completedAt) {
+        this.failStmt.run(errorLog, completedAt, jobId);
+    }
+    retry(jobId, nextRunAt) {
+        this.retryStmt.run(nextRunAt, jobId);
+    }
+    stats() {
+        return this.db
+            .prepare(`SELECT status, COUNT(*) AS count FROM liteQueue_jobs GROUP BY status`)
+            .all();
+    }
+    purge(before) {
+        this.db
+            .prepare(`DELETE FROM liteQueue_jobs WHERE status IN ('completed', 'failed') AND completed_at < ?`)
+            .run(before);
+    }
+    close() {
+        this.db.close();
+    }
+}
+//# sourceMappingURL=db.js.map

package/dist/db.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"db.js","sourceRoot":"","sources":["../src/db.ts"],"names":[],"mappings":"AAAA,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AAuCtC,MAAM,MAAM,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAuDd,CAAC;AAEF,SAAS,YAAY,CAAC,GAAU;IAC5B,OAAO;QACH,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,IAAI,EAAE,GAAG,CAAC,IAAgB;QAC1B,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,UAAU,EAAE,GAAG,CAAC,WAAW;KAC9B,CAAC;AACN,CAAC;AAED,MAAM,OAAO,EAAE;IACH,EAAE,CAAoB;IACb,WAAW,CAAC;IACZ,cAAc,CAAC;IACf,WAAW,CAAC;IACZ,kBAAkB,CAAC;IACnB,YAAY,CAAC;IACb,QAAQ,CAAC;IACT,SAAS,CAAC;IAE3B,YAAY,WAAmB;QAC3B,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,CAAC,UAAU,EAAE,CAAC;QAElB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;SAGlC,CAAC,CAAC;QAEH,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;SAMrC,CAAC,CAAC;QAEH,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;SAMlC,CAAC,CAAC;QAGH,IAAI,CAAC,kBAAkB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;SAMzC,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;SAKnC,CAAC,CAAC;QAEH,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;SAM/B,CAAC,CAAC;QAEH,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;;;SAShC,CAAC,CAAC;IACP,CAAC;IAED,UAAU;QACN,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;QACtC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC;QACvC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACzB,CAAC;IAED,OAAO,CAAC,GAAe;QACnB,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,SAAS,CAAC,GAAW,EAAE,OAAe,EAAE,IAAc;QAClD,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACnC,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,CAAsB,CAAC;YACxF,IAAI,CAAC,GAAG;gBAAE,OAAO,IAAI,CAAC;YAEtB,IAAI,GAAG,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;gBAC9B,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC;iBAAM,CAAC;gBACJ,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC;YAED,OAAO,GAAG,CAAC;QACf,CAAC,CAAC,EAAE,CAAC;QAEL,OAAO,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9C,CAAC;IAED,QAAQ,CAAC,KAAa,EAAE,WAAmB;QACvC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,CAAC,KAAa,EAAE,QAAgB,EAAE,WAAmB;QACrD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,KAAK,CAAC,KAAa,EAAE,SAAiB;QAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,KAAK;QACD,OAAO,IAAI,CAAC,EAAE;aACT,OAAO,CAAC,sEAAsE,CAAC;aAC/E,GAAG,EAAyC,CAAC;IACtD,CAAC;IAED,KAAK,CAAC,MAAc;QAChB,IAAI,CAAC,EAAE;aACF,OAAO,CAAC,yFAAyF,CAAC;aAClG,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IAED,KAAK;QACD,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;CACJ"}

package/dist/generic-worker.js

@@ -0,0 +1,18 @@
+import { parentPort } from 'node:worker_threads';
+
+parentPort.on('message', async ({ handlerPath, job }) => {
+  try {
+    const mod = await import(handlerPath);
+    const fn = mod.default;
+    if (typeof fn !== 'function') {
+      throw new Error(`Handler at "${handlerPath}" must export a default function`);
+    }
+    await fn(job);
+    parentPort.postMessage({ status: 'success' });
+  } catch (err) {
+    parentPort.postMessage({
+      status: 'error',
+      error: err instanceof Error ? err.message : String(err),
+    });
+  }
+});

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+export { LiteQ } from './queue.js';
+export type { LiteQOptions, Job, Enqueuer, EnqueueOptions, QueueStats, JobHandler, } from './types.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAC;AACjC,YAAY,EACR,YAAY,EACZ,GAAG,EACH,QAAQ,EACR,cAAc,EACd,UAAU,EACV,UAAU,GACb,MAAM,YAAY,CAAC"}

package/dist/index.js

@@ -0,0 +1,2 @@
+export { LiteQ } from './queue.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAC"}

package/dist/queue.d.ts

@@ -0,0 +1,27 @@
+import type { Enqueuer, JobHandler, LiteQOptions, PurgeOptions, QueueStats } from './types.js';
+export declare class LiteQ {
+    private readonly db;
+    private readonly handlers;
+    private readonly concurrency;
+    private readonly pollInterval;
+    private readonly jobTimeout;
+    private readonly pool;
+    private activeIo;
+    private timer;
+    constructor(options: LiteQOptions);
+    register<T>(type: string, handler: JobHandler<T>): Enqueuer<T>;
+    register(type: string, workerPath: string): Enqueuer<unknown>;
+    start(): Promise<void>;
+    stop(): Promise<void>;
+    stats(): Promise<QueueStats>;
+    purge(options: PurgeOptions): Promise<void>;
+    private enqueue;
+    private tick;
+    private tryClaimIo;
+    private tryClaimCpu;
+    private runJob;
+    private executeHandler;
+    private handleJobFailure;
+    private withTimeout;
+}
+//# sourceMappingURL=queue.d.ts.map

package/dist/queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../src/queue.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAiB,QAAQ,EAAO,UAAU,EAAE,YAAY,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAWnH,qBAAa,KAAK;IACd,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAK;IACxB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA0C;IACnE,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAS;IACtC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAa;IAClC,OAAO,CAAC,QAAQ,CAAK;IACrB,OAAO,CAAC,KAAK,CAA+C;gBAEhD,OAAO,EAAE,YAAY;IAYjC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC;IAavD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAItB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAQrB,KAAK,IAAI,OAAO,CAAC,UAAU,CAAC;IAkB5B,KAAK,CAAC,OAAO,EAAE,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC;YAInC,OAAO;IA8BrB,OAAO,CAAC,IAAI;IAKZ,OAAO,CAAC,UAAU;IAUlB,OAAO,CAAC,WAAW;YASL,MAAM;IAqBpB,OAAO,CAAC,cAAc;IAOtB,OAAO,CAAC,gBAAgB;IAYxB,OAAO,CAAC,WAAW;CActB"}

package/dist/queue.js

@@ -0,0 +1,177 @@
+import { randomUUID } from 'node:crypto';
+import os from 'node:os';
+import { resolve } from 'node:path';
+import { DB } from './db.js';
+import { WorkerPool } from './worker-pool.js';
+const CPU_COUNT = os.cpus().length;
+const DEFAULT_CONCURRENCY = 1;
+const DEFAULT_POLL_INTERVAL = 500;
+const DEFAULT_JOB_TIMEOUT = 60_000;
+const DEFAULT_MIN_WORKERS = 1;
+const DEFAULT_MAX_RETRIES = 3;
+const DEFAULT_PRIORITY = 10;
+export class LiteQ {
+    db;
+    handlers = new Map();
+    concurrency;
+    pollInterval;
+    jobTimeout;
+    pool;
+    activeIo = 0;
+    timer = null;
+    constructor(options) {
+        this.db = new DB(options.storagePath);
+        this.concurrency = options.concurrency ?? DEFAULT_CONCURRENCY;
+        this.pollInterval = options.pollInterval ?? DEFAULT_POLL_INTERVAL;
+        this.jobTimeout = options.jobTimeout ?? DEFAULT_JOB_TIMEOUT;
+        const minWorkers = options.minWorkers ?? DEFAULT_MIN_WORKERS;
+        const maxWorkers = resolveMaxWorkers(options.maxWorkers);
+        this.pool = new WorkerPool(minWorkers, maxWorkers);
+    }
+    register(type, handlerOrPath) {
+        if (typeof handlerOrPath === 'string') {
+            this.handlers.set(type, resolve(handlerOrPath));
+            return (data, options) => this.enqueue(type, data, options, 'worker');
+        }
+        this.handlers.set(type, handlerOrPath);
+        return (data, options) => this.enqueue(type, data, options, 'io');
+    }
+    async start() {
+        this.timer = setInterval(() => this.tick(), this.pollInterval);
+    }
+    async stop() {
+        if (this.timer) {
+            clearInterval(this.timer);
+            this.timer = null;
+        }
+        await this.pool.stop();
+    }
+    async stats() {
+        const rows = this.db.stats();
+        let total = 0;
+        const stats = { pending: 0, processing: 0, completed: 0, failed: 0, total: 0 };
+        for (const row of rows) {
+            const count = Number(row.count);
+            if (row.status === 'pending')
+                stats.pending = count;
+            else if (row.status === 'processing')
+                stats.processing = count;
+            else if (row.status === 'completed')
+                stats.completed = count;
+            else if (row.status === 'failed')
+                stats.failed = count;
+            total += count;
+        }
+        stats.total = total;
+        return stats;
+    }
+    async purge(options) {
+        this.db.purge(options.olderThan);
+    }
+    async enqueue(name, data, options, execType) {
+        const id = randomUUID();
+        const maxRetries = options?.maxRetries ?? DEFAULT_MAX_RETRIES;
+        const runAt = Date.now() + (options?.delay ?? 0);
+        this.db.enqueue({
+            id,
+            name,
+            type: execType,
+            payload: JSON.stringify(data),
+            runAt,
+            maxRetries,
+            priority: options?.priority ?? DEFAULT_PRIORITY,
+        });
+        return {
+            id,
+            taskType: name,
+            data,
+            attempts: 0,
+            maxRetries,
+            status: 'pending',
+        };
+    }
+    tick() {
+        this.tryClaimIo();
+        this.tryClaimCpu();
+    }
+    tryClaimIo() {
+        if (this.activeIo >= this.concurrency)
+            return;
+        const claimed = this.db.claimNext(Date.now(), this.jobTimeout, 'io');
+        if (!claimed)
+            return;
+        this.activeIo++;
+        this.runJob(claimed).finally(() => this.activeIo--);
+    }
+    tryClaimCpu() {
+        if (!this.pool.canAccept)
+            return;
+        const claimed = this.db.claimNext(Date.now(), this.jobTimeout, 'worker');
+        if (!claimed)
+            return;
+        this.runJob(claimed);
+    }
+    async runJob(claimed) {
+        const handler = this.handlers.get(claimed.name);
+        if (!handler) {
+            this.db.fail(claimed.id, `No handler registered for job type: ${claimed.name}`, Date.now());
+            return;
+        }
+        const job = toJob(claimed, JSON.parse(claimed.payload));
+        try {
+            await this.withTimeout(this.executeHandler(handler, job), this.jobTimeout);
+            this.db.complete(claimed.id, Date.now());
+        }
+        catch (err) {
+            this.handleJobFailure(claimed, err);
+        }
+    }
+    executeHandler(handler, job) {
+        if (typeof handler === 'function') {
+            return handler(job);
+        }
+        return this.pool.execute(handler, job);
+    }
+    handleJobFailure(claimed, err) {
+        const errorMsg = err instanceof Error ? err.message : String(err);
+        if (claimed.attempts < claimed.maxRetries) {
+            const backoffMs = Math.pow(2, claimed.attempts) * 1000;
+            this.db.retry(claimed.id, Date.now() + backoffMs);
+            return;
+        }
+        this.db.fail(claimed.id, errorMsg, Date.now());
+    }
+    withTimeout(promise, ms) {
+        let timeoutId;
+        const timeoutPromise = new Promise((_, reject) => {
+            timeoutId = setTimeout(() => reject(new Error(`Job timed out after ${ms}ms`)), ms);
+        });
+        return Promise.race([promise, timeoutPromise]).finally(() => {
+            clearTimeout(timeoutId);
+        });
+    }
+}
+function toJob(claimed, data) {
+    return {
+        id: claimed.id,
+        taskType: claimed.name,
+        data,
+        attempts: claimed.attempts,
+        maxRetries: claimed.maxRetries,
+        status: 'processing',
+    };
+}
+function resolveMaxWorkers(requested) {
+    const osReserved = Math.max(1, CPU_COUNT - 1);
+    if (requested === undefined) {
+        return Math.max(1, Math.floor(osReserved / 2));
+    }
+    if (requested > CPU_COUNT) {
+        throw new Error(`Your machine only has ${CPU_COUNT} cores, so you cannot use ${requested} workers.`);
+    }
+    if (requested > osReserved) {
+        console.warn(`Warning: Setting workers to ${requested} leaves no room for the OS. Recommended max is ${osReserved}.`);
+    }
+    return requested;
+}
+//# sourceMappingURL=queue.js.map

package/dist/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../src/queue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,UAAU,EAAC,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,EAAC,OAAO,EAAC,MAAM,WAAW,CAAC;AAElC,OAAO,EAAC,EAAE,EAAC,MAAM,SAAS,CAAC;AAE3B,OAAO,EAAC,UAAU,EAAC,MAAM,kBAAkB,CAAC;AAE5C,MAAM,SAAS,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC;AACnC,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,qBAAqB,GAAG,GAAG,CAAC;AAClC,MAAM,mBAAmB,GAAG,MAAM,CAAC;AACnC,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAC9B,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B,MAAM,OAAO,KAAK;IACG,EAAE,CAAK;IACP,QAAQ,GAAG,IAAI,GAAG,EAA+B,CAAC;IAClD,WAAW,CAAS;IACpB,YAAY,CAAS;IACrB,UAAU,CAAS;IACnB,IAAI,CAAa;IAC1B,QAAQ,GAAG,CAAC,CAAC;IACb,KAAK,GAA0C,IAAI,CAAC;IAE5D,YAAY,OAAqB;QAC7B,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAEtC,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,mBAAmB,CAAC;QAC9D,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,qBAAqB,CAAC;QAClE,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;QAE5D,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,mBAAmB,CAAC;QAC7D,MAAM,UAAU,GAAG,iBAAiB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACzD,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACvD,CAAC;IAID,QAAQ,CAAI,IAAY,EAAE,aAAqC;QAC3D,IAAI,OAAO,aAAa,KAAK,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,IAAO,EAAE,OAAwB,EAAE,EAAE,CACzC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QACpD,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,aAA2B,CAAC,CAAC;QACrD,OAAO,CAAC,IAAO,EAAE,OAAwB,EAAE,EAAE,CACzC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,KAAK;QACP,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;IACnE,CAAC;IAED,KAAK,CAAC,IAAI;QACN,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACtB,CAAC;QACD,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED,KAAK,CAAC,KAAK;QACP,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,KAAK,GAAe,EAAC,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAC,CAAC;QAEzF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAChC,IAAI,GAAG,CAAC,MAAM,KAAK,SAAS;gBAAE,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC;iBAC/C,IAAI,GAAG,CAAC,MAAM,KAAK,YAAY;gBAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC;iBAC1D,IAAI,GAAG,CAAC,MAAM,KAAK,WAAW;gBAAE,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC;iBACxD,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ;gBAAE,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC;YACvD,KAAK,IAAI,KAAK,CAAC;QACnB,CAAC;QAED,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,OAAqB;QAC7B,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACrC,CAAC;IAEO,KAAK,CAAC,OAAO,CACjB,IAAY,EACZ,IAAO,EACP,OAAmC,EACnC,QAAkB;QAElB,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,mBAAmB,CAAC;QAC9D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC;QAEjD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;YACZ,EAAE;YACF,IAAI;YACJ,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;YAC7B,KAAK;YACL,UAAU;YACV,QAAQ,EAAE,OAAO,EAAE,QAAQ,IAAI,gBAAgB;SAClD,CAAC,CAAC;QAEH,OAAO;YACH,EAAE;YACF,QAAQ,EAAE,IAAI;YACd,IAAI;YACJ,QAAQ,EAAE,CAAC;YACX,UAAU;YACV,MAAM,EAAE,SAAS;SACpB,CAAC;IACN,CAAC;IAEO,IAAI;QACR,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,IAAI,CAAC,WAAW,EAAE,CAAC;IACvB,CAAC;IAEO,UAAU;QACd,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE9C,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACxD,CAAC;IAEO,WAAW;QACf,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO;QAEjC,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QACzE,IAAI,CAAC,OAAO;YAAE,OAAO;QAErB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAEO,KAAK,CAAC,MAAM,CAAC,OAAmB;QACpC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,IAAI,CAAC,EAAE,CAAC,IAAI,CACR,OAAO,CAAC,EAAE,EACV,uCAAuC,OAAO,CAAC,IAAI,EAAE,EACrD,IAAI,CAAC,GAAG,EAAE,CACb,CAAC;YACF,OAAO;QACX,CAAC;QAED,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;QAExD,IAAI,CAAC;YACD,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3E,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC7C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACX,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACxC,CAAC;IACL,CAAC;IAEO,cAAc,CAAC,OAA4B,EAAE,GAAQ;QACzD,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE,CAAC;YAChC,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC3C,CAAC;IAEO,gBAAgB,CAAC,OAAmB,EAAE,GAAY;QACtD,MAAM,QAAQ,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAElE,IAAI,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;YACvD,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC;YAClD,OAAO;QACX,CAAC;QAED,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IACnD,CAAC;IAEO,WAAW,CAAI,OAAmB,EAAE,EAAU;QAClD,IAAI,SAAwC,CAAC;QAE7C,MAAM,cAAc,GAAG,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;YACpD,SAAS,GAAG,UAAU,CAClB,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,uBAAuB,EAAE,IAAI,CAAC,CAAC,EACtD,EAAE,CACL,CAAC;QACN,CAAC,CAAC,CAAC;QAEH,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE;YACxD,YAAY,CAAC,SAAS,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACP,CAAC;CACJ;AAED,SAAS,KAAK,CAAC,OAAmB,EAAE,IAAa;IAC7C,OAAO;QACH,EAAE,EAAE,OAAO,CAAC,EAAE;QACd,QAAQ,EAAE,OAAO,CAAC,IAAI;QACtB,IAAI;QACJ,QAAQ,EAAE,OAAO,CAAC,QAAQ;QAC1B,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,MAAM,EAAE,YAAY;KACvB,CAAC;AACN,CAAC;AAED,SAAS,iBAAiB,CAAC,SAAkB;IACzC,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC;IAE9C,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CACX,yBAAyB,SAAS,6BAA6B,SAAS,WAAW,CACtF,CAAC;IACN,CAAC;IAED,IAAI,SAAS,GAAG,UAAU,EAAE,CAAC;QACzB,OAAO,CAAC,IAAI,CACR,+BAA+B,SAAS,kDAAkD,UAAU,GAAG,CAC1G,CAAC;IACN,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,49 @@
+export type JobStatus = 'pending' | 'processing' | 'completed' | 'failed';
+export interface BackoffConfig {
+    type: 'exponential' | 'fixed';
+    delay: number;
+}
+export interface EnqueueOptions {
+    delay?: number;
+    maxRetries?: number;
+    priority?: number;
+    backoff?: BackoffConfig;
+}
+export interface Job<T = unknown> {
+    id: string;
+    taskType: string;
+    data: T;
+    attempts: number;
+    maxRetries: number;
+    status: JobStatus;
+    result?: unknown;
+    errorLog?: string;
+}
+export type Enqueuer<T = unknown> = (data: T, options?: EnqueueOptions) => Promise<Job<T>>;
+export interface QueueStats {
+    pending: number;
+    processing: number;
+    completed: number;
+    failed: number;
+    total: number;
+}
+export interface PurgeOptions {
+    olderThan: number;
+}
+export interface LiteQOptions {
+    storagePath: string;
+    concurrency?: number;
+    pollInterval?: number;
+    jobTimeout?: number;
+    minWorkers?: number;
+    maxWorkers?: number;
+}
+export type JobHandler<T = unknown> = (job: Job<T>) => Promise<unknown>;
+export interface LiteQEvents {
+    'job:success': [job: Job];
+    'job:failed': [job: Job, errorLog: string];
+    'job:retry': [job: Job];
+    'queue:start': [];
+    'queue:stop': [];
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,SAAS,GAAG,SAAS,GAAG,YAAY,GAAG,WAAW,GAAG,QAAQ,CAAC;AAE1E,MAAM,WAAW,aAAa;IAC1B,IAAI,EAAE,aAAa,GAAG,OAAO,CAAC;IAC9B,KAAK,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,cAAc;IAC3B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,aAAa,CAAC;CAC3B;AAED,MAAM,WAAW,GAAG,CAAC,CAAC,GAAG,OAAO;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,CAAC,CAAC;IACR,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,SAAS,CAAC;IAClB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,MAAM,QAAQ,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,cAAc,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAE3F,MAAM,WAAW,UAAU;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,YAAY;IACzB,SAAS,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,YAAY;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,MAAM,UAAU,CAAC,CAAC,GAAG,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC;AAExE,MAAM,WAAW,WAAW;IACxB,aAAa,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,YAAY,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC3C,WAAW,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACxB,aAAa,EAAE,EAAE,CAAC;IAClB,YAAY,EAAE,EAAE,CAAC;CACpB"}

package/dist/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":""}

package/dist/worker-pool.d.ts

@@ -0,0 +1,22 @@
+import type { Job } from './types.js';
+export declare class WorkerPool {
+    private minWorkers;
+    private maxWorkers;
+    private workers;
+    private queue;
+    private stopping;
+    constructor(minWorkers: number, maxWorkers: number);
+    get canAccept(): boolean;
+    execute(handlerPath: string, job: Job): Promise<void>;
+    stop(): Promise<void>;
+    private findIdle;
+    private acquireWorker;
+    private spawn;
+    private dispatch;
+    private processQueue;
+    private trimIdle;
+    private remove;
+    private clearPending;
+    private rejectPending;
+}
+//# sourceMappingURL=worker-pool.d.ts.map

package/dist/worker-pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"worker-pool.d.ts","sourceRoot":"","sources":["../src/worker-pool.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAC,GAAG,EAAC,MAAM,YAAY,CAAC;AA2BpC,qBAAa,UAAU;IAMf,OAAO,CAAC,UAAU;IAClB,OAAO,CAAC,UAAU;IANtB,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,KAAK,CAAmB;IAChC,OAAO,CAAC,QAAQ,CAAS;gBAGb,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM;IAG9B,IAAI,SAAS,IAAI,OAAO,CAEvB;IAED,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC;IAU/C,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAgB3B,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,aAAa;IAOrB,OAAO,CAAC,KAAK;IAqCb,OAAO,CAAC,QAAQ;IAShB,OAAO,CAAC,YAAY;IAoBpB,OAAO,CAAC,QAAQ;IAWhB,OAAO,CAAC,MAAM;IAKd,OAAO,CAAC,YAAY;IAKpB,OAAO,CAAC,aAAa;CAKxB"}

package/dist/worker-pool.js

@@ -0,0 +1,135 @@
+import { Worker } from 'node:worker_threads';
+import { fileURLToPath } from 'node:url';
+const GENERIC_WORKER = fileURLToPath(new URL('./generic-worker.js', import.meta.url));
+const POOL_STOPPED = new Error('Worker pool stopped');
+export class WorkerPool {
+    minWorkers;
+    maxWorkers;
+    workers = [];
+    queue = [];
+    stopping = false;
+    constructor(minWorkers, maxWorkers) {
+        this.minWorkers = minWorkers;
+        this.maxWorkers = maxWorkers;
+    }
+    get canAccept() {
+        return this.findIdle() !== undefined || this.workers.length < this.maxWorkers;
+    }
+    execute(handlerPath, job) {
+        const worker = this.acquireWorker();
+        if (!worker) {
+            return new Promise((resolve, reject) => {
+                this.queue.push({ handlerPath, job, resolve, reject });
+            });
+        }
+        return this.dispatch(worker, handlerPath, job);
+    }
+    async stop() {
+        this.stopping = true;
+        for (const entry of this.workers) {
+            this.rejectPending(entry, POOL_STOPPED);
+        }
+        for (const queued of this.queue) {
+            queued.reject(POOL_STOPPED);
+        }
+        this.queue = [];
+        const workers = this.workers.splice(0);
+        await Promise.all(workers.map((entry) => entry.worker.terminate()));
+    }
+    findIdle() {
+        return this.workers.find((worker) => !worker.busy);
+    }
+    acquireWorker() {
+        const idle = this.findIdle();
+        if (idle)
+            return idle;
+        if (this.workers.length < this.maxWorkers)
+            return this.spawn();
+        return undefined;
+    }
+    spawn() {
+        const worker = new Worker(GENERIC_WORKER);
+        const entry = { worker, busy: false, resolve: null, reject: null };
+        worker.on('message', (msg) => {
+            if (entry.reject) {
+                if (msg.status === 'error') {
+                    entry.reject(new Error(msg.error ?? 'Unknown worker error'));
+                }
+                else {
+                    entry.resolve();
+                }
+                this.clearPending(entry);
+            }
+            entry.busy = false;
+            this.processQueue();
+        });
+        worker.on('error', (err) => {
+            this.rejectPending(entry, err);
+            entry.busy = false;
+            this.remove(entry);
+            this.processQueue();
+        });
+        worker.on('exit', (code) => {
+            if (code !== 0) {
+                this.rejectPending(entry, new Error(`Worker exited with code ${code}`));
+            }
+            entry.busy = false;
+            this.remove(entry);
+            this.processQueue();
+        });
+        this.workers.push(entry);
+        return entry;
+    }
+    dispatch(entry, handlerPath, job) {
+        entry.busy = true;
+        return new Promise((resolve, reject) => {
+            entry.resolve = resolve;
+            entry.reject = reject;
+            entry.worker.postMessage({ handlerPath, job });
+        });
+    }
+    processQueue() {
+        if (this.stopping)
+            return;
+        const remaining = [];
+        for (const queued of this.queue) {
+            const worker = this.acquireWorker();
+            if (worker) {
+                this.dispatch(worker, queued.handlerPath, queued.job)
+                    .then(queued.resolve)
+                    .catch(queued.reject);
+            }
+            else {
+                remaining.push(queued);
+            }
+        }
+        this.queue = remaining;
+        this.trimIdle();
+    }
+    trimIdle() {
+        const idle = this.workers.filter((worker) => !worker.busy);
+        const excess = idle.length - this.minWorkers;
+        if (excess <= 0)
+            return;
+        for (const entry of idle.slice(0, excess)) {
+            this.remove(entry);
+            entry.worker.terminate();
+        }
+    }
+    remove(entry) {
+        const index = this.workers.indexOf(entry);
+        if (index >= 0)
+            this.workers.splice(index, 1);
+    }
+    clearPending(entry) {
+        entry.resolve = null;
+        entry.reject = null;
+    }
+    rejectPending(entry, err) {
+        if (!entry.reject)
+            return;
+        entry.reject(err);
+        this.clearPending(entry);
+    }
+}
+//# sourceMappingURL=worker-pool.js.map

package/dist/worker-pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"worker-pool.js","sourceRoot":"","sources":["../src/worker-pool.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAC,aAAa,EAAC,MAAM,UAAU,CAAC;AAsBvC,MAAM,cAAc,GAAG,aAAa,CAChC,IAAI,GAAG,CAAC,qBAAqB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAClD,CAAC;AAEF,MAAM,YAAY,GAAG,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;AAEtD,MAAM,OAAO,UAAU;IAMP;IACA;IANJ,OAAO,GAAiB,EAAE,CAAC;IAC3B,KAAK,GAAgB,EAAE,CAAC;IACxB,QAAQ,GAAG,KAAK,CAAC;IAEzB,YACY,UAAkB,EAClB,UAAkB;QADlB,eAAU,GAAV,UAAU,CAAQ;QAClB,eAAU,GAAV,UAAU,CAAQ;IAC3B,CAAC;IAEJ,IAAI,SAAS;QACT,OAAO,IAAI,CAAC,QAAQ,EAAE,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;IAClF,CAAC;IAED,OAAO,CAAC,WAAmB,EAAE,GAAQ;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBACnC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAC,WAAW,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;QACP,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,WAAW,EAAE,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,KAAK,CAAC,IAAI;QACN,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAErB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;QAC5C,CAAC;QAED,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAEhB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IACxE,CAAC;IAEO,QAAQ;QACZ,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC;IAEO,aAAa;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;QACtB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/D,OAAO,SAAS,CAAC;IACrB,CAAC;IAEO,KAAK;QACT,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,cAAc,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAe,EAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAC,CAAC;QAE7E,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAkB,EAAE,EAAE;YACxC,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;gBACf,IAAI,GAAG,CAAC,MAAM,KAAK,OAAO,EAAE,CAAC;oBACzB,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,IAAI,sBAAsB,CAAC,CAAC,CAAC;gBACjE,CAAC;qBAAM,CAAC;oBACJ,KAAK,CAAC,OAAQ,EAAE,CAAC;gBACrB,CAAC;gBACD,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;YACD,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,YAAY,EAAE,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACvB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC/B,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACnB,IAAI,CAAC,YAAY,EAAE,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;YACvB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,KAAK,CAAC,2BAA2B,IAAI,EAAE,CAAC,CAAC,CAAC;YAC5E,CAAC;YACD,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACnB,IAAI,CAAC,YAAY,EAAE,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC;IACjB,CAAC;IAEO,QAAQ,CAAC,KAAiB,EAAE,WAAmB,EAAE,GAAQ;QAC7D,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACnC,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;YACxB,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;YACtB,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,EAAC,WAAW,EAAE,GAAG,EAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACP,CAAC;IAEO,YAAY;QAChB,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAE1B,MAAM,SAAS,GAAgB,EAAE,CAAC;QAElC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YACpC,IAAI,MAAM,EAAE,CAAC;gBACT,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,GAAG,CAAC;qBAChD,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC;qBACpB,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACJ,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC;QACL,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;IAEO,QAAQ;QACZ,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;QAC7C,IAAI,MAAM,IAAI,CAAC;YAAE,OAAO;QAExB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;YACxC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACnB,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;QAC7B,CAAC;IACL,CAAC;IAEO,MAAM,CAAC,KAAiB;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,KAAK,IAAI,CAAC;YAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;IAEO,YAAY,CAAC,KAAiB;QAClC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;QACrB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;IACxB,CAAC;IAEO,aAAa,CAAC,KAAiB,EAAE,GAAY;QACjD,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO;QAC1B,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;CACJ"}

package/package.json

@@ -0,0 +1,37 @@
+{
+  "name": "@iikareem/litequeue",
+  "version": "1.0.1",
+  "description": "Zero-dependency, serverless, high-performance task queue engine powered by embedded SQLite in WAL mode",
+  "license": "MIT",
+  "type": "module",
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "scripts": {
+    "build": "tsc && cp src/generic-worker.js dist/generic-worker.js",
+    "prebuild": "rm -rf dist",
+    "typecheck": "tsc --noEmit",
+    "test": "node --test",
+    "manual": "tsx src/manual.ts",
+    "prepublishOnly": "npm run build"
+  },
+  "devDependencies": {
+    "@types/better-sqlite3": "^7.6.13",
+    "tsx": "^4.22.4",
+    "typescript": "^5.6.0",
+    "vitest": "^4.1.8"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "dependencies": {
+    "better-sqlite3": "^12.10.0"
+  }
+}