@orkestrel/worker 0.0.11 → 0.0.12

package/README.md

@@ -1,22 +1,19 @@
 # @orkestrel/worker
 
-A typed, resource-backed **job worker** for the `@orkestrel` line: a `Worker`
-is a `Queue` (`@orkestrel/queue`) whose handler runs against an automatically
-acquired resource leased from a `Pool` (`@orkestrel/pool`) — released when the
-job settles, even on throw. Composition, not reimplementation: all
-concurrency, retries, per-attempt timeout, abort, and durability are the
-Queue's; all idle reuse and `max` backpressure are the Pool's. The worker is
-observable (a typed `emitter` re-exposes the underlying queue's job lifecycle
-— `enqueue` / `start` / `retry` / `success` / `failure` / `abort` / `drain`).
-For CPU-parallel work, the server surface's `createNodeWorker` specializes the
-core `createWorker` over a pool of `node:worker_threads`, crossing the
-structured-clone boundary with zero `as` through `input` / `result` guards. Each
-thread handler receives `{ id, signal }`: `id` is the Queue's stable idempotency
-key across retries and crash restore, while `signal` is per attempt. The wire
-protocol separately mints a fresh correlation id for each dispatch so a stale
-reply cannot settle a later retry. The stable id identifies work, not a caller,
-and is not authentication or authorization evidence; per-job consumer context
-is explicit, structured-cloneable input rather than ambient thread state.
+> A resource-backed job worker: a thin facade composing a `Queue` (`@orkestrel/queue`) with
+> a `Pool` (`@orkestrel/pool`), where each job's handler runs against an automatically
+> acquired pooled resource released when the job settles.
+
+Create a worker with the `createWorker` function, give it the pool's `create` and
+`destroy` plus the handler each job runs, then `enqueue` inputs and await their
+results. Subscribe to the typed `emitter` for the job lifecycle the worker
+re-exposes from its underlying queue. Reach for the server surface's
+`createNodeWorker` where the work is CPU-bound: it specializes `createWorker`
+over a pool of `node:worker_threads` and crosses the structured-clone boundary
+through `input` and `result` guards with no `as`. A thread handler receives
+`{ id, signal }`: `id` is the Queue's stable idempotency key across retries and
+crash restore, and `signal` is per attempt. That id identifies work, not a
+caller, and is not authentication or authorization evidence.
 Part of the `@orkestrel` line.
 
 ## Install

package/dist/src/core/index.cjs

@@ -9,8 +9,8 @@ let _orkestrel_queue = require("@orkestrel/queue");
 *
 * @remarks
 * - **Composition, not reimplementation.** The Worker owns a `Pool` (built from
-*   `options.pool`) and a `Queue` whose handler ACQUIRES a pooled resource, runs the
-*   user handler against it, and RELEASES it in a `finally`. All concurrency, retries,
+*   `options.pool`) and a `Queue` whose handler `acquire`s a pooled resource, runs the
+*   user handler against it, and `release`s it in a `finally`. All concurrency, retries,
 *   timeout, and lifecycle are the Queue's — the Worker adds only the resource pairing.
 * - **Resource ↔ concurrency.** The queue strictly validates `concurrency` as a positive
 *   safe integer after caller options are captured once. Only `undefined` defaults
@@ -23,24 +23,24 @@ let _orkestrel_queue = require("@orkestrel/queue");
 *   `context.signal`, so an `abort` / `timeout` while waiting for a resource rejects
 *   the acquire — the Queue then handles retry / rejection, and there is no token to
 *   release (the resource was never leased).
-* - **Lifecycle (§10).** `enqueue` / `restore` / `start` / `stop` / `pause` / `resume` /
-*   `abort` / `clear` delegate to the queue; `count` / `active` / `paused` / `stopped`
-*   read it. `stop` / `abort` / `clear` return the queue's own cleanup barriers.
-*   `destroy` returns one stable barrier while it tears down the queue, then the pool,
-*   and destroys the worker emitter last. A sole cleanup failure is preserved by
+* - **Lifecycle (see the guide's `## Methods` section).** `enqueue` / `restore` / `start` /
+*   `stop` / `pause` / `resume` / `abort` / `clear` delegate to the queue; `count` / `active` /
+*   `paused` / `stopped` read it. `stop` / `abort` / `clear` return the queue's own cleanup
+*   barriers. `destroy` returns one stable barrier while it tears down the queue, then the
+*   pool, and destroys the worker emitter last. A sole cleanup failure is preserved by
 *   identity; failures from both layers become an ordered `AggregateError`.
 * - **Durability.** An optional `store` is passed straight through to the queue, so the
 *   worker's outstanding jobs persist; `restore` re-runs them (delegated to the queue).
-* - **Observable (§13).** The owned {@link emitter} ({@link WorkerEventMap}) RE-EXPOSES the
-*   underlying queue's job lifecycle (`enqueue` / `start` / `retry` / `success` / `failure` /
-*   `abort` / `drain`) as the worker's OWN events — bridged from the inner queue's emitter at
-*   construction — so a consumer observes the worker without reaching through to internals.
-*   The bridge re-emits directly on the worker's own emitter; the worker emitter isolates a
-*   listener throw and routes it to its `error` handler (the `error` option), so a buggy
-*   worker observer can never corrupt the inner queue or pool — the bridge listener never
-*   throws, so the inner queue's own emit stays balanced. The pool's create / acquire /
-*   release events stay the pool's internal concern (a Worker manages its own resources);
-*   observe a `Pool` directly for those.
+* - **Observable (see the guide's `## Observing` section).** The owned {@link emitter}
+*   ({@link WorkerEventMap}) re-exposes the underlying queue's job lifecycle (`enqueue` /
+*   `start` / `retry` / `success` / `failure` / `abort` / `drain`) as the worker's own events —
+*   bridged from the inner queue's emitter at construction — so a consumer observes the worker
+*   without reaching through to internals. The bridge re-emits directly on the worker's own
+*   emitter; the worker emitter isolates a listener throw and routes it to its `error` handler
+*   (the `error` option), so a buggy worker observer can never corrupt the inner queue or pool
+*   — the bridge listener never throws, so the inner queue's own emit stays balanced. The
+*   pool's create / acquire / release events stay the pool's internal concern (a Worker manages
+*   its own resources); observe a `Pool` directly for those.
 */
 var Worker = class {
 	#queue;
@@ -159,18 +159,19 @@ var Worker = class {
 //#endregion
 //#region src/core/factories.ts
 /**
-* Creates a resource-backed job worker — a `Queue` (`@orkestrel/queue`) marrying a `Pool`
-* (`@orkestrel/pool`). Each enqueued input runs through the handler against an
-* automatically acquired pooled resource (released when the job settles), with the
-* queue's bounded concurrency, retries, and per-attempt timeout / abort.
+* Creates a resource-backed job worker — a `Queue` (`@orkestrel/queue`) composed with a
+* `Pool` (`@orkestrel/pool`), where each enqueued input runs through the handler against
+* an automatically acquired pooled resource released when the job settles.
 *
 * @remarks
+* Bounded concurrency, retries, and the per-attempt timeout and abort are the queue's.
 * Default for the pool's `max`: the `concurrency` value, so resources match the jobs in flight.
 * Resources are reused across jobs. A handler that throws still releases its resource (the
 * acquire/release pair brackets the call in a `finally`), so a later job reuses it. The
 * lifecycle (`start` / `stop` / `pause` / `resume` / `abort` / `clear` / `destroy`)
-* delegates to the queue; `destroy` also tears the pool down. Observable (§13): a typed
-* `emitter` surfaces the queue lifecycle (`enqueue` / `start` / `success` / `failure` / …).
+* delegates to the queue; `destroy` also tears the pool down. It is observable (see the
+* guide's `## Observing` section): a typed `emitter` surfaces the queue lifecycle
+* (`enqueue` / `start` / `success` / `failure` / …).
 *
 * @typeParam TInput - The work input each job carries
 * @typeParam TResource - The pooled resource each job runs against
@@ -179,10 +180,12 @@ var Worker = class {
 *   `timeout`, `store`, `on`, and `error` keys (see {@link WorkerOptions})
 * @returns A working {@link WorkerInterface}
 *
-* @example
+* @example A resource-backed worker
 * ```ts
 * import { createWorker } from '@orkestrel/worker'
 *
+* // A Queue whose handler runs each job against a pooled resource (acquired before the
+* // handler, released after it — even on throw). The pool's `max` defaults to `concurrency`.
 * const worker = createWorker<Query, Connection, Rows>({
 * 	pool: { create: () => connect(), destroy: (connection) => connection.close() },
 * 	handler: (query, connection, { signal }) => connection.run(query, signal),
@@ -191,6 +194,7 @@ var Worker = class {
 * })
 *
 * const rows = await worker.enqueue(query)
+* await worker.destroy() // awaits queue cleanup, pool cleanup, then emitter teardown
 * ```
 */
 function createWorker(options) {

package/dist/src/core/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":["#queue","#pool","#emitter","#handler","#handle","#bridge","#ending","#teardown"],"sources":["../../../src/core/Worker.ts","../../../src/core/factories.ts"],"sourcesContent":["import type { EmitterInterface } from '@orkestrel/emitter'\nimport type { QueueContext, QueueEntryOptions } from '@orkestrel/queue'\nimport type { WorkerEventMap, WorkerHandler, WorkerInterface, WorkerOptions } from './types.js'\nimport { Emitter } from '@orkestrel/emitter'\nimport { Pool } from '@orkestrel/pool'\nimport { Queue } from '@orkestrel/queue'\n\n/**\n * Represents a resource-backed job worker — a thin facade composing a `Queue`\n * (`@orkestrel/queue`) with a `Pool` (`@orkestrel/pool`).\n *\n * @remarks\n * - **Composition, not reimplementation.** The Worker owns a `Pool` (built from\n *   `options.pool`) and a `Queue` whose handler ACQUIRES a pooled resource, runs the\n *   user handler against it, and RELEASES it in a `finally`. All concurrency, retries,\n *   timeout, and lifecycle are the Queue's — the Worker adds only the resource pairing.\n * - **Resource ↔ concurrency.** The queue strictly validates `concurrency` as a positive\n *   safe integer after caller options are captured once. Only `undefined` defaults\n *   `concurrency` to `1` or pool `max` to that value; runtime `null` reaches the owning\n *   validator. The queue validates before the pool option is read; every declared pool member\n *   is then captured once by direct access, preserving inherited and non-enumerable structural\n *   options. At most one resource exists per in-flight job by default, and idle resources are\n *   reused across jobs.\n * - **Acquire over the attempt signal.** Each job acquires using the attempt's\n *   `context.signal`, so an `abort` / `timeout` while waiting for a resource rejects\n *   the acquire — the Queue then handles retry / rejection, and there is no token to\n *   release (the resource was never leased).\n * - **Lifecycle (§10).** `enqueue` / `restore` / `start` / `stop` / `pause` / `resume` /\n *   `abort` / `clear` delegate to the queue; `count` / `active` / `paused` / `stopped`\n *   read it. `stop` / `abort` / `clear` return the queue's own cleanup barriers.\n *   `destroy` returns one stable barrier while it tears down the queue, then the pool,\n *   and destroys the worker emitter last. A sole cleanup failure is preserved by\n *   identity; failures from both layers become an ordered `AggregateError`.\n * - **Durability.** An optional `store` is passed straight through to the queue, so the\n *   worker's outstanding jobs persist; `restore` re-runs them (delegated to the queue).\n * - **Observable (§13).** The owned {@link emitter} ({@link WorkerEventMap}) RE-EXPOSES the\n *   underlying queue's job lifecycle (`enqueue` / `start` / `retry` / `success` / `failure` /\n *   `abort` / `drain`) as the worker's OWN events — bridged from the inner queue's emitter at\n *   construction — so a consumer observes the worker without reaching through to internals.\n *   The bridge re-emits directly on the worker's own emitter; the worker emitter isolates a\n *   listener throw and routes it to its `error` handler (the `error` option), so a buggy\n *   worker observer can never corrupt the inner queue or pool — the bridge listener never\n *   throws, so the inner queue's own emit stays balanced. The pool's create / acquire /\n *   release events stay the pool's internal concern (a Worker manages its own resources);\n *   observe a `Pool` directly for those.\n */\nexport class Worker<TInput, TResource, TResult> implements WorkerInterface<TInput, TResult> {\n\treadonly #queue: Queue<TInput, TResult>\n\treadonly #pool: Pool<TResource>\n\t// The PUSH observation surface (§13) — the worker's OWN emitter, fed by the queue→worker\n\t// bridge. The emitter isolates a worker observer's throw (routing it to the `error`\n\t// handler), so it never escapes into queue or pool.\n\treadonly #emitter: Emitter<WorkerEventMap<TResult>>\n\treadonly #handler: WorkerHandler<TInput, TResource, TResult>\n\t#ending: PromiseWithResolvers<void> | undefined\n\n\tconstructor(options: WorkerOptions<TInput, TResource, TResult>) {\n\t\tconst {\n\t\t\tconcurrency: capturedConcurrency,\n\t\t\thandler,\n\t\t\ton,\n\t\t\terror,\n\t\t\tretries,\n\t\t\ttimeout,\n\t\t\tstore,\n\t\t} = options\n\t\tconst concurrency = capturedConcurrency === undefined ? 1 : capturedConcurrency\n\t\tthis.#handler = handler\n\t\tthis.#emitter = new Emitter<WorkerEventMap<TResult>>({\n\t\t\t...(on !== undefined ? { on } : {}),\n\t\t\t...(error !== undefined ? { error } : {}),\n\t\t})\n\t\tthis.#queue = new Queue<TInput, TResult>({\n\t\t\thandler: this.#handle.bind(this),\n\t\t\tconcurrency,\n\t\t\t...(retries !== undefined ? { retries } : {}),\n\t\t\t...(timeout !== undefined ? { timeout } : {}),\n\t\t\t...(store !== undefined ? { store } : {}),\n\t\t})\n\t\tconst pool = options.pool\n\t\tconst { max, on: poolOn, error: poolError, create, destroy, validate } = pool\n\t\tthis.#pool = new Pool<TResource>({\n\t\t\tcreate,\n\t\t\tmax: max === undefined ? concurrency : max,\n\t\t\t...(poolOn !== undefined ? { on: poolOn } : {}),\n\t\t\t...(poolError !== undefined ? { error: poolError } : {}),\n\t\t\t...(destroy !== undefined ? { destroy } : {}),\n\t\t\t...(validate !== undefined ? { validate } : {}),\n\t\t})\n\t\tthis.#bridge()\n\t}\n\n\tget emitter(): EmitterInterface<WorkerEventMap<TResult>> {\n\t\treturn this.#emitter\n\t}\n\n\tget count(): number {\n\t\treturn this.#queue.count\n\t}\n\n\tget active(): number {\n\t\treturn this.#queue.active\n\t}\n\n\tget paused(): boolean {\n\t\treturn this.#queue.paused\n\t}\n\n\tget stopped(): boolean {\n\t\treturn this.#queue.stopped\n\t}\n\n\tenqueue(input: TInput, options?: QueueEntryOptions): Promise<TResult> {\n\t\treturn this.#queue.enqueue(input, options)\n\t}\n\n\trestore(): Promise<void> {\n\t\treturn this.#queue.restore()\n\t}\n\n\tstart(): void {\n\t\tthis.#queue.start()\n\t}\n\n\tstop(): Promise<void> {\n\t\treturn this.#queue.stop()\n\t}\n\n\tpause(): void {\n\t\tthis.#queue.pause()\n\t}\n\n\tresume(): void {\n\t\tthis.#queue.resume()\n\t}\n\n\tabort(reason?: unknown): Promise<void> {\n\t\treturn this.#queue.abort(reason)\n\t}\n\n\tclear(): Promise<void> {\n\t\treturn this.#queue.clear()\n\t}\n\n\tdestroy(): Promise<void> {\n\t\tif (this.#ending !== undefined) return this.#ending.promise\n\t\tconst ending = Promise.withResolvers<void>()\n\t\tthis.#ending = ending\n\t\tvoid this.#teardown(ending)\n\t\treturn ending.promise\n\t}\n\n\tasync #handle(input: TInput, context: QueueContext): Promise<TResult> {\n\t\tconst token = await this.#pool.acquire(context.signal)\n\t\ttry {\n\t\t\treturn await this.#handler(input, token.value, context)\n\t\t} finally {\n\t\t\ttoken.release()\n\t\t}\n\t}\n\n\tasync #teardown(ending: PromiseWithResolvers<void>): Promise<void> {\n\t\tconst failures: unknown[] = []\n\t\ttry {\n\t\t\tawait this.#queue.destroy()\n\t\t} catch (error) {\n\t\t\tfailures.push(error)\n\t\t}\n\t\ttry {\n\t\t\tawait this.#pool.destroy()\n\t\t} catch (error) {\n\t\t\tfailures.push(error)\n\t\t}\n\t\tthis.#emitter.destroy()\n\t\tif (failures.length === 0) ending.resolve()\n\t\telse if (failures.length === 1) ending.reject(failures[0])\n\t\telse ending.reject(new AggregateError(failures, 'worker destroy cleanup failed'))\n\t}\n\n\t// Bridge the inner queue's lifecycle onto the worker's OWN emitter, once at construction.\n\t// Each listener re-emits the queue event directly on the worker's emitter, which isolates a\n\t// worker observer's throw (routing it to the worker's `error` handler). Because the bridge\n\t// listener itself never throws, the queue's own `#emitter.emit` — which invoked this\n\t// listener — sees no throw, so the inner queue's engine stays balanced regardless of what a\n\t// worker observer does. The events are already post-transition (they fire from the queue's\n\t// own post-settle / post-wake emits), so this stays observation.\n\t#bridge(): void {\n\t\tconst queue = this.#queue.emitter\n\t\tqueue.on('enqueue', (id) => this.#emitter.emit('enqueue', id))\n\t\tqueue.on('start', (id) => this.#emitter.emit('start', id))\n\t\tqueue.on('retry', (id, attempt) => this.#emitter.emit('retry', id, attempt))\n\t\tqueue.on('success', (id, result) => this.#emitter.emit('success', id, result))\n\t\tqueue.on('failure', (id, error) => this.#emitter.emit('failure', id, error))\n\t\tqueue.on('abort', (reason) => this.#emitter.emit('abort', reason))\n\t\tqueue.on('drain', () => this.#emitter.emit('drain'))\n\t}\n}\n","import type { WorkerInterface, WorkerOptions } from './types.js'\nimport { Worker } from './Worker.js'\n\n/**\n * Creates a resource-backed job worker — a `Queue` (`@orkestrel/queue`) marrying a `Pool`\n * (`@orkestrel/pool`). Each enqueued input runs through the handler against an\n * automatically acquired pooled resource (released when the job settles), with the\n * queue's bounded concurrency, retries, and per-attempt timeout / abort.\n *\n * @remarks\n * Default for the pool's `max`: the `concurrency` value, so resources match the jobs in flight.\n * Resources are reused across jobs. A handler that throws still releases its resource (the\n * acquire/release pair brackets the call in a `finally`), so a later job reuses it. The\n * lifecycle (`start` / `stop` / `pause` / `resume` / `abort` / `clear` / `destroy`)\n * delegates to the queue; `destroy` also tears the pool down. Observable (§13): a typed\n * `emitter` surfaces the queue lifecycle (`enqueue` / `start` / `success` / `failure` / …).\n *\n * @typeParam TInput - The work input each job carries\n * @typeParam TResource - The pooled resource each job runs against\n * @typeParam TResult - The value the handler resolves for a job\n * @param options - The `handler` and `pool` plus the optional `concurrency`, `retries`,\n *   `timeout`, `store`, `on`, and `error` keys (see {@link WorkerOptions})\n * @returns A working {@link WorkerInterface}\n *\n * @example\n * ```ts\n * import { createWorker } from '@orkestrel/worker'\n *\n * const worker = createWorker<Query, Connection, Rows>({\n * \tpool: { create: () => connect(), destroy: (connection) => connection.close() },\n * \thandler: (query, connection, { signal }) => connection.run(query, signal),\n * \tconcurrency: 4,\n * \tretries: 1,\n * })\n *\n * const rows = await worker.enqueue(query)\n * ```\n */\nexport function createWorker<TInput, TResource, TResult>(\n\toptions: WorkerOptions<TInput, TResource, TResult>,\n): WorkerInterface<TInput, TResult> {\n\treturn new Worker(options)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CA,IAAa,SAAb,MAA4F;CAC3F;CACA;CAIA;CACA;CACA;CAEA,YAAY,SAAoD;EAC/D,MAAM,EACL,aAAa,qBACb,SACA,IACA,OACA,SACA,SACA,UACG;EACJ,MAAM,cAAc,wBAAwB,KAAA,IAAY,IAAI;EAC5D,KAAKG,WAAW;EAChB,KAAKD,WAAW,IAAI,mBAAA,QAAiC;GACpD,GAAI,OAAO,KAAA,IAAY,EAAE,GAAG,IAAI,CAAC;GACjC,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;EACxC,CAAC;EACD,KAAKF,SAAS,IAAI,iBAAA,MAAuB;GACxC,SAAS,KAAKI,QAAQ,KAAK,IAAI;GAC/B;GACA,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;GAC3C,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;GAC3C,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;EACxC,CAAC;EAED,MAAM,EAAE,KAAK,IAAI,QAAQ,OAAO,WAAW,QAAQ,SAAS,aAD/C,QAAQ;EAErB,KAAKH,QAAQ,IAAI,gBAAA,KAAgB;GAChC;GACA,KAAK,QAAQ,KAAA,IAAY,cAAc;GACvC,GAAI,WAAW,KAAA,IAAY,EAAE,IAAI,OAAO,IAAI,CAAC;GAC7C,GAAI,cAAc,KAAA,IAAY,EAAE,OAAO,UAAU,IAAI,CAAC;GACtD,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;GAC3C,GAAI,aAAa,KAAA,IAAY,EAAE,SAAS,IAAI,CAAC;EAC9C,CAAC;EACD,KAAKI,QAAQ;CACd;CAEA,IAAI,UAAqD;EACxD,OAAO,KAAKH;CACb;CAEA,IAAI,QAAgB;EACnB,OAAO,KAAKF,OAAO;CACpB;CAEA,IAAI,SAAiB;EACpB,OAAO,KAAKA,OAAO;CACpB;CAEA,IAAI,SAAkB;EACrB,OAAO,KAAKA,OAAO;CACpB;CAEA,IAAI,UAAmB;EACtB,OAAO,KAAKA,OAAO;CACpB;CAEA,QAAQ,OAAe,SAA+C;EACrE,OAAO,KAAKA,OAAO,QAAQ,OAAO,OAAO;CAC1C;CAEA,UAAyB;EACxB,OAAO,KAAKA,OAAO,QAAQ;CAC5B;CAEA,QAAc;EACb,KAAKA,OAAO,MAAM;CACnB;CAEA,OAAsB;EACrB,OAAO,KAAKA,OAAO,KAAK;CACzB;CAEA,QAAc;EACb,KAAKA,OAAO,MAAM;CACnB;CAEA,SAAe;EACd,KAAKA,OAAO,OAAO;CACpB;CAEA,MAAM,QAAiC;EACtC,OAAO,KAAKA,OAAO,MAAM,MAAM;CAChC;CAEA,QAAuB;EACtB,OAAO,KAAKA,OAAO,MAAM;CAC1B;CAEA,UAAyB;EACxB,IAAI,KAAKM,YAAY,KAAA,GAAW,OAAO,KAAKA,QAAQ;EACpD,MAAM,SAAS,QAAQ,cAAoB;EAC3C,KAAKA,UAAU;EACf,KAAUC,UAAU,MAAM;EAC1B,OAAO,OAAO;CACf;CAEA,MAAMH,QAAQ,OAAe,SAAyC;EACrE,MAAM,QAAQ,MAAM,KAAKH,MAAM,QAAQ,QAAQ,MAAM;EACrD,IAAI;GACH,OAAO,MAAM,KAAKE,SAAS,OAAO,MAAM,OAAO,OAAO;EACvD,UAAU;GACT,MAAM,QAAQ;EACf;CACD;CAEA,MAAMI,UAAU,QAAmD;EAClE,MAAM,WAAsB,CAAC;EAC7B,IAAI;GACH,MAAM,KAAKP,OAAO,QAAQ;EAC3B,SAAS,OAAO;GACf,SAAS,KAAK,KAAK;EACpB;EACA,IAAI;GACH,MAAM,KAAKC,MAAM,QAAQ;EAC1B,SAAS,OAAO;GACf,SAAS,KAAK,KAAK;EACpB;EACA,KAAKC,SAAS,QAAQ;EACtB,IAAI,SAAS,WAAW,GAAG,OAAO,QAAQ;OACrC,IAAI,SAAS,WAAW,GAAG,OAAO,OAAO,SAAS,EAAE;OACpD,OAAO,OAAO,IAAI,eAAe,UAAU,+BAA+B,CAAC;CACjF;CASA,UAAgB;EACf,MAAM,QAAQ,KAAKF,OAAO;EAC1B,MAAM,GAAG,YAAY,OAAO,KAAKE,SAAS,KAAK,WAAW,EAAE,CAAC;EAC7D,MAAM,GAAG,UAAU,OAAO,KAAKA,SAAS,KAAK,SAAS,EAAE,CAAC;EACzD,MAAM,GAAG,UAAU,IAAI,YAAY,KAAKA,SAAS,KAAK,SAAS,IAAI,OAAO,CAAC;EAC3E,MAAM,GAAG,YAAY,IAAI,WAAW,KAAKA,SAAS,KAAK,WAAW,IAAI,MAAM,CAAC;EAC7E,MAAM,GAAG,YAAY,IAAI,UAAU,KAAKA,SAAS,KAAK,WAAW,IAAI,KAAK,CAAC;EAC3E,MAAM,GAAG,UAAU,WAAW,KAAKA,SAAS,KAAK,SAAS,MAAM,CAAC;EACjE,MAAM,GAAG,eAAe,KAAKA,SAAS,KAAK,OAAO,CAAC;CACpD;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC9JA,SAAgB,aACf,SACmC;CACnC,OAAO,IAAI,OAAO,OAAO;AAC1B"}
+{"version":3,"file":"index.cjs","names":[],"sources":["../../../src/core/Worker.ts","../../../src/core/factories.ts"],"sourcesContent":["import type { EmitterInterface } from '@orkestrel/emitter'\nimport type { QueueContext, QueueEntryOptions } from '@orkestrel/queue'\nimport type { WorkerEventMap, WorkerHandler, WorkerInterface, WorkerOptions } from './types.js'\nimport { Emitter } from '@orkestrel/emitter'\nimport { Pool } from '@orkestrel/pool'\nimport { Queue } from '@orkestrel/queue'\n\n/**\n * Represents a resource-backed job worker — a thin facade composing a `Queue`\n * (`@orkestrel/queue`) with a `Pool` (`@orkestrel/pool`).\n *\n * @remarks\n * - **Composition, not reimplementation.** The Worker owns a `Pool` (built from\n *   `options.pool`) and a `Queue` whose handler `acquire`s a pooled resource, runs the\n *   user handler against it, and `release`s it in a `finally`. All concurrency, retries,\n *   timeout, and lifecycle are the Queue's — the Worker adds only the resource pairing.\n * - **Resource ↔ concurrency.** The queue strictly validates `concurrency` as a positive\n *   safe integer after caller options are captured once. Only `undefined` defaults\n *   `concurrency` to `1` or pool `max` to that value; runtime `null` reaches the owning\n *   validator. The queue validates before the pool option is read; every declared pool member\n *   is then captured once by direct access, preserving inherited and non-enumerable structural\n *   options. At most one resource exists per in-flight job by default, and idle resources are\n *   reused across jobs.\n * - **Acquire over the attempt signal.** Each job acquires using the attempt's\n *   `context.signal`, so an `abort` / `timeout` while waiting for a resource rejects\n *   the acquire — the Queue then handles retry / rejection, and there is no token to\n *   release (the resource was never leased).\n * - **Lifecycle (see the guide's `## Methods` section).** `enqueue` / `restore` / `start` /\n *   `stop` / `pause` / `resume` / `abort` / `clear` delegate to the queue; `count` / `active` /\n *   `paused` / `stopped` read it. `stop` / `abort` / `clear` return the queue's own cleanup\n *   barriers. `destroy` returns one stable barrier while it tears down the queue, then the\n *   pool, and destroys the worker emitter last. A sole cleanup failure is preserved by\n *   identity; failures from both layers become an ordered `AggregateError`.\n * - **Durability.** An optional `store` is passed straight through to the queue, so the\n *   worker's outstanding jobs persist; `restore` re-runs them (delegated to the queue).\n * - **Observable (see the guide's `## Observing` section).** The owned {@link emitter}\n *   ({@link WorkerEventMap}) re-exposes the underlying queue's job lifecycle (`enqueue` /\n *   `start` / `retry` / `success` / `failure` / `abort` / `drain`) as the worker's own events —\n *   bridged from the inner queue's emitter at construction — so a consumer observes the worker\n *   without reaching through to internals. The bridge re-emits directly on the worker's own\n *   emitter; the worker emitter isolates a listener throw and routes it to its `error` handler\n *   (the `error` option), so a buggy worker observer can never corrupt the inner queue or pool\n *   — the bridge listener never throws, so the inner queue's own emit stays balanced. The\n *   pool's create / acquire / release events stay the pool's internal concern (a Worker manages\n *   its own resources); observe a `Pool` directly for those.\n */\nexport class Worker<TInput, TResource, TResult> implements WorkerInterface<TInput, TResult> {\n\treadonly #queue: Queue<TInput, TResult>\n\treadonly #pool: Pool<TResource>\n\t// The push observation surface (see the guide's `## Observing` section) — the worker's own\n\t// emitter, fed by the queue→worker bridge. The emitter isolates a worker observer's throw\n\t// (routing it to the `error` handler), so it never escapes into queue or pool.\n\treadonly #emitter: Emitter<WorkerEventMap<TResult>>\n\treadonly #handler: WorkerHandler<TInput, TResource, TResult>\n\t#ending: PromiseWithResolvers<void> | undefined\n\n\tconstructor(options: WorkerOptions<TInput, TResource, TResult>) {\n\t\tconst {\n\t\t\tconcurrency: capturedConcurrency,\n\t\t\thandler,\n\t\t\ton,\n\t\t\terror,\n\t\t\tretries,\n\t\t\ttimeout,\n\t\t\tstore,\n\t\t} = options\n\t\tconst concurrency = capturedConcurrency === undefined ? 1 : capturedConcurrency\n\t\tthis.#handler = handler\n\t\tthis.#emitter = new Emitter<WorkerEventMap<TResult>>({\n\t\t\t...(on !== undefined ? { on } : {}),\n\t\t\t...(error !== undefined ? { error } : {}),\n\t\t})\n\t\tthis.#queue = new Queue<TInput, TResult>({\n\t\t\thandler: this.#handle.bind(this),\n\t\t\tconcurrency,\n\t\t\t...(retries !== undefined ? { retries } : {}),\n\t\t\t...(timeout !== undefined ? { timeout } : {}),\n\t\t\t...(store !== undefined ? { store } : {}),\n\t\t})\n\t\tconst pool = options.pool\n\t\tconst { max, on: poolOn, error: poolError, create, destroy, validate } = pool\n\t\tthis.#pool = new Pool<TResource>({\n\t\t\tcreate,\n\t\t\tmax: max === undefined ? concurrency : max,\n\t\t\t...(poolOn !== undefined ? { on: poolOn } : {}),\n\t\t\t...(poolError !== undefined ? { error: poolError } : {}),\n\t\t\t...(destroy !== undefined ? { destroy } : {}),\n\t\t\t...(validate !== undefined ? { validate } : {}),\n\t\t})\n\t\tthis.#bridge()\n\t}\n\n\tget emitter(): EmitterInterface<WorkerEventMap<TResult>> {\n\t\treturn this.#emitter\n\t}\n\n\tget count(): number {\n\t\treturn this.#queue.count\n\t}\n\n\tget active(): number {\n\t\treturn this.#queue.active\n\t}\n\n\tget paused(): boolean {\n\t\treturn this.#queue.paused\n\t}\n\n\tget stopped(): boolean {\n\t\treturn this.#queue.stopped\n\t}\n\n\tenqueue(input: TInput, options?: QueueEntryOptions): Promise<TResult> {\n\t\treturn this.#queue.enqueue(input, options)\n\t}\n\n\trestore(): Promise<void> {\n\t\treturn this.#queue.restore()\n\t}\n\n\tstart(): void {\n\t\tthis.#queue.start()\n\t}\n\n\tstop(): Promise<void> {\n\t\treturn this.#queue.stop()\n\t}\n\n\tpause(): void {\n\t\tthis.#queue.pause()\n\t}\n\n\tresume(): void {\n\t\tthis.#queue.resume()\n\t}\n\n\tabort(reason?: unknown): Promise<void> {\n\t\treturn this.#queue.abort(reason)\n\t}\n\n\tclear(): Promise<void> {\n\t\treturn this.#queue.clear()\n\t}\n\n\tdestroy(): Promise<void> {\n\t\tif (this.#ending !== undefined) return this.#ending.promise\n\t\tconst ending = Promise.withResolvers<void>()\n\t\tthis.#ending = ending\n\t\tvoid this.#teardown(ending)\n\t\treturn ending.promise\n\t}\n\n\tasync #handle(input: TInput, context: QueueContext): Promise<TResult> {\n\t\tconst token = await this.#pool.acquire(context.signal)\n\t\ttry {\n\t\t\treturn await this.#handler(input, token.value, context)\n\t\t} finally {\n\t\t\ttoken.release()\n\t\t}\n\t}\n\n\tasync #teardown(ending: PromiseWithResolvers<void>): Promise<void> {\n\t\tconst failures: unknown[] = []\n\t\ttry {\n\t\t\tawait this.#queue.destroy()\n\t\t} catch (error) {\n\t\t\tfailures.push(error)\n\t\t}\n\t\ttry {\n\t\t\tawait this.#pool.destroy()\n\t\t} catch (error) {\n\t\t\tfailures.push(error)\n\t\t}\n\t\tthis.#emitter.destroy()\n\t\tif (failures.length === 0) ending.resolve()\n\t\telse if (failures.length === 1) ending.reject(failures[0])\n\t\telse ending.reject(new AggregateError(failures, 'worker destroy cleanup failed'))\n\t}\n\n\t// Bridge the inner queue's lifecycle onto the worker's own emitter, once at construction.\n\t// Each listener re-emits the queue event directly on the worker's emitter, which isolates a\n\t// worker observer's throw (routing it to the worker's `error` handler). Because the bridge\n\t// listener itself never throws, the queue's own `#emitter.emit` — which invoked this\n\t// listener — sees no throw, so the inner queue's engine stays balanced regardless of what a\n\t// worker observer does. The events are already post-transition (they fire from the queue's\n\t// own post-settle / post-wake emits), so this stays observation.\n\t#bridge(): void {\n\t\tconst queue = this.#queue.emitter\n\t\tqueue.on('enqueue', (id) => this.#emitter.emit('enqueue', id))\n\t\tqueue.on('start', (id) => this.#emitter.emit('start', id))\n\t\tqueue.on('retry', (id, attempt) => this.#emitter.emit('retry', id, attempt))\n\t\tqueue.on('success', (id, result) => this.#emitter.emit('success', id, result))\n\t\tqueue.on('failure', (id, error) => this.#emitter.emit('failure', id, error))\n\t\tqueue.on('abort', (reason) => this.#emitter.emit('abort', reason))\n\t\tqueue.on('drain', () => this.#emitter.emit('drain'))\n\t}\n}\n","import type { WorkerInterface, WorkerOptions } from './types.js'\nimport { Worker } from './Worker.js'\n\n/**\n * Creates a resource-backed job worker — a `Queue` (`@orkestrel/queue`) composed with a\n * `Pool` (`@orkestrel/pool`), where each enqueued input runs through the handler against\n * an automatically acquired pooled resource released when the job settles.\n *\n * @remarks\n * Bounded concurrency, retries, and the per-attempt timeout and abort are the queue's.\n * Default for the pool's `max`: the `concurrency` value, so resources match the jobs in flight.\n * Resources are reused across jobs. A handler that throws still releases its resource (the\n * acquire/release pair brackets the call in a `finally`), so a later job reuses it. The\n * lifecycle (`start` / `stop` / `pause` / `resume` / `abort` / `clear` / `destroy`)\n * delegates to the queue; `destroy` also tears the pool down. It is observable (see the\n * guide's `## Observing` section): a typed `emitter` surfaces the queue lifecycle\n * (`enqueue` / `start` / `success` / `failure` / …).\n *\n * @typeParam TInput - The work input each job carries\n * @typeParam TResource - The pooled resource each job runs against\n * @typeParam TResult - The value the handler resolves for a job\n * @param options - The `handler` and `pool` plus the optional `concurrency`, `retries`,\n *   `timeout`, `store`, `on`, and `error` keys (see {@link WorkerOptions})\n * @returns A working {@link WorkerInterface}\n *\n * @example A resource-backed worker\n * ```ts\n * import { createWorker } from '@orkestrel/worker'\n *\n * // A Queue whose handler runs each job against a pooled resource (acquired before the\n * // handler, released after it — even on throw). The pool's `max` defaults to `concurrency`.\n * const worker = createWorker<Query, Connection, Rows>({\n * \tpool: { create: () => connect(), destroy: (connection) => connection.close() },\n * \thandler: (query, connection, { signal }) => connection.run(query, signal),\n * \tconcurrency: 4,\n * \tretries: 1,\n * })\n *\n * const rows = await worker.enqueue(query)\n * await worker.destroy() // awaits queue cleanup, pool cleanup, then emitter teardown\n * ```\n */\nexport function createWorker<TInput, TResource, TResult>(\n\toptions: WorkerOptions<TInput, TResource, TResult>,\n): WorkerInterface<TInput, TResult> {\n\treturn new Worker(options)\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CA,IAAa,SAAb,MAA4F;CAC3F;CACA;CAIA;CACA;CACA;CAEA,YAAY,SAAoD;EAC/D,MAAM,EACL,aAAa,qBACb,SACA,IACA,OACA,SACA,SACA,UACG;EACJ,MAAM,cAAc,wBAAwB,KAAA,IAAY,IAAI;EAC5D,KAAK,WAAW;EAChB,KAAK,WAAW,IAAI,mBAAA,QAAiC;GACpD,GAAI,OAAO,KAAA,IAAY,EAAE,GAAG,IAAI,CAAC;GACjC,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;EACxC,CAAC;EACD,KAAK,SAAS,IAAI,iBAAA,MAAuB;GACxC,SAAS,KAAK,QAAQ,KAAK,IAAI;GAC/B;GACA,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;GAC3C,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;GAC3C,GAAI,UAAU,KAAA,IAAY,EAAE,MAAM,IAAI,CAAC;EACxC,CAAC;EAED,MAAM,EAAE,KAAK,IAAI,QAAQ,OAAO,WAAW,QAAQ,SAAS,aAD/C,QAAQ;EAErB,KAAK,QAAQ,IAAI,gBAAA,KAAgB;GAChC;GACA,KAAK,QAAQ,KAAA,IAAY,cAAc;GACvC,GAAI,WAAW,KAAA,IAAY,EAAE,IAAI,OAAO,IAAI,CAAC;GAC7C,GAAI,cAAc,KAAA,IAAY,EAAE,OAAO,UAAU,IAAI,CAAC;GACtD,GAAI,YAAY,KAAA,IAAY,EAAE,QAAQ,IAAI,CAAC;GAC3C,GAAI,aAAa,KAAA,IAAY,EAAE,SAAS,IAAI,CAAC;EAC9C,CAAC;EACD,KAAK,QAAQ;CACd;CAEA,IAAI,UAAqD;EACxD,OAAO,KAAK;CACb;CAEA,IAAI,QAAgB;EACnB,OAAO,KAAK,OAAO;CACpB;CAEA,IAAI,SAAiB;EACpB,OAAO,KAAK,OAAO;CACpB;CAEA,IAAI,SAAkB;EACrB,OAAO,KAAK,OAAO;CACpB;CAEA,IAAI,UAAmB;EACtB,OAAO,KAAK,OAAO;CACpB;CAEA,QAAQ,OAAe,SAA+C;EACrE,OAAO,KAAK,OAAO,QAAQ,OAAO,OAAO;CAC1C;CAEA,UAAyB;EACxB,OAAO,KAAK,OAAO,QAAQ;CAC5B;CAEA,QAAc;EACb,KAAK,OAAO,MAAM;CACnB;CAEA,OAAsB;EACrB,OAAO,KAAK,OAAO,KAAK;CACzB;CAEA,QAAc;EACb,KAAK,OAAO,MAAM;CACnB;CAEA,SAAe;EACd,KAAK,OAAO,OAAO;CACpB;CAEA,MAAM,QAAiC;EACtC,OAAO,KAAK,OAAO,MAAM,MAAM;CAChC;CAEA,QAAuB;EACtB,OAAO,KAAK,OAAO,MAAM;CAC1B;CAEA,UAAyB;EACxB,IAAI,KAAK,YAAY,KAAA,GAAW,OAAO,KAAK,QAAQ;EACpD,MAAM,SAAS,QAAQ,cAAoB;EAC3C,KAAK,UAAU;EACf,KAAU,UAAU,MAAM;EAC1B,OAAO,OAAO;CACf;CAEA,MAAM,QAAQ,OAAe,SAAyC;EACrE,MAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ,QAAQ,MAAM;EACrD,IAAI;GACH,OAAO,MAAM,KAAK,SAAS,OAAO,MAAM,OAAO,OAAO;EACvD,UAAU;GACT,MAAM,QAAQ;EACf;CACD;CAEA,MAAM,UAAU,QAAmD;EAClE,MAAM,WAAsB,CAAC;EAC7B,IAAI;GACH,MAAM,KAAK,OAAO,QAAQ;EAC3B,SAAS,OAAO;GACf,SAAS,KAAK,KAAK;EACpB;EACA,IAAI;GACH,MAAM,KAAK,MAAM,QAAQ;EAC1B,SAAS,OAAO;GACf,SAAS,KAAK,KAAK;EACpB;EACA,KAAK,SAAS,QAAQ;EACtB,IAAI,SAAS,WAAW,GAAG,OAAO,QAAQ;OACrC,IAAI,SAAS,WAAW,GAAG,OAAO,OAAO,SAAS,EAAE;OACpD,OAAO,OAAO,IAAI,eAAe,UAAU,+BAA+B,CAAC;CACjF;CASA,UAAgB;EACf,MAAM,QAAQ,KAAK,OAAO;EAC1B,MAAM,GAAG,YAAY,OAAO,KAAK,SAAS,KAAK,WAAW,EAAE,CAAC;EAC7D,MAAM,GAAG,UAAU,OAAO,KAAK,SAAS,KAAK,SAAS,EAAE,CAAC;EACzD,MAAM,GAAG,UAAU,IAAI,YAAY,KAAK,SAAS,KAAK,SAAS,IAAI,OAAO,CAAC;EAC3E,MAAM,GAAG,YAAY,IAAI,WAAW,KAAK,SAAS,KAAK,WAAW,IAAI,MAAM,CAAC;EAC7E,MAAM,GAAG,YAAY,IAAI,UAAU,KAAK,SAAS,KAAK,WAAW,IAAI,KAAK,CAAC;EAC3E,MAAM,GAAG,UAAU,WAAW,KAAK,SAAS,KAAK,SAAS,MAAM,CAAC;EACjE,MAAM,GAAG,eAAe,KAAK,SAAS,KAAK,OAAO,CAAC;CACpD;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1JA,SAAgB,aACf,SACmC;CACnC,OAAO,IAAI,OAAO,OAAO;AAC1B"}

package/dist/src/core/index.d.cts

@@ -1,24 +1,25 @@
-import { EmitterErrorHandler } from '@orkestrel/emitter';
-import { EmitterHooks } from '@orkestrel/emitter';
-import { EmitterInterface } from '@orkestrel/emitter';
-import { PoolOptions } from '@orkestrel/pool';
-import { QueueContext } from '@orkestrel/queue';
-import { QueueEntryOptions } from '@orkestrel/queue';
-import { QueueStoreInterface } from '@orkestrel/queue';
+import type { EmitterErrorHandler } from '@orkestrel/emitter';
+import type { EmitterHooks } from '@orkestrel/emitter';
+import type { EmitterInterface } from '@orkestrel/emitter';
+import type { PoolOptions } from '@orkestrel/pool';
+import type { QueueContext } from '@orkestrel/queue';
+import type { QueueEntryOptions } from '@orkestrel/queue';
+import type { QueueStoreInterface } from '@orkestrel/queue';
 
 /**
- * Creates a resource-backed job worker — a `Queue` (`@orkestrel/queue`) marrying a `Pool`
- * (`@orkestrel/pool`). Each enqueued input runs through the handler against an
- * automatically acquired pooled resource (released when the job settles), with the
- * queue's bounded concurrency, retries, and per-attempt timeout / abort.
+ * Creates a resource-backed job worker — a `Queue` (`@orkestrel/queue`) composed with a
+ * `Pool` (`@orkestrel/pool`), where each enqueued input runs through the handler against
+ * an automatically acquired pooled resource released when the job settles.
  *
  * @remarks
+ * Bounded concurrency, retries, and the per-attempt timeout and abort are the queue's.
  * Default for the pool's `max`: the `concurrency` value, so resources match the jobs in flight.
  * Resources are reused across jobs. A handler that throws still releases its resource (the
  * acquire/release pair brackets the call in a `finally`), so a later job reuses it. The
  * lifecycle (`start` / `stop` / `pause` / `resume` / `abort` / `clear` / `destroy`)
- * delegates to the queue; `destroy` also tears the pool down. Observable (§13): a typed
- * `emitter` surfaces the queue lifecycle (`enqueue` / `start` / `success` / `failure` / …).
+ * delegates to the queue; `destroy` also tears the pool down. It is observable (see the
+ * guide's `## Observing` section): a typed `emitter` surfaces the queue lifecycle
+ * (`enqueue` / `start` / `success` / `failure` / …).
  *
  * @typeParam TInput - The work input each job carries
  * @typeParam TResource - The pooled resource each job runs against
@@ -27,10 +28,12 @@ import { QueueStoreInterface } from '@orkestrel/queue';
  *   `timeout`, `store`, `on`, and `error` keys (see {@link WorkerOptions})
  * @returns A working {@link WorkerInterface}
  *
- * @example
+ * @example A resource-backed worker
  * ```ts
  * import { createWorker } from '@orkestrel/worker'
  *
+ * // A Queue whose handler runs each job against a pooled resource (acquired before the
+ * // handler, released after it — even on throw). The pool's `max` defaults to `concurrency`.
  * const worker = createWorker<Query, Connection, Rows>({
  * 	pool: { create: () => connect(), destroy: (connection) => connection.close() },
  * 	handler: (query, connection, { signal }) => connection.run(query, signal),
@@ -39,6 +42,7 @@ import { QueueStoreInterface } from '@orkestrel/queue';
  * })
  *
  * const rows = await worker.enqueue(query)
+ * await worker.destroy() // awaits queue cleanup, pool cleanup, then emitter teardown
  * ```
  */
 export declare function createWorker<TInput, TResource, TResult>(options: WorkerOptions_2<TInput, TResource, TResult>): WorkerInterface<TInput, TResult>;
@@ -49,8 +53,8 @@ export declare function createWorker<TInput, TResource, TResult>(options: Worker
  *
  * @remarks
  * - **Composition, not reimplementation.** The Worker owns a `Pool` (built from
- *   `options.pool`) and a `Queue` whose handler ACQUIRES a pooled resource, runs the
- *   user handler against it, and RELEASES it in a `finally`. All concurrency, retries,
+ *   `options.pool`) and a `Queue` whose handler `acquire`s a pooled resource, runs the
+ *   user handler against it, and `release`s it in a `finally`. All concurrency, retries,
  *   timeout, and lifecycle are the Queue's — the Worker adds only the resource pairing.
  * - **Resource ↔ concurrency.** The queue strictly validates `concurrency` as a positive
  *   safe integer after caller options are captured once. Only `undefined` defaults
@@ -63,24 +67,24 @@ export declare function createWorker<TInput, TResource, TResult>(options: Worker
  *   `context.signal`, so an `abort` / `timeout` while waiting for a resource rejects
  *   the acquire — the Queue then handles retry / rejection, and there is no token to
  *   release (the resource was never leased).
- * - **Lifecycle (§10).** `enqueue` / `restore` / `start` / `stop` / `pause` / `resume` /
- *   `abort` / `clear` delegate to the queue; `count` / `active` / `paused` / `stopped`
- *   read it. `stop` / `abort` / `clear` return the queue's own cleanup barriers.
- *   `destroy` returns one stable barrier while it tears down the queue, then the pool,
- *   and destroys the worker emitter last. A sole cleanup failure is preserved by
+ * - **Lifecycle (see the guide's `## Methods` section).** `enqueue` / `restore` / `start` /
+ *   `stop` / `pause` / `resume` / `abort` / `clear` delegate to the queue; `count` / `active` /
+ *   `paused` / `stopped` read it. `stop` / `abort` / `clear` return the queue's own cleanup
+ *   barriers. `destroy` returns one stable barrier while it tears down the queue, then the
+ *   pool, and destroys the worker emitter last. A sole cleanup failure is preserved by
  *   identity; failures from both layers become an ordered `AggregateError`.
  * - **Durability.** An optional `store` is passed straight through to the queue, so the
  *   worker's outstanding jobs persist; `restore` re-runs them (delegated to the queue).
- * - **Observable (§13).** The owned {@link emitter} ({@link WorkerEventMap}) RE-EXPOSES the
- *   underlying queue's job lifecycle (`enqueue` / `start` / `retry` / `success` / `failure` /
- *   `abort` / `drain`) as the worker's OWN events — bridged from the inner queue's emitter at
- *   construction — so a consumer observes the worker without reaching through to internals.
- *   The bridge re-emits directly on the worker's own emitter; the worker emitter isolates a
- *   listener throw and routes it to its `error` handler (the `error` option), so a buggy
- *   worker observer can never corrupt the inner queue or pool — the bridge listener never
- *   throws, so the inner queue's own emit stays balanced. The pool's create / acquire /
- *   release events stay the pool's internal concern (a Worker manages its own resources);
- *   observe a `Pool` directly for those.
+ * - **Observable (see the guide's `## Observing` section).** The owned {@link emitter}
+ *   ({@link WorkerEventMap}) re-exposes the underlying queue's job lifecycle (`enqueue` /
+ *   `start` / `retry` / `success` / `failure` / `abort` / `drain`) as the worker's own events —
+ *   bridged from the inner queue's emitter at construction — so a consumer observes the worker
+ *   without reaching through to internals. The bridge re-emits directly on the worker's own
+ *   emitter; the worker emitter isolates a listener throw and routes it to its `error` handler
+ *   (the `error` option), so a buggy worker observer can never corrupt the inner queue or pool
+ *   — the bridge listener never throws, so the inner queue's own emit stays balanced. The
+ *   pool's create / acquire / release events stay the pool's internal concern (a Worker manages
+ *   its own resources); observe a `Pool` directly for those.
  */
 declare class Worker_2<TInput, TResource, TResult> implements WorkerInterface<TInput, TResult> {
     #private;
@@ -104,21 +108,25 @@ export { Worker_2 as Worker }
 
 /**
  * Represents the push observation surface of a {@link WorkerInterface} — the job
- * lifecycle a fire-and-forget observer subscribes to, surfacing the underlying queue's
- * moments so a Worker consumer never reaches through to the internal `Queue`.
+ * lifecycle a fire-and-forget observer subscribes to.
  *
  * @typeParam TResult - The value a job resolves (the `success` payload), mirroring the
  *   {@link WorkerInterface}'s own `TResult`.
  *
  * @remarks
  * A Worker is a `Queue`⨉`Pool` facade (both from their own `@orkestrel` packages); this
- * map RE-EXPOSES the queue lifecycle the worker surfaces (`enqueue` / `start` / `retry` /
- * `success` / `failure` / `abort` / `drain`) as the worker's OWN events — wired from the
- * underlying queue's emitter at construction, so a buggy observer is isolated exactly as
- * on the queue (a throw routes to the worker emitter's `error` handler). The
+ * map re-exposes the queue lifecycle the worker surfaces (`enqueue` / `start` / `retry` /
+ * `success` / `failure` / `abort` / `drain`) as the worker's own events — wired from the
+ * underlying queue's emitter at construction, so a consumer never reaches through to the
+ * internal `Queue` and a buggy observer is isolated exactly as on the queue (a throw
+ * routes to the worker emitter's `error` handler). The
  * pool's create / acquire / release events stay the pool's internal concern (a Worker
  * manages its own resources); a consumer who wants them observes a `Pool` directly.
- * Declared as a `type` alias (§4.5).
+ *
+ * Declared as a `type` alias (not `interface extends EventMap` — `EventMap` is a
+ * `type` kind): a type-literal satisfies the `EventMap` constraint
+ * (`Record<string, readonly unknown[]>`) structurally, whereas an interface lacks the
+ * required index signature.
  */
 declare type WorkerEventMap_2<TResult> = {
     /** Fires when a job is accepted — its id (delegated from the underlying queue's `enqueue`). */
@@ -142,7 +150,8 @@ export { WorkerEventMap_2 as WorkerEventMap }
 export declare type WorkerHandler<TInput, TResource, TResult> = (input: TInput, resource: TResource, context: QueueContext) => Promise<TResult> | TResult;
 
 /**
- * Represents a resource-backed job worker — a Queue whose handler runs against a pooled resource.
+ * Represents the job-worker contract a consumer holds — a `Queue` whose handler runs each
+ * job against a pooled resource.
  *
  * @remarks
  * Exposes a typed {@link emitter} carrying the job lifecycle
@@ -157,25 +166,38 @@ export declare interface WorkerInterface<TInput, TResult> {
     readonly active: number;
     readonly paused: boolean;
     readonly stopped: boolean;
+    /**
+     * Submits one job in FIFO order; the handler runs against an acquired resource, released
+     * when the job settles.
+     *
+     * @param input - The work payload the handler receives
+     * @param options - Optional id, retry and timeout overrides, and an entry abort signal
+     * @returns The job's settle-once execution promise
+     */
     enqueue(input: TInput, options?: QueueEntryOptions): Promise<TResult>;
-    /** Re-enqueues outstanding entries loaded from the store; no-op without a store. */
+    /** Re-enqueues the store's outstanding entries through the underlying queue; no-op without a store. */
     restore(): Promise<void>;
+    /** Starts or restarts the underlying queue's worker loops. */
     start(): void;
-    /** Stops the queue and awaits current-loop and durable cleanup quiescence. */
+    /** Stops the queue, rejects pending work, and awaits current-loop and durable cleanup quiescence. */
     stop(): Promise<void>;
+    /** Suspends dequeuing through the underlying queue, leaving in-flight jobs untouched. */
     pause(): void;
+    /** Continues a paused worker through the underlying queue. */
     resume(): void;
     /**
-     * Cancels in-flight work, rejects pending work, and awaits queue-owned cleanup.
+     * Cancels in-flight work, rejects pending work, and awaits queue-owned cleanup; an
+     * aborted attempt is never retried.
      *
      * @param reason - Optional cause retained by the queue's coded abort error
      * @returns The underlying queue's stable abort barrier
      */
     abort(reason?: unknown): Promise<void>;
-    /** Drops pending work and awaits its durable cleanup. */
+    /** Drops pending jobs and awaits their durable cleanup, leaving in-flight jobs untouched. */
     clear(): Promise<void>;
     /**
-     * Tears down the queue, then the pool, and finally the worker emitter.
+     * Tears down the queue, then the pool, and finally the worker emitter, behind one stable
+     * barrier.
      *
      * @returns One stable barrier shared by every call; it rejects with the original sole
      *   cleanup failure or an ordered `AggregateError` when both queue and pool fail
@@ -198,7 +220,7 @@ export declare interface WorkerInterface<TInput, TResult> {
  *   deadline.
  * - `store` — durable backing; outstanding entries survive a restart; call
  *   `restore()` to re-run them.
- * - `on` — the reserved {@link EmitterHooks} key (§8): initial listeners for the worker's
+ * - `on` — the reserved {@link EmitterHooks} key: initial listeners for the worker's
  *   {@link WorkerEventMap} (the job lifecycle it surfaces from its underlying queue), wired
  *   at construction.
  */