async-bulkhead-ts 0.2.2 → 0.3.0

package/README.md

@@ -14,11 +14,13 @@ Designed for services that prefer **rejecting work early** over silently degradi
 - ✅ Explicit acquire + release via a **token**
 - ✅ `bulkhead.run(fn)` helper (acquire + `finally` release)
 - ✅ Optional waiting **timeout** and **AbortSignal** cancellation
+- ✅ Graceful shutdown via **`close()`** + **`drain()`**
 - ✅ Zero dependencies
 - ✅ ESM + CJS support
 - ✅ Node.js **20+**
 
 Non-goals (by design):
+
 - ❌ No background workers
 - ❌ No retry logic
 - ❌ No distributed coordination
@@ -45,7 +47,7 @@ const r = await bulkhead.acquire();
 if (!r.ok) {
   // Fail fast — shed load, return 503, etc.
   // r.reason is one of:
-  // 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted'
+  // 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted' | 'shutdown'
   throw new Error(`Rejected: ${r.reason}`);
 }
 
@@ -91,8 +93,8 @@ const bulkhead = createBulkhead({
 > Note: bounded waiting is optional.
 > Future major versions may focus on fail-fast admission only.
 
-
 Semantics:
+
 - If `inFlight` < `maxConcurrent`: `acquire()` succeeds immediately.
 - Else if `maxQueue` > 0 and queue has space: `acquire()` waits FIFO.
 - Else: rejected immediately.
@@ -109,6 +111,7 @@ await bulkhead.run(
 ```
 
 Cancellation guarantees:
+
 - Work that is waiting in the queue can be cancelled before it starts.
 - In-flight work is not forcibly terminated (your function may observe the signal).
 - Capacity is always released correctly for acquired tokens.
@@ -122,6 +125,33 @@ You can also bound waiting time:
 await bulkhead.run(async () => doWork(), { timeoutMs: 50 });
 ```
 
+## Graceful Shutdown
+
+`close()` stops admission. `drain()` waits for in-flight work to finish. Together they give you a clean shutdown sequence:
+
+```ts
+// In your SIGTERM handler:
+bulkhead.close();
+
+// All pending waiters are rejected with 'shutdown'.
+// All future acquire/run calls reject immediately with 'shutdown'.
+// In-flight work is not interrupted — tokens release normally.
+
+await bulkhead.drain();
+// Resolves when inFlight reaches zero.
+```
+
+`close()` is synchronous, idempotent, and irreversible. If you need a fresh bulkhead, create a new instance.
+
+`drain()` is an observation primitive — it tells you when work finishes, but it cannot force work to complete. The bulkhead does not own in-flight work. If your functions support cancellation, signal them via the `AbortSignal` you already hold.
+
+`drain()` also works without `close()`. On its own it resolves when current in-flight and pending work completes, but new work can still be admitted:
+
+```ts
+// Wait for current work to finish, without stopping new admissions.
+await bulkhead.drain();
+```
+
 ## Behavioral Guarantees
 
 - maxConcurrent is never exceeded.
@@ -146,16 +176,9 @@ Returns:
   tryAcquire(): TryAcquireResult;
   acquire(options?): Promise<AcquireResult>;
   run<T>(fn: (signal?: AbortSignal) => Promise<T>, options?): Promise<T>;
-  stats(): {
-    inFlight: number;
-    pending: number;
-    maxConcurrent: number;
-    maxQueue: number;
-    aborted?: number;
-    timedOut?: number;
-    rejected?: number;
-    doubleRelease?: number;
-  };
+  close(): void;
+  drain(): Promise<void>;
+  stats(): Stats;
 }
 ```
 
@@ -164,7 +187,7 @@ Returns:
 ```ts
 export type TryAcquireResult =
   | { ok: true; token: Token }
-  | { ok: false; reason: 'concurrency_limit' };
+  | { ok: false; reason: 'concurrency_limit' | 'shutdown' };
 ```
 
 > `tryAcquire()` never waits and never enqueues; it either acquires immediately or fails fast.
@@ -179,7 +202,14 @@ type AcquireOptions = {
 
 type AcquireResult =
   | { ok: true; token: Token }
-  | { ok: false; reason: 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted' };
+  | { ok: false; reason: RejectReason };
+
+type RejectReason =
+  | 'concurrency_limit'
+  | 'queue_limit'
+  | 'timeout'
+  | 'aborted'
+  | 'shutdown';
 ```
 
 `run(fn, options?)`
@@ -189,7 +219,7 @@ Throws on rejection:
 ```ts
 class BulkheadRejectedError extends Error {
   readonly code = 'BULKHEAD_REJECTED';
-  readonly reason: 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted';
+  readonly reason: RejectReason;
 }
 ```
 
@@ -200,24 +230,54 @@ in-flight work to observe cancellation:
 await bulkhead.run(async (signal) => doWork(signal), { signal });
 ```
 
+`close()`
+
+Stops admission permanently. Rejects all pending waiters with `'shutdown'`. All future `tryAcquire`/`acquire`/`run` calls reject immediately with `'shutdown'`. In-flight tokens remain valid. Idempotent.
+
+`drain()`
+
+Returns a `Promise<void>` that resolves when `inFlight` and pending both reach zero. Multiple concurrent calls all resolve at the same moment. Works with or without `close()`.
+
+`stats()`
+
+```ts
+type Stats = {
+  inFlight: number;
+  pending: number;
+  maxConcurrent: number;
+  maxQueue: number;
+  closed: boolean;
+  // debug counters:
+  aborted?: number;
+  timedOut?: number;
+  rejected?: number;
+  doubleRelease?: number;
+  inFlightUnderflow?: number;
+};
+```
+
+`stats()` is a pure read with no side effects.
+
+`inFlightUnderflow` should always be 0. A nonzero value indicates a bug in the library.
+
 ## Design Philosophy
 
 This library is intentionally small.
 
 It exists to enforce backpressure at the boundary of your system:
 
-* before request fan-out
-* before hitting downstream dependencies
-* before saturation cascades
+- before request fan-out
+- before hitting downstream dependencies
+- before saturation cascades
 
 If you need retries, buffering, scheduling, or persistence—compose those around this, not inside it.
 
 ## Compatibility
 
-* Node.js: 20+ (24 LTS recommended)
-* Module formats: ESM and CommonJS
+- Node.js: 20+ (24 LTS recommended)
+- Module formats: ESM and CommonJS
 
 
 ## License
 
-MIT © 2026
+MIT © 2026

package/dist/index.cjs

@@ -82,42 +82,15 @@ function createBulkhead(opts) {
     throw new Error("maxQueue must be an integer >= 0");
   }
   let inFlight = 0;
+  let closed = false;
+  let livePending = 0;
   const q = new RingDeque(maxQueue + 1);
+  let drainWaiters = [];
   let aborted = 0;
   let timedOut = 0;
   let rejected = 0;
   let doubleRelease = 0;
-  const makeToken = () => {
-    let released = false;
-    return {
-      release() {
-        if (released) {
-          doubleRelease++;
-          return;
-        }
-        released = true;
-        inFlight--;
-        if (inFlight < 0) inFlight = 0;
-        drain();
-      }
-    };
-  };
-  const pruneCancelledFront = () => {
-    while (q.length > 0) {
-      const w = q.peekFront();
-      if (w.cancelled || w.settled) {
-        cleanupWaiter(w);
-        q.popFront();
-        continue;
-      } else {
-        break;
-      }
-    }
-  };
-  const pendingCount = () => {
-    pruneCancelledFront();
-    return q.length;
-  };
+  let inFlightUnderflow = 0;
   const cleanupWaiter = (w) => {
     if (w.abortListener) w.abortListener();
     if (w.timeoutId) clearTimeout(w.timeoutId);
@@ -129,14 +102,50 @@ function createBulkhead(opts) {
     w.settled = true;
     if (!w.cancelled && !r.ok) w.cancelled = true;
     cleanupWaiter(w);
+    livePending--;
     w.resolve(r);
   };
-  const drain = () => {
+  const pruneCancelledFront = () => {
+    while (q.length > 0) {
+      const w = q.peekFront();
+      if (w.cancelled || w.settled) {
+        q.popFront();
+        continue;
+      }
+      break;
+    }
+  };
+  const notifyDrainWaiters = () => {
+    if (inFlight === 0 && livePending === 0 && drainWaiters.length > 0) {
+      const waiters = drainWaiters;
+      drainWaiters = [];
+      for (const resolve of waiters) resolve();
+    }
+  };
+  const makeToken = () => {
+    let released = false;
+    return {
+      release() {
+        if (released) {
+          doubleRelease++;
+          return;
+        }
+        released = true;
+        inFlight--;
+        if (inFlight < 0) {
+          inFlightUnderflow++;
+          inFlight = 0;
+        }
+        pump();
+        notifyDrainWaiters();
+      }
+    };
+  };
+  const pump = () => {
     pruneCancelledFront();
     while (inFlight < opts.maxConcurrent && q.length > 0) {
       const w = q.popFront();
-      if (w.cancelled) {
-        cleanupWaiter(w);
+      if (w.cancelled || w.settled) {
         pruneCancelledFront();
         continue;
       }
@@ -144,7 +153,27 @@ function createBulkhead(opts) {
       settle(w, { ok: true, token: makeToken() });
     }
   };
+  const close = () => {
+    if (closed) return;
+    closed = true;
+    while (q.length > 0) {
+      const w = q.popFront();
+      if (w.settled || w.cancelled) continue;
+      rejected++;
+      settle(w, { ok: false, reason: "shutdown" });
+    }
+    notifyDrainWaiters();
+  };
+  const drainFn = () => {
+    if (inFlight === 0 && livePending === 0) return Promise.resolve();
+    return new Promise((resolve) => {
+      drainWaiters.push(resolve);
+    });
+  };
   const tryAcquire = () => {
+    if (closed) {
+      return { ok: false, reason: "shutdown" };
+    }
     if (inFlight < opts.maxConcurrent) {
       inFlight++;
       return { ok: true, token: makeToken() };
@@ -152,6 +181,10 @@ function createBulkhead(opts) {
     return { ok: false, reason: "concurrency_limit" };
   };
   const acquire = (ao = {}) => {
+    if (closed) {
+      rejected++;
+      return Promise.resolve({ ok: false, reason: "shutdown" });
+    }
     if (inFlight < opts.maxConcurrent) {
       inFlight++;
       return Promise.resolve({ ok: true, token: makeToken() });
@@ -160,7 +193,7 @@ function createBulkhead(opts) {
       rejected++;
       return Promise.resolve({ ok: false, reason: "concurrency_limit" });
     }
-    if (pendingCount() >= maxQueue) {
+    if (livePending >= maxQueue) {
       rejected++;
       return Promise.resolve({ ok: false, reason: "queue_limit" });
     }
@@ -172,6 +205,7 @@ function createBulkhead(opts) {
         abortListener: void 0,
         timeoutId: void 0
       };
+      livePending++;
       if (ao.signal) {
         if (ao.signal.aborted) {
           aborted++;
@@ -199,7 +233,9 @@ function createBulkhead(opts) {
         }, ao.timeoutMs);
       }
       q.pushBack(w);
-      drain();
+      if (inFlight < opts.maxConcurrent) {
+        pump();
+      }
     });
   };
   const run = async (fn, ao = {}) => {
@@ -215,15 +251,17 @@ function createBulkhead(opts) {
   };
   const stats = () => ({
     inFlight,
-    pending: pendingCount(),
+    pending: livePending,
     maxConcurrent: opts.maxConcurrent,
     maxQueue,
+    closed,
     aborted,
     timedOut,
     rejected,
-    doubleRelease
+    doubleRelease,
+    inFlightUnderflow
   });
-  return { tryAcquire, acquire, run, stats };
+  return { tryAcquire, acquire, run, stats, close, drain: drainFn };
 }
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {

package/dist/index.cjs.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts"],"sourcesContent":["/**\n * A small ring-buffer queue.\n * - O(1) pushBack / popFront\n * - avoids array shift and head-index + compaction heuristics \n */\nclass RingDeque<T> {\n  private buf: Array<T | undefined>;\n  private head = 0;\n  private tail = 0;\n  private size = 0;\n\n  constructor(capacity: number) {\n    const cap = Math.max(4, capacity | 0);\n    this.buf = new Array<T | undefined>(cap);\n  }\n\n  get length() {\n    return this.size;\n  }\n\n  pushBack(item: T) {\n    if (this.size === this.buf.length) {\n      this.grow();\n    }\n    const idx = (this.head + this.size) % this.buf.length;\n    this.buf[idx] = item;\n    this.size++;\n  }\n\n  peekFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    return this.buf[this.head];\n  }\n\n  popFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    const item = this.buf[this.head];\n    this.buf[this.head] = undefined; // help GC\n    this.head = (this.head + 1) % this.buf.length;\n    this.size--;\n    return item;\n  }\n\n  private grow() {\n    const newBuf = new Array<T | undefined>(this.buf.length * 2);\n    for (let i = 0; i < this.size; i++) {\n      newBuf[i] = this.buf[(this.head + i) % this.buf.length];\n    }\n    this.buf = newBuf;\n    this.head = 0;\n  }\n}\n\nexport type BulkheadOptions = {\n  maxConcurrent: number;\n  maxQueue?: number; // pending waiters allowed (0 => no waiting)\n};\n\nexport type AcquireOptions = {\n  signal?: AbortSignal;\n  timeoutMs?: number; // waiting timeout only\n};\n\nexport type Stats = {\n  inFlight: number;\n  pending: number;\n  maxConcurrent: number;\n  maxQueue: number;\n  // optional debug counters:\n  aborted?: number;\n  timedOut?: number;\n  rejected?: number;\n  doubleRelease?: number;\n};\n\nexport type Token = { release(): void };\n\nexport type TryAcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: 'concurrency_limit' };\n\nexport type AcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted' };\n\ntype Waiter = {\n  resolve: (r: AcquireResult) => void;\n  cancelled: boolean;\n  settled: boolean;\n\n  abortListener: (() => void) | undefined;\n  timeoutId: ReturnType<typeof setTimeout> | undefined;\n};\n\nexport type RejectReason = 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted';\n\nexport class BulkheadRejectedError extends Error {\n  readonly code = 'BULKHEAD_REJECTED' as const;\n\n  constructor(readonly reason: RejectReason) {\n    super(`Bulkhead rejected: ${reason}`);\n    this.name = 'BulkheadRejectedError';\n  }\n}\n\nexport function createBulkhead(opts: BulkheadOptions) {\n  // ---- validate ----\n  if (!Number.isInteger(opts.maxConcurrent) || opts.maxConcurrent <= 0) {\n    throw new Error('maxConcurrent must be a positive integer');\n  }\n  const maxQueue = opts.maxQueue ?? 0;\n  if (!Number.isInteger(maxQueue) || maxQueue < 0) {\n    throw new Error('maxQueue must be an integer >= 0');\n  }\n\n  // ---- state ----\n  let inFlight = 0;\n\n  // FIFO queue as deque (no head index, just pushBack / popFront)\n  const q = new RingDeque<Waiter>(maxQueue + 1); // +1 to avoid full queue edge case\n\n  // optional counters\n  let aborted = 0;\n  let timedOut = 0;\n  let rejected = 0;\n  let doubleRelease = 0;\n\n  // ---- token factory ----\n  const makeToken = (): Token => {\n    let released = false;\n    return {\n      release() {\n        if (released) {\n          doubleRelease++;\n          return; // idempotent; consider throw in dev builds if you prefer\n        }\n        released = true;\n        inFlight--;\n        if (inFlight < 0) inFlight = 0; // defensive, should never happen\n        drain();\n      },\n    };\n  };\n\n  const pruneCancelledFront = () => {\n    // Remove cancelled/settled waiters at the front so they stop consuming maxQueue.\n    while (q.length > 0) {\n      const w = q.peekFront()!;\n      if (w.cancelled || w.settled) {\n        cleanupWaiter(w);\n        q.popFront();\n        continue;\n      } else {\n        break;\n      }\n    }\n  }\n\n  const pendingCount = () => {\n    pruneCancelledFront();\n    return q.length;\n  }\n\n  const cleanupWaiter = (w: Waiter) => {\n    if (w.abortListener) w.abortListener();\n    if (w.timeoutId) clearTimeout(w.timeoutId);\n    w.abortListener = undefined;\n    w.timeoutId = undefined;\n  };\n\n  const settle = (w: Waiter, r: AcquireResult) => {\n    if (w.settled) return;\n    w.settled = true;\n    // Once settled, it's effectively cancelled for drain-skipping purposes.\n    // (We keep cancelled separate because drain checks it.)\n    if (!w.cancelled && !r.ok) w.cancelled = true;\n    cleanupWaiter(w);\n    w.resolve(r);\n  };\n\n  // ---- drain algorithm ----\n  const drain = () => {\n    // Prune first so cancelled/settled waiters don't block the head.\n    pruneCancelledFront();\n    while (inFlight < opts.maxConcurrent && q.length > 0) {\n      const w = q.popFront()!; \n      // If it was cancelled after peek/prune but before pop, skip it.\n      if (w.cancelled) {\n        cleanupWaiter(w);\n        pruneCancelledFront(); // in case there are more cancelled after this one\n        continue;\n      }\n      inFlight++;\n      settle(w, { ok: true, token: makeToken() });\n    }\n  };\n\n  // ---- public APIs ----\n\n  const tryAcquire = (): TryAcquireResult => {\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return { ok: true, token: makeToken() };\n    }\n    return { ok: false, reason: 'concurrency_limit' };\n  };\n\n  const acquire = (ao: AcquireOptions = {}): Promise<AcquireResult> => {\n    // immediate fast path\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return Promise.resolve({ ok: true, token: makeToken() });\n    }\n\n    // no waiting allowed\n    if (maxQueue === 0) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'concurrency_limit' });\n    }\n\n    // bounded waiting\n    if (pendingCount() >= maxQueue) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'queue_limit' });\n    }\n\n    // enqueue\n    return new Promise<AcquireResult>((resolve) => {\n      const w: Waiter = {\n        resolve,\n        cancelled: false,\n        settled: false,\n        abortListener: undefined,\n        timeoutId: undefined,\n      };\n\n      // abort support\n      if (ao.signal) {\n        if (ao.signal.aborted) {\n          aborted++;\n          settle(w, { ok: false, reason: 'aborted' });\n          return;\n        }\n        const onAbort = () => {\n          // mark cancelled; drain() will skip it\n          aborted++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'aborted' });\n        };\n\n        ao.signal.addEventListener('abort', onAbort, { once: true });\n        w.abortListener = () => ao.signal!.removeEventListener('abort', onAbort);\n      }\n\n      // timeout support (waiting only)\n      if (ao.timeoutMs != null) {\n        if (!Number.isFinite(ao.timeoutMs) || ao.timeoutMs < 0) {\n          // invalid => treat as immediate timeout\n          timedOut++;\n          settle(w, { ok: false, reason: 'timeout' });\n          return;\n        }\n        w.timeoutId = setTimeout(() => {\n          timedOut++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'timeout' });\n        }, ao.timeoutMs);\n      }\n\n      q.pushBack(w);\n      drain(); // required: capacity may have freed after the fast-path check but before enqueue\n    });\n  };\n\n  const run = async <T>(\n    fn: (signal?: AbortSignal) => Promise<T>,\n    ao: AcquireOptions = {},\n  ): Promise<T> => {\n    const r = await acquire(ao);\n    if (!r.ok) {\n      throw new BulkheadRejectedError(r.reason);\n    }\n    try {\n      return await fn(ao.signal);\n    } finally {\n      r.token.release();\n    }\n  };\n\n  const stats = (): Stats => ({\n    inFlight,\n    pending: pendingCount(),\n    maxConcurrent: opts.maxConcurrent,\n    maxQueue,\n    aborted,\n    timedOut,\n    rejected,\n    doubleRelease,\n  });\n\n  return { tryAcquire, acquire, run, stats };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,IAAM,YAAN,MAAmB;AAAA,EACT;AAAA,EACA,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EAEf,YAAY,UAAkB;AAC5B,UAAM,MAAM,KAAK,IAAI,GAAG,WAAW,CAAC;AACpC,SAAK,MAAM,IAAI,MAAqB,GAAG;AAAA,EACzC;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,SAAS,MAAS;AAChB,QAAI,KAAK,SAAS,KAAK,IAAI,QAAQ;AACjC,WAAK,KAAK;AAAA,IACZ;AACA,UAAM,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,IAAI;AAC/C,SAAK,IAAI,GAAG,IAAI;AAChB,SAAK;AAAA,EACP;AAAA,EAEA,YAA2B;AACzB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,WAAO,KAAK,IAAI,KAAK,IAAI;AAAA,EAC3B;AAAA,EAEA,WAA0B;AACxB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,UAAM,OAAO,KAAK,IAAI,KAAK,IAAI;AAC/B,SAAK,IAAI,KAAK,IAAI,IAAI;AACtB,SAAK,QAAQ,KAAK,OAAO,KAAK,KAAK,IAAI;AACvC,SAAK;AACL,WAAO;AAAA,EACT;AAAA,EAEQ,OAAO;AACb,UAAM,SAAS,IAAI,MAAqB,KAAK,IAAI,SAAS,CAAC;AAC3D,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,aAAO,CAAC,IAAI,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK,IAAI,MAAM;AAAA,IACxD;AACA,SAAK,MAAM;AACX,SAAK,OAAO;AAAA,EACd;AACF;AA6CO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAG/C,YAAqB,QAAsB;AACzC,UAAM,sBAAsB,MAAM,EAAE;AADjB;AAEnB,SAAK,OAAO;AAAA,EACd;AAAA,EALS,OAAO;AAMlB;AAEO,SAAS,eAAe,MAAuB;AAEpD,MAAI,CAAC,OAAO,UAAU,KAAK,aAAa,KAAK,KAAK,iBAAiB,GAAG;AACpE,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC5D;AACA,QAAM,WAAW,KAAK,YAAY;AAClC,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,GAAG;AAC/C,UAAM,IAAI,MAAM,kCAAkC;AAAA,EACpD;AAGA,MAAI,WAAW;AAGf,QAAM,IAAI,IAAI,UAAkB,WAAW,CAAC;AAG5C,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,WAAW;AACf,MAAI,gBAAgB;AAGpB,QAAM,YAAY,MAAa;AAC7B,QAAI,WAAW;AACf,WAAO;AAAA,MACL,UAAU;AACR,YAAI,UAAU;AACZ;AACA;AAAA,QACF;AACA,mBAAW;AACX;AACA,YAAI,WAAW,EAAG,YAAW;AAC7B,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,sBAAsB,MAAM;AAEhC,WAAO,EAAE,SAAS,GAAG;AACnB,YAAM,IAAI,EAAE,UAAU;AACtB,UAAI,EAAE,aAAa,EAAE,SAAS;AAC5B,sBAAc,CAAC;AACf,UAAE,SAAS;AACX;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,MAAM;AACzB,wBAAoB;AACpB,WAAO,EAAE;AAAA,EACX;AAEA,QAAM,gBAAgB,CAAC,MAAc;AACnC,QAAI,EAAE,cAAe,GAAE,cAAc;AACrC,QAAI,EAAE,UAAW,cAAa,EAAE,SAAS;AACzC,MAAE,gBAAgB;AAClB,MAAE,YAAY;AAAA,EAChB;AAEA,QAAM,SAAS,CAAC,GAAW,MAAqB;AAC9C,QAAI,EAAE,QAAS;AACf,MAAE,UAAU;AAGZ,QAAI,CAAC,EAAE,aAAa,CAAC,EAAE,GAAI,GAAE,YAAY;AACzC,kBAAc,CAAC;AACf,MAAE,QAAQ,CAAC;AAAA,EACb;AAGA,QAAM,QAAQ,MAAM;AAElB,wBAAoB;AACpB,WAAO,WAAW,KAAK,iBAAiB,EAAE,SAAS,GAAG;AACpD,YAAM,IAAI,EAAE,SAAS;AAErB,UAAI,EAAE,WAAW;AACf,sBAAc,CAAC;AACf,4BAAoB;AACpB;AAAA,MACF;AACA;AACA,aAAO,GAAG,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IAC5C;AAAA,EACF;AAIA,QAAM,aAAa,MAAwB;AACzC,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE;AAAA,IACxC;AACA,WAAO,EAAE,IAAI,OAAO,QAAQ,oBAAoB;AAAA,EAClD;AAEA,QAAM,UAAU,CAAC,KAAqB,CAAC,MAA8B;AAEnE,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IACzD;AAGA,QAAI,aAAa,GAAG;AAClB;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,oBAAoB,CAAC;AAAA,IACnE;AAGA,QAAI,aAAa,KAAK,UAAU;AAC9B;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,cAAc,CAAC;AAAA,IAC7D;AAGA,WAAO,IAAI,QAAuB,CAAC,YAAY;AAC7C,YAAM,IAAY;AAAA,QAChB;AAAA,QACA,WAAW;AAAA,QACX,SAAS;AAAA,QACT,eAAe;AAAA,QACf,WAAW;AAAA,MACb;AAGA,UAAI,GAAG,QAAQ;AACb,YAAI,GAAG,OAAO,SAAS;AACrB;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,cAAM,UAAU,MAAM;AAEpB;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C;AAEA,WAAG,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAE,gBAAgB,MAAM,GAAG,OAAQ,oBAAoB,SAAS,OAAO;AAAA,MACzE;AAGA,UAAI,GAAG,aAAa,MAAM;AACxB,YAAI,CAAC,OAAO,SAAS,GAAG,SAAS,KAAK,GAAG,YAAY,GAAG;AAEtD;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,UAAE,YAAY,WAAW,MAAM;AAC7B;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C,GAAG,GAAG,SAAS;AAAA,MACjB;AAEA,QAAE,SAAS,CAAC;AACZ,YAAM;AAAA,IACR,CAAC;AAAA,EACH;AAEA,QAAM,MAAM,OACV,IACA,KAAqB,CAAC,MACP;AACf,UAAM,IAAI,MAAM,QAAQ,EAAE;AAC1B,QAAI,CAAC,EAAE,IAAI;AACT,YAAM,IAAI,sBAAsB,EAAE,MAAM;AAAA,IAC1C;AACA,QAAI;AACF,aAAO,MAAM,GAAG,GAAG,MAAM;AAAA,IAC3B,UAAE;AACA,QAAE,MAAM,QAAQ;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,QAAQ,OAAc;AAAA,IAC1B;AAAA,IACA,SAAS,aAAa;AAAA,IACtB,eAAe,KAAK;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,SAAS,KAAK,MAAM;AAC3C;","names":[]}
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["/**\n * A small ring-buffer queue.\n * - O(1) pushBack / popFront\n * - avoids array shift and head-index + compaction heuristics\n */\nclass RingDeque<T> {\n  private buf: Array<T | undefined>;\n  private head = 0;\n  private tail = 0;\n  private size = 0;\n\n  constructor(capacity: number) {\n    const cap = Math.max(4, capacity | 0);\n    this.buf = new Array<T | undefined>(cap);\n  }\n\n  get length() {\n    return this.size;\n  }\n\n  pushBack(item: T) {\n    if (this.size === this.buf.length) {\n      this.grow();\n    }\n    const idx = (this.head + this.size) % this.buf.length;\n    this.buf[idx] = item;\n    this.size++;\n  }\n\n  peekFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    return this.buf[this.head];\n  }\n\n  popFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    const item = this.buf[this.head];\n    this.buf[this.head] = undefined; // help GC\n    this.head = (this.head + 1) % this.buf.length;\n    this.size--;\n    return item;\n  }\n\n  private grow() {\n    const newBuf = new Array<T | undefined>(this.buf.length * 2);\n    for (let i = 0; i < this.size; i++) {\n      newBuf[i] = this.buf[(this.head + i) % this.buf.length];\n    }\n    this.buf = newBuf;\n    this.head = 0;\n  }\n}\n\nexport type BulkheadOptions = {\n  maxConcurrent: number;\n  maxQueue?: number; // pending waiters allowed (0 => no waiting)\n};\n\nexport type AcquireOptions = {\n  signal?: AbortSignal;\n  timeoutMs?: number; // waiting timeout only\n};\n\nexport type Stats = {\n  inFlight: number;\n  pending: number;\n  maxConcurrent: number;\n  maxQueue: number;\n  closed: boolean;\n  // optional debug counters:\n  aborted?: number;\n  timedOut?: number;\n  rejected?: number;\n  doubleRelease?: number;\n  inFlightUnderflow?: number;\n};\n\nexport type Token = { release(): void };\n\nexport type TryAcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: 'concurrency_limit' | 'shutdown' };\n\nexport type AcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: RejectReason };\n\ntype Waiter = {\n  resolve: (r: AcquireResult) => void;\n  cancelled: boolean;\n  settled: boolean;\n\n  abortListener: (() => void) | undefined;\n  timeoutId: ReturnType<typeof setTimeout> | undefined;\n};\n\nexport type RejectReason =\n  | 'concurrency_limit'\n  | 'queue_limit'\n  | 'timeout'\n  | 'aborted'\n  | 'shutdown';\n\nexport class BulkheadRejectedError extends Error {\n  readonly code = 'BULKHEAD_REJECTED' as const;\n\n  constructor(readonly reason: RejectReason) {\n    super(`Bulkhead rejected: ${reason}`);\n    this.name = 'BulkheadRejectedError';\n  }\n}\n\nexport function createBulkhead(opts: BulkheadOptions) {\n  // ---- validate ----\n  if (!Number.isInteger(opts.maxConcurrent) || opts.maxConcurrent <= 0) {\n    throw new Error('maxConcurrent must be a positive integer');\n  }\n  const maxQueue = opts.maxQueue ?? 0;\n  if (!Number.isInteger(maxQueue) || maxQueue < 0) {\n    throw new Error('maxQueue must be an integer >= 0');\n  }\n\n  // ---- state ----\n  let inFlight = 0;\n  let closed = false;\n\n  // Live pending count — the number of waiters in the queue that have not\n  // been settled (admitted, cancelled, timed out, or aborted). Tracked\n  // separately from `q.length` so that `stats()` is a pure read — the\n  // queue may contain stale (cancelled/settled) entries that haven't been\n  // pruned yet, but `livePending` is always accurate.\n  let livePending = 0;\n\n  // FIFO queue as deque (no head index, just pushBack / popFront)\n  const q = new RingDeque<Waiter>(maxQueue + 1); // +1 to avoid full queue edge case\n\n  // Drain waiters — resolve functions for pending drain() promises.\n  let drainWaiters: Array<() => void> = [];\n\n  // optional counters\n  let aborted = 0;\n  let timedOut = 0;\n  let rejected = 0;\n  let doubleRelease = 0;\n  let inFlightUnderflow = 0;\n\n  // ---- internal helpers ----\n\n  const cleanupWaiter = (w: Waiter) => {\n    if (w.abortListener) w.abortListener();\n    if (w.timeoutId) clearTimeout(w.timeoutId);\n    w.abortListener = undefined;\n    w.timeoutId = undefined;\n  };\n\n  const settle = (w: Waiter, r: AcquireResult) => {\n    if (w.settled) return;\n    w.settled = true;\n    // Once settled, it's effectively cancelled for pump-skipping purposes.\n    if (!w.cancelled && !r.ok) w.cancelled = true;\n    cleanupWaiter(w);\n    livePending--;\n    w.resolve(r);\n  };\n\n  /**\n   * Remove cancelled/settled waiters from the front of the queue so the\n   * deque doesn't accumulate stale entries. Called from pump() and\n   * release paths — never from stats().\n   */\n  const pruneCancelledFront = () => {\n    while (q.length > 0) {\n      const w = q.peekFront()!;\n      if (w.cancelled || w.settled) {\n        q.popFront();\n        continue;\n      }\n      break;\n    }\n  };\n\n  /** Notify drain() waiters if inFlight has reached zero. */\n  const notifyDrainWaiters = () => {\n    if (inFlight === 0 && livePending === 0 && drainWaiters.length > 0) {\n      const waiters = drainWaiters;\n      drainWaiters = [];\n      for (const resolve of waiters) resolve();\n    }\n  };\n\n  // ---- token factory ----\n  const makeToken = (): Token => {\n    let released = false;\n    return {\n      release() {\n        if (released) {\n          doubleRelease++;\n          return;\n        }\n        released = true;\n        inFlight--;\n        if (inFlight < 0) {\n          inFlightUnderflow++;\n          inFlight = 0;\n        }\n        pump();\n        notifyDrainWaiters();\n      },\n    };\n  };\n\n  // ---- pump: admit waiters from the queue when capacity frees ----\n  const pump = () => {\n    pruneCancelledFront();\n    while (inFlight < opts.maxConcurrent && q.length > 0) {\n      const w = q.popFront()!;\n      if (w.cancelled || w.settled) {\n        pruneCancelledFront();\n        continue;\n      }\n      inFlight++;\n      settle(w, { ok: true, token: makeToken() });\n    }\n  };\n\n  // ---- close(): reject all pending, block future admission ----\n  const close = (): void => {\n    if (closed) return;\n    closed = true;\n\n    // Reject all pending waiters.\n    while (q.length > 0) {\n      const w = q.popFront()!;\n      if (w.settled || w.cancelled) continue;\n      rejected++;\n      settle(w, { ok: false, reason: 'shutdown' });\n    }\n\n    // If nothing is in-flight, notify drain waiters immediately.\n    notifyDrainWaiters();\n  };\n\n  // ---- drain(): wait for inFlight to reach zero ----\n  const drainFn = (): Promise<void> => {\n    if (inFlight === 0 && livePending === 0) return Promise.resolve();\n    return new Promise<void>((resolve) => {\n      drainWaiters.push(resolve);\n    });\n  };\n\n  // ---- public APIs ----\n\n  const tryAcquire = (): TryAcquireResult => {\n    if (closed) {\n      return { ok: false, reason: 'shutdown' };\n    }\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return { ok: true, token: makeToken() };\n    }\n    return { ok: false, reason: 'concurrency_limit' };\n  };\n\n  const acquire = (ao: AcquireOptions = {}): Promise<AcquireResult> => {\n    // closed fast path\n    if (closed) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'shutdown' });\n    }\n\n    // immediate fast path\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return Promise.resolve({ ok: true, token: makeToken() });\n    }\n\n    // no waiting allowed\n    if (maxQueue === 0) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'concurrency_limit' });\n    }\n\n    // bounded waiting\n    if (livePending >= maxQueue) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'queue_limit' });\n    }\n\n    // enqueue\n    return new Promise<AcquireResult>((resolve) => {\n      const w: Waiter = {\n        resolve,\n        cancelled: false,\n        settled: false,\n        abortListener: undefined,\n        timeoutId: undefined,\n      };\n\n      livePending++;\n\n      // abort support\n      if (ao.signal) {\n        if (ao.signal.aborted) {\n          aborted++;\n          settle(w, { ok: false, reason: 'aborted' });\n          return;\n        }\n        const onAbort = () => {\n          aborted++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'aborted' });\n        };\n\n        ao.signal.addEventListener('abort', onAbort, { once: true });\n        w.abortListener = () => ao.signal!.removeEventListener('abort', onAbort);\n      }\n\n      // timeout support (waiting only)\n      if (ao.timeoutMs != null) {\n        if (!Number.isFinite(ao.timeoutMs) || ao.timeoutMs < 0) {\n          timedOut++;\n          settle(w, { ok: false, reason: 'timeout' });\n          return;\n        }\n        w.timeoutId = setTimeout(() => {\n          timedOut++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'timeout' });\n        }, ao.timeoutMs);\n      }\n\n      q.pushBack(w);\n      // Capacity may have freed after the fast-path check but before enqueue.\n      if (inFlight < opts.maxConcurrent) {\n        pump();\n      }\n    });\n  };\n\n  const run = async <T>(\n    fn: (signal?: AbortSignal) => Promise<T>,\n    ao: AcquireOptions = {},\n  ): Promise<T> => {\n    const r = await acquire(ao);\n    if (!r.ok) {\n      throw new BulkheadRejectedError(r.reason);\n    }\n    try {\n      return await fn(ao.signal);\n    } finally {\n      r.token.release();\n    }\n  };\n\n  const stats = (): Stats => ({\n    inFlight,\n    pending: livePending,\n    maxConcurrent: opts.maxConcurrent,\n    maxQueue,\n    closed,\n    aborted,\n    timedOut,\n    rejected,\n    doubleRelease,\n    inFlightUnderflow,\n  });\n\n  return { tryAcquire, acquire, run, stats, close, drain: drainFn };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAKA,IAAM,YAAN,MAAmB;AAAA,EACT;AAAA,EACA,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EAEf,YAAY,UAAkB;AAC5B,UAAM,MAAM,KAAK,IAAI,GAAG,WAAW,CAAC;AACpC,SAAK,MAAM,IAAI,MAAqB,GAAG;AAAA,EACzC;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,SAAS,MAAS;AAChB,QAAI,KAAK,SAAS,KAAK,IAAI,QAAQ;AACjC,WAAK,KAAK;AAAA,IACZ;AACA,UAAM,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,IAAI;AAC/C,SAAK,IAAI,GAAG,IAAI;AAChB,SAAK;AAAA,EACP;AAAA,EAEA,YAA2B;AACzB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,WAAO,KAAK,IAAI,KAAK,IAAI;AAAA,EAC3B;AAAA,EAEA,WAA0B;AACxB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,UAAM,OAAO,KAAK,IAAI,KAAK,IAAI;AAC/B,SAAK,IAAI,KAAK,IAAI,IAAI;AACtB,SAAK,QAAQ,KAAK,OAAO,KAAK,KAAK,IAAI;AACvC,SAAK;AACL,WAAO;AAAA,EACT;AAAA,EAEQ,OAAO;AACb,UAAM,SAAS,IAAI,MAAqB,KAAK,IAAI,SAAS,CAAC;AAC3D,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,aAAO,CAAC,IAAI,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK,IAAI,MAAM;AAAA,IACxD;AACA,SAAK,MAAM;AACX,SAAK,OAAO;AAAA,EACd;AACF;AAoDO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAG/C,YAAqB,QAAsB;AACzC,UAAM,sBAAsB,MAAM,EAAE;AADjB;AAEnB,SAAK,OAAO;AAAA,EACd;AAAA,EALS,OAAO;AAMlB;AAEO,SAAS,eAAe,MAAuB;AAEpD,MAAI,CAAC,OAAO,UAAU,KAAK,aAAa,KAAK,KAAK,iBAAiB,GAAG;AACpE,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC5D;AACA,QAAM,WAAW,KAAK,YAAY;AAClC,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,GAAG;AAC/C,UAAM,IAAI,MAAM,kCAAkC;AAAA,EACpD;AAGA,MAAI,WAAW;AACf,MAAI,SAAS;AAOb,MAAI,cAAc;AAGlB,QAAM,IAAI,IAAI,UAAkB,WAAW,CAAC;AAG5C,MAAI,eAAkC,CAAC;AAGvC,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,WAAW;AACf,MAAI,gBAAgB;AACpB,MAAI,oBAAoB;AAIxB,QAAM,gBAAgB,CAAC,MAAc;AACnC,QAAI,EAAE,cAAe,GAAE,cAAc;AACrC,QAAI,EAAE,UAAW,cAAa,EAAE,SAAS;AACzC,MAAE,gBAAgB;AAClB,MAAE,YAAY;AAAA,EAChB;AAEA,QAAM,SAAS,CAAC,GAAW,MAAqB;AAC9C,QAAI,EAAE,QAAS;AACf,MAAE,UAAU;AAEZ,QAAI,CAAC,EAAE,aAAa,CAAC,EAAE,GAAI,GAAE,YAAY;AACzC,kBAAc,CAAC;AACf;AACA,MAAE,QAAQ,CAAC;AAAA,EACb;AAOA,QAAM,sBAAsB,MAAM;AAChC,WAAO,EAAE,SAAS,GAAG;AACnB,YAAM,IAAI,EAAE,UAAU;AACtB,UAAI,EAAE,aAAa,EAAE,SAAS;AAC5B,UAAE,SAAS;AACX;AAAA,MACF;AACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,qBAAqB,MAAM;AAC/B,QAAI,aAAa,KAAK,gBAAgB,KAAK,aAAa,SAAS,GAAG;AAClE,YAAM,UAAU;AAChB,qBAAe,CAAC;AAChB,iBAAW,WAAW,QAAS,SAAQ;AAAA,IACzC;AAAA,EACF;AAGA,QAAM,YAAY,MAAa;AAC7B,QAAI,WAAW;AACf,WAAO;AAAA,MACL,UAAU;AACR,YAAI,UAAU;AACZ;AACA;AAAA,QACF;AACA,mBAAW;AACX;AACA,YAAI,WAAW,GAAG;AAChB;AACA,qBAAW;AAAA,QACb;AACA,aAAK;AACL,2BAAmB;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAGA,QAAM,OAAO,MAAM;AACjB,wBAAoB;AACpB,WAAO,WAAW,KAAK,iBAAiB,EAAE,SAAS,GAAG;AACpD,YAAM,IAAI,EAAE,SAAS;AACrB,UAAI,EAAE,aAAa,EAAE,SAAS;AAC5B,4BAAoB;AACpB;AAAA,MACF;AACA;AACA,aAAO,GAAG,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IAC5C;AAAA,EACF;AAGA,QAAM,QAAQ,MAAY;AACxB,QAAI,OAAQ;AACZ,aAAS;AAGT,WAAO,EAAE,SAAS,GAAG;AACnB,YAAM,IAAI,EAAE,SAAS;AACrB,UAAI,EAAE,WAAW,EAAE,UAAW;AAC9B;AACA,aAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,WAAW,CAAC;AAAA,IAC7C;AAGA,uBAAmB;AAAA,EACrB;AAGA,QAAM,UAAU,MAAqB;AACnC,QAAI,aAAa,KAAK,gBAAgB,EAAG,QAAO,QAAQ,QAAQ;AAChE,WAAO,IAAI,QAAc,CAAC,YAAY;AACpC,mBAAa,KAAK,OAAO;AAAA,IAC3B,CAAC;AAAA,EACH;AAIA,QAAM,aAAa,MAAwB;AACzC,QAAI,QAAQ;AACV,aAAO,EAAE,IAAI,OAAO,QAAQ,WAAW;AAAA,IACzC;AACA,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE;AAAA,IACxC;AACA,WAAO,EAAE,IAAI,OAAO,QAAQ,oBAAoB;AAAA,EAClD;AAEA,QAAM,UAAU,CAAC,KAAqB,CAAC,MAA8B;AAEnE,QAAI,QAAQ;AACV;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,WAAW,CAAC;AAAA,IAC1D;AAGA,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IACzD;AAGA,QAAI,aAAa,GAAG;AAClB;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,oBAAoB,CAAC;AAAA,IACnE;AAGA,QAAI,eAAe,UAAU;AAC3B;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,cAAc,CAAC;AAAA,IAC7D;AAGA,WAAO,IAAI,QAAuB,CAAC,YAAY;AAC7C,YAAM,IAAY;AAAA,QAChB;AAAA,QACA,WAAW;AAAA,QACX,SAAS;AAAA,QACT,eAAe;AAAA,QACf,WAAW;AAAA,MACb;AAEA;AAGA,UAAI,GAAG,QAAQ;AACb,YAAI,GAAG,OAAO,SAAS;AACrB;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,cAAM,UAAU,MAAM;AACpB;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C;AAEA,WAAG,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAE,gBAAgB,MAAM,GAAG,OAAQ,oBAAoB,SAAS,OAAO;AAAA,MACzE;AAGA,UAAI,GAAG,aAAa,MAAM;AACxB,YAAI,CAAC,OAAO,SAAS,GAAG,SAAS,KAAK,GAAG,YAAY,GAAG;AACtD;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,UAAE,YAAY,WAAW,MAAM;AAC7B;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C,GAAG,GAAG,SAAS;AAAA,MACjB;AAEA,QAAE,SAAS,CAAC;AAEZ,UAAI,WAAW,KAAK,eAAe;AACjC,aAAK;AAAA,MACP;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,MAAM,OACV,IACA,KAAqB,CAAC,MACP;AACf,UAAM,IAAI,MAAM,QAAQ,EAAE;AAC1B,QAAI,CAAC,EAAE,IAAI;AACT,YAAM,IAAI,sBAAsB,EAAE,MAAM;AAAA,IAC1C;AACA,QAAI;AACF,aAAO,MAAM,GAAG,GAAG,MAAM;AAAA,IAC3B,UAAE;AACA,QAAE,MAAM,QAAQ;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,QAAQ,OAAc;AAAA,IAC1B;AAAA,IACA,SAAS;AAAA,IACT,eAAe,KAAK;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,SAAS,KAAK,OAAO,OAAO,OAAO,QAAQ;AAClE;","names":[]}

package/dist/index.d.cts

@@ -11,10 +11,12 @@ type Stats = {
     pending: number;
     maxConcurrent: number;
     maxQueue: number;
+    closed: boolean;
     aborted?: number;
     timedOut?: number;
     rejected?: number;
     doubleRelease?: number;
+    inFlightUnderflow?: number;
 };
 type Token = {
     release(): void;
@@ -24,16 +26,16 @@ type TryAcquireResult = {
     token: Token;
 } | {
     ok: false;
-    reason: 'concurrency_limit';
+    reason: 'concurrency_limit' | 'shutdown';
 };
 type AcquireResult = {
     ok: true;
     token: Token;
 } | {
     ok: false;
-    reason: 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted';
+    reason: RejectReason;
 };
-type RejectReason = 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted';
+type RejectReason = 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted' | 'shutdown';
 declare class BulkheadRejectedError extends Error {
     readonly reason: RejectReason;
     readonly code: "BULKHEAD_REJECTED";
@@ -44,6 +46,8 @@ declare function createBulkhead(opts: BulkheadOptions): {
     acquire: (ao?: AcquireOptions) => Promise<AcquireResult>;
     run: <T>(fn: (signal?: AbortSignal) => Promise<T>, ao?: AcquireOptions) => Promise<T>;
     stats: () => Stats;
+    close: () => void;
+    drain: () => Promise<void>;
 };
 
 export { type AcquireOptions, type AcquireResult, type BulkheadOptions, BulkheadRejectedError, type RejectReason, type Stats, type Token, type TryAcquireResult, createBulkhead };

package/dist/index.d.ts

@@ -11,10 +11,12 @@ type Stats = {
     pending: number;
     maxConcurrent: number;
     maxQueue: number;
+    closed: boolean;
     aborted?: number;
     timedOut?: number;
     rejected?: number;
     doubleRelease?: number;
+    inFlightUnderflow?: number;
 };
 type Token = {
     release(): void;
@@ -24,16 +26,16 @@ type TryAcquireResult = {
     token: Token;
 } | {
     ok: false;
-    reason: 'concurrency_limit';
+    reason: 'concurrency_limit' | 'shutdown';
 };
 type AcquireResult = {
     ok: true;
     token: Token;
 } | {
     ok: false;
-    reason: 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted';
+    reason: RejectReason;
 };
-type RejectReason = 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted';
+type RejectReason = 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted' | 'shutdown';
 declare class BulkheadRejectedError extends Error {
     readonly reason: RejectReason;
     readonly code: "BULKHEAD_REJECTED";
@@ -44,6 +46,8 @@ declare function createBulkhead(opts: BulkheadOptions): {
     acquire: (ao?: AcquireOptions) => Promise<AcquireResult>;
     run: <T>(fn: (signal?: AbortSignal) => Promise<T>, ao?: AcquireOptions) => Promise<T>;
     stats: () => Stats;
+    close: () => void;
+    drain: () => Promise<void>;
 };
 
 export { type AcquireOptions, type AcquireResult, type BulkheadOptions, BulkheadRejectedError, type RejectReason, type Stats, type Token, type TryAcquireResult, createBulkhead };

package/dist/index.js

@@ -57,42 +57,15 @@ function createBulkhead(opts) {
     throw new Error("maxQueue must be an integer >= 0");
   }
   let inFlight = 0;
+  let closed = false;
+  let livePending = 0;
   const q = new RingDeque(maxQueue + 1);
+  let drainWaiters = [];
   let aborted = 0;
   let timedOut = 0;
   let rejected = 0;
   let doubleRelease = 0;
-  const makeToken = () => {
-    let released = false;
-    return {
-      release() {
-        if (released) {
-          doubleRelease++;
-          return;
-        }
-        released = true;
-        inFlight--;
-        if (inFlight < 0) inFlight = 0;
-        drain();
-      }
-    };
-  };
-  const pruneCancelledFront = () => {
-    while (q.length > 0) {
-      const w = q.peekFront();
-      if (w.cancelled || w.settled) {
-        cleanupWaiter(w);
-        q.popFront();
-        continue;
-      } else {
-        break;
-      }
-    }
-  };
-  const pendingCount = () => {
-    pruneCancelledFront();
-    return q.length;
-  };
+  let inFlightUnderflow = 0;
   const cleanupWaiter = (w) => {
     if (w.abortListener) w.abortListener();
     if (w.timeoutId) clearTimeout(w.timeoutId);
@@ -104,14 +77,50 @@ function createBulkhead(opts) {
     w.settled = true;
     if (!w.cancelled && !r.ok) w.cancelled = true;
     cleanupWaiter(w);
+    livePending--;
     w.resolve(r);
   };
-  const drain = () => {
+  const pruneCancelledFront = () => {
+    while (q.length > 0) {
+      const w = q.peekFront();
+      if (w.cancelled || w.settled) {
+        q.popFront();
+        continue;
+      }
+      break;
+    }
+  };
+  const notifyDrainWaiters = () => {
+    if (inFlight === 0 && livePending === 0 && drainWaiters.length > 0) {
+      const waiters = drainWaiters;
+      drainWaiters = [];
+      for (const resolve of waiters) resolve();
+    }
+  };
+  const makeToken = () => {
+    let released = false;
+    return {
+      release() {
+        if (released) {
+          doubleRelease++;
+          return;
+        }
+        released = true;
+        inFlight--;
+        if (inFlight < 0) {
+          inFlightUnderflow++;
+          inFlight = 0;
+        }
+        pump();
+        notifyDrainWaiters();
+      }
+    };
+  };
+  const pump = () => {
     pruneCancelledFront();
     while (inFlight < opts.maxConcurrent && q.length > 0) {
       const w = q.popFront();
-      if (w.cancelled) {
-        cleanupWaiter(w);
+      if (w.cancelled || w.settled) {
         pruneCancelledFront();
         continue;
       }
@@ -119,7 +128,27 @@ function createBulkhead(opts) {
       settle(w, { ok: true, token: makeToken() });
     }
   };
+  const close = () => {
+    if (closed) return;
+    closed = true;
+    while (q.length > 0) {
+      const w = q.popFront();
+      if (w.settled || w.cancelled) continue;
+      rejected++;
+      settle(w, { ok: false, reason: "shutdown" });
+    }
+    notifyDrainWaiters();
+  };
+  const drainFn = () => {
+    if (inFlight === 0 && livePending === 0) return Promise.resolve();
+    return new Promise((resolve) => {
+      drainWaiters.push(resolve);
+    });
+  };
   const tryAcquire = () => {
+    if (closed) {
+      return { ok: false, reason: "shutdown" };
+    }
     if (inFlight < opts.maxConcurrent) {
       inFlight++;
       return { ok: true, token: makeToken() };
@@ -127,6 +156,10 @@ function createBulkhead(opts) {
     return { ok: false, reason: "concurrency_limit" };
   };
   const acquire = (ao = {}) => {
+    if (closed) {
+      rejected++;
+      return Promise.resolve({ ok: false, reason: "shutdown" });
+    }
     if (inFlight < opts.maxConcurrent) {
       inFlight++;
       return Promise.resolve({ ok: true, token: makeToken() });
@@ -135,7 +168,7 @@ function createBulkhead(opts) {
       rejected++;
       return Promise.resolve({ ok: false, reason: "concurrency_limit" });
     }
-    if (pendingCount() >= maxQueue) {
+    if (livePending >= maxQueue) {
       rejected++;
       return Promise.resolve({ ok: false, reason: "queue_limit" });
     }
@@ -147,6 +180,7 @@ function createBulkhead(opts) {
         abortListener: void 0,
         timeoutId: void 0
       };
+      livePending++;
       if (ao.signal) {
         if (ao.signal.aborted) {
           aborted++;
@@ -174,7 +208,9 @@ function createBulkhead(opts) {
         }, ao.timeoutMs);
       }
       q.pushBack(w);
-      drain();
+      if (inFlight < opts.maxConcurrent) {
+        pump();
+      }
     });
   };
   const run = async (fn, ao = {}) => {
@@ -190,15 +226,17 @@ function createBulkhead(opts) {
   };
   const stats = () => ({
     inFlight,
-    pending: pendingCount(),
+    pending: livePending,
     maxConcurrent: opts.maxConcurrent,
     maxQueue,
+    closed,
     aborted,
     timedOut,
     rejected,
-    doubleRelease
+    doubleRelease,
+    inFlightUnderflow
   });
-  return { tryAcquire, acquire, run, stats };
+  return { tryAcquire, acquire, run, stats, close, drain: drainFn };
 }
 export {
   BulkheadRejectedError,

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.ts"],"sourcesContent":["/**\n * A small ring-buffer queue.\n * - O(1) pushBack / popFront\n * - avoids array shift and head-index + compaction heuristics \n */\nclass RingDeque<T> {\n  private buf: Array<T | undefined>;\n  private head = 0;\n  private tail = 0;\n  private size = 0;\n\n  constructor(capacity: number) {\n    const cap = Math.max(4, capacity | 0);\n    this.buf = new Array<T | undefined>(cap);\n  }\n\n  get length() {\n    return this.size;\n  }\n\n  pushBack(item: T) {\n    if (this.size === this.buf.length) {\n      this.grow();\n    }\n    const idx = (this.head + this.size) % this.buf.length;\n    this.buf[idx] = item;\n    this.size++;\n  }\n\n  peekFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    return this.buf[this.head];\n  }\n\n  popFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    const item = this.buf[this.head];\n    this.buf[this.head] = undefined; // help GC\n    this.head = (this.head + 1) % this.buf.length;\n    this.size--;\n    return item;\n  }\n\n  private grow() {\n    const newBuf = new Array<T | undefined>(this.buf.length * 2);\n    for (let i = 0; i < this.size; i++) {\n      newBuf[i] = this.buf[(this.head + i) % this.buf.length];\n    }\n    this.buf = newBuf;\n    this.head = 0;\n  }\n}\n\nexport type BulkheadOptions = {\n  maxConcurrent: number;\n  maxQueue?: number; // pending waiters allowed (0 => no waiting)\n};\n\nexport type AcquireOptions = {\n  signal?: AbortSignal;\n  timeoutMs?: number; // waiting timeout only\n};\n\nexport type Stats = {\n  inFlight: number;\n  pending: number;\n  maxConcurrent: number;\n  maxQueue: number;\n  // optional debug counters:\n  aborted?: number;\n  timedOut?: number;\n  rejected?: number;\n  doubleRelease?: number;\n};\n\nexport type Token = { release(): void };\n\nexport type TryAcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: 'concurrency_limit' };\n\nexport type AcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted' };\n\ntype Waiter = {\n  resolve: (r: AcquireResult) => void;\n  cancelled: boolean;\n  settled: boolean;\n\n  abortListener: (() => void) | undefined;\n  timeoutId: ReturnType<typeof setTimeout> | undefined;\n};\n\nexport type RejectReason = 'concurrency_limit' | 'queue_limit' | 'timeout' | 'aborted';\n\nexport class BulkheadRejectedError extends Error {\n  readonly code = 'BULKHEAD_REJECTED' as const;\n\n  constructor(readonly reason: RejectReason) {\n    super(`Bulkhead rejected: ${reason}`);\n    this.name = 'BulkheadRejectedError';\n  }\n}\n\nexport function createBulkhead(opts: BulkheadOptions) {\n  // ---- validate ----\n  if (!Number.isInteger(opts.maxConcurrent) || opts.maxConcurrent <= 0) {\n    throw new Error('maxConcurrent must be a positive integer');\n  }\n  const maxQueue = opts.maxQueue ?? 0;\n  if (!Number.isInteger(maxQueue) || maxQueue < 0) {\n    throw new Error('maxQueue must be an integer >= 0');\n  }\n\n  // ---- state ----\n  let inFlight = 0;\n\n  // FIFO queue as deque (no head index, just pushBack / popFront)\n  const q = new RingDeque<Waiter>(maxQueue + 1); // +1 to avoid full queue edge case\n\n  // optional counters\n  let aborted = 0;\n  let timedOut = 0;\n  let rejected = 0;\n  let doubleRelease = 0;\n\n  // ---- token factory ----\n  const makeToken = (): Token => {\n    let released = false;\n    return {\n      release() {\n        if (released) {\n          doubleRelease++;\n          return; // idempotent; consider throw in dev builds if you prefer\n        }\n        released = true;\n        inFlight--;\n        if (inFlight < 0) inFlight = 0; // defensive, should never happen\n        drain();\n      },\n    };\n  };\n\n  const pruneCancelledFront = () => {\n    // Remove cancelled/settled waiters at the front so they stop consuming maxQueue.\n    while (q.length > 0) {\n      const w = q.peekFront()!;\n      if (w.cancelled || w.settled) {\n        cleanupWaiter(w);\n        q.popFront();\n        continue;\n      } else {\n        break;\n      }\n    }\n  }\n\n  const pendingCount = () => {\n    pruneCancelledFront();\n    return q.length;\n  }\n\n  const cleanupWaiter = (w: Waiter) => {\n    if (w.abortListener) w.abortListener();\n    if (w.timeoutId) clearTimeout(w.timeoutId);\n    w.abortListener = undefined;\n    w.timeoutId = undefined;\n  };\n\n  const settle = (w: Waiter, r: AcquireResult) => {\n    if (w.settled) return;\n    w.settled = true;\n    // Once settled, it's effectively cancelled for drain-skipping purposes.\n    // (We keep cancelled separate because drain checks it.)\n    if (!w.cancelled && !r.ok) w.cancelled = true;\n    cleanupWaiter(w);\n    w.resolve(r);\n  };\n\n  // ---- drain algorithm ----\n  const drain = () => {\n    // Prune first so cancelled/settled waiters don't block the head.\n    pruneCancelledFront();\n    while (inFlight < opts.maxConcurrent && q.length > 0) {\n      const w = q.popFront()!; \n      // If it was cancelled after peek/prune but before pop, skip it.\n      if (w.cancelled) {\n        cleanupWaiter(w);\n        pruneCancelledFront(); // in case there are more cancelled after this one\n        continue;\n      }\n      inFlight++;\n      settle(w, { ok: true, token: makeToken() });\n    }\n  };\n\n  // ---- public APIs ----\n\n  const tryAcquire = (): TryAcquireResult => {\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return { ok: true, token: makeToken() };\n    }\n    return { ok: false, reason: 'concurrency_limit' };\n  };\n\n  const acquire = (ao: AcquireOptions = {}): Promise<AcquireResult> => {\n    // immediate fast path\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return Promise.resolve({ ok: true, token: makeToken() });\n    }\n\n    // no waiting allowed\n    if (maxQueue === 0) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'concurrency_limit' });\n    }\n\n    // bounded waiting\n    if (pendingCount() >= maxQueue) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'queue_limit' });\n    }\n\n    // enqueue\n    return new Promise<AcquireResult>((resolve) => {\n      const w: Waiter = {\n        resolve,\n        cancelled: false,\n        settled: false,\n        abortListener: undefined,\n        timeoutId: undefined,\n      };\n\n      // abort support\n      if (ao.signal) {\n        if (ao.signal.aborted) {\n          aborted++;\n          settle(w, { ok: false, reason: 'aborted' });\n          return;\n        }\n        const onAbort = () => {\n          // mark cancelled; drain() will skip it\n          aborted++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'aborted' });\n        };\n\n        ao.signal.addEventListener('abort', onAbort, { once: true });\n        w.abortListener = () => ao.signal!.removeEventListener('abort', onAbort);\n      }\n\n      // timeout support (waiting only)\n      if (ao.timeoutMs != null) {\n        if (!Number.isFinite(ao.timeoutMs) || ao.timeoutMs < 0) {\n          // invalid => treat as immediate timeout\n          timedOut++;\n          settle(w, { ok: false, reason: 'timeout' });\n          return;\n        }\n        w.timeoutId = setTimeout(() => {\n          timedOut++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'timeout' });\n        }, ao.timeoutMs);\n      }\n\n      q.pushBack(w);\n      drain(); // required: capacity may have freed after the fast-path check but before enqueue\n    });\n  };\n\n  const run = async <T>(\n    fn: (signal?: AbortSignal) => Promise<T>,\n    ao: AcquireOptions = {},\n  ): Promise<T> => {\n    const r = await acquire(ao);\n    if (!r.ok) {\n      throw new BulkheadRejectedError(r.reason);\n    }\n    try {\n      return await fn(ao.signal);\n    } finally {\n      r.token.release();\n    }\n  };\n\n  const stats = (): Stats => ({\n    inFlight,\n    pending: pendingCount(),\n    maxConcurrent: opts.maxConcurrent,\n    maxQueue,\n    aborted,\n    timedOut,\n    rejected,\n    doubleRelease,\n  });\n\n  return { tryAcquire, acquire, run, stats };\n}\n"],"mappings":";AAKA,IAAM,YAAN,MAAmB;AAAA,EACT;AAAA,EACA,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EAEf,YAAY,UAAkB;AAC5B,UAAM,MAAM,KAAK,IAAI,GAAG,WAAW,CAAC;AACpC,SAAK,MAAM,IAAI,MAAqB,GAAG;AAAA,EACzC;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,SAAS,MAAS;AAChB,QAAI,KAAK,SAAS,KAAK,IAAI,QAAQ;AACjC,WAAK,KAAK;AAAA,IACZ;AACA,UAAM,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,IAAI;AAC/C,SAAK,IAAI,GAAG,IAAI;AAChB,SAAK;AAAA,EACP;AAAA,EAEA,YAA2B;AACzB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,WAAO,KAAK,IAAI,KAAK,IAAI;AAAA,EAC3B;AAAA,EAEA,WAA0B;AACxB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,UAAM,OAAO,KAAK,IAAI,KAAK,IAAI;AAC/B,SAAK,IAAI,KAAK,IAAI,IAAI;AACtB,SAAK,QAAQ,KAAK,OAAO,KAAK,KAAK,IAAI;AACvC,SAAK;AACL,WAAO;AAAA,EACT;AAAA,EAEQ,OAAO;AACb,UAAM,SAAS,IAAI,MAAqB,KAAK,IAAI,SAAS,CAAC;AAC3D,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,aAAO,CAAC,IAAI,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK,IAAI,MAAM;AAAA,IACxD;AACA,SAAK,MAAM;AACX,SAAK,OAAO;AAAA,EACd;AACF;AA6CO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAG/C,YAAqB,QAAsB;AACzC,UAAM,sBAAsB,MAAM,EAAE;AADjB;AAEnB,SAAK,OAAO;AAAA,EACd;AAAA,EALS,OAAO;AAMlB;AAEO,SAAS,eAAe,MAAuB;AAEpD,MAAI,CAAC,OAAO,UAAU,KAAK,aAAa,KAAK,KAAK,iBAAiB,GAAG;AACpE,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC5D;AACA,QAAM,WAAW,KAAK,YAAY;AAClC,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,GAAG;AAC/C,UAAM,IAAI,MAAM,kCAAkC;AAAA,EACpD;AAGA,MAAI,WAAW;AAGf,QAAM,IAAI,IAAI,UAAkB,WAAW,CAAC;AAG5C,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,WAAW;AACf,MAAI,gBAAgB;AAGpB,QAAM,YAAY,MAAa;AAC7B,QAAI,WAAW;AACf,WAAO;AAAA,MACL,UAAU;AACR,YAAI,UAAU;AACZ;AACA;AAAA,QACF;AACA,mBAAW;AACX;AACA,YAAI,WAAW,EAAG,YAAW;AAC7B,cAAM;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAEA,QAAM,sBAAsB,MAAM;AAEhC,WAAO,EAAE,SAAS,GAAG;AACnB,YAAM,IAAI,EAAE,UAAU;AACtB,UAAI,EAAE,aAAa,EAAE,SAAS;AAC5B,sBAAc,CAAC;AACf,UAAE,SAAS;AACX;AAAA,MACF,OAAO;AACL;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,QAAM,eAAe,MAAM;AACzB,wBAAoB;AACpB,WAAO,EAAE;AAAA,EACX;AAEA,QAAM,gBAAgB,CAAC,MAAc;AACnC,QAAI,EAAE,cAAe,GAAE,cAAc;AACrC,QAAI,EAAE,UAAW,cAAa,EAAE,SAAS;AACzC,MAAE,gBAAgB;AAClB,MAAE,YAAY;AAAA,EAChB;AAEA,QAAM,SAAS,CAAC,GAAW,MAAqB;AAC9C,QAAI,EAAE,QAAS;AACf,MAAE,UAAU;AAGZ,QAAI,CAAC,EAAE,aAAa,CAAC,EAAE,GAAI,GAAE,YAAY;AACzC,kBAAc,CAAC;AACf,MAAE,QAAQ,CAAC;AAAA,EACb;AAGA,QAAM,QAAQ,MAAM;AAElB,wBAAoB;AACpB,WAAO,WAAW,KAAK,iBAAiB,EAAE,SAAS,GAAG;AACpD,YAAM,IAAI,EAAE,SAAS;AAErB,UAAI,EAAE,WAAW;AACf,sBAAc,CAAC;AACf,4BAAoB;AACpB;AAAA,MACF;AACA;AACA,aAAO,GAAG,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IAC5C;AAAA,EACF;AAIA,QAAM,aAAa,MAAwB;AACzC,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE;AAAA,IACxC;AACA,WAAO,EAAE,IAAI,OAAO,QAAQ,oBAAoB;AAAA,EAClD;AAEA,QAAM,UAAU,CAAC,KAAqB,CAAC,MAA8B;AAEnE,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IACzD;AAGA,QAAI,aAAa,GAAG;AAClB;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,oBAAoB,CAAC;AAAA,IACnE;AAGA,QAAI,aAAa,KAAK,UAAU;AAC9B;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,cAAc,CAAC;AAAA,IAC7D;AAGA,WAAO,IAAI,QAAuB,CAAC,YAAY;AAC7C,YAAM,IAAY;AAAA,QAChB;AAAA,QACA,WAAW;AAAA,QACX,SAAS;AAAA,QACT,eAAe;AAAA,QACf,WAAW;AAAA,MACb;AAGA,UAAI,GAAG,QAAQ;AACb,YAAI,GAAG,OAAO,SAAS;AACrB;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,cAAM,UAAU,MAAM;AAEpB;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C;AAEA,WAAG,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAE,gBAAgB,MAAM,GAAG,OAAQ,oBAAoB,SAAS,OAAO;AAAA,MACzE;AAGA,UAAI,GAAG,aAAa,MAAM;AACxB,YAAI,CAAC,OAAO,SAAS,GAAG,SAAS,KAAK,GAAG,YAAY,GAAG;AAEtD;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,UAAE,YAAY,WAAW,MAAM;AAC7B;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C,GAAG,GAAG,SAAS;AAAA,MACjB;AAEA,QAAE,SAAS,CAAC;AACZ,YAAM;AAAA,IACR,CAAC;AAAA,EACH;AAEA,QAAM,MAAM,OACV,IACA,KAAqB,CAAC,MACP;AACf,UAAM,IAAI,MAAM,QAAQ,EAAE;AAC1B,QAAI,CAAC,EAAE,IAAI;AACT,YAAM,IAAI,sBAAsB,EAAE,MAAM;AAAA,IAC1C;AACA,QAAI;AACF,aAAO,MAAM,GAAG,GAAG,MAAM;AAAA,IAC3B,UAAE;AACA,QAAE,MAAM,QAAQ;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,QAAQ,OAAc;AAAA,IAC1B;AAAA,IACA,SAAS,aAAa;AAAA,IACtB,eAAe,KAAK;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,SAAS,KAAK,MAAM;AAC3C;","names":[]}
+{"version":3,"sources":["../src/index.ts"],"sourcesContent":["/**\n * A small ring-buffer queue.\n * - O(1) pushBack / popFront\n * - avoids array shift and head-index + compaction heuristics\n */\nclass RingDeque<T> {\n  private buf: Array<T | undefined>;\n  private head = 0;\n  private tail = 0;\n  private size = 0;\n\n  constructor(capacity: number) {\n    const cap = Math.max(4, capacity | 0);\n    this.buf = new Array<T | undefined>(cap);\n  }\n\n  get length() {\n    return this.size;\n  }\n\n  pushBack(item: T) {\n    if (this.size === this.buf.length) {\n      this.grow();\n    }\n    const idx = (this.head + this.size) % this.buf.length;\n    this.buf[idx] = item;\n    this.size++;\n  }\n\n  peekFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    return this.buf[this.head];\n  }\n\n  popFront(): T | undefined {\n    if (this.size === 0) return undefined;\n    const item = this.buf[this.head];\n    this.buf[this.head] = undefined; // help GC\n    this.head = (this.head + 1) % this.buf.length;\n    this.size--;\n    return item;\n  }\n\n  private grow() {\n    const newBuf = new Array<T | undefined>(this.buf.length * 2);\n    for (let i = 0; i < this.size; i++) {\n      newBuf[i] = this.buf[(this.head + i) % this.buf.length];\n    }\n    this.buf = newBuf;\n    this.head = 0;\n  }\n}\n\nexport type BulkheadOptions = {\n  maxConcurrent: number;\n  maxQueue?: number; // pending waiters allowed (0 => no waiting)\n};\n\nexport type AcquireOptions = {\n  signal?: AbortSignal;\n  timeoutMs?: number; // waiting timeout only\n};\n\nexport type Stats = {\n  inFlight: number;\n  pending: number;\n  maxConcurrent: number;\n  maxQueue: number;\n  closed: boolean;\n  // optional debug counters:\n  aborted?: number;\n  timedOut?: number;\n  rejected?: number;\n  doubleRelease?: number;\n  inFlightUnderflow?: number;\n};\n\nexport type Token = { release(): void };\n\nexport type TryAcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: 'concurrency_limit' | 'shutdown' };\n\nexport type AcquireResult =\n  | { ok: true; token: Token }\n  | { ok: false; reason: RejectReason };\n\ntype Waiter = {\n  resolve: (r: AcquireResult) => void;\n  cancelled: boolean;\n  settled: boolean;\n\n  abortListener: (() => void) | undefined;\n  timeoutId: ReturnType<typeof setTimeout> | undefined;\n};\n\nexport type RejectReason =\n  | 'concurrency_limit'\n  | 'queue_limit'\n  | 'timeout'\n  | 'aborted'\n  | 'shutdown';\n\nexport class BulkheadRejectedError extends Error {\n  readonly code = 'BULKHEAD_REJECTED' as const;\n\n  constructor(readonly reason: RejectReason) {\n    super(`Bulkhead rejected: ${reason}`);\n    this.name = 'BulkheadRejectedError';\n  }\n}\n\nexport function createBulkhead(opts: BulkheadOptions) {\n  // ---- validate ----\n  if (!Number.isInteger(opts.maxConcurrent) || opts.maxConcurrent <= 0) {\n    throw new Error('maxConcurrent must be a positive integer');\n  }\n  const maxQueue = opts.maxQueue ?? 0;\n  if (!Number.isInteger(maxQueue) || maxQueue < 0) {\n    throw new Error('maxQueue must be an integer >= 0');\n  }\n\n  // ---- state ----\n  let inFlight = 0;\n  let closed = false;\n\n  // Live pending count — the number of waiters in the queue that have not\n  // been settled (admitted, cancelled, timed out, or aborted). Tracked\n  // separately from `q.length` so that `stats()` is a pure read — the\n  // queue may contain stale (cancelled/settled) entries that haven't been\n  // pruned yet, but `livePending` is always accurate.\n  let livePending = 0;\n\n  // FIFO queue as deque (no head index, just pushBack / popFront)\n  const q = new RingDeque<Waiter>(maxQueue + 1); // +1 to avoid full queue edge case\n\n  // Drain waiters — resolve functions for pending drain() promises.\n  let drainWaiters: Array<() => void> = [];\n\n  // optional counters\n  let aborted = 0;\n  let timedOut = 0;\n  let rejected = 0;\n  let doubleRelease = 0;\n  let inFlightUnderflow = 0;\n\n  // ---- internal helpers ----\n\n  const cleanupWaiter = (w: Waiter) => {\n    if (w.abortListener) w.abortListener();\n    if (w.timeoutId) clearTimeout(w.timeoutId);\n    w.abortListener = undefined;\n    w.timeoutId = undefined;\n  };\n\n  const settle = (w: Waiter, r: AcquireResult) => {\n    if (w.settled) return;\n    w.settled = true;\n    // Once settled, it's effectively cancelled for pump-skipping purposes.\n    if (!w.cancelled && !r.ok) w.cancelled = true;\n    cleanupWaiter(w);\n    livePending--;\n    w.resolve(r);\n  };\n\n  /**\n   * Remove cancelled/settled waiters from the front of the queue so the\n   * deque doesn't accumulate stale entries. Called from pump() and\n   * release paths — never from stats().\n   */\n  const pruneCancelledFront = () => {\n    while (q.length > 0) {\n      const w = q.peekFront()!;\n      if (w.cancelled || w.settled) {\n        q.popFront();\n        continue;\n      }\n      break;\n    }\n  };\n\n  /** Notify drain() waiters if inFlight has reached zero. */\n  const notifyDrainWaiters = () => {\n    if (inFlight === 0 && livePending === 0 && drainWaiters.length > 0) {\n      const waiters = drainWaiters;\n      drainWaiters = [];\n      for (const resolve of waiters) resolve();\n    }\n  };\n\n  // ---- token factory ----\n  const makeToken = (): Token => {\n    let released = false;\n    return {\n      release() {\n        if (released) {\n          doubleRelease++;\n          return;\n        }\n        released = true;\n        inFlight--;\n        if (inFlight < 0) {\n          inFlightUnderflow++;\n          inFlight = 0;\n        }\n        pump();\n        notifyDrainWaiters();\n      },\n    };\n  };\n\n  // ---- pump: admit waiters from the queue when capacity frees ----\n  const pump = () => {\n    pruneCancelledFront();\n    while (inFlight < opts.maxConcurrent && q.length > 0) {\n      const w = q.popFront()!;\n      if (w.cancelled || w.settled) {\n        pruneCancelledFront();\n        continue;\n      }\n      inFlight++;\n      settle(w, { ok: true, token: makeToken() });\n    }\n  };\n\n  // ---- close(): reject all pending, block future admission ----\n  const close = (): void => {\n    if (closed) return;\n    closed = true;\n\n    // Reject all pending waiters.\n    while (q.length > 0) {\n      const w = q.popFront()!;\n      if (w.settled || w.cancelled) continue;\n      rejected++;\n      settle(w, { ok: false, reason: 'shutdown' });\n    }\n\n    // If nothing is in-flight, notify drain waiters immediately.\n    notifyDrainWaiters();\n  };\n\n  // ---- drain(): wait for inFlight to reach zero ----\n  const drainFn = (): Promise<void> => {\n    if (inFlight === 0 && livePending === 0) return Promise.resolve();\n    return new Promise<void>((resolve) => {\n      drainWaiters.push(resolve);\n    });\n  };\n\n  // ---- public APIs ----\n\n  const tryAcquire = (): TryAcquireResult => {\n    if (closed) {\n      return { ok: false, reason: 'shutdown' };\n    }\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return { ok: true, token: makeToken() };\n    }\n    return { ok: false, reason: 'concurrency_limit' };\n  };\n\n  const acquire = (ao: AcquireOptions = {}): Promise<AcquireResult> => {\n    // closed fast path\n    if (closed) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'shutdown' });\n    }\n\n    // immediate fast path\n    if (inFlight < opts.maxConcurrent) {\n      inFlight++;\n      return Promise.resolve({ ok: true, token: makeToken() });\n    }\n\n    // no waiting allowed\n    if (maxQueue === 0) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'concurrency_limit' });\n    }\n\n    // bounded waiting\n    if (livePending >= maxQueue) {\n      rejected++;\n      return Promise.resolve({ ok: false, reason: 'queue_limit' });\n    }\n\n    // enqueue\n    return new Promise<AcquireResult>((resolve) => {\n      const w: Waiter = {\n        resolve,\n        cancelled: false,\n        settled: false,\n        abortListener: undefined,\n        timeoutId: undefined,\n      };\n\n      livePending++;\n\n      // abort support\n      if (ao.signal) {\n        if (ao.signal.aborted) {\n          aborted++;\n          settle(w, { ok: false, reason: 'aborted' });\n          return;\n        }\n        const onAbort = () => {\n          aborted++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'aborted' });\n        };\n\n        ao.signal.addEventListener('abort', onAbort, { once: true });\n        w.abortListener = () => ao.signal!.removeEventListener('abort', onAbort);\n      }\n\n      // timeout support (waiting only)\n      if (ao.timeoutMs != null) {\n        if (!Number.isFinite(ao.timeoutMs) || ao.timeoutMs < 0) {\n          timedOut++;\n          settle(w, { ok: false, reason: 'timeout' });\n          return;\n        }\n        w.timeoutId = setTimeout(() => {\n          timedOut++;\n          w.cancelled = true;\n          settle(w, { ok: false, reason: 'timeout' });\n        }, ao.timeoutMs);\n      }\n\n      q.pushBack(w);\n      // Capacity may have freed after the fast-path check but before enqueue.\n      if (inFlight < opts.maxConcurrent) {\n        pump();\n      }\n    });\n  };\n\n  const run = async <T>(\n    fn: (signal?: AbortSignal) => Promise<T>,\n    ao: AcquireOptions = {},\n  ): Promise<T> => {\n    const r = await acquire(ao);\n    if (!r.ok) {\n      throw new BulkheadRejectedError(r.reason);\n    }\n    try {\n      return await fn(ao.signal);\n    } finally {\n      r.token.release();\n    }\n  };\n\n  const stats = (): Stats => ({\n    inFlight,\n    pending: livePending,\n    maxConcurrent: opts.maxConcurrent,\n    maxQueue,\n    closed,\n    aborted,\n    timedOut,\n    rejected,\n    doubleRelease,\n    inFlightUnderflow,\n  });\n\n  return { tryAcquire, acquire, run, stats, close, drain: drainFn };\n}\n"],"mappings":";AAKA,IAAM,YAAN,MAAmB;AAAA,EACT;AAAA,EACA,OAAO;AAAA,EACP,OAAO;AAAA,EACP,OAAO;AAAA,EAEf,YAAY,UAAkB;AAC5B,UAAM,MAAM,KAAK,IAAI,GAAG,WAAW,CAAC;AACpC,SAAK,MAAM,IAAI,MAAqB,GAAG;AAAA,EACzC;AAAA,EAEA,IAAI,SAAS;AACX,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,SAAS,MAAS;AAChB,QAAI,KAAK,SAAS,KAAK,IAAI,QAAQ;AACjC,WAAK,KAAK;AAAA,IACZ;AACA,UAAM,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,IAAI;AAC/C,SAAK,IAAI,GAAG,IAAI;AAChB,SAAK;AAAA,EACP;AAAA,EAEA,YAA2B;AACzB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,WAAO,KAAK,IAAI,KAAK,IAAI;AAAA,EAC3B;AAAA,EAEA,WAA0B;AACxB,QAAI,KAAK,SAAS,EAAG,QAAO;AAC5B,UAAM,OAAO,KAAK,IAAI,KAAK,IAAI;AAC/B,SAAK,IAAI,KAAK,IAAI,IAAI;AACtB,SAAK,QAAQ,KAAK,OAAO,KAAK,KAAK,IAAI;AACvC,SAAK;AACL,WAAO;AAAA,EACT;AAAA,EAEQ,OAAO;AACb,UAAM,SAAS,IAAI,MAAqB,KAAK,IAAI,SAAS,CAAC;AAC3D,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK;AAClC,aAAO,CAAC,IAAI,KAAK,KAAK,KAAK,OAAO,KAAK,KAAK,IAAI,MAAM;AAAA,IACxD;AACA,SAAK,MAAM;AACX,SAAK,OAAO;AAAA,EACd;AACF;AAoDO,IAAM,wBAAN,cAAoC,MAAM;AAAA,EAG/C,YAAqB,QAAsB;AACzC,UAAM,sBAAsB,MAAM,EAAE;AADjB;AAEnB,SAAK,OAAO;AAAA,EACd;AAAA,EALS,OAAO;AAMlB;AAEO,SAAS,eAAe,MAAuB;AAEpD,MAAI,CAAC,OAAO,UAAU,KAAK,aAAa,KAAK,KAAK,iBAAiB,GAAG;AACpE,UAAM,IAAI,MAAM,0CAA0C;AAAA,EAC5D;AACA,QAAM,WAAW,KAAK,YAAY;AAClC,MAAI,CAAC,OAAO,UAAU,QAAQ,KAAK,WAAW,GAAG;AAC/C,UAAM,IAAI,MAAM,kCAAkC;AAAA,EACpD;AAGA,MAAI,WAAW;AACf,MAAI,SAAS;AAOb,MAAI,cAAc;AAGlB,QAAM,IAAI,IAAI,UAAkB,WAAW,CAAC;AAG5C,MAAI,eAAkC,CAAC;AAGvC,MAAI,UAAU;AACd,MAAI,WAAW;AACf,MAAI,WAAW;AACf,MAAI,gBAAgB;AACpB,MAAI,oBAAoB;AAIxB,QAAM,gBAAgB,CAAC,MAAc;AACnC,QAAI,EAAE,cAAe,GAAE,cAAc;AACrC,QAAI,EAAE,UAAW,cAAa,EAAE,SAAS;AACzC,MAAE,gBAAgB;AAClB,MAAE,YAAY;AAAA,EAChB;AAEA,QAAM,SAAS,CAAC,GAAW,MAAqB;AAC9C,QAAI,EAAE,QAAS;AACf,MAAE,UAAU;AAEZ,QAAI,CAAC,EAAE,aAAa,CAAC,EAAE,GAAI,GAAE,YAAY;AACzC,kBAAc,CAAC;AACf;AACA,MAAE,QAAQ,CAAC;AAAA,EACb;AAOA,QAAM,sBAAsB,MAAM;AAChC,WAAO,EAAE,SAAS,GAAG;AACnB,YAAM,IAAI,EAAE,UAAU;AACtB,UAAI,EAAE,aAAa,EAAE,SAAS;AAC5B,UAAE,SAAS;AACX;AAAA,MACF;AACA;AAAA,IACF;AAAA,EACF;AAGA,QAAM,qBAAqB,MAAM;AAC/B,QAAI,aAAa,KAAK,gBAAgB,KAAK,aAAa,SAAS,GAAG;AAClE,YAAM,UAAU;AAChB,qBAAe,CAAC;AAChB,iBAAW,WAAW,QAAS,SAAQ;AAAA,IACzC;AAAA,EACF;AAGA,QAAM,YAAY,MAAa;AAC7B,QAAI,WAAW;AACf,WAAO;AAAA,MACL,UAAU;AACR,YAAI,UAAU;AACZ;AACA;AAAA,QACF;AACA,mBAAW;AACX;AACA,YAAI,WAAW,GAAG;AAChB;AACA,qBAAW;AAAA,QACb;AACA,aAAK;AACL,2BAAmB;AAAA,MACrB;AAAA,IACF;AAAA,EACF;AAGA,QAAM,OAAO,MAAM;AACjB,wBAAoB;AACpB,WAAO,WAAW,KAAK,iBAAiB,EAAE,SAAS,GAAG;AACpD,YAAM,IAAI,EAAE,SAAS;AACrB,UAAI,EAAE,aAAa,EAAE,SAAS;AAC5B,4BAAoB;AACpB;AAAA,MACF;AACA;AACA,aAAO,GAAG,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IAC5C;AAAA,EACF;AAGA,QAAM,QAAQ,MAAY;AACxB,QAAI,OAAQ;AACZ,aAAS;AAGT,WAAO,EAAE,SAAS,GAAG;AACnB,YAAM,IAAI,EAAE,SAAS;AACrB,UAAI,EAAE,WAAW,EAAE,UAAW;AAC9B;AACA,aAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,WAAW,CAAC;AAAA,IAC7C;AAGA,uBAAmB;AAAA,EACrB;AAGA,QAAM,UAAU,MAAqB;AACnC,QAAI,aAAa,KAAK,gBAAgB,EAAG,QAAO,QAAQ,QAAQ;AAChE,WAAO,IAAI,QAAc,CAAC,YAAY;AACpC,mBAAa,KAAK,OAAO;AAAA,IAC3B,CAAC;AAAA,EACH;AAIA,QAAM,aAAa,MAAwB;AACzC,QAAI,QAAQ;AACV,aAAO,EAAE,IAAI,OAAO,QAAQ,WAAW;AAAA,IACzC;AACA,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE;AAAA,IACxC;AACA,WAAO,EAAE,IAAI,OAAO,QAAQ,oBAAoB;AAAA,EAClD;AAEA,QAAM,UAAU,CAAC,KAAqB,CAAC,MAA8B;AAEnE,QAAI,QAAQ;AACV;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,WAAW,CAAC;AAAA,IAC1D;AAGA,QAAI,WAAW,KAAK,eAAe;AACjC;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,MAAM,OAAO,UAAU,EAAE,CAAC;AAAA,IACzD;AAGA,QAAI,aAAa,GAAG;AAClB;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,oBAAoB,CAAC;AAAA,IACnE;AAGA,QAAI,eAAe,UAAU;AAC3B;AACA,aAAO,QAAQ,QAAQ,EAAE,IAAI,OAAO,QAAQ,cAAc,CAAC;AAAA,IAC7D;AAGA,WAAO,IAAI,QAAuB,CAAC,YAAY;AAC7C,YAAM,IAAY;AAAA,QAChB;AAAA,QACA,WAAW;AAAA,QACX,SAAS;AAAA,QACT,eAAe;AAAA,QACf,WAAW;AAAA,MACb;AAEA;AAGA,UAAI,GAAG,QAAQ;AACb,YAAI,GAAG,OAAO,SAAS;AACrB;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,cAAM,UAAU,MAAM;AACpB;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C;AAEA,WAAG,OAAO,iBAAiB,SAAS,SAAS,EAAE,MAAM,KAAK,CAAC;AAC3D,UAAE,gBAAgB,MAAM,GAAG,OAAQ,oBAAoB,SAAS,OAAO;AAAA,MACzE;AAGA,UAAI,GAAG,aAAa,MAAM;AACxB,YAAI,CAAC,OAAO,SAAS,GAAG,SAAS,KAAK,GAAG,YAAY,GAAG;AACtD;AACA,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAC1C;AAAA,QACF;AACA,UAAE,YAAY,WAAW,MAAM;AAC7B;AACA,YAAE,YAAY;AACd,iBAAO,GAAG,EAAE,IAAI,OAAO,QAAQ,UAAU,CAAC;AAAA,QAC5C,GAAG,GAAG,SAAS;AAAA,MACjB;AAEA,QAAE,SAAS,CAAC;AAEZ,UAAI,WAAW,KAAK,eAAe;AACjC,aAAK;AAAA,MACP;AAAA,IACF,CAAC;AAAA,EACH;AAEA,QAAM,MAAM,OACV,IACA,KAAqB,CAAC,MACP;AACf,UAAM,IAAI,MAAM,QAAQ,EAAE;AAC1B,QAAI,CAAC,EAAE,IAAI;AACT,YAAM,IAAI,sBAAsB,EAAE,MAAM;AAAA,IAC1C;AACA,QAAI;AACF,aAAO,MAAM,GAAG,GAAG,MAAM;AAAA,IAC3B,UAAE;AACA,QAAE,MAAM,QAAQ;AAAA,IAClB;AAAA,EACF;AAEA,QAAM,QAAQ,OAAc;AAAA,IAC1B;AAAA,IACA,SAAS;AAAA,IACT,eAAe,KAAK;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,SAAO,EAAE,YAAY,SAAS,KAAK,OAAO,OAAO,OAAO,QAAQ;AAClE;","names":[]}

package/package.json

@@ -1,6 +1,12 @@
 {
   "name": "async-bulkhead-ts",
-  "version": "0.2.2",
+  "version": "0.3.0",
+  "overrides": {
+    "minimatch": "^10.2.1",
+    "@eslint/eslintrc": {
+      "ajv": "^6.12.6"
+    }
+  },
   "description": "Fail-fast admission control + bulkheads for async workloads",
   "license": "MIT",
   "type": "module",