@vielzeug/familiar 1.0.8 → 2.0.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +24 -47
- package/dist/_pool.cjs +1 -1
- package/dist/_pool.cjs.map +1 -1
- package/dist/_pool.d.ts +4 -12
- package/dist/_pool.d.ts.map +1 -1
- package/dist/_pool.js +163 -222
- package/dist/_pool.js.map +1 -1
- package/dist/_queue.cjs +1 -1
- package/dist/_queue.cjs.map +1 -1
- package/dist/_queue.d.ts +3 -39
- package/dist/_queue.d.ts.map +1 -1
- package/dist/_queue.js +27 -28
- package/dist/_queue.js.map +1 -1
- package/dist/_stream-pool.cjs +2 -0
- package/dist/_stream-pool.cjs.map +1 -0
- package/dist/_stream-pool.d.ts +11 -0
- package/dist/_stream-pool.d.ts.map +1 -0
- package/dist/_stream-pool.js +152 -0
- package/dist/_stream-pool.js.map +1 -0
- package/dist/errors.cjs.map +1 -1
- package/dist/errors.d.ts +1 -1
- package/dist/errors.d.ts.map +1 -1
- package/dist/errors.js.map +1 -1
- package/dist/familiar.cjs +1 -27
- package/dist/familiar.cjs.map +1 -1
- package/dist/familiar.iife.js +1 -27
- package/dist/familiar.iife.js.map +1 -1
- package/dist/familiar.js +1 -27
- package/dist/familiar.js.map +1 -1
- package/dist/index.cjs +1 -1
- package/dist/index.js +3 -2
- package/dist/protocol.cjs +1 -1
- package/dist/protocol.cjs.map +1 -1
- package/dist/protocol.d.ts +40 -44
- package/dist/protocol.d.ts.map +1 -1
- package/dist/protocol.js +42 -27
- package/dist/protocol.js.map +1 -1
- package/dist/testing/testing.cjs +1 -1
- package/dist/testing/testing.cjs.map +1 -1
- package/dist/testing/testing.d.ts +15 -22
- package/dist/testing/testing.d.ts.map +1 -1
- package/dist/testing/testing.js +53 -35
- package/dist/testing/testing.js.map +1 -1
- package/dist/types.d.ts +49 -119
- package/dist/types.d.ts.map +1 -1
- package/dist/worker.cjs +1 -27
- package/dist/worker.cjs.map +1 -1
- package/dist/worker.d.ts +11 -67
- package/dist/worker.d.ts.map +1 -1
- package/dist/worker.js +139 -187
- package/dist/worker.js.map +1 -1
- package/package.json +2 -2
- package/dist/_dev.cjs +0 -2
- package/dist/_dev.cjs.map +0 -1
- package/dist/_dev.js +0 -6
- package/dist/_dev.js.map +0 -1
package/README.md
CHANGED
|
@@ -1,71 +1,48 @@
|
|
|
1
1
|
# @vielzeug/familiar
|
|
2
2
|
|
|
3
|
-
> Typed
|
|
3
|
+
> Typed module-worker pools with cancellation, priority scheduling, streaming, and test utilities.
|
|
4
4
|
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
<details>
|
|
8
|
-
<summary>Quick Reference</summary>
|
|
9
|
-
|
|
10
|
-
**Package:** `@vielzeug/familiar` · **Category:** Workers
|
|
11
|
-
|
|
12
|
-
**Key exports:** `createWorker`, `createModuleWorker`, `createTestWorker`
|
|
13
|
-
|
|
14
|
-
**When to use:** Typed Web Worker pools with task queuing, priorities, per-task timeouts, AbortSignal cancellation, streaming, heartbeat monitoring, and in-process testing.
|
|
15
|
-
|
|
16
|
-
**Related:** [@vielzeug/arsenal](https://vielzeug.dev/arsenal/) · [@vielzeug/ripple](https://vielzeug.dev/ripple/) · [@vielzeug/herald](https://vielzeug.dev/herald/)
|
|
17
|
-
|
|
18
|
-
</details>
|
|
19
|
-
|
|
20
|
-
`@vielzeug/familiar` is part of Vielzeug and ships as a zero-dependency TypeScript package with ESM+CJS output.
|
|
5
|
+
`@vielzeug/familiar` runs typed work in ES module workers. Worker modules keep imports, source maps, and normal file boundaries intact.
|
|
21
6
|
|
|
22
7
|
## Installation
|
|
23
8
|
|
|
24
9
|
```sh
|
|
25
10
|
pnpm add @vielzeug/familiar
|
|
26
|
-
npm install @vielzeug/familiar
|
|
27
|
-
yarn add @vielzeug/familiar
|
|
28
11
|
```
|
|
29
12
|
|
|
30
13
|
## Quick Start
|
|
31
14
|
|
|
32
15
|
```ts
|
|
33
|
-
|
|
16
|
+
// sum.worker.ts
|
|
17
|
+
import { exposeTask } from '@vielzeug/familiar/protocol';
|
|
34
18
|
|
|
35
|
-
|
|
36
|
-
|
|
37
|
-
console.log(await worker.run([1, 2, 3, 4, 5])); // 15
|
|
38
|
-
worker.dispose();
|
|
39
|
-
|
|
40
|
-
// Worker pool — 4 concurrent slots with a 5 s timeout
|
|
41
|
-
const pool = createWorker<number, number>(
|
|
42
|
-
function fib(n) {
|
|
43
|
-
return n <= 1 ? n : fib(n - 1) + fib(n - 2);
|
|
44
|
-
},
|
|
45
|
-
{ concurrency: 4, timeout: 5000 },
|
|
46
|
-
);
|
|
47
|
-
|
|
48
|
-
const results = await Promise.all([35, 36, 37, 38].map((n) => pool.run(n)));
|
|
49
|
-
pool.dispose();
|
|
19
|
+
exposeTask((values: number[]) => values.reduce((total, value) => total + value, 0));
|
|
20
|
+
```
|
|
50
21
|
|
|
51
|
-
|
|
52
|
-
|
|
22
|
+
```ts
|
|
23
|
+
// main.ts
|
|
24
|
+
import { createWorker } from '@vielzeug/familiar';
|
|
53
25
|
|
|
54
|
-
|
|
55
|
-
|
|
56
|
-
|
|
57
|
-
}
|
|
26
|
+
const pool = createWorker<number[], number>(new URL('./sum.worker.ts', import.meta.url), {
|
|
27
|
+
concurrency: 2,
|
|
28
|
+
timeout: 5_000,
|
|
29
|
+
});
|
|
58
30
|
|
|
59
|
-
// Typed errors — instanceof checks for precise handling
|
|
60
|
-
import { FamiliarTimeoutError, FamiliarQueueFullError } from '@vielzeug/familiar';
|
|
61
31
|
try {
|
|
62
|
-
await pool.run(
|
|
63
|
-
}
|
|
64
|
-
|
|
65
|
-
if (err instanceof FamiliarQueueFullError) console.error(`Queue full (max ${err.maxQueue})`);
|
|
32
|
+
console.log(await pool.run([1, 2, 3]));
|
|
33
|
+
} finally {
|
|
34
|
+
pool.dispose();
|
|
66
35
|
}
|
|
67
36
|
```
|
|
68
37
|
|
|
38
|
+
## Exports
|
|
39
|
+
|
|
40
|
+
- `createWorker()` creates a task pool backed by modules registered with `exposeTask()`.
|
|
41
|
+
- `createStreamWorker()` creates a stream-only pool backed by modules registered with `exposeStream()`.
|
|
42
|
+
- `batch()` and `createTaskGroup()` compose task-pool work without widening every pool handle.
|
|
43
|
+
- `createTestWorker()` provides structured-clone, timeout, cancellation, and error-wrapping parity for task-pool tests.
|
|
44
|
+
- `dispose()` stops work immediately; `drain()` waits for active work before teardown.
|
|
45
|
+
|
|
69
46
|
## Documentation
|
|
70
47
|
|
|
71
48
|
- [Overview](https://vielzeug.dev/familiar/)
|
package/dist/_pool.cjs
CHANGED
|
@@ -1,2 +1,2 @@
|
|
|
1
|
-
const e=require("./errors.cjs"),t=require("./_queue.cjs"),n=require("./_timers.cjs");let r=require("@vielzeug/arsenal/async");function i(i,a){let
|
|
1
|
+
const e=require("./errors.cjs"),t=require("./_queue.cjs"),n=require("./_timers.cjs");let r=require("@vielzeug/arsenal/async");function i(i,a){let o=[...i],s=new t.TaskQueue,c=new AbortController,l=[],u=[],d=0,f=0,p=0,m,h=!1,g=!1;function _(){return d===0&&s.size===0}function v(){if(_())for(let e of l.splice(0))e.timer&&clearTimeout(e.timer),e.resolve()}function y(t={}){return _()?Promise.resolve():new Promise((r,i)=>{let a={reject:i,resolve:r};t.timeout!==void 0&&(a.timer=setTimeout(()=>{let n=l.indexOf(a);n!==-1&&l.splice(n,1),i(new e.FamiliarTimeoutError(t.timeout))},t.timeout),n.unrefTimer(a.timer)),l.push(a)})}function b(){u.shift()?.resolve()}function x(e){for(let t of u.splice(0))t.reject(e)}function S(e){return e?.aborted?Promise.reject((0,r.abortError)(e)):new Promise((t,n)=>{let i=!1,a={cleanup(){e?.removeEventListener(`abort`,o)},reject(e){if(i)return;i=!0,a.cleanup();let t=u.indexOf(a);t!==-1&&u.splice(t,1),n(e)},resolve(){i||(i=!0,a.cleanup(),t())}},o=()=>a.reject((0,r.abortError)(e));e?.addEventListener(`abort`,o,{once:!0}),u.push(a)})}function C(){for(;s.size>0;){let e=s.shift();if(!e)break;if(e.signal?.aborted){e.cleanupAbort?.(),e.reject((0,r.abortError)(e.signal)),b();continue}return e}v()}function w(){if(!(h||g)){for(h=!0;!g&&o.length>0&&s.size>0;){let i=C();if(!i)break;let s=i,c=o.pop(),l=s.timeout??a.defaultTimeout;d+=1,b();let u=()=>c.cancel((0,r.abortError)(s.signal));s.cleanupAbort=()=>{s.signal?.removeEventListener(`abort`,u),s.cleanupAbort=void 0},s.signal?.addEventListener(`abort`,u,{once:!0}),c.run(s.input,s.transferables,l).then(e=>t(e),e=>n(e));function t(e){s.cleanupAbort?.(),o.push(c),--d,f+=1,s.resolve(e),w(),v()}function n(t){s.cleanupAbort?.(),o.push(c),--d,!(t instanceof e.FamiliarTerminatedError)&&t?.constructor?.name!==`AbortError`&&(p+=1),s.reject(t),w(),v()}}h=!1}}async function T(t,n={}){let{priority:i=0,signal:o,timeout:c,transferables:l=[]}=n;if(g)throw new e.FamiliarTerminatedError;if(m)throw new e.FamiliarTerminatedError(`Worker is draining`);if(o?.aborted)throw(0,r.abortError)(o);for(;a.onFull===`wait`&&a.maxQueue!==void 0&&s.size>=a.maxQueue;){if(await S(o),g)throw new e.FamiliarTerminatedError;if(m)throw new e.FamiliarTerminatedError(`Worker is draining`);if(o?.aborted)throw(0,r.abortError)(o)}let u,d,f=new Promise((e,t)=>{u=e,d=t}),p={input:t,priority:i,reject:d,resolve:u,signal:o,timeout:c,transferables:l};if(!s.enqueue(p,a.onFull===`wait`?void 0:a.maxQueue))throw new e.FamiliarQueueFullError(a.maxQueue);if(o){let e=()=>{s.remove(p)&&(p.cleanupAbort?.(),d((0,r.abortError)(o)),b(),v())};p.cleanupAbort=()=>{o.removeEventListener(`abort`,e),p.cleanupAbort=void 0},o.addEventListener(`abort`,e,{once:!0})}return w(),f}function E(){if(!g){g=!0,c.abort();for(let e of i)e.terminate();for(;s.size>0;){let t=s.shift();if(!t)break;t.cleanupAbort?.(),t.reject(new e.FamiliarTerminatedError)}x(new e.FamiliarTerminatedError),v()}}function D(t={}){return g?Promise.resolve():m||(x(new e.FamiliarTerminatedError(`Worker is draining`)),m=y(t).then(()=>E(),e=>{throw E(),e}),m)}return{get disposalSignal(){return c.signal},dispose:E,get disposed(){return g},drain:D,async prime(){await Promise.all(i.map(e=>e.prime()))},run:T,get stats(){return{active:d,completed:f,failed:p,queued:s.size}},get status(){return g?`terminated`:d===0?`idle`:`running`},[Symbol.asyncDispose]:()=>D(),[Symbol.dispose]:E}}async function*a(e,t,n={}){let r=new AbortController,i=()=>r.abort(n.signal.reason);n.signal?.addEventListener(`abort`,i,{once:!0});let a=t.map(t=>e.run(t,{...n,signal:r.signal}));try{for(let e of a)yield await e}catch(e){throw r.abort(e),await Promise.allSettled(a),e}finally{n.signal?.removeEventListener(`abort`,i),r.abort(),await Promise.allSettled(a)}}function o(e,t=void 0,n={}){let r=new AbortController,i=new Set,a=0;return n.signal?.addEventListener(`abort`,()=>r.abort(n.signal.reason),{once:!0}),{abort(e){r.abort(e)},async drain(){return Promise.allSettled([...i])},get name(){return t},get pending(){return i.size},run(t,n={}){let o=e.run(t,{...n,signal:r.signal});return a+=1,i.add(o),o.finally(()=>i.delete(o)),o},get size(){return a}}}exports.batch=a,exports.createPool=i,exports.createTaskGroup=o;
|
|
2
2
|
//# sourceMappingURL=_pool.cjs.map
|
package/dist/_pool.cjs.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"_pool.cjs","names":[],"sources":["../src/_pool.ts"],"sourcesContent":["/**\n * Shared pool orchestration engine used by both the real worker implementation and the test\n * double. Handles queue management, iterative drain loop, abort handling, lifecycle (drain /\n * dispose), metrics, batch streaming, task groups, and backpressure.\n *\n * Callers provide a SlotStrategy array — each slot encapsulates run/runStream/prime/terminate.\n * The pool does not care whether slots use a Web Worker or run in-process.\n *\n * Not part of the public API surface.\n */\n\nimport { abortError } from '@vielzeug/arsenal/async';\n\nimport type {\n BatchOptions,\n GroupOptions,\n RunOptions,\n SlotStrategy,\n TaskGroup,\n WorkerHandle,\n WorkerStatus,\n} from './types';\n\nimport { type QueueItem, TaskQueue } from './_queue';\nimport { unrefTimer } from './_timers';\nimport { FamiliarQueueFullError, FamiliarRuntimeError, FamiliarTerminatedError, FamiliarTimeoutError } from './errors';\n\nexport type PoolOptions = {\n concurrency: number;\n defaultTimeout: number | undefined;\n maxQueue: number | undefined;\n onFull: 'reject' | 'wait';\n};\n\nexport function createPool<TInput, TOutput>(\n slots: SlotStrategy<TInput, TOutput>[],\n options: PoolOptions,\n): WorkerHandle<TInput, TOutput> {\n const { concurrency, defaultTimeout, maxQueue, onFull } = options;\n const freeSlots = [...slots];\n const queue = new TaskQueue<TInput, TOutput>();\n const disposeController = new AbortController();\n const idleResolvers: Array<() => void> = [];\n /** Waiters blocked on run() because the queue is full (onFull='wait' mode). */\n const fullWaiters: Array<() => void> = [];\n\n let activeCount = 0;\n let drainPromise: Promise<void> | undefined;\n let completedCount = 0;\n let failedCount = 0;\n let groupActiveCount = 0;\n let terminated = false;\n\n // ─── Idle tracking ────────────────────────────────────────────────────────────\n\n function isIdle(): boolean {\n return activeCount === 0 && queue.size === 0;\n }\n\n function notifyIdle(): void {\n if (!isIdle() || idleResolvers.length === 0) return;\n\n const resolvers = idleResolvers.splice(0);\n\n for (const resolve of resolvers) resolve();\n }\n\n function waitForIdle(timeoutMs?: number): Promise<void> {\n if (isIdle()) return Promise.resolve();\n\n return new Promise<void>((resolve, reject) => {\n idleResolvers.push(resolve);\n\n if (timeoutMs !== undefined) {\n const timer = setTimeout(() => {\n const idx = idleResolvers.indexOf(resolve);\n\n if (idx !== -1) idleResolvers.splice(idx, 1);\n\n reject(new FamiliarTimeoutError(timeoutMs));\n }, timeoutMs);\n\n unrefTimer(timer);\n }\n });\n }\n\n // ─── Full-queue backpressure (onFull='wait') ──────────────────────────────────\n\n function releaseOneFullWaiter(): void {\n const waiter = fullWaiters.shift();\n\n if (waiter) waiter();\n }\n\n // ─── Drain loop (iterative) ───────────────────────────────────────────────────\n\n let draining = false;\n\n function drainLoop(): void {\n if (terminated || draining) return;\n\n draining = true;\n\n while (!terminated && freeSlots.length > 0 && queue.size > 0) {\n const item = nextItem();\n\n if (!item) break;\n\n const slot = freeSlots.pop()!;\n\n item.cleanupAbort?.();\n activeCount += 1;\n releaseOneFullWaiter();\n\n const taskTimeout = item.timeout ?? defaultTimeout;\n\n slot.run(item.input, item.transferables, taskTimeout).then(\n (result) => {\n freeSlots.push(slot);\n activeCount -= 1;\n completedCount += 1;\n item.resolve(result);\n drainLoop();\n\n if (isIdle()) notifyIdle();\n },\n (error: unknown) => {\n freeSlots.push(slot);\n activeCount -= 1;\n\n if (!(error instanceof FamiliarTerminatedError)) failedCount += 1;\n\n item.reject(error);\n drainLoop();\n\n if (isIdle()) notifyIdle();\n },\n );\n }\n\n draining = false;\n }\n\n // ─── Queue helpers ────────────────────────────────────────────────────────────\n\n function nextItem(): QueueItem<TInput, TOutput> | undefined {\n while (queue.size > 0) {\n const item = queue.shift();\n\n if (!item) break;\n\n if (item.signal?.aborted) {\n item.cleanupAbort?.();\n item.reject(abortError(item.signal));\n continue;\n }\n\n return item;\n }\n\n // All remaining items were aborted and rejected above — the pool may now be idle.\n // Notify any drain() waiter so it does not hang.\n notifyIdle();\n\n return undefined;\n }\n\n // ─── Lifecycle ────────────────────────────────────────────────────────────────\n\n function dispose(): void {\n if (terminated) return;\n\n terminated = true;\n disposeController.abort();\n\n for (const slot of slots) slot.terminate();\n\n while (queue.size > 0) {\n const item = queue.shift();\n\n if (!item) break;\n\n item.cleanupAbort?.();\n item.reject(new FamiliarTerminatedError());\n }\n\n const resolvers = idleResolvers.splice(0);\n\n for (const resolve of resolvers) resolve();\n\n for (const waiter of fullWaiters.splice(0)) waiter();\n }\n\n function drain(timeoutMs?: number): Promise<void> {\n if (terminated) return Promise.resolve();\n\n if (drainPromise) return drainPromise;\n\n drainPromise = waitForIdle(timeoutMs).then(dispose, (err) => {\n dispose();\n throw err;\n });\n\n return drainPromise;\n }\n\n // ─── run() ───────────────────────────────────────────────────────────────────\n\n async function run(input: TInput, runOptions: RunOptions = {}): Promise<TOutput> {\n const { priority = 0, signal, timeout, transferables = [] } = runOptions;\n\n if (terminated) {\n throw new FamiliarTerminatedError();\n }\n\n if (drainPromise) {\n throw new FamiliarTerminatedError('Worker is draining');\n }\n\n if (signal?.aborted) {\n throw abortError(signal);\n }\n\n if (onFull === 'wait' && maxQueue !== undefined) {\n while (!terminated && !drainPromise && queue.size >= maxQueue) {\n await new Promise<void>((resolve) => fullWaiters.push(resolve));\n }\n\n if (terminated) throw new FamiliarTerminatedError();\n\n if (drainPromise) throw new FamiliarTerminatedError('Worker is draining');\n }\n\n let resolve!: (value: TOutput) => void;\n let reject!: (reason: unknown) => void;\n\n const promise = new Promise<TOutput>((res, rej) => {\n resolve = res;\n reject = rej;\n });\n\n const item: QueueItem<TInput, TOutput> = {\n input,\n priority,\n reject,\n resolve,\n signal,\n timeout,\n transferables,\n };\n\n if (!queue.enqueue(item, onFull === 'wait' ? undefined : maxQueue)) {\n // maxQueue is guaranteed defined here: enqueue() only returns false when maxQueue is set.\n throw new FamiliarQueueFullError(maxQueue as number);\n }\n\n if (signal) {\n const onAbort = () => {\n if (!queue.remove(item)) return;\n\n item.cleanupAbort?.();\n reject(abortError(signal));\n notifyIdle();\n };\n\n item.cleanupAbort = () => {\n signal.removeEventListener('abort', onAbort);\n item.cleanupAbort = undefined;\n };\n\n signal.addEventListener('abort', onAbort, { once: true });\n }\n\n drainLoop();\n\n return promise;\n }\n\n // ─── runStream() ─────────────────────────────────────────────────────────────\n\n function runStream(input: TInput, options: Omit<RunOptions, 'signal'> = {}): AsyncIterable<TOutput> {\n if (terminated) {\n throw new FamiliarRuntimeError('Worker was terminated');\n }\n\n const slot = freeSlots.pop();\n\n if (!slot) {\n throw new FamiliarRuntimeError(\n `runStream() requires a free worker slot; all ${slots.length} slot${slots.length === 1 ? '' : 's'} are busy`,\n );\n }\n\n const { timeout, transferables = [] } = options;\n const iter = slot.runStream(input, transferables, timeout);\n\n return {\n [Symbol.asyncIterator]() {\n const inner = iter[Symbol.asyncIterator]();\n let released = false;\n\n const releaseSlot = () => {\n if (!released) {\n released = true;\n freeSlots.push(slot);\n }\n };\n\n return {\n async next() {\n const result = await inner.next();\n\n if (result.done) releaseSlot();\n\n return result;\n },\n\n async return(value?: unknown) {\n slot.cancel();\n releaseSlot();\n\n return inner.return?.(value) ?? { done: true as const, value };\n },\n\n async throw(error?: unknown) {\n slot.cancel();\n releaseSlot();\n\n if (inner.throw) return inner.throw(error);\n\n throw error;\n },\n };\n },\n };\n }\n\n // ─── batch() ─────────────────────────────────────────────────────────────────\n\n async function* batch(inputs: TInput[], batchOptions: BatchOptions = {}): AsyncIterable<TOutput> {\n if (inputs.length === 0) return;\n\n const { ordered = true, ...runOpts } = batchOptions;\n const ac = new AbortController();\n\n try {\n if (ordered) {\n const promises = inputs.map((input) => run(input, { ...runOpts, signal: ac.signal }));\n\n for (const p of promises) {\n yield await p;\n }\n } else {\n // As-completed: yield results in the order tasks finish, not submission order.\n // A single-slot notification channel wakes the consumer when the next result is ready.\n // Submission is windowed to `concurrency` outstanding (in-flight or buffered-but-unread)\n // tasks at a time — releasing capacity for one more submission each time the consumer\n // reads a result — so a slow consumer can't let an entire large batch settle in memory.\n type Completion = { error: unknown } | { value: TOutput };\n\n const completions: Completion[] = [];\n let notifier: (() => void) | null = null;\n let nextIndex = 0;\n const windowSize = Math.max(1, concurrency);\n\n function submitNext(): void {\n if (nextIndex >= inputs.length) return;\n\n const input = inputs[nextIndex++]!;\n\n run(input, { ...runOpts, signal: ac.signal }).then(\n (value) => {\n completions.push({ value });\n notifier?.();\n notifier = null;\n },\n (error: unknown) => {\n completions.push({ error });\n notifier?.();\n notifier = null;\n },\n );\n }\n\n for (let i = 0; i < windowSize && i < inputs.length; i++) submitNext();\n\n for (let i = 0; i < inputs.length; i++) {\n while (completions.length === 0) {\n await new Promise<void>((resolve) => {\n notifier = resolve;\n });\n }\n\n const next = completions.shift()!;\n\n if ('error' in next) throw next.error;\n\n yield next.value;\n\n // Only release capacity for another submission once the consumer has actually resumed\n // past this yield (i.e. did not break/return early) — submitting here unconditionally\n // would over-submit by one task on every early exit.\n submitNext();\n }\n }\n } finally {\n // Abort remaining in-flight tasks on any exit path (normal, consumer break, or error).\n ac.abort();\n }\n }\n\n // ─── group() ─────────────────────────────────────────────────────────────────\n\n function group(name?: string, options: GroupOptions = {}): TaskGroup<TInput, TOutput> {\n const ac = new AbortController();\n\n if (options.signal) {\n const sig = options.signal;\n\n if (sig.aborted) {\n ac.abort(sig.reason);\n } else {\n sig.addEventListener('abort', () => ac.abort(sig.reason), { once: true });\n }\n }\n\n groupActiveCount += 1;\n\n let submittedCount = 0;\n let settledCount = 0;\n let groupClosed = false;\n const pendingPromises: Promise<TOutput>[] = [];\n\n function decrementGroupIfDone(): void {\n if (!groupClosed && submittedCount > 0 && submittedCount === settledCount) {\n groupClosed = true;\n groupActiveCount -= 1;\n }\n }\n\n return {\n abort(reason?: unknown): void {\n ac.abort(reason);\n },\n\n drain(): Promise<PromiseSettledResult<TOutput>[]> {\n const snapshot = pendingPromises.splice(0);\n\n if (!groupClosed) {\n groupClosed = true;\n groupActiveCount -= 1;\n }\n\n return Promise.allSettled(snapshot);\n },\n\n get name() {\n return name;\n },\n\n get pending() {\n return submittedCount - settledCount;\n },\n\n run(input: TInput, runOpts: Omit<RunOptions, 'signal'> = {}): Promise<TOutput> {\n submittedCount += 1;\n\n const p = run(input, { ...runOpts, signal: ac.signal });\n\n pendingPromises.push(p);\n p.then(\n () => {\n settledCount += 1;\n decrementGroupIfDone();\n },\n () => {\n settledCount += 1;\n decrementGroupIfDone();\n },\n );\n\n return p;\n },\n\n get size() {\n return submittedCount;\n },\n };\n }\n\n // ─── Status ──────────────────────────────────────────────────────────────────\n\n function getStatus(): WorkerStatus {\n if (terminated) return 'terminated';\n\n return activeCount > 0 || queue.size > 0 ? 'running' : 'idle';\n }\n\n return {\n get active(): number {\n return activeCount;\n },\n batch,\n get completed(): number {\n return completedCount;\n },\n get concurrency(): number {\n return concurrency;\n },\n get disposalSignal(): AbortSignal {\n return disposeController.signal;\n },\n dispose,\n get disposed(): boolean {\n return terminated;\n },\n drain,\n get failed(): number {\n return failedCount;\n },\n group,\n get groupCount(): number {\n return groupActiveCount;\n },\n prime(): Promise<void> {\n return Promise.all(slots.map((s) => s.prime())).then(() => {});\n },\n get queued(): number {\n return queue.size;\n },\n run,\n runStream,\n get status(): WorkerStatus {\n return getStatus();\n },\n [Symbol.asyncDispose]: () => drain(),\n [Symbol.dispose]: dispose,\n };\n}\n"],"mappings":"8HAkCA,SAAgB,EACd,EACA,EAC+B,CAC/B,GAAM,CAAE,cAAa,iBAAgB,WAAU,UAAW,EACpD,EAAY,CAAC,GAAG,CAAK,EACrB,EAAQ,IAAI,EAAA,UACZ,EAAoB,IAAI,gBACxB,EAAmC,CAAC,EAEpC,EAAiC,CAAC,EAEpC,EAAc,EACd,EACA,EAAiB,EACjB,EAAc,EACd,EAAmB,EACnB,EAAa,GAIjB,SAAS,GAAkB,CACzB,OAAO,IAAgB,GAAK,EAAM,OAAS,CAC7C,CAEA,SAAS,GAAmB,CAC1B,GAAI,CAAC,EAAO,GAAK,EAAc,SAAW,EAAG,OAE7C,IAAM,EAAY,EAAc,OAAO,CAAC,EAExC,IAAK,IAAM,KAAW,EAAW,EAAQ,CAC3C,CAEA,SAAS,EAAY,EAAmC,CAGtD,OAFI,EAAO,EAAU,QAAQ,QAAQ,EAE9B,IAAI,SAAe,EAAS,IAAW,CAG5C,GAFA,EAAc,KAAK,CAAO,EAEtB,IAAc,IAAA,GAAW,CAC3B,IAAM,EAAQ,eAAiB,CAC7B,IAAM,EAAM,EAAc,QAAQ,CAAO,EAErC,IAAQ,IAAI,EAAc,OAAO,EAAK,CAAC,EAE3C,EAAO,IAAI,EAAA,qBAAqB,CAAS,CAAC,CAC5C,EAAG,CAAS,EAEZ,EAAA,WAAW,CAAK,CAClB,CACF,CAAC,CACH,CAIA,SAAS,GAA6B,CACpC,IAAM,EAAS,EAAY,MAAM,EAE7B,GAAQ,EAAO,CACrB,CAIA,IAAI,EAAW,GAEf,SAAS,GAAkB,CACrB,QAAc,GAIlB,KAFA,EAAW,GAEJ,CAAC,GAAc,EAAU,OAAS,GAAK,EAAM,KAAO,GAAG,CAC5D,IAAM,EAAO,EAAS,EAEtB,GAAI,CAAC,EAAM,MAEX,IAAM,EAAO,EAAU,IAAI,EAE3B,EAAK,eAAe,EACpB,GAAe,EACf,EAAqB,EAErB,IAAM,EAAc,EAAK,SAAW,EAEpC,EAAK,IAAI,EAAK,MAAO,EAAK,cAAe,CAAW,CAAC,CAAC,KACnD,GAAW,CACV,EAAU,KAAK,CAAI,EACnB,IACA,GAAkB,EAClB,EAAK,QAAQ,CAAM,EACnB,EAAU,EAEN,EAAO,GAAG,EAAW,CAC3B,EACC,GAAmB,CAClB,EAAU,KAAK,CAAI,EACnB,IAEM,aAAiB,EAAA,0BAA0B,GAAe,GAEhE,EAAK,OAAO,CAAK,EACjB,EAAU,EAEN,EAAO,GAAG,EAAW,CAC3B,CACF,CACF,CAEA,EAAW,EAFX,CAGF,CAIA,SAAS,GAAmD,CAC1D,KAAO,EAAM,KAAO,GAAG,CACrB,IAAM,EAAO,EAAM,MAAM,EAEzB,GAAI,CAAC,EAAM,MAEX,GAAI,EAAK,QAAQ,QAAS,CACxB,EAAK,eAAe,EACpB,EAAK,QAAA,EAAO,EAAA,WAAA,CAAW,EAAK,MAAM,CAAC,EACnC,QACF,CAEA,OAAO,CACT,CAIA,EAAW,CAGb,CAIA,SAAS,GAAgB,CACvB,GAAI,EAAY,OAEhB,EAAa,GACb,EAAkB,MAAM,EAExB,IAAK,IAAM,KAAQ,EAAO,EAAK,UAAU,EAEzC,KAAO,EAAM,KAAO,GAAG,CACrB,IAAM,EAAO,EAAM,MAAM,EAEzB,GAAI,CAAC,EAAM,MAEX,EAAK,eAAe,EACpB,EAAK,OAAO,IAAI,EAAA,uBAAyB,CAC3C,CAEA,IAAM,EAAY,EAAc,OAAO,CAAC,EAExC,IAAK,IAAM,KAAW,EAAW,EAAQ,EAEzC,IAAK,IAAM,KAAU,EAAY,OAAO,CAAC,EAAG,EAAO,CACrD,CAEA,SAAS,EAAM,EAAmC,CAUhD,OATI,EAAmB,QAAQ,QAAQ,EAEnC,IAEJ,EAAe,EAAY,CAAS,CAAC,CAAC,KAAK,EAAU,GAAQ,CAE3D,MADA,EAAQ,EACF,CACR,CAAC,EAEM,EACT,CAIA,eAAe,EAAI,EAAe,EAAyB,CAAC,EAAqB,CAC/E,GAAM,CAAE,WAAW,EAAG,SAAQ,UAAS,gBAAgB,CAAC,GAAM,EAE9D,GAAI,EACF,MAAM,IAAI,EAAA,wBAGZ,GAAI,EACF,MAAM,IAAI,EAAA,wBAAwB,oBAAoB,EAGxD,GAAI,GAAQ,QACV,MAAA,EAAM,EAAA,WAAA,CAAW,CAAM,EAGzB,GAAI,IAAW,QAAU,IAAa,IAAA,GAAW,CAC/C,KAAO,CAAC,GAAc,CAAC,GAAgB,EAAM,MAAQ,GACnD,MAAM,IAAI,QAAe,GAAY,EAAY,KAAK,CAAO,CAAC,EAGhE,GAAI,EAAY,MAAM,IAAI,EAAA,wBAE1B,GAAI,EAAc,MAAM,IAAI,EAAA,wBAAwB,oBAAoB,CAC1E,CAEA,IAAI,EACA,EAEE,EAAU,IAAI,SAAkB,EAAK,IAAQ,CACjD,EAAU,EACV,EAAS,CACX,CAAC,EAEK,EAAmC,CACvC,QACA,WACA,SACA,UACA,SACA,UACA,eACF,EAEA,GAAI,CAAC,EAAM,QAAQ,EAAM,IAAW,OAAS,IAAA,GAAY,CAAQ,EAE/D,MAAM,IAAI,EAAA,uBAAuB,CAAkB,EAGrD,GAAI,EAAQ,CACV,IAAM,MAAgB,CACf,EAAM,OAAO,CAAI,IAEtB,EAAK,eAAe,EACpB,GAAA,EAAO,EAAA,WAAA,CAAW,CAAM,CAAC,EACzB,EAAW,EACb,EAEA,EAAK,iBAAqB,CACxB,EAAO,oBAAoB,QAAS,CAAO,EAC3C,EAAK,aAAe,IAAA,EACtB,EAEA,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,CAC1D,CAIA,OAFA,EAAU,EAEH,CACT,CAIA,SAAS,EAAU,EAAe,EAAsC,CAAC,EAA2B,CAClG,GAAI,EACF,MAAM,IAAI,EAAA,qBAAqB,uBAAuB,EAGxD,IAAM,EAAO,EAAU,IAAI,EAE3B,GAAI,CAAC,EACH,MAAM,IAAI,EAAA,qBACR,gDAAgD,EAAM,OAAO,OAAO,EAAM,SAAW,EAAI,GAAK,IAAI,UACpG,EAGF,GAAM,CAAE,UAAS,gBAAgB,CAAC,GAAM,EAClC,EAAO,EAAK,UAAU,EAAO,EAAe,CAAO,EAEzD,MAAO,CACL,CAAC,OAAO,gBAAiB,CACvB,IAAM,EAAQ,EAAK,OAAO,cAAc,CAAC,EACrC,EAAW,GAET,MAAoB,CACnB,IACH,EAAW,GACX,EAAU,KAAK,CAAI,EAEvB,EAEA,MAAO,CACL,MAAM,MAAO,CACX,IAAM,EAAS,MAAM,EAAM,KAAK,EAIhC,OAFI,EAAO,MAAM,EAAY,EAEtB,CACT,EAEA,MAAM,OAAO,EAAiB,CAI5B,OAHA,EAAK,OAAO,EACZ,EAAY,EAEL,EAAM,SAAS,CAAK,GAAK,CAAE,KAAM,GAAe,OAAM,CAC/D,EAEA,MAAM,MAAM,EAAiB,CAI3B,GAHA,EAAK,OAAO,EACZ,EAAY,EAER,EAAM,MAAO,OAAO,EAAM,MAAM,CAAK,EAEzC,MAAM,CACR,CACF,CACF,CACF,CACF,CAIA,eAAgB,EAAM,EAAkB,EAA6B,CAAC,EAA2B,CAC/F,GAAI,EAAO,SAAW,EAAG,OAEzB,GAAM,CAAE,UAAU,GAAM,GAAG,GAAY,EACjC,EAAK,IAAI,gBAEf,GAAI,CACF,GAAI,EAAS,CACX,IAAM,EAAW,EAAO,IAAK,GAAU,EAAI,EAAO,CAAE,GAAG,EAAS,OAAQ,EAAG,MAAO,CAAC,CAAC,EAEpF,IAAK,IAAM,KAAK,EACd,MAAM,MAAM,CAEhB,KAAO,CAQL,IAAM,EAA4B,CAAC,EAC/B,EAAgC,KAChC,EAAY,EACV,EAAa,KAAK,IAAI,EAAG,CAAW,EAE1C,SAAS,GAAmB,CAC1B,GAAI,GAAa,EAAO,OAAQ,OAEhC,IAAM,EAAQ,EAAO,KAErB,EAAI,EAAO,CAAE,GAAG,EAAS,OAAQ,EAAG,MAAO,CAAC,CAAC,CAAC,KAC3C,GAAU,CACT,EAAY,KAAK,CAAE,OAAM,CAAC,EAC1B,IAAW,EACX,EAAW,IACb,EACC,GAAmB,CAClB,EAAY,KAAK,CAAE,OAAM,CAAC,EAC1B,IAAW,EACX,EAAW,IACb,CACF,CACF,CAEA,IAAK,IAAI,EAAI,EAAG,EAAI,GAAc,EAAI,EAAO,OAAQ,IAAK,EAAW,EAErE,IAAK,IAAI,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,KAAO,EAAY,SAAW,GAC5B,MAAM,IAAI,QAAe,GAAY,CACnC,EAAW,CACb,CAAC,EAGH,IAAM,EAAO,EAAY,MAAM,EAE/B,GAAI,UAAW,EAAM,MAAM,EAAK,MAEhC,MAAM,EAAK,MAKX,EAAW,CACb,CACF,CACF,QAAU,CAER,EAAG,MAAM,CACX,CACF,CAIA,SAAS,EAAM,EAAe,EAAwB,CAAC,EAA+B,CACpF,IAAM,EAAK,IAAI,gBAEf,GAAI,EAAQ,OAAQ,CAClB,IAAM,EAAM,EAAQ,OAEhB,EAAI,QACN,EAAG,MAAM,EAAI,MAAM,EAEnB,EAAI,iBAAiB,YAAe,EAAG,MAAM,EAAI,MAAM,EAAG,CAAE,KAAM,EAAK,CAAC,CAE5E,CAEA,GAAoB,EAEpB,IAAI,EAAiB,EACjB,EAAe,EACf,EAAc,GACZ,EAAsC,CAAC,EAE7C,SAAS,GAA6B,CAChC,CAAC,GAAe,EAAiB,GAAK,IAAmB,IAC3D,EAAc,GACd,IAEJ,CAEA,MAAO,CACL,MAAM,EAAwB,CAC5B,EAAG,MAAM,CAAM,CACjB,EAEA,OAAkD,CAChD,IAAM,EAAW,EAAgB,OAAO,CAAC,EAOzC,OALK,IACH,EAAc,GACd,KAGK,QAAQ,WAAW,CAAQ,CACpC,EAEA,IAAI,MAAO,CACT,OAAO,CACT,EAEA,IAAI,SAAU,CACZ,OAAO,EAAiB,CAC1B,EAEA,IAAI,EAAe,EAAsC,CAAC,EAAqB,CAC7E,GAAkB,EAElB,IAAM,EAAI,EAAI,EAAO,CAAE,GAAG,EAAS,OAAQ,EAAG,MAAO,CAAC,EActD,OAZA,EAAgB,KAAK,CAAC,EACtB,EAAE,SACM,CACJ,GAAgB,EAChB,EAAqB,CACvB,MACM,CACJ,GAAgB,EAChB,EAAqB,CACvB,CACF,EAEO,CACT,EAEA,IAAI,MAAO,CACT,OAAO,CACT,CACF,CACF,CAIA,SAAS,GAA0B,CAGjC,OAFI,EAAmB,aAEhB,EAAc,GAAK,EAAM,KAAO,EAAI,UAAY,MACzD,CAEA,MAAO,CACL,IAAI,QAAiB,CACnB,OAAO,CACT,EACA,QACA,IAAI,WAAoB,CACtB,OAAO,CACT,EACA,IAAI,aAAsB,CACxB,OAAO,CACT,EACA,IAAI,gBAA8B,CAChC,OAAO,EAAkB,MAC3B,EACA,UACA,IAAI,UAAoB,CACtB,OAAO,CACT,EACA,QACA,IAAI,QAAiB,CACnB,OAAO,CACT,EACA,QACA,IAAI,YAAqB,CACvB,OAAO,CACT,EACA,OAAuB,CACrB,OAAO,QAAQ,IAAI,EAAM,IAAK,GAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAW,CAAC,CAAC,CAC/D,EACA,IAAI,QAAiB,CACnB,OAAO,EAAM,IACf,EACA,MACA,YACA,IAAI,QAAuB,CACzB,OAAO,EAAU,CACnB,GACC,OAAO,kBAAqB,EAAM,GAClC,OAAO,SAAU,CACpB,CACF"}
|
|
1
|
+
{"version":3,"file":"_pool.cjs","names":[],"sources":["../src/_pool.ts"],"sourcesContent":["import { abortError } from '@vielzeug/arsenal/async';\n\nimport type {\n BatchOptions,\n DrainOptions,\n RunOptions,\n SlotStrategy,\n TaskGroup,\n TaskGroupOptions,\n WorkerPool,\n WorkerStats,\n WorkerStatus,\n} from './types';\n\nimport { type QueueItem, TaskQueue } from './_queue';\nimport { unrefTimer } from './_timers';\nimport { FamiliarQueueFullError, FamiliarTerminatedError, FamiliarTimeoutError } from './errors';\n\nexport type PoolOptions = {\n concurrency: number;\n defaultTimeout: number | undefined;\n maxQueue: number | undefined;\n onFull: 'reject' | 'wait';\n};\n\ntype IdleWaiter = {\n reject: (reason: unknown) => void;\n resolve: () => void;\n timer?: ReturnType<typeof setTimeout>;\n};\n\ntype CapacityWaiter = {\n cleanup(): void;\n reject(reason: unknown): void;\n resolve(): void;\n};\n\nexport function createPool<TInput, TOutput>(\n slots: SlotStrategy<TInput, TOutput>[],\n options: PoolOptions,\n): WorkerPool<TInput, TOutput> {\n const freeSlots = [...slots];\n const queue = new TaskQueue<TInput, TOutput>();\n const disposalController = new AbortController();\n const idleWaiters: IdleWaiter[] = [];\n const capacityWaiters: CapacityWaiter[] = [];\n let active = 0;\n let completed = 0;\n let failed = 0;\n let drainPromise: Promise<void> | undefined;\n let draining = false;\n let terminated = false;\n\n function isIdle(): boolean {\n return active === 0 && queue.size === 0;\n }\n\n function settleIdle(): void {\n if (!isIdle()) return;\n\n for (const waiter of idleWaiters.splice(0)) {\n if (waiter.timer) clearTimeout(waiter.timer);\n\n waiter.resolve();\n }\n }\n\n function waitForIdle(drainOptions: DrainOptions = {}): Promise<void> {\n if (isIdle()) return Promise.resolve();\n\n return new Promise<void>((resolve, reject) => {\n const waiter: IdleWaiter = { reject, resolve };\n\n if (drainOptions.timeout !== undefined) {\n waiter.timer = setTimeout(() => {\n const index = idleWaiters.indexOf(waiter);\n\n if (index !== -1) idleWaiters.splice(index, 1);\n\n reject(new FamiliarTimeoutError(drainOptions.timeout!));\n }, drainOptions.timeout);\n unrefTimer(waiter.timer);\n }\n\n idleWaiters.push(waiter);\n });\n }\n\n function releaseCapacity(): void {\n capacityWaiters.shift()?.resolve();\n }\n\n function rejectCapacity(reason: unknown): void {\n for (const waiter of capacityWaiters.splice(0)) waiter.reject(reason);\n }\n\n function waitForCapacity(signal: AbortSignal | undefined): Promise<void> {\n if (signal?.aborted) return Promise.reject(abortError(signal));\n\n return new Promise<void>((resolve, reject) => {\n let settled = false;\n const waiter: CapacityWaiter = {\n cleanup() {\n signal?.removeEventListener('abort', onAbort);\n },\n reject(reason) {\n if (settled) return;\n\n settled = true;\n waiter.cleanup();\n\n const index = capacityWaiters.indexOf(waiter);\n\n if (index !== -1) capacityWaiters.splice(index, 1);\n\n reject(reason);\n },\n resolve() {\n if (settled) return;\n\n settled = true;\n waiter.cleanup();\n resolve();\n },\n };\n const onAbort = () => waiter.reject(abortError(signal!));\n\n signal?.addEventListener('abort', onAbort, { once: true });\n capacityWaiters.push(waiter);\n });\n }\n\n function nextItem(): QueueItem<TInput, TOutput> | undefined {\n while (queue.size > 0) {\n const item = queue.shift();\n\n if (!item) break;\n\n if (item.signal?.aborted) {\n item.cleanupAbort?.();\n item.reject(abortError(item.signal));\n releaseCapacity();\n continue;\n }\n\n return item;\n }\n\n settleIdle();\n\n return undefined;\n }\n\n function drainQueue(): void {\n if (draining || terminated) return;\n\n draining = true;\n\n while (!terminated && freeSlots.length > 0 && queue.size > 0) {\n const next = nextItem();\n\n if (!next) break;\n\n const item = next;\n const slot = freeSlots.pop()!;\n const timeout = item.timeout ?? options.defaultTimeout;\n\n active += 1;\n releaseCapacity();\n\n const onAbort = () => slot.cancel(abortError(item.signal!));\n\n item.cleanupAbort = () => {\n item.signal?.removeEventListener('abort', onAbort);\n item.cleanupAbort = undefined;\n };\n item.signal?.addEventListener('abort', onAbort, { once: true });\n\n slot.run(item.input, item.transferables, timeout).then(\n (value) => finish(value),\n (error: unknown) => fail(error),\n );\n\n function finish(value: TOutput): void {\n item.cleanupAbort?.();\n freeSlots.push(slot);\n active -= 1;\n completed += 1;\n item.resolve(value);\n drainQueue();\n settleIdle();\n }\n\n function fail(error: unknown): void {\n item.cleanupAbort?.();\n freeSlots.push(slot);\n active -= 1;\n\n if (!(error instanceof FamiliarTerminatedError) && error?.constructor?.name !== 'AbortError') failed += 1;\n\n item.reject(error);\n drainQueue();\n settleIdle();\n }\n }\n\n draining = false;\n }\n\n async function run(input: TInput, runOptions: RunOptions = {}): Promise<TOutput> {\n const { priority = 0, signal, timeout, transferables = [] } = runOptions;\n\n if (terminated) throw new FamiliarTerminatedError();\n\n if (drainPromise) throw new FamiliarTerminatedError('Worker is draining');\n\n if (signal?.aborted) throw abortError(signal);\n\n while (options.onFull === 'wait' && options.maxQueue !== undefined && queue.size >= options.maxQueue) {\n await waitForCapacity(signal);\n\n if (terminated) throw new FamiliarTerminatedError();\n\n if (drainPromise) throw new FamiliarTerminatedError('Worker is draining');\n\n if (signal?.aborted) throw abortError(signal);\n }\n\n let resolve!: (value: TOutput) => void;\n let reject!: (reason: unknown) => void;\n const promise = new Promise<TOutput>((res, rej) => {\n resolve = res;\n reject = rej;\n });\n const item: QueueItem<TInput, TOutput> = { input, priority, reject, resolve, signal, timeout, transferables };\n\n if (!queue.enqueue(item, options.onFull === 'wait' ? undefined : options.maxQueue)) {\n throw new FamiliarQueueFullError(options.maxQueue!);\n }\n\n if (signal) {\n const onAbort = () => {\n if (!queue.remove(item)) return;\n\n item.cleanupAbort?.();\n reject(abortError(signal));\n releaseCapacity();\n settleIdle();\n };\n\n item.cleanupAbort = () => {\n signal.removeEventListener('abort', onAbort);\n item.cleanupAbort = undefined;\n };\n signal.addEventListener('abort', onAbort, { once: true });\n }\n\n drainQueue();\n\n return promise;\n }\n\n function dispose(): void {\n if (terminated) return;\n\n terminated = true;\n disposalController.abort();\n for (const slot of slots) slot.terminate();\n\n while (queue.size > 0) {\n const item = queue.shift();\n\n if (!item) break;\n\n item.cleanupAbort?.();\n item.reject(new FamiliarTerminatedError());\n }\n\n rejectCapacity(new FamiliarTerminatedError());\n settleIdle();\n }\n\n function drain(drainOptions: DrainOptions = {}): Promise<void> {\n if (terminated) return Promise.resolve();\n\n if (drainPromise) return drainPromise;\n\n rejectCapacity(new FamiliarTerminatedError('Worker is draining'));\n drainPromise = waitForIdle(drainOptions).then(\n () => dispose(),\n (error: unknown) => {\n dispose();\n throw error;\n },\n );\n\n return drainPromise;\n }\n\n return {\n get disposalSignal() {\n return disposalController.signal;\n },\n dispose,\n get disposed() {\n return terminated;\n },\n drain,\n async prime(): Promise<void> {\n await Promise.all(slots.map((slot) => slot.prime()));\n },\n run,\n get stats(): WorkerStats {\n return { active, completed, failed, queued: queue.size };\n },\n get status(): WorkerStatus {\n if (terminated) return 'terminated';\n\n return active === 0 ? 'idle' : 'running';\n },\n [Symbol.asyncDispose]: () => drain(),\n [Symbol.dispose]: dispose,\n };\n}\n\nexport async function* batch<TInput, TOutput>(\n pool: WorkerPool<TInput, TOutput>,\n inputs: readonly TInput[],\n options: BatchOptions = {},\n): AsyncIterable<TOutput> {\n const controller = new AbortController();\n const onAbort = () => controller.abort(options.signal!.reason);\n\n options.signal?.addEventListener('abort', onAbort, { once: true });\n\n const tasks = inputs.map((input) => pool.run(input, { ...options, signal: controller.signal }));\n\n try {\n for (const task of tasks) yield await task;\n } catch (error) {\n controller.abort(error);\n await Promise.allSettled(tasks);\n throw error;\n } finally {\n options.signal?.removeEventListener('abort', onAbort);\n controller.abort();\n await Promise.allSettled(tasks);\n }\n}\n\nexport function createTaskGroup<TInput, TOutput>(\n pool: WorkerPool<TInput, TOutput>,\n name: string | undefined = undefined,\n options: TaskGroupOptions = {},\n): TaskGroup<TInput, TOutput> {\n const controller = new AbortController();\n const tasks = new Set<Promise<TOutput>>();\n let size = 0;\n const onAbort = () => controller.abort(options.signal!.reason);\n\n options.signal?.addEventListener('abort', onAbort, { once: true });\n\n return {\n abort(reason?: unknown): void {\n controller.abort(reason);\n },\n async drain(): Promise<PromiseSettledResult<TOutput>[]> {\n return Promise.allSettled([...tasks]);\n },\n get name() {\n return name;\n },\n get pending() {\n return tasks.size;\n },\n run(input, runOptions = {}): Promise<TOutput> {\n const task = pool.run(input, { ...runOptions, signal: controller.signal });\n\n size += 1;\n tasks.add(task);\n void task.finally(() => tasks.delete(task));\n\n return task;\n },\n get size() {\n return size;\n },\n };\n}\n"],"mappings":"8HAqCA,SAAgB,EACd,EACA,EAC6B,CAC7B,IAAM,EAAY,CAAC,GAAG,CAAK,EACrB,EAAQ,IAAI,EAAA,UACZ,EAAqB,IAAI,gBACzB,EAA4B,CAAC,EAC7B,EAAoC,CAAC,EACvC,EAAS,EACT,EAAY,EACZ,EAAS,EACT,EACA,EAAW,GACX,EAAa,GAEjB,SAAS,GAAkB,CACzB,OAAO,IAAW,GAAK,EAAM,OAAS,CACxC,CAEA,SAAS,GAAmB,CACrB,KAAO,EAEZ,IAAK,IAAM,KAAU,EAAY,OAAO,CAAC,EACnC,EAAO,OAAO,aAAa,EAAO,KAAK,EAE3C,EAAO,QAAQ,CAEnB,CAEA,SAAS,EAAY,EAA6B,CAAC,EAAkB,CAGnE,OAFI,EAAO,EAAU,QAAQ,QAAQ,EAE9B,IAAI,SAAe,EAAS,IAAW,CAC5C,IAAM,EAAqB,CAAE,SAAQ,SAAQ,EAEzC,EAAa,UAAY,IAAA,KAC3B,EAAO,MAAQ,eAAiB,CAC9B,IAAM,EAAQ,EAAY,QAAQ,CAAM,EAEpC,IAAU,IAAI,EAAY,OAAO,EAAO,CAAC,EAE7C,EAAO,IAAI,EAAA,qBAAqB,EAAa,OAAQ,CAAC,CACxD,EAAG,EAAa,OAAO,EACvB,EAAA,WAAW,EAAO,KAAK,GAGzB,EAAY,KAAK,CAAM,CACzB,CAAC,CACH,CAEA,SAAS,GAAwB,CAC/B,EAAgB,MAAM,CAAC,EAAE,QAAQ,CACnC,CAEA,SAAS,EAAe,EAAuB,CAC7C,IAAK,IAAM,KAAU,EAAgB,OAAO,CAAC,EAAG,EAAO,OAAO,CAAM,CACtE,CAEA,SAAS,EAAgB,EAAgD,CAGvE,OAFI,GAAQ,QAAgB,QAAQ,QAAA,EAAO,EAAA,WAAA,CAAW,CAAM,CAAC,EAEtD,IAAI,SAAe,EAAS,IAAW,CAC5C,IAAI,EAAU,GACR,EAAyB,CAC7B,SAAU,CACR,GAAQ,oBAAoB,QAAS,CAAO,CAC9C,EACA,OAAO,EAAQ,CACb,GAAI,EAAS,OAEb,EAAU,GACV,EAAO,QAAQ,EAEf,IAAM,EAAQ,EAAgB,QAAQ,CAAM,EAExC,IAAU,IAAI,EAAgB,OAAO,EAAO,CAAC,EAEjD,EAAO,CAAM,CACf,EACA,SAAU,CACJ,IAEJ,EAAU,GACV,EAAO,QAAQ,EACf,EAAQ,EACV,CACF,EACM,MAAgB,EAAO,QAAA,EAAO,EAAA,WAAA,CAAW,CAAO,CAAC,EAEvD,GAAQ,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,EACzD,EAAgB,KAAK,CAAM,CAC7B,CAAC,CACH,CAEA,SAAS,GAAmD,CAC1D,KAAO,EAAM,KAAO,GAAG,CACrB,IAAM,EAAO,EAAM,MAAM,EAEzB,GAAI,CAAC,EAAM,MAEX,GAAI,EAAK,QAAQ,QAAS,CACxB,EAAK,eAAe,EACpB,EAAK,QAAA,EAAO,EAAA,WAAA,CAAW,EAAK,MAAM,CAAC,EACnC,EAAgB,EAChB,QACF,CAEA,OAAO,CACT,CAEA,EAAW,CAGb,CAEA,SAAS,GAAmB,CACtB,QAAY,GAIhB,KAFA,EAAW,GAEJ,CAAC,GAAc,EAAU,OAAS,GAAK,EAAM,KAAO,GAAG,CAC5D,IAAM,EAAO,EAAS,EAEtB,GAAI,CAAC,EAAM,MAEX,IAAM,EAAO,EACP,EAAO,EAAU,IAAI,EACrB,EAAU,EAAK,SAAW,EAAQ,eAExC,GAAU,EACV,EAAgB,EAEhB,IAAM,MAAgB,EAAK,QAAA,EAAO,EAAA,WAAA,CAAW,EAAK,MAAO,CAAC,EAE1D,EAAK,iBAAqB,CACxB,EAAK,QAAQ,oBAAoB,QAAS,CAAO,EACjD,EAAK,aAAe,IAAA,EACtB,EACA,EAAK,QAAQ,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,EAE9D,EAAK,IAAI,EAAK,MAAO,EAAK,cAAe,CAAO,CAAC,CAAC,KAC/C,GAAU,EAAO,CAAK,EACtB,GAAmB,EAAK,CAAK,CAChC,EAEA,SAAS,EAAO,EAAsB,CACpC,EAAK,eAAe,EACpB,EAAU,KAAK,CAAI,EACnB,IACA,GAAa,EACb,EAAK,QAAQ,CAAK,EAClB,EAAW,EACX,EAAW,CACb,CAEA,SAAS,EAAK,EAAsB,CAClC,EAAK,eAAe,EACpB,EAAU,KAAK,CAAI,EACnB,IAEI,EAAE,aAAiB,EAAA,0BAA4B,GAAO,aAAa,OAAS,eAAc,GAAU,GAExG,EAAK,OAAO,CAAK,EACjB,EAAW,EACX,EAAW,CACb,CACF,CAEA,EAAW,EAFX,CAGF,CAEA,eAAe,EAAI,EAAe,EAAyB,CAAC,EAAqB,CAC/E,GAAM,CAAE,WAAW,EAAG,SAAQ,UAAS,gBAAgB,CAAC,GAAM,EAE9D,GAAI,EAAY,MAAM,IAAI,EAAA,wBAE1B,GAAI,EAAc,MAAM,IAAI,EAAA,wBAAwB,oBAAoB,EAExE,GAAI,GAAQ,QAAS,MAAA,EAAM,EAAA,WAAA,CAAW,CAAM,EAE5C,KAAO,EAAQ,SAAW,QAAU,EAAQ,WAAa,IAAA,IAAa,EAAM,MAAQ,EAAQ,UAAU,CAGpG,GAFA,MAAM,EAAgB,CAAM,EAExB,EAAY,MAAM,IAAI,EAAA,wBAE1B,GAAI,EAAc,MAAM,IAAI,EAAA,wBAAwB,oBAAoB,EAExE,GAAI,GAAQ,QAAS,MAAA,EAAM,EAAA,WAAA,CAAW,CAAM,CAC9C,CAEA,IAAI,EACA,EACE,EAAU,IAAI,SAAkB,EAAK,IAAQ,CACjD,EAAU,EACV,EAAS,CACX,CAAC,EACK,EAAmC,CAAE,QAAO,WAAU,SAAQ,UAAS,SAAQ,UAAS,eAAc,EAE5G,GAAI,CAAC,EAAM,QAAQ,EAAM,EAAQ,SAAW,OAAS,IAAA,GAAY,EAAQ,QAAQ,EAC/E,MAAM,IAAI,EAAA,uBAAuB,EAAQ,QAAS,EAGpD,GAAI,EAAQ,CACV,IAAM,MAAgB,CACf,EAAM,OAAO,CAAI,IAEtB,EAAK,eAAe,EACpB,GAAA,EAAO,EAAA,WAAA,CAAW,CAAM,CAAC,EACzB,EAAgB,EAChB,EAAW,EACb,EAEA,EAAK,iBAAqB,CACxB,EAAO,oBAAoB,QAAS,CAAO,EAC3C,EAAK,aAAe,IAAA,EACtB,EACA,EAAO,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,CAC1D,CAIA,OAFA,EAAW,EAEJ,CACT,CAEA,SAAS,GAAgB,CACnB,MAGJ,CADA,EAAa,GACb,EAAmB,MAAM,EACzB,IAAK,IAAM,KAAQ,EAAO,EAAK,UAAU,EAEzC,KAAO,EAAM,KAAO,GAAG,CACrB,IAAM,EAAO,EAAM,MAAM,EAEzB,GAAI,CAAC,EAAM,MAEX,EAAK,eAAe,EACpB,EAAK,OAAO,IAAI,EAAA,uBAAyB,CAC3C,CAEA,EAAe,IAAI,EAAA,uBAAyB,EAC5C,EAAW,CAbc,CAc3B,CAEA,SAAS,EAAM,EAA6B,CAAC,EAAkB,CAc7D,OAbI,EAAmB,QAAQ,QAAQ,EAEnC,IAEJ,EAAe,IAAI,EAAA,wBAAwB,oBAAoB,CAAC,EAChE,EAAe,EAAY,CAAY,CAAC,CAAC,SACjC,EAAQ,EACb,GAAmB,CAElB,MADA,EAAQ,EACF,CACR,CACF,EAEO,EACT,CAEA,MAAO,CACL,IAAI,gBAAiB,CACnB,OAAO,EAAmB,MAC5B,EACA,UACA,IAAI,UAAW,CACb,OAAO,CACT,EACA,QACA,MAAM,OAAuB,CAC3B,MAAM,QAAQ,IAAI,EAAM,IAAK,GAAS,EAAK,MAAM,CAAC,CAAC,CACrD,EACA,MACA,IAAI,OAAqB,CACvB,MAAO,CAAE,SAAQ,YAAW,SAAQ,OAAQ,EAAM,IAAK,CACzD,EACA,IAAI,QAAuB,CAGzB,OAFI,EAAmB,aAEhB,IAAW,EAAI,OAAS,SACjC,GACC,OAAO,kBAAqB,EAAM,GAClC,OAAO,SAAU,CACpB,CACF,CAEA,eAAuB,EACrB,EACA,EACA,EAAwB,CAAC,EACD,CACxB,IAAM,EAAa,IAAI,gBACjB,MAAgB,EAAW,MAAM,EAAQ,OAAQ,MAAM,EAE7D,EAAQ,QAAQ,iBAAiB,QAAS,EAAS,CAAE,KAAM,EAAK,CAAC,EAEjE,IAAM,EAAQ,EAAO,IAAK,GAAU,EAAK,IAAI,EAAO,CAAE,GAAG,EAAS,OAAQ,EAAW,MAAO,CAAC,CAAC,EAE9F,GAAI,CACF,IAAK,IAAM,KAAQ,EAAO,MAAM,MAAM,CACxC,OAAS,EAAO,CAGd,MAFA,EAAW,MAAM,CAAK,EACtB,MAAM,QAAQ,WAAW,CAAK,EACxB,CACR,QAAU,CACR,EAAQ,QAAQ,oBAAoB,QAAS,CAAO,EACpD,EAAW,MAAM,EACjB,MAAM,QAAQ,WAAW,CAAK,CAChC,CACF,CAEA,SAAgB,EACd,EACA,EAA2B,IAAA,GAC3B,EAA4B,CAAC,EACD,CAC5B,IAAM,EAAa,IAAI,gBACjB,EAAQ,IAAI,IACd,EAAO,EAKX,OAFA,EAAQ,QAAQ,iBAAiB,YAFX,EAAW,MAAM,EAAQ,OAAQ,MAAM,EAEV,CAAE,KAAM,EAAK,CAAC,EAE1D,CACL,MAAM,EAAwB,CAC5B,EAAW,MAAM,CAAM,CACzB,EACA,MAAM,OAAkD,CACtD,OAAO,QAAQ,WAAW,CAAC,GAAG,CAAK,CAAC,CACtC,EACA,IAAI,MAAO,CACT,OAAO,CACT,EACA,IAAI,SAAU,CACZ,OAAO,EAAM,IACf,EACA,IAAI,EAAO,EAAa,CAAC,EAAqB,CAC5C,IAAM,EAAO,EAAK,IAAI,EAAO,CAAE,GAAG,EAAY,OAAQ,EAAW,MAAO,CAAC,EAMzE,MAJA,IAAQ,EACR,EAAM,IAAI,CAAI,EACd,EAAU,YAAc,EAAM,OAAO,CAAI,CAAC,EAEnC,CACT,EACA,IAAI,MAAO,CACT,OAAO,CACT,CACF,CACF"}
|
package/dist/_pool.d.ts
CHANGED
|
@@ -1,19 +1,11 @@
|
|
|
1
|
-
|
|
2
|
-
* Shared pool orchestration engine used by both the real worker implementation and the test
|
|
3
|
-
* double. Handles queue management, iterative drain loop, abort handling, lifecycle (drain /
|
|
4
|
-
* dispose), metrics, batch streaming, task groups, and backpressure.
|
|
5
|
-
*
|
|
6
|
-
* Callers provide a SlotStrategy array — each slot encapsulates run/runStream/prime/terminate.
|
|
7
|
-
* The pool does not care whether slots use a Web Worker or run in-process.
|
|
8
|
-
*
|
|
9
|
-
* Not part of the public API surface.
|
|
10
|
-
*/
|
|
11
|
-
import type { SlotStrategy, WorkerHandle } from './types';
|
|
1
|
+
import type { BatchOptions, SlotStrategy, TaskGroup, TaskGroupOptions, WorkerPool } from './types';
|
|
12
2
|
export type PoolOptions = {
|
|
13
3
|
concurrency: number;
|
|
14
4
|
defaultTimeout: number | undefined;
|
|
15
5
|
maxQueue: number | undefined;
|
|
16
6
|
onFull: 'reject' | 'wait';
|
|
17
7
|
};
|
|
18
|
-
export declare function createPool<TInput, TOutput>(slots: SlotStrategy<TInput, TOutput>[], options: PoolOptions):
|
|
8
|
+
export declare function createPool<TInput, TOutput>(slots: SlotStrategy<TInput, TOutput>[], options: PoolOptions): WorkerPool<TInput, TOutput>;
|
|
9
|
+
export declare function batch<TInput, TOutput>(pool: WorkerPool<TInput, TOutput>, inputs: readonly TInput[], options?: BatchOptions): AsyncIterable<TOutput>;
|
|
10
|
+
export declare function createTaskGroup<TInput, TOutput>(pool: WorkerPool<TInput, TOutput>, name?: string | undefined, options?: TaskGroupOptions): TaskGroup<TInput, TOutput>;
|
|
19
11
|
//# sourceMappingURL=_pool.d.ts.map
|
package/dist/_pool.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"_pool.d.ts","sourceRoot":"","sources":["../src/_pool.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"_pool.d.ts","sourceRoot":"","sources":["../src/_pool.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,YAAY,EAGZ,YAAY,EACZ,SAAS,EACT,gBAAgB,EAChB,UAAU,EAGX,MAAM,SAAS,CAAC;AAMjB,MAAM,MAAM,WAAW,GAAG;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,cAAc,EAAE,MAAM,GAAG,SAAS,CAAC;IACnC,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,MAAM,EAAE,QAAQ,GAAG,MAAM,CAAC;CAC3B,CAAC;AAcF,wBAAgB,UAAU,CAAC,MAAM,EAAE,OAAO,EACxC,KAAK,EAAE,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EACtC,OAAO,EAAE,WAAW,GACnB,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CA2R7B;AAED,wBAAuB,KAAK,CAAC,MAAM,EAAE,OAAO,EAC1C,IAAI,EAAE,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,EACjC,MAAM,EAAE,SAAS,MAAM,EAAE,EACzB,OAAO,GAAE,YAAiB,GACzB,aAAa,CAAC,OAAO,CAAC,CAmBxB;AAED,wBAAgB,eAAe,CAAC,MAAM,EAAE,OAAO,EAC7C,IAAI,EAAE,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,EACjC,IAAI,GAAE,MAAM,GAAG,SAAqB,EACpC,OAAO,GAAE,gBAAqB,GAC7B,SAAS,CAAC,MAAM,EAAE,OAAO,CAAC,CAkC5B"}
|