@vielzeug/familiar 1.0.2

package/dist/_queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_queue.js","names":[],"sources":["../src/_queue.ts"],"sourcesContent":["/**\n * Internal priority-queue for @vielzeug/familiar.\n * Not part of the public API surface.\n *\n * Uses a binary max-heap ordered by priority (higher value = runs first), with\n * insertion-sequence tiebreaking to ensure FIFO ordering within the same priority.\n * Cancelled items are marked lazily and silently skipped by shift().\n *\n * Complexity:\n *   enqueue  O(log n)\n *   shift    O(log n) amortised (lazy cancellation may scan multiple cancelled tops)\n *   remove   O(n) scan + O(1) mark — adequate for typical queue depths\n */\n\nexport type QueueItem<TInput, TOutput> = {\n  /** Marked true by remove(); the next shift() discards the item silently. */\n  cancelled?: boolean;\n  cleanupAbort?: () => void;\n  input: TInput;\n  /** Scheduling priority. Higher value = runs first. Default: 0. */\n  priority: number;\n  reject: (reason: unknown) => void;\n  resolve: (value: TOutput) => void;\n  signal?: AbortSignal;\n  timeout?: number;\n  transferables: Transferable[];\n};\n\n/**\n * Internal heap node: wraps a QueueItem with an insertion sequence for FIFO tiebreaking.\n * Using a wrapper instead of mutating QueueItem keeps queue items free of internal\n * scheduling metadata (_seq).\n */\ntype HeapEntry<TInput, TOutput> = { readonly _seq: number; readonly item: QueueItem<TInput, TOutput> };\n\nexport class TaskQueue<TInput, TOutput> {\n  private readonly heap: HeapEntry<TInput, TOutput>[] = [];\n  /** Accurate count of live (non-cancelled) items. */\n  private liveCount = 0;\n  private seq = 0;\n\n  /** Number of live (non-cancelled) items. Always accurate. */\n  get size(): number {\n    return this.liveCount;\n  }\n\n  /**\n   * Enqueue item. Returns false (without modifying state) when maxQueue is set and\n   * liveCount has already reached it; returns true on success.\n   */\n  enqueue(item: QueueItem<TInput, TOutput>, maxQueue: number | undefined): boolean {\n    if (maxQueue !== undefined && this.liveCount >= maxQueue) return false;\n\n    this.heap.push({ _seq: this.seq++, item });\n    this.siftUp(this.heap.length - 1);\n    this.liveCount++;\n\n    return true;\n  }\n\n  /**\n   * Dequeue the highest-priority live item. Silently discards cancelled tombstones.\n   * Returns undefined only when there are no live items left.\n   */\n  shift(): QueueItem<TInput, TOutput> | undefined {\n    while (this.heap.length > 0) {\n      const { item } = this.extractTop();\n\n      if (!item.cancelled) {\n        this.liveCount--;\n\n        return item;\n      }\n      // Cancelled: liveCount was already decremented in remove(). Just discard and continue.\n    }\n\n    return undefined;\n  }\n\n  /**\n   * Mark item as cancelled (O(n) scan). The heap slot is reclaimed lazily by the next shift().\n   * Returns true when found and marked, false when the item is not in the queue.\n   */\n  remove(item: QueueItem<TInput, TOutput>): boolean {\n    if (item.cancelled) return false;\n\n    for (let i = 0; i < this.heap.length; i++) {\n      if (this.heap[i]!.item === item) {\n        item.cancelled = true;\n        this.liveCount--;\n\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  // ─── Heap internals ────────────────────────────────────────────────────────\n\n  private extractTop(): HeapEntry<TInput, TOutput> {\n    const top = this.heap[0]!;\n    const last = this.heap.pop()!;\n\n    if (this.heap.length > 0) {\n      this.heap[0] = last;\n      this.siftDown(0);\n    }\n\n    return top;\n  }\n\n  /** Returns true when entry a should be dispatched before entry b. */\n  private higher(a: HeapEntry<TInput, TOutput>, b: HeapEntry<TInput, TOutput>): boolean {\n    if (a.item.priority !== b.item.priority) return a.item.priority > b.item.priority;\n\n    return a._seq < b._seq; // earlier insertion wins for equal priority (FIFO)\n  }\n\n  private siftUp(i: number): void {\n    while (i > 0) {\n      const parent = (i - 1) >> 1;\n\n      if (this.higher(this.heap[i]!, this.heap[parent]!)) {\n        [this.heap[i], this.heap[parent]] = [this.heap[parent]!, this.heap[i]!];\n        i = parent;\n      } else {\n        break;\n      }\n    }\n  }\n\n  private siftDown(i: number): void {\n    const n = this.heap.length;\n\n    for (;;) {\n      let top = i;\n      const left = 2 * i + 1;\n      const right = 2 * i + 2;\n\n      if (left < n && this.higher(this.heap[left]!, this.heap[top]!)) top = left;\n\n      if (right < n && this.higher(this.heap[right]!, this.heap[top]!)) top = right;\n\n      if (top === i) break;\n\n      [this.heap[i], this.heap[top]] = [this.heap[top]!, this.heap[i]!];\n      i = top;\n    }\n  }\n}\n"],"mappings":";AAmCA,IAAa,IAAb,MAAwC;CACtC,OAAsD,CAAC;CAEvD,YAAoB;CACpB,MAAc;CAGd,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAMA,QAAQ,GAAkC,GAAuC;EAO/E,OANI,MAAa,KAAA,KAAa,KAAK,aAAa,IAAiB,MAEjE,KAAK,KAAK,KAAK;GAAE,MAAM,KAAK;GAAO;EAAK,CAAC,GACzC,KAAK,OAAO,KAAK,KAAK,SAAS,CAAC,GAChC,KAAK,aAEE;CACT;CAMA,QAAgD;EAC9C,OAAO,KAAK,KAAK,SAAS,IAAG;GAC3B,IAAM,EAAE,YAAS,KAAK,WAAW;GAEjC,IAAI,CAAC,EAAK,WAGR,OAFA,KAAK,aAEE;EAGX;CAGF;CAMA,OAAO,GAA2C;EAChD,IAAI,EAAK,WAAW,OAAO;EAE3B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,KACpC,IAAI,KAAK,KAAK,EAAE,CAAE,SAAS,GAIzB,OAHA,EAAK,YAAY,IACjB,KAAK,aAEE;EAIX,OAAO;CACT;CAIA,aAAiD;EAC/C,IAAM,IAAM,KAAK,KAAK,IAChB,IAAO,KAAK,KAAK,IAAI;EAO3B,OALI,KAAK,KAAK,SAAS,MACrB,KAAK,KAAK,KAAK,GACf,KAAK,SAAS,CAAC,IAGV;CACT;CAGA,OAAe,GAA+B,GAAwC;EAGpF,OAFI,EAAE,KAAK,aAAa,EAAE,KAAK,WAExB,EAAE,OAAO,EAAE,OAF8B,EAAE,KAAK,WAAW,EAAE,KAAK;CAG3E;CAEA,OAAe,GAAiB;EAC9B,OAAO,IAAI,IAAG;GACZ,IAAM,IAAU,IAAI,KAAM;GAE1B,IAAI,KAAK,OAAO,KAAK,KAAK,IAAK,KAAK,KAAK,EAAQ,GAE/C,AADA,CAAC,KAAK,KAAK,IAAI,KAAK,KAAK,MAAW,CAAC,KAAK,KAAK,IAAU,KAAK,KAAK,EAAG,GACtE,IAAI;QAEJ;EAEJ;CACF;CAEA,SAAiB,GAAiB;EAChC,IAAM,IAAI,KAAK,KAAK;EAEpB,SAAS;GACP,IAAI,IAAM,GACJ,IAAO,IAAI,IAAI,GACf,IAAQ,IAAI,IAAI;GAMtB,IAJI,IAAO,KAAK,KAAK,OAAO,KAAK,KAAK,IAAQ,KAAK,KAAK,EAAK,MAAG,IAAM,IAElE,IAAQ,KAAK,KAAK,OAAO,KAAK,KAAK,IAAS,KAAK,KAAK,EAAK,MAAG,IAAM,IAEpE,MAAQ,GAAG;GAGf,AADA,CAAC,KAAK,KAAK,IAAI,KAAK,KAAK,MAAQ,CAAC,KAAK,KAAK,IAAO,KAAK,KAAK,EAAG,GAChE,IAAI;EACN;CACF;AACF"}

package/dist/_timers.cjs

@@ -0,0 +1,2 @@
+function e(e){typeof e==`object`&&e&&`unref`in e&&e.unref()}exports.unrefTimer=e;
+//# sourceMappingURL=_timers.cjs.map

package/dist/_timers.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"_timers.cjs","names":[],"sources":["../src/_timers.ts"],"sourcesContent":["/**\n * Node compatibility helper: `unref()`s a timer so a pending per-task timeout/watchdog does not\n * keep a Node event loop (e.g. a Worker polyfill) alive. Browsers return a plain number from\n * `setTimeout`/`setInterval`, so this is a no-op there.\n *\n * Not part of the public API surface.\n */\nexport function unrefTimer(timer: ReturnType<typeof setTimeout> | ReturnType<typeof setInterval>): void {\n  if (typeof timer === 'object' && timer !== null && 'unref' in timer) {\n    (timer as { unref(): void }).unref();\n  }\n}\n"],"mappings":"AAOA,SAAgB,EAAW,EAA6E,CAClG,OAAO,GAAU,UAAY,GAAkB,UAAW,GAC5D,EAA6B,MAAM,CAEvC"}

package/dist/_timers.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Node compatibility helper: `unref()`s a timer so a pending per-task timeout/watchdog does not
+ * keep a Node event loop (e.g. a Worker polyfill) alive. Browsers return a plain number from
+ * `setTimeout`/`setInterval`, so this is a no-op there.
+ *
+ * Not part of the public API surface.
+ */
+export declare function unrefTimer(timer: ReturnType<typeof setTimeout> | ReturnType<typeof setInterval>): void;
+//# sourceMappingURL=_timers.d.ts.map

package/dist/_timers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_timers.d.ts","sourceRoot":"","sources":["../src/_timers.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,OAAO,UAAU,CAAC,GAAG,UAAU,CAAC,OAAO,WAAW,CAAC,GAAG,IAAI,CAItG"}

package/dist/_timers.js

@@ -0,0 +1,8 @@
+//#region src/_timers.ts
+function e(e) {
+	typeof e == "object" && e && "unref" in e && e.unref();
+}
+//#endregion
+export { e as unrefTimer };
+
+//# sourceMappingURL=_timers.js.map

package/dist/_timers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"_timers.js","names":[],"sources":["../src/_timers.ts"],"sourcesContent":["/**\n * Node compatibility helper: `unref()`s a timer so a pending per-task timeout/watchdog does not\n * keep a Node event loop (e.g. a Worker polyfill) alive. Browsers return a plain number from\n * `setTimeout`/`setInterval`, so this is a no-op there.\n *\n * Not part of the public API surface.\n */\nexport function unrefTimer(timer: ReturnType<typeof setTimeout> | ReturnType<typeof setInterval>): void {\n  if (typeof timer === 'object' && timer !== null && 'unref' in timer) {\n    (timer as { unref(): void }).unref();\n  }\n}\n"],"mappings":";AAOA,SAAgB,EAAW,GAA6E;CACtG,AAAI,OAAO,KAAU,YAAY,KAAkB,WAAW,KAC5D,EAA6B,MAAM;AAEvC"}

package/dist/errors.cjs

@@ -0,0 +1,2 @@
+var e=class e extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}static is(t){return t instanceof e}},t=class extends e{},n=class extends e{maxQueue;constructor(e){super(`Queue is full (maxQueue=${e})`),this.maxQueue=e}},r=class extends e{},i=class extends e{constructor(e=`Worker was terminated`){super(e)}},a=class extends e{timeoutMs;constructor(e){super(`Task timed out after ${e}ms`),this.timeoutMs=e}},o=class extends e{};exports.FamiliarError=e,exports.FamiliarInvalidOptionsError=t,exports.FamiliarQueueFullError=n,exports.FamiliarRuntimeError=o,exports.FamiliarTaskError=r,exports.FamiliarTerminatedError=i,exports.FamiliarTimeoutError=a;
+//# sourceMappingURL=errors.cjs.map

package/dist/errors.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.cjs","names":[],"sources":["../src/errors.ts"],"sourcesContent":["/** Base class for all familiar errors. Use `instanceof FamiliarError` to catch any familiar-originated error. */\nexport class FamiliarError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n\n  static is(err: unknown): err is FamiliarError {\n    return err instanceof FamiliarError;\n  }\n}\n\n/** Thrown when invalid options are passed to `createWorker` or `createModuleWorker`. */\nexport class FamiliarInvalidOptionsError extends FamiliarError {}\n\n/** Thrown when run() is called and the queue is full (`onFull='reject'`). */\nexport class FamiliarQueueFullError extends FamiliarError {\n  /** The configured `maxQueue` value. */\n  readonly maxQueue: number;\n\n  constructor(maxQueue: number) {\n    super(`Queue is full (maxQueue=${maxQueue})`);\n    this.maxQueue = maxQueue;\n  }\n}\n\n/** Thrown when the task function throws. The original error is available as `.cause`. */\nexport class FamiliarTaskError extends FamiliarError {}\n\n/** Thrown when a task or operation is rejected because the worker was terminated. */\nexport class FamiliarTerminatedError extends FamiliarError {\n  constructor(message = 'Worker was terminated') {\n    super(message);\n  }\n}\n\n/** Thrown when a task exceeds its timeout or `drain()` times out. */\nexport class FamiliarTimeoutError extends FamiliarError {\n  /** The configured timeout in milliseconds. */\n  readonly timeoutMs: number;\n\n  constructor(timeoutMs: number) {\n    super(`Task timed out after ${timeoutMs}ms`);\n    this.timeoutMs = timeoutMs;\n  }\n}\n\n/** Thrown when the Worker API is unavailable or an unhandled error occurs in the worker thread. */\nexport class FamiliarRuntimeError extends FamiliarError {}\n"],"mappings":"AACA,IAAa,EAAb,MAAa,UAAsB,KAAM,CACvC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,IAAI,OAAO,KACvB,OAAO,eAAe,KAAM,IAAI,OAAO,SAAS,CAClD,CAEA,OAAO,GAAG,EAAoC,CAC5C,OAAO,aAAe,CACxB,CACF,EAGa,EAAb,cAAiD,CAAc,CAAC,EAGnD,EAAb,cAA4C,CAAc,CAExD,SAEA,YAAY,EAAkB,CAC5B,MAAM,2BAA2B,EAAS,EAAE,EAC5C,KAAK,SAAW,CAClB,CACF,EAGa,EAAb,cAAuC,CAAc,CAAC,EAGzC,EAAb,cAA6C,CAAc,CACzD,YAAY,EAAU,wBAAyB,CAC7C,MAAM,CAAO,CACf,CACF,EAGa,EAAb,cAA0C,CAAc,CAEtD,UAEA,YAAY,EAAmB,CAC7B,MAAM,wBAAwB,EAAU,GAAG,EAC3C,KAAK,UAAY,CACnB,CACF,EAGa,EAAb,cAA0C,CAAc,CAAC"}

package/dist/errors.d.ts

@@ -0,0 +1,31 @@
+/** Base class for all familiar errors. Use `instanceof FamiliarError` to catch any familiar-originated error. */
+export declare class FamiliarError extends Error {
+    constructor(message: string, opts?: ErrorOptions);
+    static is(err: unknown): err is FamiliarError;
+}
+/** Thrown when invalid options are passed to `createWorker` or `createModuleWorker`. */
+export declare class FamiliarInvalidOptionsError extends FamiliarError {
+}
+/** Thrown when run() is called and the queue is full (`onFull='reject'`). */
+export declare class FamiliarQueueFullError extends FamiliarError {
+    /** The configured `maxQueue` value. */
+    readonly maxQueue: number;
+    constructor(maxQueue: number);
+}
+/** Thrown when the task function throws. The original error is available as `.cause`. */
+export declare class FamiliarTaskError extends FamiliarError {
+}
+/** Thrown when a task or operation is rejected because the worker was terminated. */
+export declare class FamiliarTerminatedError extends FamiliarError {
+    constructor(message?: string);
+}
+/** Thrown when a task exceeds its timeout or `drain()` times out. */
+export declare class FamiliarTimeoutError extends FamiliarError {
+    /** The configured timeout in milliseconds. */
+    readonly timeoutMs: number;
+    constructor(timeoutMs: number);
+}
+/** Thrown when the Worker API is unavailable or an unhandled error occurs in the worker thread. */
+export declare class FamiliarRuntimeError extends FamiliarError {
+}
+//# sourceMappingURL=errors.d.ts.map

package/dist/errors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA,iHAAiH;AACjH,qBAAa,aAAc,SAAQ,KAAK;gBAC1B,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,YAAY;IAMhD,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,GAAG,GAAG,IAAI,aAAa;CAG9C;AAED,wFAAwF;AACxF,qBAAa,2BAA4B,SAAQ,aAAa;CAAG;AAEjE,6EAA6E;AAC7E,qBAAa,sBAAuB,SAAQ,aAAa;IACvD,uCAAuC;IACvC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;gBAEd,QAAQ,EAAE,MAAM;CAI7B;AAED,yFAAyF;AACzF,qBAAa,iBAAkB,SAAQ,aAAa;CAAG;AAEvD,qFAAqF;AACrF,qBAAa,uBAAwB,SAAQ,aAAa;gBAC5C,OAAO,SAA0B;CAG9C;AAED,qEAAqE;AACrE,qBAAa,oBAAqB,SAAQ,aAAa;IACrD,8CAA8C;IAC9C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;gBAEf,SAAS,EAAE,MAAM;CAI9B;AAED,mGAAmG;AACnG,qBAAa,oBAAqB,SAAQ,aAAa;CAAG"}

package/dist/errors.js

@@ -0,0 +1,27 @@
+//#region src/errors.ts
+var e = class e extends Error {
+	constructor(e, t) {
+		super(e, t), this.name = new.target.name, Object.setPrototypeOf(this, new.target.prototype);
+	}
+	static is(t) {
+		return t instanceof e;
+	}
+}, t = class extends e {}, n = class extends e {
+	maxQueue;
+	constructor(e) {
+		super(`Queue is full (maxQueue=${e})`), this.maxQueue = e;
+	}
+}, r = class extends e {}, i = class extends e {
+	constructor(e = "Worker was terminated") {
+		super(e);
+	}
+}, a = class extends e {
+	timeoutMs;
+	constructor(e) {
+		super(`Task timed out after ${e}ms`), this.timeoutMs = e;
+	}
+}, o = class extends e {};
+//#endregion
+export { e as FamiliarError, t as FamiliarInvalidOptionsError, n as FamiliarQueueFullError, o as FamiliarRuntimeError, r as FamiliarTaskError, i as FamiliarTerminatedError, a as FamiliarTimeoutError };
+
+//# sourceMappingURL=errors.js.map

package/dist/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","names":[],"sources":["../src/errors.ts"],"sourcesContent":["/** Base class for all familiar errors. Use `instanceof FamiliarError` to catch any familiar-originated error. */\nexport class FamiliarError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n\n  static is(err: unknown): err is FamiliarError {\n    return err instanceof FamiliarError;\n  }\n}\n\n/** Thrown when invalid options are passed to `createWorker` or `createModuleWorker`. */\nexport class FamiliarInvalidOptionsError extends FamiliarError {}\n\n/** Thrown when run() is called and the queue is full (`onFull='reject'`). */\nexport class FamiliarQueueFullError extends FamiliarError {\n  /** The configured `maxQueue` value. */\n  readonly maxQueue: number;\n\n  constructor(maxQueue: number) {\n    super(`Queue is full (maxQueue=${maxQueue})`);\n    this.maxQueue = maxQueue;\n  }\n}\n\n/** Thrown when the task function throws. The original error is available as `.cause`. */\nexport class FamiliarTaskError extends FamiliarError {}\n\n/** Thrown when a task or operation is rejected because the worker was terminated. */\nexport class FamiliarTerminatedError extends FamiliarError {\n  constructor(message = 'Worker was terminated') {\n    super(message);\n  }\n}\n\n/** Thrown when a task exceeds its timeout or `drain()` times out. */\nexport class FamiliarTimeoutError extends FamiliarError {\n  /** The configured timeout in milliseconds. */\n  readonly timeoutMs: number;\n\n  constructor(timeoutMs: number) {\n    super(`Task timed out after ${timeoutMs}ms`);\n    this.timeoutMs = timeoutMs;\n  }\n}\n\n/** Thrown when the Worker API is unavailable or an unhandled error occurs in the worker thread. */\nexport class FamiliarRuntimeError extends FamiliarError {}\n"],"mappings":";AACA,IAAa,IAAb,MAAa,UAAsB,MAAM;CACvC,YAAY,GAAiB,GAAqB;EAGhD,AAFA,MAAM,GAAS,CAAI,GACnB,KAAK,OAAO,IAAI,OAAO,MACvB,OAAO,eAAe,MAAM,IAAI,OAAO,SAAS;CAClD;CAEA,OAAO,GAAG,GAAoC;EAC5C,OAAO,aAAe;CACxB;AACF,GAGa,IAAb,cAAiD,EAAc,CAAC,GAGnD,IAAb,cAA4C,EAAc;CAExD;CAEA,YAAY,GAAkB;EAE5B,AADA,MAAM,2BAA2B,EAAS,EAAE,GAC5C,KAAK,WAAW;CAClB;AACF,GAGa,IAAb,cAAuC,EAAc,CAAC,GAGzC,IAAb,cAA6C,EAAc;CACzD,YAAY,IAAU,yBAAyB;EAC7C,MAAM,CAAO;CACf;AACF,GAGa,IAAb,cAA0C,EAAc;CAEtD;CAEA,YAAY,GAAmB;EAE7B,AADA,MAAM,wBAAwB,EAAU,GAAG,GAC3C,KAAK,YAAY;CACnB;AACF,GAGa,IAAb,cAA0C,EAAc,CAAC"}

package/dist/familiar.cjs

@@ -0,0 +1,28 @@
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});let e=require("@vielzeug/arsenal");var t=class e extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}static is(t){return t instanceof e}},n=class extends t{},r=class extends t{maxQueue;constructor(e){super(`Queue is full (maxQueue=${e})`),this.maxQueue=e}},i=class extends t{},a=class extends t{constructor(e=`Worker was terminated`){super(e)}},o=class extends t{timeoutMs;constructor(e){super(`Task timed out after ${e}ms`),this.timeoutMs=e}},s=class extends t{},c=!globalThis.__FAMILIAR_PROD__;function l(e){c&&console.warn(`[@vielzeug/familiar] ${e}`)}var u=class{heap=[];liveCount=0;seq=0;get size(){return this.liveCount}enqueue(e,t){return t!==void 0&&this.liveCount>=t?!1:(this.heap.push({_seq:this.seq++,item:e}),this.siftUp(this.heap.length-1),this.liveCount++,!0)}shift(){for(;this.heap.length>0;){let{item:e}=this.extractTop();if(!e.cancelled)return this.liveCount--,e}}remove(e){if(e.cancelled)return!1;for(let t=0;t<this.heap.length;t++)if(this.heap[t].item===e)return e.cancelled=!0,this.liveCount--,!0;return!1}extractTop(){let e=this.heap[0],t=this.heap.pop();return this.heap.length>0&&(this.heap[0]=t,this.siftDown(0)),e}higher(e,t){return e.item.priority===t.item.priority?e._seq<t._seq:e.item.priority>t.item.priority}siftUp(e){for(;e>0;){let t=e-1>>1;if(this.higher(this.heap[e],this.heap[t]))[this.heap[e],this.heap[t]]=[this.heap[t],this.heap[e]],e=t;else break}}siftDown(e){let t=this.heap.length;for(;;){let n=e,r=2*e+1,i=2*e+2;if(r<t&&this.higher(this.heap[r],this.heap[n])&&(n=r),i<t&&this.higher(this.heap[i],this.heap[n])&&(n=i),n===e)break;[this.heap[e],this.heap[n]]=[this.heap[n],this.heap[e]],e=n}}};function d(e){typeof e==`object`&&e&&`unref`in e&&e.unref()}function f(t,n){let{concurrency:i,defaultTimeout:c,maxQueue:l,onFull:f}=n,p=[...t],m=new u,h=new AbortController,g=[],_=[],v=0,y,b=0,x=0,S=0,C=!1;function w(){return v===0&&m.size===0}function T(){if(!w()||g.length===0)return;let e=g.splice(0);for(let t of e)t()}function E(e){return w()?Promise.resolve():new Promise((t,n)=>{g.push(t),e!==void 0&&d(setTimeout(()=>{let r=g.indexOf(t);r!==-1&&g.splice(r,1),n(new o(e))},e))})}function D(){let e=_.shift();e&&e()}let O=!1;function k(){if(!(C||O)){for(O=!0;!C&&p.length>0&&m.size>0;){let e=A();if(!e)break;let t=p.pop();e.cleanupAbort?.(),v+=1,D();let n=e.timeout??c;t.run(e.input,e.transferables,n).then(n=>{p.push(t),--v,b+=1,e.resolve(n),k(),w()&&T()},n=>{p.push(t),--v,n instanceof a||(x+=1),e.reject(n),k(),w()&&T()})}O=!1}}function A(){for(;m.size>0;){let t=m.shift();if(!t)break;if(t.signal?.aborted){t.cleanupAbort?.(),t.reject((0,e.abortError)(t.signal));continue}return t}T()}function j(){if(C)return;C=!0,h.abort();for(let e of t)e.terminate();for(;m.size>0;){let e=m.shift();if(!e)break;e.cleanupAbort?.(),e.reject(new a)}let e=g.splice(0);for(let t of e)t();for(let e of _.splice(0))e()}function M(e){return C?Promise.resolve():y||(y=E(e).then(j,e=>{throw j(),e}),y)}async function N(t,n={}){let{priority:i=0,signal:o,timeout:s,transferables:c=[]}=n;if(C)throw new a;if(y)throw new a(`Worker is draining`);if(o?.aborted)throw(0,e.abortError)(o);if(f===`wait`&&l!==void 0){for(;!C&&!y&&m.size>=l;)await new Promise(e=>_.push(e));if(C)throw new a;if(y)throw new a(`Worker is draining`)}let u,d,p=new Promise((e,t)=>{u=e,d=t}),h={input:t,priority:i,reject:d,resolve:u,signal:o,timeout:s,transferables:c};if(!m.enqueue(h,f===`wait`?void 0:l))throw new r(l);if(o){let t=()=>{m.remove(h)&&(h.cleanupAbort?.(),d((0,e.abortError)(o)),T())};h.cleanupAbort=()=>{o.removeEventListener(`abort`,t),h.cleanupAbort=void 0},o.addEventListener(`abort`,t,{once:!0})}return k(),p}function P(e,n={}){if(C)throw new s(`Worker was terminated`);let r=p.pop();if(!r)throw new s(`runStream() requires a free worker slot; all ${t.length} slot${t.length===1?``:`s`} are busy`);let{timeout:i,transferables:a=[]}=n,o=r.runStream(e,a,i);return{[Symbol.asyncIterator](){let e=o[Symbol.asyncIterator](),t=!1,n=()=>{t||(t=!0,p.push(r))};return{async next(){let t=await e.next();return t.done&&n(),t},async return(t){return r.cancel(),n(),e.return?.(t)??{done:!0,value:t}},async throw(t){if(r.cancel(),n(),e.throw)return e.throw(t);throw t}}}}}async function*F(e,t={}){if(e.length===0)return;let{ordered:n=!0,...r}=t,a=new AbortController;try{if(n){let t=e.map(e=>N(e,{...r,signal:a.signal}));for(let e of t)yield await e}else{let t=[],n=null,s=0,c=Math.max(1,i);function o(){if(s>=e.length)return;let i=e[s++];N(i,{...r,signal:a.signal}).then(e=>{t.push({value:e}),n?.(),n=null},e=>{t.push({error:e}),n?.(),n=null})}for(let t=0;t<c&&t<e.length;t++)o();for(let r=0;r<e.length;r++){for(;t.length===0;)await new Promise(e=>{n=e});let e=t.shift();if(`error`in e)throw e.error;yield e.value,o()}}}finally{a.abort()}}function I(e,t={}){let n=new AbortController;if(t.signal){let e=t.signal;e.aborted?n.abort(e.reason):e.addEventListener(`abort`,()=>n.abort(e.reason),{once:!0})}S+=1;let r=0,i=0,a=!1,o=[];function s(){!a&&r>0&&r===i&&(a=!0,--S)}return{abort(e){n.abort(e)},drain(){let e=o.splice(0);return a||(a=!0,--S),Promise.allSettled(e)},get name(){return e},get pending(){return r-i},run(e,t={}){r+=1;let a=N(e,{...t,signal:n.signal});return o.push(a),a.then(()=>{i+=1,s()},()=>{i+=1,s()}),a},get size(){return r}}}function L(){return C?`terminated`:v>0||m.size>0?`running`:`idle`}return{get active(){return v},batch:F,get completed(){return b},get concurrency(){return i},get disposalSignal(){return h.signal},dispose:j,get disposed(){return C},drain:M,get failed(){return x},group:I,get groupCount(){return S},prime(){return Promise.all(t.map(e=>e.prime())).then(()=>{})},get queued(){return m.size},run:N,runStream:P,get status(){return L()},[Symbol.asyncDispose]:()=>M(),[Symbol.dispose]:j}}function p(e){if(e.toString().includes(`[native code]`))throw new n(`Task function cannot be a bound or native function`);return e}var m=512;function h(e){if(e===void 0)return 1;if(e===`auto`)return Math.max(1,globalThis.navigator?.hardwareConcurrency??1);if(!Number.isInteger(e)||e<1||e>m)throw new n(`\`concurrency\` must be a positive integer ≤ ${m} or "auto"`);return e}function g(e={}){let t=h(e.concurrency),{heartbeatWindow:r,maxQueue:i,onFull:a=`reject`,onSlotError:o,timeout:s}=e;if(s!==void 0&&(!Number.isFinite(s)||s<=0))throw new n("`timeout` must be a finite number greater than 0");if(i!==void 0&&(!Number.isInteger(i)||i<1))throw new n("`maxQueue` must be a positive integer");if(r!==void 0&&(!Number.isFinite(r)||r<=0))throw new n("`heartbeatWindow` must be a finite number greater than 0");return{concurrency:t,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}}function _(e,t){return`
+const __fn = (${e.toString()});
+
+self.onmessage = async function (event) {
+  const { id, input, stream } = event.data;
+
+  // Automatically send heartbeats at half the heartbeatWindow interval.
+  let heartbeatTimer = null;
+  ${t==null?``:`heartbeatTimer = setInterval(() => self.postMessage({ id, heartbeat: true }), ${t});`}
+
+  try {
+    if (stream) {
+      const iterable = await __fn(input);
+      for await (const chunk of iterable) {
+        self.postMessage({ id, chunk });
+      }
+      self.postMessage({ id, result: undefined });
+    } else {
+      const result = await __fn(input);
+      self.postMessage({ id, result });
+    }
+  } catch (error) {
+    self.postMessage({ id, error });
+  } finally {
+    if (heartbeatTimer) clearInterval(heartbeatTimer);
+  }
+}`.trim()}var v=class{config;onSlotError;disposed=!1;pending=null;taskId=0;worker=null;constructor(e,t){this.config=e,this.onSlotError=t}prime(){if(this.disposed)return Promise.resolve();try{this.ensureWorker()}catch{}return Promise.resolve()}run(e,t,n){return this.dispatch(e,t,n,!1)}runStream(e,t,n){let r=[],i=!1,a,o=[],s=e=>{r.push(e),o.shift()?.()},c=e=>{i=!0,a=e;for(let e of o.splice(0))e()};return this.dispatch(e,t,n,!0,s).then(()=>c(),c),this.pending&&(this.pending.finishStream=c),{[Symbol.asyncIterator](){let e=0;return{async next(){for(;e>=r.length&&!i;)await new Promise(e=>o.push(e));if(e<r.length){let t=r[e];return r[e]=null,e++,{done:!1,value:t}}if(a!==void 0)throw a;return{done:!0,value:void 0}}}}}}cancel(){let e=this.pending;e&&(clearTimeout(e.timer),clearTimeout(e.heartbeatWatchdog),this.pending=null,this.stopWorker(),e.finishStream?.(new a(`Stream was cancelled`)))}terminate(){this.disposed=!0,this.stopWorker(),this.failPending(new a)}dispatch(e,t,n,r,i){if(this.disposed)return Promise.reject(new a);let c;try{c=this.ensureWorker()}catch(e){return Promise.reject(e)}let l=this.config.kind===`inline`&&this.config.heartbeatInterval!=null?this.config.heartbeatInterval*2:void 0;return new Promise((a,u)=>{let f=this.taskId++,p={emit:i,id:f,reject:u,resolve:a,watchdogMs:l};n!==void 0&&(p.timer=setTimeout(()=>{this.restart(new o(n))},n),d(p.timer)),l!==void 0&&(p.heartbeatWatchdog=setTimeout(()=>{this.restart(new o(l))},l),d(p.heartbeatWatchdog)),this.pending=p;try{c.postMessage({id:f,input:e,stream:r},t)}catch(e){this.failPending(new s(e instanceof Error?e.message:String(e),{cause:e}))}})}ensureWorker(){if(this.worker)return this.worker;if(typeof globalThis.Worker!=`function`)throw new s(`Worker API is unavailable in this runtime`);let e;if(this.config.kind===`module`)try{e=new Worker(this.config.url,{type:`module`})}catch(e){throw new s(`Failed to create Worker`,{cause:e})}else try{let t=new Blob([_(this.config.fn,this.config.heartbeatInterval)],{type:`application/javascript`}),n=URL.createObjectURL(t);try{e=new Worker(n)}finally{URL.revokeObjectURL(n)}}catch(e){throw new s(`Failed to create Worker`,{cause:e})}return e.onmessage=e=>{let t=this.pending;if(!(!t||e.data.id!==t.id)){if(`heartbeat`in e.data){t.watchdogMs!==void 0&&(clearTimeout(t.heartbeatWatchdog),t.heartbeatWatchdog=setTimeout(()=>{this.restart(new o(t.watchdogMs))},t.watchdogMs),d(t.heartbeatWatchdog));return}if(`chunk`in e.data){t.emit?.(e.data.chunk);return}if(clearTimeout(t.timer),clearTimeout(t.heartbeatWatchdog),this.pending=null,`error`in e.data){let n=e.data.error instanceof Error?e.data.error:Error(String(e.data.error));t.reject(new i(n.message,{cause:n}))}else t.resolve(e.data.result)}},e.onerror=e=>{let t=new s(e.message);this.stopWorker(),this.failPending(t),this.onSlotError?.(t,()=>void this.prime())},this.worker=e,e}failPending(e){let t=this.pending;t&&(clearTimeout(t.timer),clearTimeout(t.heartbeatWatchdog),this.pending=null,t.reject(e))}restart(e){this.stopWorker(),this.failPending(e)}stopWorker(){this.worker&&=(this.worker.terminate(),null)}};function y(e,t){let{concurrency:n,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}=g(t),c=r==null?void 0:Math.floor(r/2);return f(Array.from({length:n},()=>new v({fn:e,heartbeatInterval:c,kind:`inline`},o)),{concurrency:n,defaultTimeout:s,maxQueue:i,onFull:a})}function b(e,t){let{concurrency:n,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}=g(t);r!==void 0&&l("`heartbeatWindow` has no effect on module workers — the worker script must implement the heartbeat protocol manually.");let c=typeof e==`string`?e:e.href;return f(Array.from({length:n},()=>new v({kind:`module`,url:c},o)),{concurrency:n,defaultTimeout:s,maxQueue:i,onFull:a})}exports.FamiliarError=t,exports.FamiliarInvalidOptionsError=n,exports.FamiliarQueueFullError=r,exports.FamiliarRuntimeError=s,exports.FamiliarTaskError=i,exports.FamiliarTerminatedError=a,exports.FamiliarTimeoutError=o,exports.createModuleWorker=b,exports.createWorker=y,exports.task=p;
+//# sourceMappingURL=familiar.cjs.map

package/dist/familiar.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"familiar.cjs","names":[],"sources":["../src/errors.ts","../src/_dev.ts","../src/_queue.ts","../src/_timers.ts","../src/_pool.ts","../src/worker.ts"],"sourcesContent":["/** Base class for all familiar errors. Use `instanceof FamiliarError` to catch any familiar-originated error. */\nexport class FamiliarError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n\n  static is(err: unknown): err is FamiliarError {\n    return err instanceof FamiliarError;\n  }\n}\n\n/** Thrown when invalid options are passed to `createWorker` or `createModuleWorker`. */\nexport class FamiliarInvalidOptionsError extends FamiliarError {}\n\n/** Thrown when run() is called and the queue is full (`onFull='reject'`). */\nexport class FamiliarQueueFullError extends FamiliarError {\n  /** The configured `maxQueue` value. */\n  readonly maxQueue: number;\n\n  constructor(maxQueue: number) {\n    super(`Queue is full (maxQueue=${maxQueue})`);\n    this.maxQueue = maxQueue;\n  }\n}\n\n/** Thrown when the task function throws. The original error is available as `.cause`. */\nexport class FamiliarTaskError extends FamiliarError {}\n\n/** Thrown when a task or operation is rejected because the worker was terminated. */\nexport class FamiliarTerminatedError extends FamiliarError {\n  constructor(message = 'Worker was terminated') {\n    super(message);\n  }\n}\n\n/** Thrown when a task exceeds its timeout or `drain()` times out. */\nexport class FamiliarTimeoutError extends FamiliarError {\n  /** The configured timeout in milliseconds. */\n  readonly timeoutMs: number;\n\n  constructor(timeoutMs: number) {\n    super(`Task timed out after ${timeoutMs}ms`);\n    this.timeoutMs = timeoutMs;\n  }\n}\n\n/** Thrown when the Worker API is unavailable or an unhandled error occurs in the worker thread. */\nexport class FamiliarRuntimeError extends FamiliarError {}\n","const isDev = !(globalThis as { __FAMILIAR_PROD__?: boolean }).__FAMILIAR_PROD__;\n\n/** @internal */\nexport function warn(msg: string): void {\n  if (isDev) console.warn(`[@vielzeug/familiar] ${msg}`);\n}\n\n/** @internal — Run fn only in dev builds. Use when dev-only logic goes beyond a single warn() / error() call. */\nexport function devOnly(fn: () => void): void {\n  if (isDev) fn();\n}\n","/**\n * Internal priority-queue for @vielzeug/familiar.\n * Not part of the public API surface.\n *\n * Uses a binary max-heap ordered by priority (higher value = runs first), with\n * insertion-sequence tiebreaking to ensure FIFO ordering within the same priority.\n * Cancelled items are marked lazily and silently skipped by shift().\n *\n * Complexity:\n *   enqueue  O(log n)\n *   shift    O(log n) amortised (lazy cancellation may scan multiple cancelled tops)\n *   remove   O(n) scan + O(1) mark — adequate for typical queue depths\n */\n\nexport type QueueItem<TInput, TOutput> = {\n  /** Marked true by remove(); the next shift() discards the item silently. */\n  cancelled?: boolean;\n  cleanupAbort?: () => void;\n  input: TInput;\n  /** Scheduling priority. Higher value = runs first. Default: 0. */\n  priority: number;\n  reject: (reason: unknown) => void;\n  resolve: (value: TOutput) => void;\n  signal?: AbortSignal;\n  timeout?: number;\n  transferables: Transferable[];\n};\n\n/**\n * Internal heap node: wraps a QueueItem with an insertion sequence for FIFO tiebreaking.\n * Using a wrapper instead of mutating QueueItem keeps queue items free of internal\n * scheduling metadata (_seq).\n */\ntype HeapEntry<TInput, TOutput> = { readonly _seq: number; readonly item: QueueItem<TInput, TOutput> };\n\nexport class TaskQueue<TInput, TOutput> {\n  private readonly heap: HeapEntry<TInput, TOutput>[] = [];\n  /** Accurate count of live (non-cancelled) items. */\n  private liveCount = 0;\n  private seq = 0;\n\n  /** Number of live (non-cancelled) items. Always accurate. */\n  get size(): number {\n    return this.liveCount;\n  }\n\n  /**\n   * Enqueue item. Returns false (without modifying state) when maxQueue is set and\n   * liveCount has already reached it; returns true on success.\n   */\n  enqueue(item: QueueItem<TInput, TOutput>, maxQueue: number | undefined): boolean {\n    if (maxQueue !== undefined && this.liveCount >= maxQueue) return false;\n\n    this.heap.push({ _seq: this.seq++, item });\n    this.siftUp(this.heap.length - 1);\n    this.liveCount++;\n\n    return true;\n  }\n\n  /**\n   * Dequeue the highest-priority live item. Silently discards cancelled tombstones.\n   * Returns undefined only when there are no live items left.\n   */\n  shift(): QueueItem<TInput, TOutput> | undefined {\n    while (this.heap.length > 0) {\n      const { item } = this.extractTop();\n\n      if (!item.cancelled) {\n        this.liveCount--;\n\n        return item;\n      }\n      // Cancelled: liveCount was already decremented in remove(). Just discard and continue.\n    }\n\n    return undefined;\n  }\n\n  /**\n   * Mark item as cancelled (O(n) scan). The heap slot is reclaimed lazily by the next shift().\n   * Returns true when found and marked, false when the item is not in the queue.\n   */\n  remove(item: QueueItem<TInput, TOutput>): boolean {\n    if (item.cancelled) return false;\n\n    for (let i = 0; i < this.heap.length; i++) {\n      if (this.heap[i]!.item === item) {\n        item.cancelled = true;\n        this.liveCount--;\n\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  // ─── Heap internals ────────────────────────────────────────────────────────\n\n  private extractTop(): HeapEntry<TInput, TOutput> {\n    const top = this.heap[0]!;\n    const last = this.heap.pop()!;\n\n    if (this.heap.length > 0) {\n      this.heap[0] = last;\n      this.siftDown(0);\n    }\n\n    return top;\n  }\n\n  /** Returns true when entry a should be dispatched before entry b. */\n  private higher(a: HeapEntry<TInput, TOutput>, b: HeapEntry<TInput, TOutput>): boolean {\n    if (a.item.priority !== b.item.priority) return a.item.priority > b.item.priority;\n\n    return a._seq < b._seq; // earlier insertion wins for equal priority (FIFO)\n  }\n\n  private siftUp(i: number): void {\n    while (i > 0) {\n      const parent = (i - 1) >> 1;\n\n      if (this.higher(this.heap[i]!, this.heap[parent]!)) {\n        [this.heap[i], this.heap[parent]] = [this.heap[parent]!, this.heap[i]!];\n        i = parent;\n      } else {\n        break;\n      }\n    }\n  }\n\n  private siftDown(i: number): void {\n    const n = this.heap.length;\n\n    for (;;) {\n      let top = i;\n      const left = 2 * i + 1;\n      const right = 2 * i + 2;\n\n      if (left < n && this.higher(this.heap[left]!, this.heap[top]!)) top = left;\n\n      if (right < n && this.higher(this.heap[right]!, this.heap[top]!)) top = right;\n\n      if (top === i) break;\n\n      [this.heap[i], this.heap[top]] = [this.heap[top]!, this.heap[i]!];\n      i = top;\n    }\n  }\n}\n","/**\n * Node compatibility helper: `unref()`s a timer so a pending per-task timeout/watchdog does not\n * keep a Node event loop (e.g. a Worker polyfill) alive. Browsers return a plain number from\n * `setTimeout`/`setInterval`, so this is a no-op there.\n *\n * Not part of the public API surface.\n */\nexport function unrefTimer(timer: ReturnType<typeof setTimeout> | ReturnType<typeof setInterval>): void {\n  if (typeof timer === 'object' && timer !== null && 'unref' in timer) {\n    (timer as { unref(): void }).unref();\n  }\n}\n","/**\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';\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","// Re-export all public types and classes so consumers only need one import.\nexport type {\n  BatchOptions,\n  GroupOptions,\n  RunOptions,\n  TaskFn,\n  TaskGroup,\n  WorkerHandle,\n  WorkerOptions,\n  WorkerStatus,\n} from './types';\nexport {\n  FamiliarError,\n  FamiliarInvalidOptionsError,\n  FamiliarQueueFullError,\n  FamiliarRuntimeError,\n  FamiliarTaskError,\n  FamiliarTerminatedError,\n  FamiliarTimeoutError,\n} from './errors';\n\nimport type { SlotStrategy, TaskFn, WorkerHandle, WorkerOptions } from './types';\n\nimport { warn } from './_dev';\nimport { createPool } from './_pool';\nimport { unrefTimer } from './_timers';\nimport {\n  FamiliarInvalidOptionsError,\n  FamiliarRuntimeError,\n  FamiliarTaskError,\n  FamiliarTerminatedError,\n  FamiliarTimeoutError,\n} from './errors';\n\n// ─── task() — optional validation helper ─────────────────────────────────────\n\n/**\n * Optional helper that validates a function is safe to serialize for use in `createWorker`.\n *\n * `createWorker` accepts any `TaskFn` directly — this helper exists only to catch the common\n * mistake of passing a bound or native function whose body cannot be serialized.\n *\n * IMPORTANT: The function is serialized via `.toString()` and runs in an isolated Worker scope.\n * It **cannot** close over variables from the surrounding module — any outer reference resolves\n * to `undefined` inside the worker.\n *\n * @throws FamiliarInvalidOptionsError if the function is bound or native.\n *\n * @example\n * // Without task() — works fine for plain arrow functions:\n * const worker = createWorker((n: number) => n * 2);\n *\n * // With task() — catches the mistake of passing Math.sqrt directly:\n * const worker = createWorker(task((n: number) => Math.sqrt(n)));\n */\nexport function task<TInput, TOutput>(fn: TaskFn<TInput, TOutput>): TaskFn<TInput, TOutput> {\n  if (fn.toString().includes('[native code]')) {\n    throw new FamiliarInvalidOptionsError('Task function cannot be a bound or native function');\n  }\n\n  return fn;\n}\n\n// ─── Options resolution ───────────────────────────────────────────────────────\n\n/** Upper bound on `concurrency`: generous headroom over realistic hardware/IO limits while still catching obvious misconfiguration (e.g. a typo like `50000`). */\nconst MAX_CONCURRENCY = 512;\n\nfunction resolveConcurrency(value: WorkerOptions['concurrency']): number {\n  if (value === undefined) return 1;\n\n  if (value === 'auto') {\n    return Math.max(1, globalThis.navigator?.hardwareConcurrency ?? 1);\n  }\n\n  if (!Number.isInteger(value) || value < 1 || value > MAX_CONCURRENCY) {\n    throw new FamiliarInvalidOptionsError(`\\`concurrency\\` must be a positive integer ≤ ${MAX_CONCURRENCY} or \"auto\"`);\n  }\n\n  return value;\n}\n\nfunction resolveOptions(options: WorkerOptions = {}): {\n  concurrency: number;\n  heartbeatWindow: number | undefined;\n  maxQueue: number | undefined;\n  onFull: 'reject' | 'wait';\n  onSlotError: WorkerOptions['onSlotError'];\n  timeout: number | undefined;\n} {\n  const concurrency = resolveConcurrency(options.concurrency);\n  const { heartbeatWindow, maxQueue, onFull = 'reject', onSlotError, timeout } = options;\n\n  if (timeout !== undefined && (!Number.isFinite(timeout) || timeout <= 0)) {\n    throw new FamiliarInvalidOptionsError('`timeout` must be a finite number greater than 0');\n  }\n\n  if (maxQueue !== undefined && (!Number.isInteger(maxQueue) || maxQueue < 1)) {\n    throw new FamiliarInvalidOptionsError('`maxQueue` must be a positive integer');\n  }\n\n  if (heartbeatWindow !== undefined && (!Number.isFinite(heartbeatWindow) || heartbeatWindow <= 0)) {\n    throw new FamiliarInvalidOptionsError('`heartbeatWindow` must be a finite number greater than 0');\n  }\n\n  return { concurrency, heartbeatWindow, maxQueue, onFull, onSlotError, timeout };\n}\n\n// ─── Worker script builder ────────────────────────────────────────────────────\n\n/**\n * @security `fn.toString()` is injected verbatim into the blob script. Any code embedded in the\n * serialized function executes only inside the isolated Worker scope — no shared memory, no access\n * to the host page's globals. Risk is therefore low, but callers should only pass plain functions\n * that do not close over module scope.\n */\nfunction buildWorkerScript(fn: TaskFn<unknown, unknown>, heartbeatInterval: number | undefined): string {\n  return `\nconst __fn = (${fn.toString()});\n\nself.onmessage = async function (event) {\n  const { id, input, stream } = event.data;\n\n  // Automatically send heartbeats at half the heartbeatWindow interval.\n  let heartbeatTimer = null;\n  ${heartbeatInterval != null ? `heartbeatTimer = setInterval(() => self.postMessage({ id, heartbeat: true }), ${heartbeatInterval});` : ''}\n\n  try {\n    if (stream) {\n      const iterable = await __fn(input);\n      for await (const chunk of iterable) {\n        self.postMessage({ id, chunk });\n      }\n      self.postMessage({ id, result: undefined });\n    } else {\n      const result = await __fn(input);\n      self.postMessage({ id, result });\n    }\n  } catch (error) {\n    self.postMessage({ id, error });\n  } finally {\n    if (heartbeatTimer) clearInterval(heartbeatTimer);\n  }\n}`.trim();\n}\n\n// ─── SlotConfig discriminated union ──────────────────────────────────────────\n\ntype SlotConfig<TInput, TOutput> =\n  | { fn: TaskFn<TInput, TOutput>; heartbeatInterval: number | undefined; kind: 'inline' }\n  | { kind: 'module'; url: string };\n\n// ─── PendingTask ─────────────────────────────────────────────────────────────\n\ntype SlotMessage<TOutput> =\n  | { error: unknown; id: number }\n  | { chunk: TOutput; id: number }\n  | { heartbeat: true; id: number }\n  | { id: number; result: TOutput };\n\ntype PendingTask<TOutput> = {\n  /** Emits intermediate stream chunks. Undefined for non-streaming tasks. */\n  emit?: (chunk: TOutput) => void;\n  /** Called with an error when the streaming dispatch is cancelled mid-flight, so the finish closure drains its waiters. */\n  finishStream?: (err: unknown) => void;\n  /**\n   * Single-shot timer that fires if no heartbeat is received within watchdogMs.\n   * Reset (cleared + recreated) on every incoming heartbeat message.\n   * Uses setTimeout because the watchdog is conceptually one-shot with manual reset,\n   * not a recurring interval.\n   */\n  heartbeatWatchdog?: ReturnType<typeof setTimeout>;\n  id: number;\n  reject: (reason: unknown) => void;\n  resolve: (value: TOutput) => void;\n  timer?: ReturnType<typeof setTimeout>;\n  /** Watchdog window in ms (= heartbeatWindow). Stored on PendingTask to reset the timer on each heartbeat. */\n  watchdogMs?: number;\n};\n\n// ─── Slot — implements SlotStrategy ──────────────────────────────────────────\n\nclass Slot<TInput, TOutput> implements SlotStrategy<TInput, TOutput> {\n  private readonly config: SlotConfig<TInput, TOutput>;\n  private readonly onSlotError: WorkerOptions['onSlotError'];\n  private disposed = false;\n  private pending: PendingTask<TOutput> | null = null;\n  private taskId = 0;\n  private worker: Worker | null = null;\n\n  constructor(config: SlotConfig<TInput, TOutput>, onSlotError?: WorkerOptions['onSlotError']) {\n    this.config = config;\n    this.onSlotError = onSlotError;\n  }\n\n  prime(): Promise<void> {\n    if (this.disposed) return Promise.resolve();\n\n    try {\n      this.ensureWorker();\n    } catch {\n      // Best-effort — errors surface on the first run() call.\n    }\n\n    return Promise.resolve();\n  }\n\n  run(input: TInput, transferables: Transferable[], timeout: number | undefined): Promise<TOutput> {\n    return this.dispatch(input, transferables, timeout, false) as Promise<TOutput>;\n  }\n\n  runStream(input: TInput, transferables: Transferable[], timeout: number | undefined): AsyncIterable<TOutput> {\n    const chunks: TOutput[] = [];\n    let done = false;\n    let error: unknown;\n    const waiters: Array<() => void> = [];\n\n    const emit = (chunk: TOutput) => {\n      chunks.push(chunk);\n      waiters.shift()?.();\n    };\n\n    const finish = (err?: unknown) => {\n      done = true;\n      error = err;\n\n      for (const w of waiters.splice(0)) w();\n    };\n\n    // Dispatch the task in stream mode. The promise resolves when the worker signals done.\n    // finishStream is stored on the PendingTask so cancel() can drain the waiters if the\n    // consumer exits early (break/throw from for-await), preventing a permanently dangling Promise.\n    // this.pending is set synchronously inside dispatch(), so this assignment is safe.\n    this.dispatch(input, transferables, timeout, true, emit).then(() => finish(), finish);\n\n    if (this.pending) this.pending.finishStream = finish;\n\n    return {\n      [Symbol.asyncIterator]() {\n        let cursor = 0;\n\n        return {\n          async next(): Promise<IteratorResult<TOutput>> {\n            while (cursor >= chunks.length && !done) {\n              await new Promise<void>((resolve) => waiters.push(resolve));\n            }\n\n            if (cursor < chunks.length) {\n              const value = chunks[cursor]!;\n\n              // Null-out the consumed slot so GC can collect the value\n              // without waiting for the entire stream to close.\n              (chunks as (TOutput | null)[])[cursor] = null;\n              cursor++;\n\n              return { done: false, value };\n            }\n\n            if (error !== undefined) throw error;\n\n            return { done: true, value: undefined as unknown as TOutput };\n          },\n        };\n      },\n    };\n  }\n\n  cancel(): void {\n    const pending = this.pending;\n\n    if (!pending) return;\n\n    clearTimeout(pending.timer);\n    clearTimeout(pending.heartbeatWatchdog);\n    this.pending = null;\n    // Terminate the worker: the streaming task may still be running and sending chunks.\n    // A fresh worker is created on the next run() or runStream() call via ensureWorker().\n    this.stopWorker();\n    // Drain the stream finish closure so any pending .next() waiters resolve immediately\n    // rather than leaking as permanently dangling Promises.\n    pending.finishStream?.(new FamiliarTerminatedError('Stream was cancelled'));\n  }\n\n  terminate(): void {\n    this.disposed = true;\n    this.stopWorker();\n    this.failPending(new FamiliarTerminatedError());\n  }\n\n  private dispatch(\n    input: TInput,\n    transferables: Transferable[],\n    timeout: number | undefined,\n    stream: boolean,\n    emit?: (chunk: TOutput) => void,\n  ): Promise<TOutput | void> {\n    if (this.disposed) {\n      return Promise.reject(new FamiliarTerminatedError());\n    }\n\n    let worker: Worker;\n\n    try {\n      worker = this.ensureWorker();\n    } catch (error) {\n      return Promise.reject(error);\n    }\n\n    // watchdogMs = heartbeatInterval * 2 (Nyquist margin: worker beats at interval, host allows 2× before firing).\n    const watchdogMs =\n      this.config.kind === 'inline' && this.config.heartbeatInterval != null\n        ? this.config.heartbeatInterval * 2\n        : undefined;\n\n    return new Promise<TOutput | void>((resolve, reject) => {\n      const id = this.taskId++;\n      const pending: PendingTask<TOutput> = {\n        emit,\n        id,\n        reject,\n        resolve: resolve as (v: TOutput) => void,\n        watchdogMs,\n      };\n\n      if (timeout !== undefined) {\n        pending.timer = setTimeout(() => {\n          this.restart(new FamiliarTimeoutError(timeout));\n        }, timeout);\n        unrefTimer(pending.timer);\n      }\n\n      if (watchdogMs !== undefined) {\n        pending.heartbeatWatchdog = setTimeout(() => {\n          this.restart(new FamiliarTimeoutError(watchdogMs));\n        }, watchdogMs);\n        unrefTimer(pending.heartbeatWatchdog);\n      }\n\n      this.pending = pending;\n\n      try {\n        worker.postMessage({ id, input, stream }, transferables);\n      } catch (err) {\n        this.failPending(new FamiliarRuntimeError(err instanceof Error ? err.message : String(err), { cause: err }));\n      }\n    });\n  }\n\n  private ensureWorker(): Worker {\n    if (this.worker) return this.worker;\n\n    if (typeof globalThis.Worker !== 'function') {\n      throw new FamiliarRuntimeError('Worker API is unavailable in this runtime');\n    }\n\n    let worker: Worker;\n\n    if (this.config.kind === 'module') {\n      try {\n        worker = new Worker(this.config.url, { type: 'module' });\n      } catch (error) {\n        throw new FamiliarRuntimeError('Failed to create Worker', { cause: error });\n      }\n    } else {\n      try {\n        const blob = new Blob(\n          [buildWorkerScript(this.config.fn as TaskFn<unknown, unknown>, this.config.heartbeatInterval)],\n          { type: 'application/javascript' },\n        );\n        const url = URL.createObjectURL(blob);\n\n        try {\n          worker = new Worker(url);\n        } finally {\n          URL.revokeObjectURL(url);\n        }\n      } catch (error) {\n        throw new FamiliarRuntimeError('Failed to create Worker', { cause: error });\n      }\n    }\n\n    worker.onmessage = (event: MessageEvent<SlotMessage<TOutput>>) => {\n      const pending = this.pending;\n\n      if (!pending || event.data.id !== pending.id) return;\n\n      // Handle heartbeat message — reset the watchdog timer.\n      if ('heartbeat' in event.data) {\n        if (pending.watchdogMs !== undefined) {\n          clearTimeout(pending.heartbeatWatchdog);\n          pending.heartbeatWatchdog = setTimeout(() => {\n            this.restart(new FamiliarTimeoutError(pending.watchdogMs!));\n          }, pending.watchdogMs);\n          unrefTimer(pending.heartbeatWatchdog);\n        }\n\n        return;\n      }\n\n      if ('chunk' in event.data) {\n        pending.emit?.(event.data.chunk);\n\n        return;\n      }\n\n      clearTimeout(pending.timer);\n      clearTimeout(pending.heartbeatWatchdog);\n      this.pending = null;\n\n      if ('error' in event.data) {\n        const cause = event.data.error instanceof Error ? event.data.error : new Error(String(event.data.error));\n\n        pending.reject(new FamiliarTaskError(cause.message, { cause }));\n      } else {\n        pending.resolve(event.data.result);\n      }\n    };\n\n    worker.onerror = (event: ErrorEvent) => {\n      const error = new FamiliarRuntimeError(event.message);\n\n      // Stop and fail before calling the external callback so it sees a clean state.\n      this.stopWorker();\n      this.failPending(error);\n\n      this.onSlotError?.(error, () => void this.prime());\n    };\n\n    this.worker = worker;\n\n    return worker;\n  }\n\n  private failPending(reason: unknown): void {\n    const pending = this.pending;\n\n    if (!pending) return;\n\n    clearTimeout(pending.timer);\n    clearTimeout(pending.heartbeatWatchdog);\n    this.pending = null;\n    pending.reject(reason);\n  }\n\n  private restart(reason: unknown): void {\n    this.stopWorker();\n    this.failPending(reason);\n  }\n\n  private stopWorker(): void {\n    if (!this.worker) return;\n\n    this.worker.terminate();\n    this.worker = null;\n  }\n}\n\n// ─── createWorker ─────────────────────────────────────────────────────────────\n\n/**\n * Creates a pool of Web Workers that run `fn` in parallel.\n *\n * The task function is serialized via `.toString()` and runs in a separate global scope.\n * It cannot close over variables from the surrounding module.\n *\n * Use the optional `task()` helper to validate that the function is not bound or native.\n * For workers that need imports, see `createModuleWorker`.\n *\n * @example\n * // Plain arrow function — most common case:\n * const worker = createWorker((n: number) => n * 2);\n *\n * // With task() for validation:\n * const worker = createWorker(task((n: number) => n * 2));\n */\nexport function createWorker<TInput, TOutput>(\n  fn: TaskFn<TInput, TOutput>,\n  options?: WorkerOptions,\n): WorkerHandle<TInput, TOutput> {\n  const { concurrency, heartbeatWindow, maxQueue, onFull, onSlotError, timeout } = resolveOptions(options);\n  const heartbeatInterval = heartbeatWindow != null ? Math.floor(heartbeatWindow / 2) : undefined;\n\n  const slots = Array.from(\n    { length: concurrency },\n    () => new Slot<TInput, TOutput>({ fn, heartbeatInterval, kind: 'inline' }, onSlotError),\n  );\n\n  return createPool(slots, {\n    concurrency,\n    defaultTimeout: timeout,\n    maxQueue,\n    onFull,\n  });\n}\n\n// ─── createModuleWorker ───────────────────────────────────────────────────────\n\n/**\n * Creates a pool of module-type Web Workers loaded from a real URL.\n *\n * Unlike `createWorker`, the worker file is a regular module — it can import utilities,\n * use top-level await, and reference module scope.\n *\n * Use `handleMessages` from `@vielzeug/familiar/protocol` in the worker file to implement\n * the message protocol without boilerplate.\n *\n * **Protocol**: The worker module must handle the `{ id, input }` message format and reply\n * with `{ id, result }` or `{ id, error: { name, message, stack } }`. For streaming, it must\n * send one or more `{ id, chunk }` messages followed by `{ id, result: undefined }`.\n * For heartbeat support, send `{ id, heartbeat: true }` at regular intervals.\n *\n * @example\n * ```ts\n * // my-worker.ts — use handleMessages for zero boilerplate:\n * import { handleMessages } from '@vielzeug/familiar/protocol';\n * handleMessages(async (input: number) => input * 2);\n *\n * // main.ts\n * const pool = createModuleWorker<number, number>(\n *   new URL('./my-worker.ts', import.meta.url),\n *   { concurrency: 4 },\n * );\n * ```\n */\nexport function createModuleWorker<TInput, TOutput>(\n  url: URL | string,\n  options?: WorkerOptions,\n): WorkerHandle<TInput, TOutput> {\n  const { concurrency, heartbeatWindow, maxQueue, onFull, onSlotError, timeout } = resolveOptions(options);\n\n  if (heartbeatWindow !== undefined) {\n    warn(\n      '`heartbeatWindow` has no effect on module workers — the worker script must implement the heartbeat protocol manually.',\n    );\n  }\n\n  const href = typeof url === 'string' ? url : url.href;\n\n  const slots = Array.from(\n    { length: concurrency },\n    () => new Slot<TInput, TOutput>({ kind: 'module', url: href }, onSlotError),\n  );\n\n  return createPool(slots, {\n    concurrency,\n    defaultTimeout: timeout,\n    maxQueue,\n    onFull,\n  });\n}\n"],"mappings":"sGACA,IAAa,EAAb,MAAa,UAAsB,KAAM,CACvC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,IAAI,OAAO,KACvB,OAAO,eAAe,KAAM,IAAI,OAAO,SAAS,CAClD,CAEA,OAAO,GAAG,EAAoC,CAC5C,OAAO,aAAe,CACxB,CACF,EAGa,EAAb,cAAiD,CAAc,CAAC,EAGnD,EAAb,cAA4C,CAAc,CAExD,SAEA,YAAY,EAAkB,CAC5B,MAAM,2BAA2B,EAAS,EAAE,EAC5C,KAAK,SAAW,CAClB,CACF,EAGa,EAAb,cAAuC,CAAc,CAAC,EAGzC,EAAb,cAA6C,CAAc,CACzD,YAAY,EAAU,wBAAyB,CAC7C,MAAM,CAAO,CACf,CACF,EAGa,EAAb,cAA0C,CAAc,CAEtD,UAEA,YAAY,EAAmB,CAC7B,MAAM,wBAAwB,EAAU,GAAG,EAC3C,KAAK,UAAY,CACnB,CACF,EAGa,EAAb,cAA0C,CAAc,CAAC,ECjDnD,EAAQ,CAAE,WAA+C,kBAG/D,SAAgB,EAAK,EAAmB,CAClC,GAAO,QAAQ,KAAK,wBAAwB,GAAK,CACvD,CC8BA,IAAa,EAAb,KAAwC,CACtC,KAAsD,CAAC,EAEvD,UAAoB,EACpB,IAAc,EAGd,IAAI,MAAe,CACjB,OAAO,KAAK,SACd,CAMA,QAAQ,EAAkC,EAAuC,CAO/E,OANI,IAAa,IAAA,IAAa,KAAK,WAAa,EAAiB,IAEjE,KAAK,KAAK,KAAK,CAAE,KAAM,KAAK,MAAO,MAAK,CAAC,EACzC,KAAK,OAAO,KAAK,KAAK,OAAS,CAAC,EAChC,KAAK,YAEE,GACT,CAMA,OAAgD,CAC9C,KAAO,KAAK,KAAK,OAAS,GAAG,CAC3B,GAAM,CAAE,QAAS,KAAK,WAAW,EAEjC,GAAI,CAAC,EAAK,UAGR,MAFA,MAAK,YAEE,CAGX,CAGF,CAMA,OAAO,EAA2C,CAChD,GAAI,EAAK,UAAW,MAAO,GAE3B,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,GAAI,KAAK,KAAK,EAAE,CAAE,OAAS,EAIzB,MAHA,GAAK,UAAY,GACjB,KAAK,YAEE,GAIX,MAAO,EACT,CAIA,YAAiD,CAC/C,IAAM,EAAM,KAAK,KAAK,GAChB,EAAO,KAAK,KAAK,IAAI,EAO3B,OALI,KAAK,KAAK,OAAS,IACrB,KAAK,KAAK,GAAK,EACf,KAAK,SAAS,CAAC,GAGV,CACT,CAGA,OAAe,EAA+B,EAAwC,CAGpF,OAFI,EAAE,KAAK,WAAa,EAAE,KAAK,SAExB,EAAE,KAAO,EAAE,KAF8B,EAAE,KAAK,SAAW,EAAE,KAAK,QAG3E,CAEA,OAAe,EAAiB,CAC9B,KAAO,EAAI,GAAG,CACZ,IAAM,EAAU,EAAI,GAAM,EAE1B,GAAI,KAAK,OAAO,KAAK,KAAK,GAAK,KAAK,KAAK,EAAQ,EAC/C,CAAC,KAAK,KAAK,GAAI,KAAK,KAAK,IAAW,CAAC,KAAK,KAAK,GAAU,KAAK,KAAK,EAAG,EACtE,EAAI,OAEJ,KAEJ,CACF,CAEA,SAAiB,EAAiB,CAChC,IAAM,EAAI,KAAK,KAAK,OAEpB,OAAS,CACP,IAAI,EAAM,EACJ,EAAO,EAAI,EAAI,EACf,EAAQ,EAAI,EAAI,EAMtB,GAJI,EAAO,GAAK,KAAK,OAAO,KAAK,KAAK,GAAQ,KAAK,KAAK,EAAK,IAAG,EAAM,GAElE,EAAQ,GAAK,KAAK,OAAO,KAAK,KAAK,GAAS,KAAK,KAAK,EAAK,IAAG,EAAM,GAEpE,IAAQ,EAAG,MAEf,CAAC,KAAK,KAAK,GAAI,KAAK,KAAK,IAAQ,CAAC,KAAK,KAAK,GAAO,KAAK,KAAK,EAAG,EAChE,EAAI,CACN,CACF,CACF,EC/IA,SAAgB,EAAW,EAA6E,CAClG,OAAO,GAAU,UAAY,GAAkB,UAAW,GAC5D,EAA6B,MAAM,CAEvC,CCuBA,SAAgB,EACd,EACA,EAC+B,CAC/B,GAAM,CAAE,cAAa,iBAAgB,WAAU,UAAW,EACpD,EAAY,CAAC,GAAG,CAAK,EACrB,EAAQ,IAAI,EACZ,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,CAC5C,EAAc,KAAK,CAAO,EAEtB,IAAc,IAAA,IAShB,EARc,eAAiB,CAC7B,IAAM,EAAM,EAAc,QAAQ,CAAO,EAErC,IAAQ,IAAI,EAAc,OAAO,EAAK,CAAC,EAE3C,EAAO,IAAI,EAAqB,CAAS,CAAC,CAC5C,EAAG,CAEQ,CAAK,CAEpB,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,IAA0B,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,EAAA,EAAA,WAAA,CAAkB,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,CAAyB,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,EAGZ,GAAI,EACF,MAAM,IAAI,EAAwB,oBAAoB,EAGxD,GAAI,GAAQ,QACV,MAAA,EAAA,EAAA,WAAA,CAAiB,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,EAE1B,GAAI,EAAc,MAAM,IAAI,EAAwB,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,EAAuB,CAAkB,EAGrD,GAAI,EAAQ,CACV,IAAM,MAAgB,CACf,EAAM,OAAO,CAAI,IAEtB,EAAK,eAAe,EACpB,GAAA,EAAA,EAAA,WAAA,CAAkB,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,EAAqB,uBAAuB,EAGxD,IAAM,EAAO,EAAU,IAAI,EAE3B,GAAI,CAAC,EACH,MAAM,IAAI,EACR,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,CCpeA,SAAgB,EAAsB,EAAsD,CAC1F,GAAI,EAAG,SAAS,CAAC,CAAC,SAAS,eAAe,EACxC,MAAM,IAAI,EAA4B,oDAAoD,EAG5F,OAAO,CACT,CAKA,IAAM,EAAkB,IAExB,SAAS,EAAmB,EAA6C,CACvE,GAAI,IAAU,IAAA,GAAW,MAAO,GAEhC,GAAI,IAAU,OACZ,OAAO,KAAK,IAAI,EAAG,WAAW,WAAW,qBAAuB,CAAC,EAGnE,GAAI,CAAC,OAAO,UAAU,CAAK,GAAK,EAAQ,GAAK,EAAQ,EACnD,MAAM,IAAI,EAA4B,gDAAgD,EAAgB,WAAW,EAGnH,OAAO,CACT,CAEA,SAAS,EAAe,EAAyB,CAAC,EAOhD,CACA,IAAM,EAAc,EAAmB,EAAQ,WAAW,EACpD,CAAE,kBAAiB,WAAU,SAAS,SAAU,cAAa,WAAY,EAE/E,GAAI,IAAY,IAAA,KAAc,CAAC,OAAO,SAAS,CAAO,GAAK,GAAW,GACpE,MAAM,IAAI,EAA4B,kDAAkD,EAG1F,GAAI,IAAa,IAAA,KAAc,CAAC,OAAO,UAAU,CAAQ,GAAK,EAAW,GACvE,MAAM,IAAI,EAA4B,uCAAuC,EAG/E,GAAI,IAAoB,IAAA,KAAc,CAAC,OAAO,SAAS,CAAe,GAAK,GAAmB,GAC5F,MAAM,IAAI,EAA4B,0DAA0D,EAGlG,MAAO,CAAE,cAAa,kBAAiB,WAAU,SAAQ,cAAa,SAAQ,CAChF,CAUA,SAAS,EAAkB,EAA8B,EAA+C,CACtG,MAAO;gBACO,EAAG,SAAS,EAAE;;;;;;;IAO1B,GAAqB,KAAgH,GAAzG,iFAAiF,EAAkB,IAAS;;;;;;;;;;;;;;;;;;GAkBzI,KAAK,CACR,CAsCA,IAAM,EAAN,KAAqE,CACnE,OACA,YACA,SAAmB,GACnB,QAA+C,KAC/C,OAAiB,EACjB,OAAgC,KAEhC,YAAY,EAAqC,EAA4C,CAC3F,KAAK,OAAS,EACd,KAAK,YAAc,CACrB,CAEA,OAAuB,CACrB,GAAI,KAAK,SAAU,OAAO,QAAQ,QAAQ,EAE1C,GAAI,CACF,KAAK,aAAa,CACpB,MAAQ,CAER,CAEA,OAAO,QAAQ,QAAQ,CACzB,CAEA,IAAI,EAAe,EAA+B,EAA+C,CAC/F,OAAO,KAAK,SAAS,EAAO,EAAe,EAAS,EAAK,CAC3D,CAEA,UAAU,EAAe,EAA+B,EAAqD,CAC3G,IAAM,EAAoB,CAAC,EACvB,EAAO,GACP,EACE,EAA6B,CAAC,EAE9B,EAAQ,GAAmB,CAC/B,EAAO,KAAK,CAAK,EACjB,EAAQ,MAAM,CAAC,GAAG,CACpB,EAEM,EAAU,GAAkB,CAChC,EAAO,GACP,EAAQ,EAER,IAAK,IAAM,KAAK,EAAQ,OAAO,CAAC,EAAG,EAAE,CACvC,EAUA,OAJA,KAAK,SAAS,EAAO,EAAe,EAAS,GAAM,CAAI,CAAC,CAAC,SAAW,EAAO,EAAG,CAAM,EAEhF,KAAK,UAAS,KAAK,QAAQ,aAAe,GAEvC,CACL,CAAC,OAAO,gBAAiB,CACvB,IAAI,EAAS,EAEb,MAAO,CACL,MAAM,MAAyC,CAC7C,KAAO,GAAU,EAAO,QAAU,CAAC,GACjC,MAAM,IAAI,QAAe,GAAY,EAAQ,KAAK,CAAO,CAAC,EAG5D,GAAI,EAAS,EAAO,OAAQ,CAC1B,IAAM,EAAQ,EAAO,GAOrB,MAHA,GAA+B,GAAU,KACzC,IAEO,CAAE,KAAM,GAAO,OAAM,CAC9B,CAEA,GAAI,IAAU,IAAA,GAAW,MAAM,EAE/B,MAAO,CAAE,KAAM,GAAM,MAAO,IAAA,EAAgC,CAC9D,CACF,CACF,CACF,CACF,CAEA,QAAe,CACb,IAAM,EAAU,KAAK,QAEhB,IAEL,aAAa,EAAQ,KAAK,EAC1B,aAAa,EAAQ,iBAAiB,EACtC,KAAK,QAAU,KAGf,KAAK,WAAW,EAGhB,EAAQ,eAAe,IAAI,EAAwB,sBAAsB,CAAC,EAC5E,CAEA,WAAkB,CAChB,KAAK,SAAW,GAChB,KAAK,WAAW,EAChB,KAAK,YAAY,IAAI,CAAyB,CAChD,CAEA,SACE,EACA,EACA,EACA,EACA,EACyB,CACzB,GAAI,KAAK,SACP,OAAO,QAAQ,OAAO,IAAI,CAAyB,EAGrD,IAAI,EAEJ,GAAI,CACF,EAAS,KAAK,aAAa,CAC7B,OAAS,EAAO,CACd,OAAO,QAAQ,OAAO,CAAK,CAC7B,CAGA,IAAM,EACJ,KAAK,OAAO,OAAS,UAAY,KAAK,OAAO,mBAAqB,KAC9D,KAAK,OAAO,kBAAoB,EAChC,IAAA,GAEN,OAAO,IAAI,SAAyB,EAAS,IAAW,CACtD,IAAM,EAAK,KAAK,SACV,EAAgC,CACpC,OACA,KACA,SACS,UACT,YACF,EAEI,IAAY,IAAA,KACd,EAAQ,MAAQ,eAAiB,CAC/B,KAAK,QAAQ,IAAI,EAAqB,CAAO,CAAC,CAChD,EAAG,CAAO,EACV,EAAW,EAAQ,KAAK,GAGtB,IAAe,IAAA,KACjB,EAAQ,kBAAoB,eAAiB,CAC3C,KAAK,QAAQ,IAAI,EAAqB,CAAU,CAAC,CACnD,EAAG,CAAU,EACb,EAAW,EAAQ,iBAAiB,GAGtC,KAAK,QAAU,EAEf,GAAI,CACF,EAAO,YAAY,CAAE,KAAI,QAAO,QAAO,EAAG,CAAa,CACzD,OAAS,EAAK,CACZ,KAAK,YAAY,IAAI,EAAqB,aAAe,MAAQ,EAAI,QAAU,OAAO,CAAG,EAAG,CAAE,MAAO,CAAI,CAAC,CAAC,CAC7G,CACF,CAAC,CACH,CAEA,cAA+B,CAC7B,GAAI,KAAK,OAAQ,OAAO,KAAK,OAE7B,GAAI,OAAO,WAAW,QAAW,WAC/B,MAAM,IAAI,EAAqB,2CAA2C,EAG5E,IAAI,EAEJ,GAAI,KAAK,OAAO,OAAS,SACvB,GAAI,CACF,EAAS,IAAI,OAAO,KAAK,OAAO,IAAK,CAAE,KAAM,QAAS,CAAC,CACzD,OAAS,EAAO,CACd,MAAM,IAAI,EAAqB,0BAA2B,CAAE,MAAO,CAAM,CAAC,CAC5E,MAEA,GAAI,CACF,IAAM,EAAO,IAAI,KACf,CAAC,EAAkB,KAAK,OAAO,GAAgC,KAAK,OAAO,iBAAiB,CAAC,EAC7F,CAAE,KAAM,wBAAyB,CACnC,EACM,EAAM,IAAI,gBAAgB,CAAI,EAEpC,GAAI,CACF,EAAS,IAAI,OAAO,CAAG,CACzB,QAAU,CACR,IAAI,gBAAgB,CAAG,CACzB,CACF,OAAS,EAAO,CACd,MAAM,IAAI,EAAqB,0BAA2B,CAAE,MAAO,CAAM,CAAC,CAC5E,CAoDF,MAjDA,GAAO,UAAa,GAA8C,CAChE,IAAM,EAAU,KAAK,QAEjB,MAAC,GAAW,EAAM,KAAK,KAAO,EAAQ,IAG1C,IAAI,cAAe,EAAM,KAAM,CACzB,EAAQ,aAAe,IAAA,KACzB,aAAa,EAAQ,iBAAiB,EACtC,EAAQ,kBAAoB,eAAiB,CAC3C,KAAK,QAAQ,IAAI,EAAqB,EAAQ,UAAW,CAAC,CAC5D,EAAG,EAAQ,UAAU,EACrB,EAAW,EAAQ,iBAAiB,GAGtC,MACF,CAEA,GAAI,UAAW,EAAM,KAAM,CACzB,EAAQ,OAAO,EAAM,KAAK,KAAK,EAE/B,MACF,CAMA,GAJA,aAAa,EAAQ,KAAK,EAC1B,aAAa,EAAQ,iBAAiB,EACtC,KAAK,QAAU,KAEX,UAAW,EAAM,KAAM,CACzB,IAAM,EAAQ,EAAM,KAAK,iBAAiB,MAAQ,EAAM,KAAK,MAAY,MAAM,OAAO,EAAM,KAAK,KAAK,CAAC,EAEvG,EAAQ,OAAO,IAAI,EAAkB,EAAM,QAAS,CAAE,OAAM,CAAC,CAAC,CAChE,MACE,EAAQ,QAAQ,EAAM,KAAK,MAAM,CAjBnC,CAmBF,EAEA,EAAO,QAAW,GAAsB,CACtC,IAAM,EAAQ,IAAI,EAAqB,EAAM,OAAO,EAGpD,KAAK,WAAW,EAChB,KAAK,YAAY,CAAK,EAEtB,KAAK,cAAc,MAAa,KAAK,KAAK,MAAM,CAAC,CACnD,EAEA,KAAK,OAAS,EAEP,CACT,CAEA,YAAoB,EAAuB,CACzC,IAAM,EAAU,KAAK,QAEhB,IAEL,aAAa,EAAQ,KAAK,EAC1B,aAAa,EAAQ,iBAAiB,EACtC,KAAK,QAAU,KACf,EAAQ,OAAO,CAAM,EACvB,CAEA,QAAgB,EAAuB,CACrC,KAAK,WAAW,EAChB,KAAK,YAAY,CAAM,CACzB,CAEA,YAA2B,CACpB,AAGL,KAAK,UADL,KAAK,OAAO,UAAU,EACR,KAChB,CACF,EAoBA,SAAgB,EACd,EACA,EAC+B,CAC/B,GAAM,CAAE,cAAa,kBAAiB,WAAU,SAAQ,cAAa,WAAY,EAAe,CAAO,EACjG,EAAoB,GAAmB,KAAyC,IAAA,GAAlC,KAAK,MAAM,EAAkB,CAAC,EAOlF,OAAO,EALO,MAAM,KAClB,CAAE,OAAQ,CAAY,MAChB,IAAI,EAAsB,CAAE,KAAI,oBAAmB,KAAM,QAAS,EAAG,CAAW,CAGtE,EAAO,CACvB,cACA,eAAgB,EAChB,WACA,QACF,CAAC,CACH,CA+BA,SAAgB,EACd,EACA,EAC+B,CAC/B,GAAM,CAAE,cAAa,kBAAiB,WAAU,SAAQ,cAAa,WAAY,EAAe,CAAO,EAEnG,IAAoB,IAAA,IACtB,EACE,uHACF,EAGF,IAAM,EAAO,OAAO,GAAQ,SAAW,EAAM,EAAI,KAOjD,OAAO,EALO,MAAM,KAClB,CAAE,OAAQ,CAAY,MAChB,IAAI,EAAsB,CAAE,KAAM,SAAU,IAAK,CAAK,EAAG,CAAW,CAG1D,EAAO,CACvB,cACA,eAAgB,EAChB,WACA,QACF,CAAC,CACH"}

package/dist/familiar.iife.js

@@ -0,0 +1,28 @@
+var Familiar=(function(e,t){Object.defineProperty(e,Symbol.toStringTag,{value:`Module`});var n=class e extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}static is(t){return t instanceof e}},r=class extends n{},i=class extends n{maxQueue;constructor(e){super(`Queue is full (maxQueue=${e})`),this.maxQueue=e}},a=class extends n{},o=class extends n{constructor(e=`Worker was terminated`){super(e)}},s=class extends n{timeoutMs;constructor(e){super(`Task timed out after ${e}ms`),this.timeoutMs=e}},c=class extends n{},l=!globalThis.__FAMILIAR_PROD__;function u(e){l&&console.warn(`[@vielzeug/familiar] ${e}`)}var d=class{heap=[];liveCount=0;seq=0;get size(){return this.liveCount}enqueue(e,t){return t!==void 0&&this.liveCount>=t?!1:(this.heap.push({_seq:this.seq++,item:e}),this.siftUp(this.heap.length-1),this.liveCount++,!0)}shift(){for(;this.heap.length>0;){let{item:e}=this.extractTop();if(!e.cancelled)return this.liveCount--,e}}remove(e){if(e.cancelled)return!1;for(let t=0;t<this.heap.length;t++)if(this.heap[t].item===e)return e.cancelled=!0,this.liveCount--,!0;return!1}extractTop(){let e=this.heap[0],t=this.heap.pop();return this.heap.length>0&&(this.heap[0]=t,this.siftDown(0)),e}higher(e,t){return e.item.priority===t.item.priority?e._seq<t._seq:e.item.priority>t.item.priority}siftUp(e){for(;e>0;){let t=e-1>>1;if(this.higher(this.heap[e],this.heap[t]))[this.heap[e],this.heap[t]]=[this.heap[t],this.heap[e]],e=t;else break}}siftDown(e){let t=this.heap.length;for(;;){let n=e,r=2*e+1,i=2*e+2;if(r<t&&this.higher(this.heap[r],this.heap[n])&&(n=r),i<t&&this.higher(this.heap[i],this.heap[n])&&(n=i),n===e)break;[this.heap[e],this.heap[n]]=[this.heap[n],this.heap[e]],e=n}}};function f(e){typeof e==`object`&&e&&`unref`in e&&e.unref()}function p(e,n){let{concurrency:r,defaultTimeout:a,maxQueue:l,onFull:u}=n,p=[...e],m=new d,h=new AbortController,g=[],_=[],v=0,y,b=0,x=0,S=0,C=!1;function w(){return v===0&&m.size===0}function T(){if(!w()||g.length===0)return;let e=g.splice(0);for(let t of e)t()}function E(e){return w()?Promise.resolve():new Promise((t,n)=>{g.push(t),e!==void 0&&f(setTimeout(()=>{let r=g.indexOf(t);r!==-1&&g.splice(r,1),n(new s(e))},e))})}function D(){let e=_.shift();e&&e()}let O=!1;function k(){if(!(C||O)){for(O=!0;!C&&p.length>0&&m.size>0;){let e=A();if(!e)break;let t=p.pop();e.cleanupAbort?.(),v+=1,D();let n=e.timeout??a;t.run(e.input,e.transferables,n).then(n=>{p.push(t),--v,b+=1,e.resolve(n),k(),w()&&T()},n=>{p.push(t),--v,n instanceof o||(x+=1),e.reject(n),k(),w()&&T()})}O=!1}}function A(){for(;m.size>0;){let e=m.shift();if(!e)break;if(e.signal?.aborted){e.cleanupAbort?.(),e.reject((0,t.abortError)(e.signal));continue}return e}T()}function j(){if(C)return;C=!0,h.abort();for(let t of e)t.terminate();for(;m.size>0;){let e=m.shift();if(!e)break;e.cleanupAbort?.(),e.reject(new o)}let t=g.splice(0);for(let e of t)e();for(let e of _.splice(0))e()}function M(e){return C?Promise.resolve():y||(y=E(e).then(j,e=>{throw j(),e}),y)}async function N(e,n={}){let{priority:r=0,signal:a,timeout:s,transferables:c=[]}=n;if(C)throw new o;if(y)throw new o(`Worker is draining`);if(a?.aborted)throw(0,t.abortError)(a);if(u===`wait`&&l!==void 0){for(;!C&&!y&&m.size>=l;)await new Promise(e=>_.push(e));if(C)throw new o;if(y)throw new o(`Worker is draining`)}let d,f,p=new Promise((e,t)=>{d=e,f=t}),h={input:e,priority:r,reject:f,resolve:d,signal:a,timeout:s,transferables:c};if(!m.enqueue(h,u===`wait`?void 0:l))throw new i(l);if(a){let e=()=>{m.remove(h)&&(h.cleanupAbort?.(),f((0,t.abortError)(a)),T())};h.cleanupAbort=()=>{a.removeEventListener(`abort`,e),h.cleanupAbort=void 0},a.addEventListener(`abort`,e,{once:!0})}return k(),p}function P(t,n={}){if(C)throw new c(`Worker was terminated`);let r=p.pop();if(!r)throw new c(`runStream() requires a free worker slot; all ${e.length} slot${e.length===1?``:`s`} are busy`);let{timeout:i,transferables:a=[]}=n,o=r.runStream(t,a,i);return{[Symbol.asyncIterator](){let e=o[Symbol.asyncIterator](),t=!1,n=()=>{t||(t=!0,p.push(r))};return{async next(){let t=await e.next();return t.done&&n(),t},async return(t){return r.cancel(),n(),e.return?.(t)??{done:!0,value:t}},async throw(t){if(r.cancel(),n(),e.throw)return e.throw(t);throw t}}}}}async function*F(e,t={}){if(e.length===0)return;let{ordered:n=!0,...i}=t,a=new AbortController;try{if(n){let t=e.map(e=>N(e,{...i,signal:a.signal}));for(let e of t)yield await e}else{let t=[],n=null,s=0,c=Math.max(1,r);function o(){if(s>=e.length)return;let r=e[s++];N(r,{...i,signal:a.signal}).then(e=>{t.push({value:e}),n?.(),n=null},e=>{t.push({error:e}),n?.(),n=null})}for(let t=0;t<c&&t<e.length;t++)o();for(let r=0;r<e.length;r++){for(;t.length===0;)await new Promise(e=>{n=e});let e=t.shift();if(`error`in e)throw e.error;yield e.value,o()}}}finally{a.abort()}}function I(e,t={}){let n=new AbortController;if(t.signal){let e=t.signal;e.aborted?n.abort(e.reason):e.addEventListener(`abort`,()=>n.abort(e.reason),{once:!0})}S+=1;let r=0,i=0,a=!1,o=[];function s(){!a&&r>0&&r===i&&(a=!0,--S)}return{abort(e){n.abort(e)},drain(){let e=o.splice(0);return a||(a=!0,--S),Promise.allSettled(e)},get name(){return e},get pending(){return r-i},run(e,t={}){r+=1;let a=N(e,{...t,signal:n.signal});return o.push(a),a.then(()=>{i+=1,s()},()=>{i+=1,s()}),a},get size(){return r}}}function L(){return C?`terminated`:v>0||m.size>0?`running`:`idle`}return{get active(){return v},batch:F,get completed(){return b},get concurrency(){return r},get disposalSignal(){return h.signal},dispose:j,get disposed(){return C},drain:M,get failed(){return x},group:I,get groupCount(){return S},prime(){return Promise.all(e.map(e=>e.prime())).then(()=>{})},get queued(){return m.size},run:N,runStream:P,get status(){return L()},[Symbol.asyncDispose]:()=>M(),[Symbol.dispose]:j}}function m(e){if(e.toString().includes(`[native code]`))throw new r(`Task function cannot be a bound or native function`);return e}var h=512;function g(e){if(e===void 0)return 1;if(e===`auto`)return Math.max(1,globalThis.navigator?.hardwareConcurrency??1);if(!Number.isInteger(e)||e<1||e>h)throw new r(`\`concurrency\` must be a positive integer ≤ ${h} or "auto"`);return e}function _(e={}){let t=g(e.concurrency),{heartbeatWindow:n,maxQueue:i,onFull:a=`reject`,onSlotError:o,timeout:s}=e;if(s!==void 0&&(!Number.isFinite(s)||s<=0))throw new r("`timeout` must be a finite number greater than 0");if(i!==void 0&&(!Number.isInteger(i)||i<1))throw new r("`maxQueue` must be a positive integer");if(n!==void 0&&(!Number.isFinite(n)||n<=0))throw new r("`heartbeatWindow` must be a finite number greater than 0");return{concurrency:t,heartbeatWindow:n,maxQueue:i,onFull:a,onSlotError:o,timeout:s}}function v(e,t){return`
+const __fn = (${e.toString()});
+
+self.onmessage = async function (event) {
+  const { id, input, stream } = event.data;
+
+  // Automatically send heartbeats at half the heartbeatWindow interval.
+  let heartbeatTimer = null;
+  ${t==null?``:`heartbeatTimer = setInterval(() => self.postMessage({ id, heartbeat: true }), ${t});`}
+
+  try {
+    if (stream) {
+      const iterable = await __fn(input);
+      for await (const chunk of iterable) {
+        self.postMessage({ id, chunk });
+      }
+      self.postMessage({ id, result: undefined });
+    } else {
+      const result = await __fn(input);
+      self.postMessage({ id, result });
+    }
+  } catch (error) {
+    self.postMessage({ id, error });
+  } finally {
+    if (heartbeatTimer) clearInterval(heartbeatTimer);
+  }
+}`.trim()}var y=class{config;onSlotError;disposed=!1;pending=null;taskId=0;worker=null;constructor(e,t){this.config=e,this.onSlotError=t}prime(){if(this.disposed)return Promise.resolve();try{this.ensureWorker()}catch{}return Promise.resolve()}run(e,t,n){return this.dispatch(e,t,n,!1)}runStream(e,t,n){let r=[],i=!1,a,o=[],s=e=>{r.push(e),o.shift()?.()},c=e=>{i=!0,a=e;for(let e of o.splice(0))e()};return this.dispatch(e,t,n,!0,s).then(()=>c(),c),this.pending&&(this.pending.finishStream=c),{[Symbol.asyncIterator](){let e=0;return{async next(){for(;e>=r.length&&!i;)await new Promise(e=>o.push(e));if(e<r.length){let t=r[e];return r[e]=null,e++,{done:!1,value:t}}if(a!==void 0)throw a;return{done:!0,value:void 0}}}}}}cancel(){let e=this.pending;e&&(clearTimeout(e.timer),clearTimeout(e.heartbeatWatchdog),this.pending=null,this.stopWorker(),e.finishStream?.(new o(`Stream was cancelled`)))}terminate(){this.disposed=!0,this.stopWorker(),this.failPending(new o)}dispatch(e,t,n,r,i){if(this.disposed)return Promise.reject(new o);let a;try{a=this.ensureWorker()}catch(e){return Promise.reject(e)}let l=this.config.kind===`inline`&&this.config.heartbeatInterval!=null?this.config.heartbeatInterval*2:void 0;return new Promise((o,u)=>{let d=this.taskId++,p={emit:i,id:d,reject:u,resolve:o,watchdogMs:l};n!==void 0&&(p.timer=setTimeout(()=>{this.restart(new s(n))},n),f(p.timer)),l!==void 0&&(p.heartbeatWatchdog=setTimeout(()=>{this.restart(new s(l))},l),f(p.heartbeatWatchdog)),this.pending=p;try{a.postMessage({id:d,input:e,stream:r},t)}catch(e){this.failPending(new c(e instanceof Error?e.message:String(e),{cause:e}))}})}ensureWorker(){if(this.worker)return this.worker;if(typeof globalThis.Worker!=`function`)throw new c(`Worker API is unavailable in this runtime`);let e;if(this.config.kind===`module`)try{e=new Worker(this.config.url,{type:`module`})}catch(e){throw new c(`Failed to create Worker`,{cause:e})}else try{let t=new Blob([v(this.config.fn,this.config.heartbeatInterval)],{type:`application/javascript`}),n=URL.createObjectURL(t);try{e=new Worker(n)}finally{URL.revokeObjectURL(n)}}catch(e){throw new c(`Failed to create Worker`,{cause:e})}return e.onmessage=e=>{let t=this.pending;if(!(!t||e.data.id!==t.id)){if(`heartbeat`in e.data){t.watchdogMs!==void 0&&(clearTimeout(t.heartbeatWatchdog),t.heartbeatWatchdog=setTimeout(()=>{this.restart(new s(t.watchdogMs))},t.watchdogMs),f(t.heartbeatWatchdog));return}if(`chunk`in e.data){t.emit?.(e.data.chunk);return}if(clearTimeout(t.timer),clearTimeout(t.heartbeatWatchdog),this.pending=null,`error`in e.data){let n=e.data.error instanceof Error?e.data.error:Error(String(e.data.error));t.reject(new a(n.message,{cause:n}))}else t.resolve(e.data.result)}},e.onerror=e=>{let t=new c(e.message);this.stopWorker(),this.failPending(t),this.onSlotError?.(t,()=>void this.prime())},this.worker=e,e}failPending(e){let t=this.pending;t&&(clearTimeout(t.timer),clearTimeout(t.heartbeatWatchdog),this.pending=null,t.reject(e))}restart(e){this.stopWorker(),this.failPending(e)}stopWorker(){this.worker&&=(this.worker.terminate(),null)}};function b(e,t){let{concurrency:n,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}=_(t),c=r==null?void 0:Math.floor(r/2);return p(Array.from({length:n},()=>new y({fn:e,heartbeatInterval:c,kind:`inline`},o)),{concurrency:n,defaultTimeout:s,maxQueue:i,onFull:a})}function x(e,t){let{concurrency:n,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}=_(t);r!==void 0&&u("`heartbeatWindow` has no effect on module workers — the worker script must implement the heartbeat protocol manually.");let c=typeof e==`string`?e:e.href;return p(Array.from({length:n},()=>new y({kind:`module`,url:c},o)),{concurrency:n,defaultTimeout:s,maxQueue:i,onFull:a})}return e.FamiliarError=n,e.FamiliarInvalidOptionsError=r,e.FamiliarQueueFullError=i,e.FamiliarRuntimeError=c,e.FamiliarTaskError=a,e.FamiliarTerminatedError=o,e.FamiliarTimeoutError=s,e.createModuleWorker=x,e.createWorker=b,e.task=m,e})({},Arsenal);
+//# sourceMappingURL=familiar.iife.js.map

package/dist/familiar.iife.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"familiar.iife.js","names":[],"sources":["../src/errors.ts","../src/_dev.ts","../src/_queue.ts","../src/_timers.ts","../src/_pool.ts","../src/worker.ts"],"sourcesContent":["/** Base class for all familiar errors. Use `instanceof FamiliarError` to catch any familiar-originated error. */\nexport class FamiliarError extends Error {\n  constructor(message: string, opts?: ErrorOptions) {\n    super(message, opts);\n    this.name = new.target.name;\n    Object.setPrototypeOf(this, new.target.prototype);\n  }\n\n  static is(err: unknown): err is FamiliarError {\n    return err instanceof FamiliarError;\n  }\n}\n\n/** Thrown when invalid options are passed to `createWorker` or `createModuleWorker`. */\nexport class FamiliarInvalidOptionsError extends FamiliarError {}\n\n/** Thrown when run() is called and the queue is full (`onFull='reject'`). */\nexport class FamiliarQueueFullError extends FamiliarError {\n  /** The configured `maxQueue` value. */\n  readonly maxQueue: number;\n\n  constructor(maxQueue: number) {\n    super(`Queue is full (maxQueue=${maxQueue})`);\n    this.maxQueue = maxQueue;\n  }\n}\n\n/** Thrown when the task function throws. The original error is available as `.cause`. */\nexport class FamiliarTaskError extends FamiliarError {}\n\n/** Thrown when a task or operation is rejected because the worker was terminated. */\nexport class FamiliarTerminatedError extends FamiliarError {\n  constructor(message = 'Worker was terminated') {\n    super(message);\n  }\n}\n\n/** Thrown when a task exceeds its timeout or `drain()` times out. */\nexport class FamiliarTimeoutError extends FamiliarError {\n  /** The configured timeout in milliseconds. */\n  readonly timeoutMs: number;\n\n  constructor(timeoutMs: number) {\n    super(`Task timed out after ${timeoutMs}ms`);\n    this.timeoutMs = timeoutMs;\n  }\n}\n\n/** Thrown when the Worker API is unavailable or an unhandled error occurs in the worker thread. */\nexport class FamiliarRuntimeError extends FamiliarError {}\n","const isDev = !(globalThis as { __FAMILIAR_PROD__?: boolean }).__FAMILIAR_PROD__;\n\n/** @internal */\nexport function warn(msg: string): void {\n  if (isDev) console.warn(`[@vielzeug/familiar] ${msg}`);\n}\n\n/** @internal — Run fn only in dev builds. Use when dev-only logic goes beyond a single warn() / error() call. */\nexport function devOnly(fn: () => void): void {\n  if (isDev) fn();\n}\n","/**\n * Internal priority-queue for @vielzeug/familiar.\n * Not part of the public API surface.\n *\n * Uses a binary max-heap ordered by priority (higher value = runs first), with\n * insertion-sequence tiebreaking to ensure FIFO ordering within the same priority.\n * Cancelled items are marked lazily and silently skipped by shift().\n *\n * Complexity:\n *   enqueue  O(log n)\n *   shift    O(log n) amortised (lazy cancellation may scan multiple cancelled tops)\n *   remove   O(n) scan + O(1) mark — adequate for typical queue depths\n */\n\nexport type QueueItem<TInput, TOutput> = {\n  /** Marked true by remove(); the next shift() discards the item silently. */\n  cancelled?: boolean;\n  cleanupAbort?: () => void;\n  input: TInput;\n  /** Scheduling priority. Higher value = runs first. Default: 0. */\n  priority: number;\n  reject: (reason: unknown) => void;\n  resolve: (value: TOutput) => void;\n  signal?: AbortSignal;\n  timeout?: number;\n  transferables: Transferable[];\n};\n\n/**\n * Internal heap node: wraps a QueueItem with an insertion sequence for FIFO tiebreaking.\n * Using a wrapper instead of mutating QueueItem keeps queue items free of internal\n * scheduling metadata (_seq).\n */\ntype HeapEntry<TInput, TOutput> = { readonly _seq: number; readonly item: QueueItem<TInput, TOutput> };\n\nexport class TaskQueue<TInput, TOutput> {\n  private readonly heap: HeapEntry<TInput, TOutput>[] = [];\n  /** Accurate count of live (non-cancelled) items. */\n  private liveCount = 0;\n  private seq = 0;\n\n  /** Number of live (non-cancelled) items. Always accurate. */\n  get size(): number {\n    return this.liveCount;\n  }\n\n  /**\n   * Enqueue item. Returns false (without modifying state) when maxQueue is set and\n   * liveCount has already reached it; returns true on success.\n   */\n  enqueue(item: QueueItem<TInput, TOutput>, maxQueue: number | undefined): boolean {\n    if (maxQueue !== undefined && this.liveCount >= maxQueue) return false;\n\n    this.heap.push({ _seq: this.seq++, item });\n    this.siftUp(this.heap.length - 1);\n    this.liveCount++;\n\n    return true;\n  }\n\n  /**\n   * Dequeue the highest-priority live item. Silently discards cancelled tombstones.\n   * Returns undefined only when there are no live items left.\n   */\n  shift(): QueueItem<TInput, TOutput> | undefined {\n    while (this.heap.length > 0) {\n      const { item } = this.extractTop();\n\n      if (!item.cancelled) {\n        this.liveCount--;\n\n        return item;\n      }\n      // Cancelled: liveCount was already decremented in remove(). Just discard and continue.\n    }\n\n    return undefined;\n  }\n\n  /**\n   * Mark item as cancelled (O(n) scan). The heap slot is reclaimed lazily by the next shift().\n   * Returns true when found and marked, false when the item is not in the queue.\n   */\n  remove(item: QueueItem<TInput, TOutput>): boolean {\n    if (item.cancelled) return false;\n\n    for (let i = 0; i < this.heap.length; i++) {\n      if (this.heap[i]!.item === item) {\n        item.cancelled = true;\n        this.liveCount--;\n\n        return true;\n      }\n    }\n\n    return false;\n  }\n\n  // ─── Heap internals ────────────────────────────────────────────────────────\n\n  private extractTop(): HeapEntry<TInput, TOutput> {\n    const top = this.heap[0]!;\n    const last = this.heap.pop()!;\n\n    if (this.heap.length > 0) {\n      this.heap[0] = last;\n      this.siftDown(0);\n    }\n\n    return top;\n  }\n\n  /** Returns true when entry a should be dispatched before entry b. */\n  private higher(a: HeapEntry<TInput, TOutput>, b: HeapEntry<TInput, TOutput>): boolean {\n    if (a.item.priority !== b.item.priority) return a.item.priority > b.item.priority;\n\n    return a._seq < b._seq; // earlier insertion wins for equal priority (FIFO)\n  }\n\n  private siftUp(i: number): void {\n    while (i > 0) {\n      const parent = (i - 1) >> 1;\n\n      if (this.higher(this.heap[i]!, this.heap[parent]!)) {\n        [this.heap[i], this.heap[parent]] = [this.heap[parent]!, this.heap[i]!];\n        i = parent;\n      } else {\n        break;\n      }\n    }\n  }\n\n  private siftDown(i: number): void {\n    const n = this.heap.length;\n\n    for (;;) {\n      let top = i;\n      const left = 2 * i + 1;\n      const right = 2 * i + 2;\n\n      if (left < n && this.higher(this.heap[left]!, this.heap[top]!)) top = left;\n\n      if (right < n && this.higher(this.heap[right]!, this.heap[top]!)) top = right;\n\n      if (top === i) break;\n\n      [this.heap[i], this.heap[top]] = [this.heap[top]!, this.heap[i]!];\n      i = top;\n    }\n  }\n}\n","/**\n * Node compatibility helper: `unref()`s a timer so a pending per-task timeout/watchdog does not\n * keep a Node event loop (e.g. a Worker polyfill) alive. Browsers return a plain number from\n * `setTimeout`/`setInterval`, so this is a no-op there.\n *\n * Not part of the public API surface.\n */\nexport function unrefTimer(timer: ReturnType<typeof setTimeout> | ReturnType<typeof setInterval>): void {\n  if (typeof timer === 'object' && timer !== null && 'unref' in timer) {\n    (timer as { unref(): void }).unref();\n  }\n}\n","/**\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';\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","// Re-export all public types and classes so consumers only need one import.\nexport type {\n  BatchOptions,\n  GroupOptions,\n  RunOptions,\n  TaskFn,\n  TaskGroup,\n  WorkerHandle,\n  WorkerOptions,\n  WorkerStatus,\n} from './types';\nexport {\n  FamiliarError,\n  FamiliarInvalidOptionsError,\n  FamiliarQueueFullError,\n  FamiliarRuntimeError,\n  FamiliarTaskError,\n  FamiliarTerminatedError,\n  FamiliarTimeoutError,\n} from './errors';\n\nimport type { SlotStrategy, TaskFn, WorkerHandle, WorkerOptions } from './types';\n\nimport { warn } from './_dev';\nimport { createPool } from './_pool';\nimport { unrefTimer } from './_timers';\nimport {\n  FamiliarInvalidOptionsError,\n  FamiliarRuntimeError,\n  FamiliarTaskError,\n  FamiliarTerminatedError,\n  FamiliarTimeoutError,\n} from './errors';\n\n// ─── task() — optional validation helper ─────────────────────────────────────\n\n/**\n * Optional helper that validates a function is safe to serialize for use in `createWorker`.\n *\n * `createWorker` accepts any `TaskFn` directly — this helper exists only to catch the common\n * mistake of passing a bound or native function whose body cannot be serialized.\n *\n * IMPORTANT: The function is serialized via `.toString()` and runs in an isolated Worker scope.\n * It **cannot** close over variables from the surrounding module — any outer reference resolves\n * to `undefined` inside the worker.\n *\n * @throws FamiliarInvalidOptionsError if the function is bound or native.\n *\n * @example\n * // Without task() — works fine for plain arrow functions:\n * const worker = createWorker((n: number) => n * 2);\n *\n * // With task() — catches the mistake of passing Math.sqrt directly:\n * const worker = createWorker(task((n: number) => Math.sqrt(n)));\n */\nexport function task<TInput, TOutput>(fn: TaskFn<TInput, TOutput>): TaskFn<TInput, TOutput> {\n  if (fn.toString().includes('[native code]')) {\n    throw new FamiliarInvalidOptionsError('Task function cannot be a bound or native function');\n  }\n\n  return fn;\n}\n\n// ─── Options resolution ───────────────────────────────────────────────────────\n\n/** Upper bound on `concurrency`: generous headroom over realistic hardware/IO limits while still catching obvious misconfiguration (e.g. a typo like `50000`). */\nconst MAX_CONCURRENCY = 512;\n\nfunction resolveConcurrency(value: WorkerOptions['concurrency']): number {\n  if (value === undefined) return 1;\n\n  if (value === 'auto') {\n    return Math.max(1, globalThis.navigator?.hardwareConcurrency ?? 1);\n  }\n\n  if (!Number.isInteger(value) || value < 1 || value > MAX_CONCURRENCY) {\n    throw new FamiliarInvalidOptionsError(`\\`concurrency\\` must be a positive integer ≤ ${MAX_CONCURRENCY} or \"auto\"`);\n  }\n\n  return value;\n}\n\nfunction resolveOptions(options: WorkerOptions = {}): {\n  concurrency: number;\n  heartbeatWindow: number | undefined;\n  maxQueue: number | undefined;\n  onFull: 'reject' | 'wait';\n  onSlotError: WorkerOptions['onSlotError'];\n  timeout: number | undefined;\n} {\n  const concurrency = resolveConcurrency(options.concurrency);\n  const { heartbeatWindow, maxQueue, onFull = 'reject', onSlotError, timeout } = options;\n\n  if (timeout !== undefined && (!Number.isFinite(timeout) || timeout <= 0)) {\n    throw new FamiliarInvalidOptionsError('`timeout` must be a finite number greater than 0');\n  }\n\n  if (maxQueue !== undefined && (!Number.isInteger(maxQueue) || maxQueue < 1)) {\n    throw new FamiliarInvalidOptionsError('`maxQueue` must be a positive integer');\n  }\n\n  if (heartbeatWindow !== undefined && (!Number.isFinite(heartbeatWindow) || heartbeatWindow <= 0)) {\n    throw new FamiliarInvalidOptionsError('`heartbeatWindow` must be a finite number greater than 0');\n  }\n\n  return { concurrency, heartbeatWindow, maxQueue, onFull, onSlotError, timeout };\n}\n\n// ─── Worker script builder ────────────────────────────────────────────────────\n\n/**\n * @security `fn.toString()` is injected verbatim into the blob script. Any code embedded in the\n * serialized function executes only inside the isolated Worker scope — no shared memory, no access\n * to the host page's globals. Risk is therefore low, but callers should only pass plain functions\n * that do not close over module scope.\n */\nfunction buildWorkerScript(fn: TaskFn<unknown, unknown>, heartbeatInterval: number | undefined): string {\n  return `\nconst __fn = (${fn.toString()});\n\nself.onmessage = async function (event) {\n  const { id, input, stream } = event.data;\n\n  // Automatically send heartbeats at half the heartbeatWindow interval.\n  let heartbeatTimer = null;\n  ${heartbeatInterval != null ? `heartbeatTimer = setInterval(() => self.postMessage({ id, heartbeat: true }), ${heartbeatInterval});` : ''}\n\n  try {\n    if (stream) {\n      const iterable = await __fn(input);\n      for await (const chunk of iterable) {\n        self.postMessage({ id, chunk });\n      }\n      self.postMessage({ id, result: undefined });\n    } else {\n      const result = await __fn(input);\n      self.postMessage({ id, result });\n    }\n  } catch (error) {\n    self.postMessage({ id, error });\n  } finally {\n    if (heartbeatTimer) clearInterval(heartbeatTimer);\n  }\n}`.trim();\n}\n\n// ─── SlotConfig discriminated union ──────────────────────────────────────────\n\ntype SlotConfig<TInput, TOutput> =\n  | { fn: TaskFn<TInput, TOutput>; heartbeatInterval: number | undefined; kind: 'inline' }\n  | { kind: 'module'; url: string };\n\n// ─── PendingTask ─────────────────────────────────────────────────────────────\n\ntype SlotMessage<TOutput> =\n  | { error: unknown; id: number }\n  | { chunk: TOutput; id: number }\n  | { heartbeat: true; id: number }\n  | { id: number; result: TOutput };\n\ntype PendingTask<TOutput> = {\n  /** Emits intermediate stream chunks. Undefined for non-streaming tasks. */\n  emit?: (chunk: TOutput) => void;\n  /** Called with an error when the streaming dispatch is cancelled mid-flight, so the finish closure drains its waiters. */\n  finishStream?: (err: unknown) => void;\n  /**\n   * Single-shot timer that fires if no heartbeat is received within watchdogMs.\n   * Reset (cleared + recreated) on every incoming heartbeat message.\n   * Uses setTimeout because the watchdog is conceptually one-shot with manual reset,\n   * not a recurring interval.\n   */\n  heartbeatWatchdog?: ReturnType<typeof setTimeout>;\n  id: number;\n  reject: (reason: unknown) => void;\n  resolve: (value: TOutput) => void;\n  timer?: ReturnType<typeof setTimeout>;\n  /** Watchdog window in ms (= heartbeatWindow). Stored on PendingTask to reset the timer on each heartbeat. */\n  watchdogMs?: number;\n};\n\n// ─── Slot — implements SlotStrategy ──────────────────────────────────────────\n\nclass Slot<TInput, TOutput> implements SlotStrategy<TInput, TOutput> {\n  private readonly config: SlotConfig<TInput, TOutput>;\n  private readonly onSlotError: WorkerOptions['onSlotError'];\n  private disposed = false;\n  private pending: PendingTask<TOutput> | null = null;\n  private taskId = 0;\n  private worker: Worker | null = null;\n\n  constructor(config: SlotConfig<TInput, TOutput>, onSlotError?: WorkerOptions['onSlotError']) {\n    this.config = config;\n    this.onSlotError = onSlotError;\n  }\n\n  prime(): Promise<void> {\n    if (this.disposed) return Promise.resolve();\n\n    try {\n      this.ensureWorker();\n    } catch {\n      // Best-effort — errors surface on the first run() call.\n    }\n\n    return Promise.resolve();\n  }\n\n  run(input: TInput, transferables: Transferable[], timeout: number | undefined): Promise<TOutput> {\n    return this.dispatch(input, transferables, timeout, false) as Promise<TOutput>;\n  }\n\n  runStream(input: TInput, transferables: Transferable[], timeout: number | undefined): AsyncIterable<TOutput> {\n    const chunks: TOutput[] = [];\n    let done = false;\n    let error: unknown;\n    const waiters: Array<() => void> = [];\n\n    const emit = (chunk: TOutput) => {\n      chunks.push(chunk);\n      waiters.shift()?.();\n    };\n\n    const finish = (err?: unknown) => {\n      done = true;\n      error = err;\n\n      for (const w of waiters.splice(0)) w();\n    };\n\n    // Dispatch the task in stream mode. The promise resolves when the worker signals done.\n    // finishStream is stored on the PendingTask so cancel() can drain the waiters if the\n    // consumer exits early (break/throw from for-await), preventing a permanently dangling Promise.\n    // this.pending is set synchronously inside dispatch(), so this assignment is safe.\n    this.dispatch(input, transferables, timeout, true, emit).then(() => finish(), finish);\n\n    if (this.pending) this.pending.finishStream = finish;\n\n    return {\n      [Symbol.asyncIterator]() {\n        let cursor = 0;\n\n        return {\n          async next(): Promise<IteratorResult<TOutput>> {\n            while (cursor >= chunks.length && !done) {\n              await new Promise<void>((resolve) => waiters.push(resolve));\n            }\n\n            if (cursor < chunks.length) {\n              const value = chunks[cursor]!;\n\n              // Null-out the consumed slot so GC can collect the value\n              // without waiting for the entire stream to close.\n              (chunks as (TOutput | null)[])[cursor] = null;\n              cursor++;\n\n              return { done: false, value };\n            }\n\n            if (error !== undefined) throw error;\n\n            return { done: true, value: undefined as unknown as TOutput };\n          },\n        };\n      },\n    };\n  }\n\n  cancel(): void {\n    const pending = this.pending;\n\n    if (!pending) return;\n\n    clearTimeout(pending.timer);\n    clearTimeout(pending.heartbeatWatchdog);\n    this.pending = null;\n    // Terminate the worker: the streaming task may still be running and sending chunks.\n    // A fresh worker is created on the next run() or runStream() call via ensureWorker().\n    this.stopWorker();\n    // Drain the stream finish closure so any pending .next() waiters resolve immediately\n    // rather than leaking as permanently dangling Promises.\n    pending.finishStream?.(new FamiliarTerminatedError('Stream was cancelled'));\n  }\n\n  terminate(): void {\n    this.disposed = true;\n    this.stopWorker();\n    this.failPending(new FamiliarTerminatedError());\n  }\n\n  private dispatch(\n    input: TInput,\n    transferables: Transferable[],\n    timeout: number | undefined,\n    stream: boolean,\n    emit?: (chunk: TOutput) => void,\n  ): Promise<TOutput | void> {\n    if (this.disposed) {\n      return Promise.reject(new FamiliarTerminatedError());\n    }\n\n    let worker: Worker;\n\n    try {\n      worker = this.ensureWorker();\n    } catch (error) {\n      return Promise.reject(error);\n    }\n\n    // watchdogMs = heartbeatInterval * 2 (Nyquist margin: worker beats at interval, host allows 2× before firing).\n    const watchdogMs =\n      this.config.kind === 'inline' && this.config.heartbeatInterval != null\n        ? this.config.heartbeatInterval * 2\n        : undefined;\n\n    return new Promise<TOutput | void>((resolve, reject) => {\n      const id = this.taskId++;\n      const pending: PendingTask<TOutput> = {\n        emit,\n        id,\n        reject,\n        resolve: resolve as (v: TOutput) => void,\n        watchdogMs,\n      };\n\n      if (timeout !== undefined) {\n        pending.timer = setTimeout(() => {\n          this.restart(new FamiliarTimeoutError(timeout));\n        }, timeout);\n        unrefTimer(pending.timer);\n      }\n\n      if (watchdogMs !== undefined) {\n        pending.heartbeatWatchdog = setTimeout(() => {\n          this.restart(new FamiliarTimeoutError(watchdogMs));\n        }, watchdogMs);\n        unrefTimer(pending.heartbeatWatchdog);\n      }\n\n      this.pending = pending;\n\n      try {\n        worker.postMessage({ id, input, stream }, transferables);\n      } catch (err) {\n        this.failPending(new FamiliarRuntimeError(err instanceof Error ? err.message : String(err), { cause: err }));\n      }\n    });\n  }\n\n  private ensureWorker(): Worker {\n    if (this.worker) return this.worker;\n\n    if (typeof globalThis.Worker !== 'function') {\n      throw new FamiliarRuntimeError('Worker API is unavailable in this runtime');\n    }\n\n    let worker: Worker;\n\n    if (this.config.kind === 'module') {\n      try {\n        worker = new Worker(this.config.url, { type: 'module' });\n      } catch (error) {\n        throw new FamiliarRuntimeError('Failed to create Worker', { cause: error });\n      }\n    } else {\n      try {\n        const blob = new Blob(\n          [buildWorkerScript(this.config.fn as TaskFn<unknown, unknown>, this.config.heartbeatInterval)],\n          { type: 'application/javascript' },\n        );\n        const url = URL.createObjectURL(blob);\n\n        try {\n          worker = new Worker(url);\n        } finally {\n          URL.revokeObjectURL(url);\n        }\n      } catch (error) {\n        throw new FamiliarRuntimeError('Failed to create Worker', { cause: error });\n      }\n    }\n\n    worker.onmessage = (event: MessageEvent<SlotMessage<TOutput>>) => {\n      const pending = this.pending;\n\n      if (!pending || event.data.id !== pending.id) return;\n\n      // Handle heartbeat message — reset the watchdog timer.\n      if ('heartbeat' in event.data) {\n        if (pending.watchdogMs !== undefined) {\n          clearTimeout(pending.heartbeatWatchdog);\n          pending.heartbeatWatchdog = setTimeout(() => {\n            this.restart(new FamiliarTimeoutError(pending.watchdogMs!));\n          }, pending.watchdogMs);\n          unrefTimer(pending.heartbeatWatchdog);\n        }\n\n        return;\n      }\n\n      if ('chunk' in event.data) {\n        pending.emit?.(event.data.chunk);\n\n        return;\n      }\n\n      clearTimeout(pending.timer);\n      clearTimeout(pending.heartbeatWatchdog);\n      this.pending = null;\n\n      if ('error' in event.data) {\n        const cause = event.data.error instanceof Error ? event.data.error : new Error(String(event.data.error));\n\n        pending.reject(new FamiliarTaskError(cause.message, { cause }));\n      } else {\n        pending.resolve(event.data.result);\n      }\n    };\n\n    worker.onerror = (event: ErrorEvent) => {\n      const error = new FamiliarRuntimeError(event.message);\n\n      // Stop and fail before calling the external callback so it sees a clean state.\n      this.stopWorker();\n      this.failPending(error);\n\n      this.onSlotError?.(error, () => void this.prime());\n    };\n\n    this.worker = worker;\n\n    return worker;\n  }\n\n  private failPending(reason: unknown): void {\n    const pending = this.pending;\n\n    if (!pending) return;\n\n    clearTimeout(pending.timer);\n    clearTimeout(pending.heartbeatWatchdog);\n    this.pending = null;\n    pending.reject(reason);\n  }\n\n  private restart(reason: unknown): void {\n    this.stopWorker();\n    this.failPending(reason);\n  }\n\n  private stopWorker(): void {\n    if (!this.worker) return;\n\n    this.worker.terminate();\n    this.worker = null;\n  }\n}\n\n// ─── createWorker ─────────────────────────────────────────────────────────────\n\n/**\n * Creates a pool of Web Workers that run `fn` in parallel.\n *\n * The task function is serialized via `.toString()` and runs in a separate global scope.\n * It cannot close over variables from the surrounding module.\n *\n * Use the optional `task()` helper to validate that the function is not bound or native.\n * For workers that need imports, see `createModuleWorker`.\n *\n * @example\n * // Plain arrow function — most common case:\n * const worker = createWorker((n: number) => n * 2);\n *\n * // With task() for validation:\n * const worker = createWorker(task((n: number) => n * 2));\n */\nexport function createWorker<TInput, TOutput>(\n  fn: TaskFn<TInput, TOutput>,\n  options?: WorkerOptions,\n): WorkerHandle<TInput, TOutput> {\n  const { concurrency, heartbeatWindow, maxQueue, onFull, onSlotError, timeout } = resolveOptions(options);\n  const heartbeatInterval = heartbeatWindow != null ? Math.floor(heartbeatWindow / 2) : undefined;\n\n  const slots = Array.from(\n    { length: concurrency },\n    () => new Slot<TInput, TOutput>({ fn, heartbeatInterval, kind: 'inline' }, onSlotError),\n  );\n\n  return createPool(slots, {\n    concurrency,\n    defaultTimeout: timeout,\n    maxQueue,\n    onFull,\n  });\n}\n\n// ─── createModuleWorker ───────────────────────────────────────────────────────\n\n/**\n * Creates a pool of module-type Web Workers loaded from a real URL.\n *\n * Unlike `createWorker`, the worker file is a regular module — it can import utilities,\n * use top-level await, and reference module scope.\n *\n * Use `handleMessages` from `@vielzeug/familiar/protocol` in the worker file to implement\n * the message protocol without boilerplate.\n *\n * **Protocol**: The worker module must handle the `{ id, input }` message format and reply\n * with `{ id, result }` or `{ id, error: { name, message, stack } }`. For streaming, it must\n * send one or more `{ id, chunk }` messages followed by `{ id, result: undefined }`.\n * For heartbeat support, send `{ id, heartbeat: true }` at regular intervals.\n *\n * @example\n * ```ts\n * // my-worker.ts — use handleMessages for zero boilerplate:\n * import { handleMessages } from '@vielzeug/familiar/protocol';\n * handleMessages(async (input: number) => input * 2);\n *\n * // main.ts\n * const pool = createModuleWorker<number, number>(\n *   new URL('./my-worker.ts', import.meta.url),\n *   { concurrency: 4 },\n * );\n * ```\n */\nexport function createModuleWorker<TInput, TOutput>(\n  url: URL | string,\n  options?: WorkerOptions,\n): WorkerHandle<TInput, TOutput> {\n  const { concurrency, heartbeatWindow, maxQueue, onFull, onSlotError, timeout } = resolveOptions(options);\n\n  if (heartbeatWindow !== undefined) {\n    warn(\n      '`heartbeatWindow` has no effect on module workers — the worker script must implement the heartbeat protocol manually.',\n    );\n  }\n\n  const href = typeof url === 'string' ? url : url.href;\n\n  const slots = Array.from(\n    { length: concurrency },\n    () => new Slot<TInput, TOutput>({ kind: 'module', url: href }, onSlotError),\n  );\n\n  return createPool(slots, {\n    concurrency,\n    defaultTimeout: timeout,\n    maxQueue,\n    onFull,\n  });\n}\n"],"mappings":"yFACA,IAAa,EAAb,MAAa,UAAsB,KAAM,CACvC,YAAY,EAAiB,EAAqB,CAChD,MAAM,EAAS,CAAI,EACnB,KAAK,KAAO,IAAI,OAAO,KACvB,OAAO,eAAe,KAAM,IAAI,OAAO,SAAS,CAClD,CAEA,OAAO,GAAG,EAAoC,CAC5C,OAAO,aAAe,CACxB,CACF,EAGa,EAAb,cAAiD,CAAc,CAAC,EAGnD,EAAb,cAA4C,CAAc,CAExD,SAEA,YAAY,EAAkB,CAC5B,MAAM,2BAA2B,EAAS,EAAE,EAC5C,KAAK,SAAW,CAClB,CACF,EAGa,EAAb,cAAuC,CAAc,CAAC,EAGzC,EAAb,cAA6C,CAAc,CACzD,YAAY,EAAU,wBAAyB,CAC7C,MAAM,CAAO,CACf,CACF,EAGa,EAAb,cAA0C,CAAc,CAEtD,UAEA,YAAY,EAAmB,CAC7B,MAAM,wBAAwB,EAAU,GAAG,EAC3C,KAAK,UAAY,CACnB,CACF,EAGa,EAAb,cAA0C,CAAc,CAAC,ECjDnD,EAAQ,CAAE,WAA+C,kBAG/D,SAAgB,EAAK,EAAmB,CAClC,GAAO,QAAQ,KAAK,wBAAwB,GAAK,CACvD,CC8BA,IAAa,EAAb,KAAwC,CACtC,KAAsD,CAAC,EAEvD,UAAoB,EACpB,IAAc,EAGd,IAAI,MAAe,CACjB,OAAO,KAAK,SACd,CAMA,QAAQ,EAAkC,EAAuC,CAO/E,OANI,IAAa,IAAA,IAAa,KAAK,WAAa,EAAiB,IAEjE,KAAK,KAAK,KAAK,CAAE,KAAM,KAAK,MAAO,MAAK,CAAC,EACzC,KAAK,OAAO,KAAK,KAAK,OAAS,CAAC,EAChC,KAAK,YAEE,GACT,CAMA,OAAgD,CAC9C,KAAO,KAAK,KAAK,OAAS,GAAG,CAC3B,GAAM,CAAE,QAAS,KAAK,WAAW,EAEjC,GAAI,CAAC,EAAK,UAGR,MAFA,MAAK,YAEE,CAGX,CAGF,CAMA,OAAO,EAA2C,CAChD,GAAI,EAAK,UAAW,MAAO,GAE3B,IAAK,IAAI,EAAI,EAAG,EAAI,KAAK,KAAK,OAAQ,IACpC,GAAI,KAAK,KAAK,EAAE,CAAE,OAAS,EAIzB,MAHA,GAAK,UAAY,GACjB,KAAK,YAEE,GAIX,MAAO,EACT,CAIA,YAAiD,CAC/C,IAAM,EAAM,KAAK,KAAK,GAChB,EAAO,KAAK,KAAK,IAAI,EAO3B,OALI,KAAK,KAAK,OAAS,IACrB,KAAK,KAAK,GAAK,EACf,KAAK,SAAS,CAAC,GAGV,CACT,CAGA,OAAe,EAA+B,EAAwC,CAGpF,OAFI,EAAE,KAAK,WAAa,EAAE,KAAK,SAExB,EAAE,KAAO,EAAE,KAF8B,EAAE,KAAK,SAAW,EAAE,KAAK,QAG3E,CAEA,OAAe,EAAiB,CAC9B,KAAO,EAAI,GAAG,CACZ,IAAM,EAAU,EAAI,GAAM,EAE1B,GAAI,KAAK,OAAO,KAAK,KAAK,GAAK,KAAK,KAAK,EAAQ,EAC/C,CAAC,KAAK,KAAK,GAAI,KAAK,KAAK,IAAW,CAAC,KAAK,KAAK,GAAU,KAAK,KAAK,EAAG,EACtE,EAAI,OAEJ,KAEJ,CACF,CAEA,SAAiB,EAAiB,CAChC,IAAM,EAAI,KAAK,KAAK,OAEpB,OAAS,CACP,IAAI,EAAM,EACJ,EAAO,EAAI,EAAI,EACf,EAAQ,EAAI,EAAI,EAMtB,GAJI,EAAO,GAAK,KAAK,OAAO,KAAK,KAAK,GAAQ,KAAK,KAAK,EAAK,IAAG,EAAM,GAElE,EAAQ,GAAK,KAAK,OAAO,KAAK,KAAK,GAAS,KAAK,KAAK,EAAK,IAAG,EAAM,GAEpE,IAAQ,EAAG,MAEf,CAAC,KAAK,KAAK,GAAI,KAAK,KAAK,IAAQ,CAAC,KAAK,KAAK,GAAO,KAAK,KAAK,EAAG,EAChE,EAAI,CACN,CACF,CACF,EC/IA,SAAgB,EAAW,EAA6E,CAClG,OAAO,GAAU,UAAY,GAAkB,UAAW,GAC5D,EAA6B,MAAM,CAEvC,CCuBA,SAAgB,EACd,EACA,EAC+B,CAC/B,GAAM,CAAE,cAAa,iBAAgB,WAAU,UAAW,EACpD,EAAY,CAAC,GAAG,CAAK,EACrB,EAAQ,IAAI,EACZ,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,CAC5C,EAAc,KAAK,CAAO,EAEtB,IAAc,IAAA,IAShB,EARc,eAAiB,CAC7B,IAAM,EAAM,EAAc,QAAQ,CAAO,EAErC,IAAQ,IAAI,EAAc,OAAO,EAAK,CAAC,EAE3C,EAAO,IAAI,EAAqB,CAAS,CAAC,CAC5C,EAAG,CAEQ,CAAK,CAEpB,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,IAA0B,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,EAAA,EAAA,WAAA,CAAkB,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,CAAyB,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,EAGZ,GAAI,EACF,MAAM,IAAI,EAAwB,oBAAoB,EAGxD,GAAI,GAAQ,QACV,MAAA,EAAA,EAAA,WAAA,CAAiB,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,EAE1B,GAAI,EAAc,MAAM,IAAI,EAAwB,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,EAAuB,CAAkB,EAGrD,GAAI,EAAQ,CACV,IAAM,MAAgB,CACf,EAAM,OAAO,CAAI,IAEtB,EAAK,eAAe,EACpB,GAAA,EAAA,EAAA,WAAA,CAAkB,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,EAAqB,uBAAuB,EAGxD,IAAM,EAAO,EAAU,IAAI,EAE3B,GAAI,CAAC,EACH,MAAM,IAAI,EACR,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,CCpeA,SAAgB,EAAsB,EAAsD,CAC1F,GAAI,EAAG,SAAS,CAAC,CAAC,SAAS,eAAe,EACxC,MAAM,IAAI,EAA4B,oDAAoD,EAG5F,OAAO,CACT,CAKA,IAAM,EAAkB,IAExB,SAAS,EAAmB,EAA6C,CACvE,GAAI,IAAU,IAAA,GAAW,MAAO,GAEhC,GAAI,IAAU,OACZ,OAAO,KAAK,IAAI,EAAG,WAAW,WAAW,qBAAuB,CAAC,EAGnE,GAAI,CAAC,OAAO,UAAU,CAAK,GAAK,EAAQ,GAAK,EAAQ,EACnD,MAAM,IAAI,EAA4B,gDAAgD,EAAgB,WAAW,EAGnH,OAAO,CACT,CAEA,SAAS,EAAe,EAAyB,CAAC,EAOhD,CACA,IAAM,EAAc,EAAmB,EAAQ,WAAW,EACpD,CAAE,kBAAiB,WAAU,SAAS,SAAU,cAAa,WAAY,EAE/E,GAAI,IAAY,IAAA,KAAc,CAAC,OAAO,SAAS,CAAO,GAAK,GAAW,GACpE,MAAM,IAAI,EAA4B,kDAAkD,EAG1F,GAAI,IAAa,IAAA,KAAc,CAAC,OAAO,UAAU,CAAQ,GAAK,EAAW,GACvE,MAAM,IAAI,EAA4B,uCAAuC,EAG/E,GAAI,IAAoB,IAAA,KAAc,CAAC,OAAO,SAAS,CAAe,GAAK,GAAmB,GAC5F,MAAM,IAAI,EAA4B,0DAA0D,EAGlG,MAAO,CAAE,cAAa,kBAAiB,WAAU,SAAQ,cAAa,SAAQ,CAChF,CAUA,SAAS,EAAkB,EAA8B,EAA+C,CACtG,MAAO;gBACO,EAAG,SAAS,EAAE;;;;;;;IAO1B,GAAqB,KAAgH,GAAzG,iFAAiF,EAAkB,IAAS;;;;;;;;;;;;;;;;;;GAkBzI,KAAK,CACR,CAsCA,IAAM,EAAN,KAAqE,CACnE,OACA,YACA,SAAmB,GACnB,QAA+C,KAC/C,OAAiB,EACjB,OAAgC,KAEhC,YAAY,EAAqC,EAA4C,CAC3F,KAAK,OAAS,EACd,KAAK,YAAc,CACrB,CAEA,OAAuB,CACrB,GAAI,KAAK,SAAU,OAAO,QAAQ,QAAQ,EAE1C,GAAI,CACF,KAAK,aAAa,CACpB,MAAQ,CAER,CAEA,OAAO,QAAQ,QAAQ,CACzB,CAEA,IAAI,EAAe,EAA+B,EAA+C,CAC/F,OAAO,KAAK,SAAS,EAAO,EAAe,EAAS,EAAK,CAC3D,CAEA,UAAU,EAAe,EAA+B,EAAqD,CAC3G,IAAM,EAAoB,CAAC,EACvB,EAAO,GACP,EACE,EAA6B,CAAC,EAE9B,EAAQ,GAAmB,CAC/B,EAAO,KAAK,CAAK,EACjB,EAAQ,MAAM,CAAC,GAAG,CACpB,EAEM,EAAU,GAAkB,CAChC,EAAO,GACP,EAAQ,EAER,IAAK,IAAM,KAAK,EAAQ,OAAO,CAAC,EAAG,EAAE,CACvC,EAUA,OAJA,KAAK,SAAS,EAAO,EAAe,EAAS,GAAM,CAAI,CAAC,CAAC,SAAW,EAAO,EAAG,CAAM,EAEhF,KAAK,UAAS,KAAK,QAAQ,aAAe,GAEvC,CACL,CAAC,OAAO,gBAAiB,CACvB,IAAI,EAAS,EAEb,MAAO,CACL,MAAM,MAAyC,CAC7C,KAAO,GAAU,EAAO,QAAU,CAAC,GACjC,MAAM,IAAI,QAAe,GAAY,EAAQ,KAAK,CAAO,CAAC,EAG5D,GAAI,EAAS,EAAO,OAAQ,CAC1B,IAAM,EAAQ,EAAO,GAOrB,MAHA,GAA+B,GAAU,KACzC,IAEO,CAAE,KAAM,GAAO,OAAM,CAC9B,CAEA,GAAI,IAAU,IAAA,GAAW,MAAM,EAE/B,MAAO,CAAE,KAAM,GAAM,MAAO,IAAA,EAAgC,CAC9D,CACF,CACF,CACF,CACF,CAEA,QAAe,CACb,IAAM,EAAU,KAAK,QAEhB,IAEL,aAAa,EAAQ,KAAK,EAC1B,aAAa,EAAQ,iBAAiB,EACtC,KAAK,QAAU,KAGf,KAAK,WAAW,EAGhB,EAAQ,eAAe,IAAI,EAAwB,sBAAsB,CAAC,EAC5E,CAEA,WAAkB,CAChB,KAAK,SAAW,GAChB,KAAK,WAAW,EAChB,KAAK,YAAY,IAAI,CAAyB,CAChD,CAEA,SACE,EACA,EACA,EACA,EACA,EACyB,CACzB,GAAI,KAAK,SACP,OAAO,QAAQ,OAAO,IAAI,CAAyB,EAGrD,IAAI,EAEJ,GAAI,CACF,EAAS,KAAK,aAAa,CAC7B,OAAS,EAAO,CACd,OAAO,QAAQ,OAAO,CAAK,CAC7B,CAGA,IAAM,EACJ,KAAK,OAAO,OAAS,UAAY,KAAK,OAAO,mBAAqB,KAC9D,KAAK,OAAO,kBAAoB,EAChC,IAAA,GAEN,OAAO,IAAI,SAAyB,EAAS,IAAW,CACtD,IAAM,EAAK,KAAK,SACV,EAAgC,CACpC,OACA,KACA,SACS,UACT,YACF,EAEI,IAAY,IAAA,KACd,EAAQ,MAAQ,eAAiB,CAC/B,KAAK,QAAQ,IAAI,EAAqB,CAAO,CAAC,CAChD,EAAG,CAAO,EACV,EAAW,EAAQ,KAAK,GAGtB,IAAe,IAAA,KACjB,EAAQ,kBAAoB,eAAiB,CAC3C,KAAK,QAAQ,IAAI,EAAqB,CAAU,CAAC,CACnD,EAAG,CAAU,EACb,EAAW,EAAQ,iBAAiB,GAGtC,KAAK,QAAU,EAEf,GAAI,CACF,EAAO,YAAY,CAAE,KAAI,QAAO,QAAO,EAAG,CAAa,CACzD,OAAS,EAAK,CACZ,KAAK,YAAY,IAAI,EAAqB,aAAe,MAAQ,EAAI,QAAU,OAAO,CAAG,EAAG,CAAE,MAAO,CAAI,CAAC,CAAC,CAC7G,CACF,CAAC,CACH,CAEA,cAA+B,CAC7B,GAAI,KAAK,OAAQ,OAAO,KAAK,OAE7B,GAAI,OAAO,WAAW,QAAW,WAC/B,MAAM,IAAI,EAAqB,2CAA2C,EAG5E,IAAI,EAEJ,GAAI,KAAK,OAAO,OAAS,SACvB,GAAI,CACF,EAAS,IAAI,OAAO,KAAK,OAAO,IAAK,CAAE,KAAM,QAAS,CAAC,CACzD,OAAS,EAAO,CACd,MAAM,IAAI,EAAqB,0BAA2B,CAAE,MAAO,CAAM,CAAC,CAC5E,MAEA,GAAI,CACF,IAAM,EAAO,IAAI,KACf,CAAC,EAAkB,KAAK,OAAO,GAAgC,KAAK,OAAO,iBAAiB,CAAC,EAC7F,CAAE,KAAM,wBAAyB,CACnC,EACM,EAAM,IAAI,gBAAgB,CAAI,EAEpC,GAAI,CACF,EAAS,IAAI,OAAO,CAAG,CACzB,QAAU,CACR,IAAI,gBAAgB,CAAG,CACzB,CACF,OAAS,EAAO,CACd,MAAM,IAAI,EAAqB,0BAA2B,CAAE,MAAO,CAAM,CAAC,CAC5E,CAoDF,MAjDA,GAAO,UAAa,GAA8C,CAChE,IAAM,EAAU,KAAK,QAEjB,MAAC,GAAW,EAAM,KAAK,KAAO,EAAQ,IAG1C,IAAI,cAAe,EAAM,KAAM,CACzB,EAAQ,aAAe,IAAA,KACzB,aAAa,EAAQ,iBAAiB,EACtC,EAAQ,kBAAoB,eAAiB,CAC3C,KAAK,QAAQ,IAAI,EAAqB,EAAQ,UAAW,CAAC,CAC5D,EAAG,EAAQ,UAAU,EACrB,EAAW,EAAQ,iBAAiB,GAGtC,MACF,CAEA,GAAI,UAAW,EAAM,KAAM,CACzB,EAAQ,OAAO,EAAM,KAAK,KAAK,EAE/B,MACF,CAMA,GAJA,aAAa,EAAQ,KAAK,EAC1B,aAAa,EAAQ,iBAAiB,EACtC,KAAK,QAAU,KAEX,UAAW,EAAM,KAAM,CACzB,IAAM,EAAQ,EAAM,KAAK,iBAAiB,MAAQ,EAAM,KAAK,MAAY,MAAM,OAAO,EAAM,KAAK,KAAK,CAAC,EAEvG,EAAQ,OAAO,IAAI,EAAkB,EAAM,QAAS,CAAE,OAAM,CAAC,CAAC,CAChE,MACE,EAAQ,QAAQ,EAAM,KAAK,MAAM,CAjBnC,CAmBF,EAEA,EAAO,QAAW,GAAsB,CACtC,IAAM,EAAQ,IAAI,EAAqB,EAAM,OAAO,EAGpD,KAAK,WAAW,EAChB,KAAK,YAAY,CAAK,EAEtB,KAAK,cAAc,MAAa,KAAK,KAAK,MAAM,CAAC,CACnD,EAEA,KAAK,OAAS,EAEP,CACT,CAEA,YAAoB,EAAuB,CACzC,IAAM,EAAU,KAAK,QAEhB,IAEL,aAAa,EAAQ,KAAK,EAC1B,aAAa,EAAQ,iBAAiB,EACtC,KAAK,QAAU,KACf,EAAQ,OAAO,CAAM,EACvB,CAEA,QAAgB,EAAuB,CACrC,KAAK,WAAW,EAChB,KAAK,YAAY,CAAM,CACzB,CAEA,YAA2B,CACpB,AAGL,KAAK,UADL,KAAK,OAAO,UAAU,EACR,KAChB,CACF,EAoBA,SAAgB,EACd,EACA,EAC+B,CAC/B,GAAM,CAAE,cAAa,kBAAiB,WAAU,SAAQ,cAAa,WAAY,EAAe,CAAO,EACjG,EAAoB,GAAmB,KAAyC,IAAA,GAAlC,KAAK,MAAM,EAAkB,CAAC,EAOlF,OAAO,EALO,MAAM,KAClB,CAAE,OAAQ,CAAY,MAChB,IAAI,EAAsB,CAAE,KAAI,oBAAmB,KAAM,QAAS,EAAG,CAAW,CAGtE,EAAO,CACvB,cACA,eAAgB,EAChB,WACA,QACF,CAAC,CACH,CA+BA,SAAgB,EACd,EACA,EAC+B,CAC/B,GAAM,CAAE,cAAa,kBAAiB,WAAU,SAAQ,cAAa,WAAY,EAAe,CAAO,EAEnG,IAAoB,IAAA,IACtB,EACE,uHACF,EAGF,IAAM,EAAO,OAAO,GAAQ,SAAW,EAAM,EAAI,KAOjD,OAAO,EALO,MAAM,KAClB,CAAE,OAAQ,CAAY,MAChB,IAAI,EAAsB,CAAE,KAAM,SAAU,IAAK,CAAK,EAAG,CAAW,CAG1D,EAAO,CACvB,cACA,eAAgB,EAChB,WACA,QACF,CAAC,CACH"}

package/dist/familiar.js

@@ -0,0 +1,28 @@
+import{abortError as e}from"@vielzeug/arsenal";var t=class e extends Error{constructor(e,t){super(e,t),this.name=new.target.name,Object.setPrototypeOf(this,new.target.prototype)}static is(t){return t instanceof e}},n=class extends t{},r=class extends t{maxQueue;constructor(e){super(`Queue is full (maxQueue=${e})`),this.maxQueue=e}},i=class extends t{},a=class extends t{constructor(e=`Worker was terminated`){super(e)}},o=class extends t{timeoutMs;constructor(e){super(`Task timed out after ${e}ms`),this.timeoutMs=e}},s=class extends t{},c=!globalThis.__FAMILIAR_PROD__;function l(e){c&&console.warn(`[@vielzeug/familiar] ${e}`)}var u=class{heap=[];liveCount=0;seq=0;get size(){return this.liveCount}enqueue(e,t){return t!==void 0&&this.liveCount>=t?!1:(this.heap.push({_seq:this.seq++,item:e}),this.siftUp(this.heap.length-1),this.liveCount++,!0)}shift(){for(;this.heap.length>0;){let{item:e}=this.extractTop();if(!e.cancelled)return this.liveCount--,e}}remove(e){if(e.cancelled)return!1;for(let t=0;t<this.heap.length;t++)if(this.heap[t].item===e)return e.cancelled=!0,this.liveCount--,!0;return!1}extractTop(){let e=this.heap[0],t=this.heap.pop();return this.heap.length>0&&(this.heap[0]=t,this.siftDown(0)),e}higher(e,t){return e.item.priority===t.item.priority?e._seq<t._seq:e.item.priority>t.item.priority}siftUp(e){for(;e>0;){let t=e-1>>1;if(this.higher(this.heap[e],this.heap[t]))[this.heap[e],this.heap[t]]=[this.heap[t],this.heap[e]],e=t;else break}}siftDown(e){let t=this.heap.length;for(;;){let n=e,r=2*e+1,i=2*e+2;if(r<t&&this.higher(this.heap[r],this.heap[n])&&(n=r),i<t&&this.higher(this.heap[i],this.heap[n])&&(n=i),n===e)break;[this.heap[e],this.heap[n]]=[this.heap[n],this.heap[e]],e=n}}};function d(e){typeof e==`object`&&e&&`unref`in e&&e.unref()}function f(t,n){let{concurrency:i,defaultTimeout:c,maxQueue:l,onFull:f}=n,p=[...t],m=new u,h=new AbortController,g=[],_=[],v=0,y,b=0,x=0,S=0,C=!1;function w(){return v===0&&m.size===0}function T(){if(!w()||g.length===0)return;let e=g.splice(0);for(let t of e)t()}function E(e){return w()?Promise.resolve():new Promise((t,n)=>{g.push(t),e!==void 0&&d(setTimeout(()=>{let r=g.indexOf(t);r!==-1&&g.splice(r,1),n(new o(e))},e))})}function D(){let e=_.shift();e&&e()}let O=!1;function k(){if(!(C||O)){for(O=!0;!C&&p.length>0&&m.size>0;){let e=A();if(!e)break;let t=p.pop();e.cleanupAbort?.(),v+=1,D();let n=e.timeout??c;t.run(e.input,e.transferables,n).then(n=>{p.push(t),--v,b+=1,e.resolve(n),k(),w()&&T()},n=>{p.push(t),--v,n instanceof a||(x+=1),e.reject(n),k(),w()&&T()})}O=!1}}function A(){for(;m.size>0;){let t=m.shift();if(!t)break;if(t.signal?.aborted){t.cleanupAbort?.(),t.reject(e(t.signal));continue}return t}T()}function j(){if(C)return;C=!0,h.abort();for(let e of t)e.terminate();for(;m.size>0;){let e=m.shift();if(!e)break;e.cleanupAbort?.(),e.reject(new a)}let e=g.splice(0);for(let t of e)t();for(let e of _.splice(0))e()}function M(e){return C?Promise.resolve():y||(y=E(e).then(j,e=>{throw j(),e}),y)}async function N(t,n={}){let{priority:i=0,signal:o,timeout:s,transferables:c=[]}=n;if(C)throw new a;if(y)throw new a(`Worker is draining`);if(o?.aborted)throw e(o);if(f===`wait`&&l!==void 0){for(;!C&&!y&&m.size>=l;)await new Promise(e=>_.push(e));if(C)throw new a;if(y)throw new a(`Worker is draining`)}let u,d,p=new Promise((e,t)=>{u=e,d=t}),h={input:t,priority:i,reject:d,resolve:u,signal:o,timeout:s,transferables:c};if(!m.enqueue(h,f===`wait`?void 0:l))throw new r(l);if(o){let t=()=>{m.remove(h)&&(h.cleanupAbort?.(),d(e(o)),T())};h.cleanupAbort=()=>{o.removeEventListener(`abort`,t),h.cleanupAbort=void 0},o.addEventListener(`abort`,t,{once:!0})}return k(),p}function P(e,n={}){if(C)throw new s(`Worker was terminated`);let r=p.pop();if(!r)throw new s(`runStream() requires a free worker slot; all ${t.length} slot${t.length===1?``:`s`} are busy`);let{timeout:i,transferables:a=[]}=n,o=r.runStream(e,a,i);return{[Symbol.asyncIterator](){let e=o[Symbol.asyncIterator](),t=!1,n=()=>{t||(t=!0,p.push(r))};return{async next(){let t=await e.next();return t.done&&n(),t},async return(t){return r.cancel(),n(),e.return?.(t)??{done:!0,value:t}},async throw(t){if(r.cancel(),n(),e.throw)return e.throw(t);throw t}}}}}async function*F(e,t={}){if(e.length===0)return;let{ordered:n=!0,...r}=t,a=new AbortController;try{if(n){let t=e.map(e=>N(e,{...r,signal:a.signal}));for(let e of t)yield await e}else{let t=[],n=null,o=0,s=Math.max(1,i);function c(){if(o>=e.length)return;let i=e[o++];N(i,{...r,signal:a.signal}).then(e=>{t.push({value:e}),n?.(),n=null},e=>{t.push({error:e}),n?.(),n=null})}for(let t=0;t<s&&t<e.length;t++)c();for(let r=0;r<e.length;r++){for(;t.length===0;)await new Promise(e=>{n=e});let e=t.shift();if(`error`in e)throw e.error;yield e.value,c()}}}finally{a.abort()}}function I(e,t={}){let n=new AbortController;if(t.signal){let e=t.signal;e.aborted?n.abort(e.reason):e.addEventListener(`abort`,()=>n.abort(e.reason),{once:!0})}S+=1;let r=0,i=0,a=!1,o=[];function s(){!a&&r>0&&r===i&&(a=!0,--S)}return{abort(e){n.abort(e)},drain(){let e=o.splice(0);return a||(a=!0,--S),Promise.allSettled(e)},get name(){return e},get pending(){return r-i},run(e,t={}){r+=1;let a=N(e,{...t,signal:n.signal});return o.push(a),a.then(()=>{i+=1,s()},()=>{i+=1,s()}),a},get size(){return r}}}function L(){return C?`terminated`:v>0||m.size>0?`running`:`idle`}return{get active(){return v},batch:F,get completed(){return b},get concurrency(){return i},get disposalSignal(){return h.signal},dispose:j,get disposed(){return C},drain:M,get failed(){return x},group:I,get groupCount(){return S},prime(){return Promise.all(t.map(e=>e.prime())).then(()=>{})},get queued(){return m.size},run:N,runStream:P,get status(){return L()},[Symbol.asyncDispose]:()=>M(),[Symbol.dispose]:j}}function p(e){if(e.toString().includes(`[native code]`))throw new n(`Task function cannot be a bound or native function`);return e}var m=512;function h(e){if(e===void 0)return 1;if(e===`auto`)return Math.max(1,globalThis.navigator?.hardwareConcurrency??1);if(!Number.isInteger(e)||e<1||e>m)throw new n(`\`concurrency\` must be a positive integer ≤ ${m} or "auto"`);return e}function g(e={}){let t=h(e.concurrency),{heartbeatWindow:r,maxQueue:i,onFull:a=`reject`,onSlotError:o,timeout:s}=e;if(s!==void 0&&(!Number.isFinite(s)||s<=0))throw new n("`timeout` must be a finite number greater than 0");if(i!==void 0&&(!Number.isInteger(i)||i<1))throw new n("`maxQueue` must be a positive integer");if(r!==void 0&&(!Number.isFinite(r)||r<=0))throw new n("`heartbeatWindow` must be a finite number greater than 0");return{concurrency:t,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}}function _(e,t){return`
+const __fn = (${e.toString()});
+
+self.onmessage = async function (event) {
+  const { id, input, stream } = event.data;
+
+  // Automatically send heartbeats at half the heartbeatWindow interval.
+  let heartbeatTimer = null;
+  ${t==null?``:`heartbeatTimer = setInterval(() => self.postMessage({ id, heartbeat: true }), ${t});`}
+
+  try {
+    if (stream) {
+      const iterable = await __fn(input);
+      for await (const chunk of iterable) {
+        self.postMessage({ id, chunk });
+      }
+      self.postMessage({ id, result: undefined });
+    } else {
+      const result = await __fn(input);
+      self.postMessage({ id, result });
+    }
+  } catch (error) {
+    self.postMessage({ id, error });
+  } finally {
+    if (heartbeatTimer) clearInterval(heartbeatTimer);
+  }
+}`.trim()}var v=class{config;onSlotError;disposed=!1;pending=null;taskId=0;worker=null;constructor(e,t){this.config=e,this.onSlotError=t}prime(){if(this.disposed)return Promise.resolve();try{this.ensureWorker()}catch{}return Promise.resolve()}run(e,t,n){return this.dispatch(e,t,n,!1)}runStream(e,t,n){let r=[],i=!1,a,o=[],s=e=>{r.push(e),o.shift()?.()},c=e=>{i=!0,a=e;for(let e of o.splice(0))e()};return this.dispatch(e,t,n,!0,s).then(()=>c(),c),this.pending&&(this.pending.finishStream=c),{[Symbol.asyncIterator](){let e=0;return{async next(){for(;e>=r.length&&!i;)await new Promise(e=>o.push(e));if(e<r.length){let t=r[e];return r[e]=null,e++,{done:!1,value:t}}if(a!==void 0)throw a;return{done:!0,value:void 0}}}}}}cancel(){let e=this.pending;e&&(clearTimeout(e.timer),clearTimeout(e.heartbeatWatchdog),this.pending=null,this.stopWorker(),e.finishStream?.(new a(`Stream was cancelled`)))}terminate(){this.disposed=!0,this.stopWorker(),this.failPending(new a)}dispatch(e,t,n,r,i){if(this.disposed)return Promise.reject(new a);let c;try{c=this.ensureWorker()}catch(e){return Promise.reject(e)}let l=this.config.kind===`inline`&&this.config.heartbeatInterval!=null?this.config.heartbeatInterval*2:void 0;return new Promise((a,u)=>{let f=this.taskId++,p={emit:i,id:f,reject:u,resolve:a,watchdogMs:l};n!==void 0&&(p.timer=setTimeout(()=>{this.restart(new o(n))},n),d(p.timer)),l!==void 0&&(p.heartbeatWatchdog=setTimeout(()=>{this.restart(new o(l))},l),d(p.heartbeatWatchdog)),this.pending=p;try{c.postMessage({id:f,input:e,stream:r},t)}catch(e){this.failPending(new s(e instanceof Error?e.message:String(e),{cause:e}))}})}ensureWorker(){if(this.worker)return this.worker;if(typeof globalThis.Worker!=`function`)throw new s(`Worker API is unavailable in this runtime`);let e;if(this.config.kind===`module`)try{e=new Worker(this.config.url,{type:`module`})}catch(e){throw new s(`Failed to create Worker`,{cause:e})}else try{let t=new Blob([_(this.config.fn,this.config.heartbeatInterval)],{type:`application/javascript`}),n=URL.createObjectURL(t);try{e=new Worker(n)}finally{URL.revokeObjectURL(n)}}catch(e){throw new s(`Failed to create Worker`,{cause:e})}return e.onmessage=e=>{let t=this.pending;if(!(!t||e.data.id!==t.id)){if(`heartbeat`in e.data){t.watchdogMs!==void 0&&(clearTimeout(t.heartbeatWatchdog),t.heartbeatWatchdog=setTimeout(()=>{this.restart(new o(t.watchdogMs))},t.watchdogMs),d(t.heartbeatWatchdog));return}if(`chunk`in e.data){t.emit?.(e.data.chunk);return}if(clearTimeout(t.timer),clearTimeout(t.heartbeatWatchdog),this.pending=null,`error`in e.data){let n=e.data.error instanceof Error?e.data.error:Error(String(e.data.error));t.reject(new i(n.message,{cause:n}))}else t.resolve(e.data.result)}},e.onerror=e=>{let t=new s(e.message);this.stopWorker(),this.failPending(t),this.onSlotError?.(t,()=>void this.prime())},this.worker=e,e}failPending(e){let t=this.pending;t&&(clearTimeout(t.timer),clearTimeout(t.heartbeatWatchdog),this.pending=null,t.reject(e))}restart(e){this.stopWorker(),this.failPending(e)}stopWorker(){this.worker&&=(this.worker.terminate(),null)}};function y(e,t){let{concurrency:n,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}=g(t),c=r==null?void 0:Math.floor(r/2);return f(Array.from({length:n},()=>new v({fn:e,heartbeatInterval:c,kind:`inline`},o)),{concurrency:n,defaultTimeout:s,maxQueue:i,onFull:a})}function b(e,t){let{concurrency:n,heartbeatWindow:r,maxQueue:i,onFull:a,onSlotError:o,timeout:s}=g(t);r!==void 0&&l("`heartbeatWindow` has no effect on module workers — the worker script must implement the heartbeat protocol manually.");let c=typeof e==`string`?e:e.href;return f(Array.from({length:n},()=>new v({kind:`module`,url:c},o)),{concurrency:n,defaultTimeout:s,maxQueue:i,onFull:a})}export{t as FamiliarError,n as FamiliarInvalidOptionsError,r as FamiliarQueueFullError,s as FamiliarRuntimeError,i as FamiliarTaskError,a as FamiliarTerminatedError,o as FamiliarTimeoutError,b as createModuleWorker,y as createWorker,p as task};
+//# sourceMappingURL=familiar.js.map