@nxtedition/scheduler 3.0.12 → 3.1.0

package/README.md

@@ -1,6 +1,6 @@
 # @nxtedition/scheduler
 
-A high-performance, priority-based task scheduler for Node.js with support for concurrency limiting and multi-worker coordination via `SharedArrayBuffer`.
+A high-performance, priority-based task scheduler for Node.js with support for concurrency limiting, byte-rate throttling, and multi-worker coordination via `SharedArrayBuffer`.
 
 ## Install
 
@@ -157,6 +157,80 @@ Create shared state for cross-worker scheduling.
 
 Parse a string or number into a normalized priority value.
 
+---
+
+## Throttle
+
+`Throttle` is a token-bucket rate limiter that controls how many **bytes per second** are processed. It shares the same priority system as `Scheduler`.
+
+### Basic
+
+```js
+import { Throttle } from '@nxtedition/scheduler'
+
+// Allow 1 MB/s
+const throttle = new Throttle({ bytesPerSecond: 1_000_000 })
+
+// Refill tokens every 10ms
+setInterval(() => throttle.refill(), 10)
+```
+
+### Multi-Worker Coordination
+
+### Streaming
+
+`throttle.stream()` returns a Node.js `Transform` stream that enforces backpressure — it won't call the next `write` until tokens are available:
+
+```js
+import { createReadStream, createWriteStream } from 'node:fs'
+import { pipeline } from 'node:stream/promises'
+
+const throttle = new Throttle({ bytesPerSecond: 1_000_000 }) // 1 MB/s
+setInterval(() => throttle.refill(), 10)
+
+await pipeline(createReadStream('input.mp4'), throttle.stream(), createWriteStream('output.mp4'))
+```
+
+### Priority
+
+Both `run()` and `stream()` accept a priority. Higher-priority work drains first when tokens are available:
+
+```js
+// Low-priority stream (yields to higher-priority work)
+const stream = throttle.stream('low')
+```
+
+### Low-Level API
+
+```js
+throttle.acquire(
+  () => {
+    sendPacket(data)
+  },
+  data.byteLength,
+  'normal',
+)
+```
+
+`acquire` returns `true` if the callback ran immediately (tokens were available), or `false` if it was queued.
+
+## API
+
+### `new Throttle(opts)`
+
+- `opts.bytesPerSecond` — bytes per second (default: `Infinity`)
+- `opts` may also be a `SharedArrayBuffer` created by `Throttle.makeSharedState()`
+
+### `throttle.acquire(fn, bytes, priority?): boolean`
+
+Low-level acquisition. Returns `true` if `fn` ran immediately, `false` if queued.
+
+### `throttle.stream(priority?): Transform`
+
+Returns a `Transform` stream that rate-limits data passing through it. Each chunk consumes `chunk.length` tokens.
+
+---
+
 ## License
 
 MIT

package/lib/index.d.ts

@@ -1,30 +1,5 @@
-export type Priority = -3 | -2 | -1 | 0 | 1 | 2 | 3 | 'lowest' | 'lower' | 'low' | 'normal' | 'high' | 'higher' | 'highest';
-export declare function parsePriority(p: string | number): -3 | -2 | -1 | 0 | 1 | 2 | 3;
-export declare class Scheduler {
-    #private;
-    static readonly LOWEST = -3;
-    static readonly LOWER = -2;
-    static readonly LOW = -1;
-    static readonly NORMAL = 0;
-    static readonly HIGH = 1;
-    static readonly HIGHER = 2;
-    static readonly HIGHEST = 3;
-    get concurrency(): number;
-    get stats(): {
-        deferred: number;
-        running: number;
-        pending: number;
-        queues: {
-            count: number;
-        }[];
-    };
-    static makeSharedState(concurrency: number): SharedArrayBuffer;
-    constructor(opts: SharedArrayBuffer | {
-        concurrency?: number;
-    });
-    run<T>(fn: () => Promise<T> | T, priority?: Priority): Promise<T>;
-    run<T, U>(fn: (opaque: U) => Promise<T> | T, priority: Priority, opaque: U): Promise<T>;
-    acquire(fn: () => unknown, priority?: Priority): void;
-    acquire<U>(fn: (opaque: U) => unknown, priority: Priority, opaque: U): void;
-    release(): void;
-}
+export { Scheduler } from './scheduler.ts';
+export { Throttle } from './throttle.ts';
+export type { Priority } from './queue.ts';
+export { parsePriority } from './queue.ts';
+//# sourceMappingURL=index.d.ts.map

package/lib/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC1C,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AACxC,YAAY,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAA;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA"}

package/lib/index.js

@@ -1,272 +1,4 @@
-const RUNNING_INDEX = 0
-const CONCURRENCY_INDEX = 1
-
-const maxInt = 2147483647
-
-class FastQueue {
-  idx = 0
-  cnt = 0
-  arr                 = []
-}
-
-                      
-      
-      
-      
-     
-     
-     
-     
-            
-           
-         
-            
-          
-            
-             
-
-export function parsePriority(p                 )                               {
-  if (typeof p === 'number') {
-    // Do nothing...
-  } else if (p === 'lowest') {
-    return -3
-  } else if (p === 'lower') {
-    return -2
-  } else if (p === 'low') {
-    return -1
-  } else if (p === 'normal') {
-    return 0
-  } else if (p === 'high') {
-    return 1
-  } else if (p === 'higher') {
-    return 2
-  } else if (p === 'highest') {
-    return 3
-  } else {
-    p = Number(p)
-  }
-
-  if (typeof p !== 'number' || Number.isNaN(p)) {
-    return 0
-  } else if (p < -3) {
-    return -3
-  } else if (p > 3) {
-    return 3
-  } else {
-    return Math.trunc(p)                                
-  }
-}
-
-export class Scheduler {
-  static          LOWEST = -3
-  static          LOWER = -2
-  static          LOW = -1
-  static          NORMAL = 0
-  static          HIGH = 1
-  static          HIGHER = 2
-  static          HIGHEST = 3
-
-  #concurrency
-  #stateView
-
-  #running = 0
-  #pending = 0
-  #counter = 0
-  #releasing = false
-  #deferred = 0
-
-  #queues = [
-    new FastQueue(), // 0 lowest
-    new FastQueue(), // 1 lower
-    new FastQueue(), // 2 low
-    new FastQueue(), // 3 normal
-    new FastQueue(), // 4 high
-    new FastQueue(), // 5 higher
-    new FastQueue(), // 6 highest
-  ]
-
-  get concurrency() {
-    return this.#concurrency
-  }
-
-  get stats() {
-    return {
-      deferred: this.#deferred,
-      running: this.#running,
-      pending: this.#pending,
-      queues: this.#queues.map((q) => ({ count: q.cnt })),
-    }
-  }
-
-  static makeSharedState(concurrency        ) {
-    if (concurrency != null && (concurrency < 0 || !Number.isInteger(concurrency))) {
-      throw new Error('Invalid concurrency')
-    }
-    const stateBuffer = new SharedArrayBuffer(64)
-    const stateView = new Int32Array(stateBuffer)
-    Atomics.store(stateView, CONCURRENCY_INDEX, concurrency ?? -1)
-    return stateBuffer
-  }
-
-  constructor(opts                                              ) {
-    if (opts instanceof SharedArrayBuffer) {
-      this.#stateView = new Int32Array(opts)
-      this.#concurrency = Atomics.load(this.#stateView, CONCURRENCY_INDEX)
-      if (this.#concurrency === -1) {
-        this.#concurrency = Infinity
-      }
-    } else {
-      this.#concurrency = opts?.concurrency ?? Infinity
-    }
-  }
-                                                                   
-                                                                                         
-  run      (
-    fn                                ,
-    priority           = Scheduler.NORMAL,
-    opaque    ,
-  )             {
-    return new Promise   ((resolve, reject) => {
-      this.acquire(
-        async (o) => {
-          try {
-            resolve(await fn(o))
-          } catch (err) {
-            // eslint-disable-next-line @typescript-eslint/prefer-promise-reject-errors
-            reject(err)
-          } finally {
-            this.release()
-          }
-        },
-        priority,
-        opaque,
-      )
-    })
-  }
-
-                                                       
-                                                                             
-  acquire   (fn                         , priority           = Scheduler.NORMAL, opaque    )       {
-    const p = parsePriority(priority)
-    const queue = this.#queues[p + 3]
-
-    if (this.#stateView) {
-      // Make sure we are always running at least one local job even if we might globally over subscribe.
-      if (this.#running < 1) {
-        Atomics.add(this.#stateView, RUNNING_INDEX, 1)
-        this.#running += 1
-        fn(opaque)
-        return
-      }
-
-      // We use non atomic access here as an optimization and treat the concurrency limit as a soft limit.
-      if (this.#stateView[RUNNING_INDEX] < this.#concurrency) {
-        Atomics.add(this.#stateView, RUNNING_INDEX, 1)
-        this.#running += 1
-        fn(opaque)
-        return
-      }
-    } else if ((this.#running < 1 && this.#concurrency > 0) || this.#running < this.#concurrency) {
-      this.#running += 1
-      fn(opaque)
-      return
-    }
-
-    queue.arr.push(fn, opaque)
-    queue.cnt += 1
-
-    this.#deferred += 1
-    this.#pending += 1
-  }
-
-  release() {
-    let running        
-    if (this.#running > 0) {
-      running = this.#stateView
-        ? Atomics.sub(this.#stateView, RUNNING_INDEX, 1) - 1
-        : this.#running - 1
-      this.#running -= 1
-    } else {
-      // Gracefully handle user error...
-      running = this.#stateView ? Atomics.load(this.#stateView, RUNNING_INDEX) : this.#running
-    }
-
-    if (this.#pending === 0 || this.#releasing) {
-      return
-    }
-
-    try {
-      this.#releasing = true
-      while (this.#pending > 0 && (this.#running === 0 || running < this.#concurrency)) {
-        let queue                   = null
-
-        let idx = this.#queues.length - 1
-
-        // Avoid starvation by randomizing the starting queue.
-        {
-          this.#counter = (this.#counter + 1) & maxInt
-          if (this.#counter & 0b0000001) {
-            idx = 6 // highest: 50%
-          } else if (this.#counter & 0b0000010) {
-            idx = 5 // higher: 25%
-          } else if (this.#counter & 0b0000100) {
-            idx = 4 // high: 12.5%
-          } else if (this.#counter & 0b0001000) {
-            idx = 3 // normal: 6.25%
-          } else if (this.#counter & 0b0010000) {
-            idx = 2 // low: 3.125%
-          } else if (this.#counter & 0b0100000) {
-            idx = 1 // lower: 1.5625%
-          } else if (this.#counter & 0b1000000) {
-            idx = 0 // lowest: 0.78%
-          }
-        }
-
-        for (let n = idx; n >= 0 && (queue == null || queue.cnt === 0); n--) {
-          queue = this.#queues[n]
-        }
-
-        for (let n = this.#queues.length - 1; n > idx && (queue == null || queue.cnt === 0); n--) {
-          queue = this.#queues[n]
-        }
-
-        if (queue == null || queue.cnt === 0) {
-          throw new Error('Invariant violation: pending > 0 but no tasks in queues')
-        }
-
-        const fn = queue.arr[queue.idx]                                 
-        queue.arr[queue.idx++] = null
-        const opaque = queue.arr[queue.idx]
-        queue.arr[queue.idx++] = null
-        queue.cnt -= 1
-
-        if (queue.cnt === 0) {
-          queue.idx = 0
-          queue.arr.length = 0
-        } else if (queue.idx > 1024) {
-          queue.arr.splice(0, queue.idx)
-          queue.idx = 0
-        }
-
-        this.#pending -= 1
-        this.#running += 1
-
-        if (this.#stateView) {
-          Atomics.add(this.#stateView, RUNNING_INDEX, 1)
-        }
-
-        fn(opaque)
-
-        // Re-read running after fn() in case it synchronously called release()
-        running = this.#stateView ? Atomics.load(this.#stateView, RUNNING_INDEX) : this.#running
-      }
-    } catch (err) {
-      // Throwing here is undefined behavior...
-      queueMicrotask(() => {
-        throw new Error('Scheduler task error', { cause: err })
-      })
-    } finally {
-      this.#releasing = false
-    }
-  }
-}
+export { Scheduler } from "./scheduler.js";
+export { Throttle } from "./throttle.js";
+export { parsePriority } from "./queue.js";
+//# sourceMappingURL=index.js.map

package/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC1C,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAExC,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAA"}

package/lib/queue.d.ts

@@ -0,0 +1,38 @@
+export declare class FastQueue {
+    idx: number;
+    cnt: number;
+    arr: Array<unknown>;
+}
+export type NumberPriority = -3 | -2 | -1 | 0 | 1 | 2 | 3;
+export type Priority = NumberPriority | 'lowest' | 'lower' | 'low' | 'normal' | 'high' | 'higher' | 'highest';
+export declare function parsePriority(p: string | number): NumberPriority;
+export declare class Queue {
+    #private;
+    static readonly LOWEST = -3;
+    static readonly LOWER = -2;
+    static readonly LOW = -1;
+    static readonly NORMAL = 0;
+    static readonly HIGH = 1;
+    static readonly HIGHER = 2;
+    static readonly HIGHEST = 3;
+    protected stateView?: Int32Array;
+    protected running: number;
+    protected pending: number;
+    protected counter: number;
+    protected releasing: boolean;
+    protected deferred: number;
+    protected queues: FastQueue[];
+    get concurrency(): number;
+    get stats(): {
+        pending: number;
+        queues: {
+            count: number;
+        }[];
+    };
+    protected getNextQueue(): FastQueue | null;
+    static makeSharedState(concurrency: number): SharedArrayBuffer;
+    constructor(opts: SharedArrayBuffer | {
+        concurrency?: number;
+    });
+}
+//# sourceMappingURL=queue.d.ts.map

package/lib/queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.d.ts","sourceRoot":"","sources":["../src/queue.ts"],"names":[],"mappings":"AAEA,qBAAa,SAAS;IACpB,GAAG,SAAI;IACP,GAAG,SAAI;IACP,GAAG,EAAE,KAAK,CAAC,OAAO,CAAC,CAAK;CACzB;AAED,MAAM,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAEzD,MAAM,MAAM,QAAQ,GAChB,cAAc,GACd,QAAQ,GACR,OAAO,GACP,KAAK,GACL,QAAQ,GACR,MAAM,GACN,QAAQ,GACR,SAAS,CAAA;AAEb,wBAAgB,aAAa,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,cAAc,CA8BhE;AAID,qBAAa,KAAK;;IAChB,MAAM,CAAC,QAAQ,CAAC,MAAM,MAAK;IAC3B,MAAM,CAAC,QAAQ,CAAC,KAAK,MAAK;IAC1B,MAAM,CAAC,QAAQ,CAAC,GAAG,MAAK;IACxB,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAI;IAC1B,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAI;IACxB,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAI;IAC1B,MAAM,CAAC,QAAQ,CAAC,OAAO,KAAI;IAG3B,SAAS,CAAC,SAAS,CAAC,EAAE,UAAU,CAAA;IAEhC,SAAS,CAAC,OAAO,SAAI;IACrB,SAAS,CAAC,OAAO,SAAI;IACrB,SAAS,CAAC,OAAO,SAAI;IACrB,SAAS,CAAC,SAAS,UAAQ;IAC3B,SAAS,CAAC,QAAQ,SAAI;IAGtB,SAAS,CAAC,MAAM,cAQf;IAED,IAAI,WAAW,WAEd;IAED,IAAI,KAAK;;;;;MAKR;IAED,SAAS,CAAC,YAAY;IAkCtB,MAAM,CAAC,eAAe,CAAC,WAAW,EAAE,MAAM;gBAU9B,IAAI,EAAE,iBAAiB,GAAG;QAAE,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE;CAW/D"}

package/lib/queue.js

@@ -0,0 +1,138 @@
+const CONCURRENCY_INDEX = 1;
+export class FastQueue {
+    idx = 0;
+    cnt = 0;
+    arr = [];
+}
+export function parsePriority(p) {
+    if (typeof p === 'number') {
+        // Do nothing...
+    }
+    else if (p === 'lowest') {
+        return -3;
+    }
+    else if (p === 'lower') {
+        return -2;
+    }
+    else if (p === 'low') {
+        return -1;
+    }
+    else if (p === 'normal') {
+        return 0;
+    }
+    else if (p === 'high') {
+        return 1;
+    }
+    else if (p === 'higher') {
+        return 2;
+    }
+    else if (p === 'highest') {
+        return 3;
+    }
+    else {
+        p = Number(p);
+    }
+    if (typeof p !== 'number' || Number.isNaN(p)) {
+        return 0;
+    }
+    else if (p < -3) {
+        return -3;
+    }
+    else if (p > 3) {
+        return 3;
+    }
+    else {
+        return Math.trunc(p);
+    }
+}
+const maxInt = 2147483647;
+export class Queue {
+    static LOWEST = -3;
+    static LOWER = -2;
+    static LOW = -1;
+    static NORMAL = 0;
+    static HIGH = 1;
+    static HIGHER = 2;
+    static HIGHEST = 3;
+    #concurrency;
+    stateView;
+    running = 0;
+    pending = 0;
+    counter = 0;
+    releasing = false;
+    deferred = 0;
+    // Queues are stored in order of priority, so index == priority + 3
+    queues = [
+        new FastQueue(), // 0 lowest
+        new FastQueue(), // 1 lower
+        new FastQueue(), // 2 low
+        new FastQueue(), // 3 normal
+        new FastQueue(), // 4 high
+        new FastQueue(), // 5 higher
+        new FastQueue(), // 6 highest
+    ];
+    get concurrency() {
+        return this.#concurrency;
+    }
+    get stats() {
+        return {
+            pending: this.pending,
+            queues: this.queues.map((q) => ({ count: q.cnt })),
+        };
+    }
+    getNextQueue() {
+        let queue = null;
+        this.counter = (this.counter + 1) & maxInt;
+        let idx = this.queues.length - 1;
+        if (this.counter & 0b0000001) {
+            idx = 6; // highest: 50%
+        }
+        else if (this.counter & 0b0000010) {
+            idx = 5; // higher: 25%
+        }
+        else if (this.counter & 0b0000100) {
+            idx = 4; // high: 12.5%
+        }
+        else if (this.counter & 0b0001000) {
+            idx = 3; // normal: 6.25%
+        }
+        else if (this.counter & 0b0010000) {
+            idx = 2; // low: 3.125%
+        }
+        else if (this.counter & 0b0100000) {
+            idx = 1; // lower: 1.5625%
+        }
+        else if (this.counter & 0b1000000) {
+            idx = 0; // lowest: 0.78%
+        }
+        for (let n = idx; n >= 0 && (queue == null || queue.cnt === 0); n--) {
+            queue = this.queues[n];
+        }
+        for (let n = this.queues.length - 1; n > idx && (queue == null || queue.cnt === 0); n--) {
+            queue = this.queues[n];
+        }
+        return queue;
+    }
+    static makeSharedState(concurrency) {
+        if (concurrency != null && (concurrency < 0 || !Number.isInteger(concurrency))) {
+            throw new Error('Invalid concurrency');
+        }
+        const stateBuffer = new SharedArrayBuffer(64);
+        const stateView = new Int32Array(stateBuffer);
+        Atomics.store(stateView, CONCURRENCY_INDEX, concurrency ?? -1);
+        return stateBuffer;
+    }
+    constructor(opts) {
+        if (opts instanceof SharedArrayBuffer) {
+            this.stateView = new Int32Array(opts);
+            this.#concurrency = Atomics.load(this.stateView, CONCURRENCY_INDEX);
+            if (this.#concurrency === -1) {
+                this.#concurrency = Infinity;
+            }
+        }
+        else {
+            this.#concurrency = opts?.concurrency ?? Infinity;
+        }
+    }
+}
+//# sourceMappingURL=queue.js.map

package/lib/queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../src/queue.ts"],"names":[],"mappings":"AAAA,MAAM,iBAAiB,GAAG,CAAC,CAAA;AAE3B,MAAM,OAAO,SAAS;IACpB,GAAG,GAAG,CAAC,CAAA;IACP,GAAG,GAAG,CAAC,CAAA;IACP,GAAG,GAAmB,EAAE,CAAA;CACzB;AAcD,MAAM,UAAU,aAAa,CAAC,CAAkB;IAC9C,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC1B,gBAAgB;IAClB,CAAC;SAAM,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC1B,OAAO,CAAC,CAAC,CAAA;IACX,CAAC;SAAM,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;QACzB,OAAO,CAAC,CAAC,CAAA;IACX,CAAC;SAAM,IAAI,CAAC,KAAK,KAAK,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC,CAAA;IACX,CAAC;SAAM,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC1B,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;QACxB,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC1B,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,CAAC;QACN,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAClB,OAAO,CAAC,CAAC,CAAA;IACX,CAAC;SAAM,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,CAAA;IACV,CAAC;SAAM,CAAC;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAmB,CAAA;IACxC,CAAC;AACH,CAAC;AAED,MAAM,MAAM,GAAG,UAAU,CAAA;AAEzB,MAAM,OAAO,KAAK;IAChB,MAAM,CAAU,MAAM,GAAG,CAAC,CAAC,CAAA;IAC3B,MAAM,CAAU,KAAK,GAAG,CAAC,CAAC,CAAA;IAC1B,MAAM,CAAU,GAAG,GAAG,CAAC,CAAC,CAAA;IACxB,MAAM,CAAU,MAAM,GAAG,CAAC,CAAA;IAC1B,MAAM,CAAU,IAAI,GAAG,CAAC,CAAA;IACxB,MAAM,CAAU,MAAM,GAAG,CAAC,CAAA;IAC1B,MAAM,CAAU,OAAO,GAAG,CAAC,CAAA;IAE3B,YAAY,CAAQ;IACV,SAAS,CAAa;IAEtB,OAAO,GAAG,CAAC,CAAA;IACX,OAAO,GAAG,CAAC,CAAA;IACX,OAAO,GAAG,CAAC,CAAA;IACX,SAAS,GAAG,KAAK,CAAA;IACjB,QAAQ,GAAG,CAAC,CAAA;IAEtB,mEAAmE;IACzD,MAAM,GAAG;QACjB,IAAI,SAAS,EAAE,EAAE,WAAW;QAC5B,IAAI,SAAS,EAAE,EAAE,UAAU;QAC3B,IAAI,SAAS,EAAE,EAAE,QAAQ;QACzB,IAAI,SAAS,EAAE,EAAE,WAAW;QAC5B,IAAI,SAAS,EAAE,EAAE,SAAS;QAC1B,IAAI,SAAS,EAAE,EAAE,WAAW;QAC5B,IAAI,SAAS,EAAE,EAAE,YAAY;KAC9B,CAAA;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAA;IAC1B,CAAC;IAED,IAAI,KAAK;QACP,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;SACnD,CAAA;IACH,CAAC;IAES,YAAY;QACpB,IAAI,KAAK,GAAqB,IAAI,CAAA;QAElC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,CAAA;QAE1C,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;QAEhC,IAAI,IAAI,CAAC,OAAO,GAAG,SAAS,EAAE,CAAC;YAC7B,GAAG,GAAG,CAAC,CAAA,CAAC,eAAe;QACzB,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,GAAG,SAAS,EAAE,CAAC;YACpC,GAAG,GAAG,CAAC,CAAA,CAAC,cAAc;QACxB,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,GAAG,SAAS,EAAE,CAAC;YACpC,GAAG,GAAG,CAAC,CAAA,CAAC,cAAc;QACxB,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,GAAG,SAAS,EAAE,CAAC;YACpC,GAAG,GAAG,CAAC,CAAA,CAAC,gBAAgB;QAC1B,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,GAAG,SAAS,EAAE,CAAC;YACpC,GAAG,GAAG,CAAC,CAAA,CAAC,cAAc;QACxB,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,GAAG,SAAS,EAAE,CAAC;YACpC,GAAG,GAAG,CAAC,CAAA,CAAC,iBAAiB;QAC3B,CAAC;aAAM,IAAI,IAAI,CAAC,OAAO,GAAG,SAAS,EAAE,CAAC;YACpC,GAAG,GAAG,CAAC,CAAA,CAAC,gBAAgB;QAC1B,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpE,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACxB,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACxF,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACxB,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED,MAAM,CAAC,eAAe,CAAC,WAAmB;QACxC,IAAI,WAAW,IAAI,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC;YAC/E,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAA;QACxC,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,iBAAiB,CAAC,EAAE,CAAC,CAAA;QAC7C,MAAM,SAAS,GAAG,IAAI,UAAU,CAAC,WAAW,CAAC,CAAA;QAC7C,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,iBAAiB,EAAE,WAAW,IAAI,CAAC,CAAC,CAAC,CAAA;QAC9D,OAAO,WAAW,CAAA;IACpB,CAAC;IAED,YAAY,IAAkD;QAC5D,IAAI,IAAI,YAAY,iBAAiB,EAAE,CAAC;YACtC,IAAI,CAAC,SAAS,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,CAAA;YACrC,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAA;YACnE,IAAI,IAAI,CAAC,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAA;YAC9B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,YAAY,GAAG,IAAI,EAAE,WAAW,IAAI,QAAQ,CAAA;QACnD,CAAC;IACH,CAAC"}

package/lib/scheduler.d.ts

@@ -0,0 +1,17 @@
+import { Queue, type Priority } from './queue.ts';
+export declare class Scheduler extends Queue {
+    run<T>(fn: () => Promise<T> | T, priority?: Priority): Promise<T>;
+    run<T, U>(fn: (opaque: U) => Promise<T> | T, priority: Priority, opaque: U): Promise<T>;
+    acquire(fn: () => unknown, priority?: Priority): void;
+    acquire<U>(fn: (opaque: U) => unknown, priority: Priority, opaque: U): void;
+    release(): void;
+    get stats(): {
+        deferred: number;
+        running: number;
+        pending: number;
+        queues: {
+            count: number;
+        }[];
+    };
+}
+//# sourceMappingURL=scheduler.d.ts.map

package/lib/scheduler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.d.ts","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAA4B,KAAK,EAAE,KAAK,QAAQ,EAAE,MAAM,YAAY,CAAA;AAI3E,qBAAa,SAAU,SAAQ,KAAK;IAClC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC;IACjE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAwBvF,OAAO,CAAC,EAAE,EAAE,MAAM,OAAO,EAAE,QAAQ,CAAC,EAAE,QAAQ,GAAG,IAAI;IACrD,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,GAAG,IAAI;IAkC3E,OAAO;IA6DP,IAAI,KAAK;;;;;;;MAOR;CACF"}

package/lib/scheduler.js

@@ -0,0 +1,113 @@
+import { FastQueue, parsePriority, Queue } from "./queue.js";
+const RUNNING_INDEX = 0;
+export class Scheduler extends Queue {
+    run(fn, priority = Queue.NORMAL, opaque) {
+        return new Promise((resolve, reject) => {
+            this.acquire(async (o) => {
+                try {
+                    resolve(await fn(o));
+                }
+                catch (err) {
+                    // eslint-disable-next-line @typescript-eslint/prefer-promise-reject-errors
+                    reject(err);
+                }
+                finally {
+                    this.release();
+                }
+            }, priority, opaque);
+        });
+    }
+    acquire(fn, priority = Queue.NORMAL, opaque) {
+        const p = parsePriority(priority);
+        const queue = this.queues[p + 3];
+        if (this.stateView) {
+            // Make sure we are always running at least one local job even if we might globally over subscribe.
+            if (this.running < 1) {
+                Atomics.add(this.stateView, RUNNING_INDEX, 1);
+                this.running += 1;
+                fn(opaque);
+                return;
+            }
+            // We use non atomic access here as an optimization and treat the concurrency limit as a soft limit.
+            if (this.stateView[RUNNING_INDEX] < this.concurrency) {
+                Atomics.add(this.stateView, RUNNING_INDEX, 1);
+                this.running += 1;
+                fn(opaque);
+                return;
+            }
+        }
+        else if ((this.running < 1 && this.concurrency > 0) || this.running < this.concurrency) {
+            this.running += 1;
+            fn(opaque);
+            return;
+        }
+        queue.arr.push(fn, opaque);
+        queue.cnt += 1;
+        this.deferred += 1;
+        this.pending += 1;
+    }
+    release() {
+        let running;
+        if (this.running > 0) {
+            running = this.stateView
+                ? Atomics.sub(this.stateView, RUNNING_INDEX, 1) - 1
+                : this.running - 1;
+            this.running -= 1;
+        }
+        else {
+            // Gracefully handle user error...
+            running = this.stateView ? Atomics.load(this.stateView, RUNNING_INDEX) : this.running;
+        }
+        if (this.pending === 0 || this.releasing) {
+            return;
+        }
+        try {
+            this.releasing = true;
+            while (this.pending > 0 && (this.running === 0 || running < this.concurrency)) {
+                const queue = this.getNextQueue();
+                if (queue == null || queue.cnt === 0) {
+                    throw new Error('Invariant violation: pending > 0 but no tasks in queues');
+                }
+                const fn = queue.arr[queue.idx];
+                queue.arr[queue.idx++] = null;
+                const opaque = queue.arr[queue.idx];
+                queue.arr[queue.idx++] = null;
+                queue.cnt -= 1;
+                if (queue.cnt === 0) {
+                    queue.idx = 0;
+                    queue.arr.length = 0;
+                }
+                else if (queue.idx > 1024) {
+                    queue.arr.splice(0, queue.idx);
+                    queue.idx = 0;
+                }
+                this.pending -= 1;
+                this.running += 1;
+                if (this.stateView) {
+                    Atomics.add(this.stateView, RUNNING_INDEX, 1);
+                }
+                fn(opaque);
+                // Re-read running after fn() in case it synchronously called release()
+                running = this.stateView ? Atomics.load(this.stateView, RUNNING_INDEX) : this.running;
+            }
+        }
+        catch (err) {
+            // Throwing here is undefined behavior...
+            queueMicrotask(() => {
+                throw new Error('Scheduler task error', { cause: err });
+            });
+        }
+        finally {
+            this.releasing = false;
+        }
+    }
+    get stats() {
+        return {
+            deferred: this.deferred,
+            running: this.running,
+            pending: this.pending,
+            queues: this.queues.map((q) => ({ count: q.cnt })),
+        };
+    }
+}
+//# sourceMappingURL=scheduler.js.map

package/lib/scheduler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scheduler.js","sourceRoot":"","sources":["../src/scheduler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,KAAK,EAAiB,MAAM,YAAY,CAAA;AAE3E,MAAM,aAAa,GAAG,CAAC,CAAA;AAEvB,MAAM,OAAO,SAAU,SAAQ,KAAK;IAGlC,GAAG,CACD,EAAkC,EAClC,WAAqB,KAAK,CAAC,MAAM,EACjC,MAAU;QAEV,OAAO,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACxC,IAAI,CAAC,OAAO,CACV,KAAK,EAAE,CAAC,EAAE,EAAE;gBACV,IAAI,CAAC;oBACH,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;gBACtB,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,2EAA2E;oBAC3E,MAAM,CAAC,GAAG,CAAC,CAAA;gBACb,CAAC;wBAAS,CAAC;oBACT,IAAI,CAAC,OAAO,EAAE,CAAA;gBAChB,CAAC;YACH,CAAC,EACD,QAAQ,EACR,MAAM,CACP,CAAA;QACH,CAAC,CAAC,CAAA;IACJ,CAAC;IAID,OAAO,CAAI,EAA2B,EAAE,WAAqB,KAAK,CAAC,MAAM,EAAE,MAAU;QACnF,MAAM,CAAC,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAA;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAEhC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,mGAAmG;YACnG,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;gBACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAA;gBAC7C,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;gBACjB,EAAE,CAAC,MAAM,CAAC,CAAA;gBACV,OAAM;YACR,CAAC;YAED,oGAAoG;YACpG,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAA;gBAC7C,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;gBACjB,EAAE,CAAC,MAAM,CAAC,CAAA;gBACV,OAAM;YACR,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YACzF,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;YACjB,EAAE,CAAC,MAAM,CAAC,CAAA;YACV,OAAM;QACR,CAAC;QAED,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAA;QAC1B,KAAK,CAAC,GAAG,IAAI,CAAC,CAAA;QAEd,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA;QAClB,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;IACnB,CAAC;IAED,OAAO;QACL,IAAI,OAAe,CAAA;QACnB,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;YACrB,OAAO,GAAG,IAAI,CAAC,SAAS;gBACtB,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,GAAG,CAAC;gBACnD,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAA;YACpB,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;QACnB,CAAC;aAAM,CAAC;YACN,kCAAkC;YAClC,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAA;QACvF,CAAC;QAED,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACzC,OAAM;QACR,CAAC;QAED,IAAI,CAAC;YACH,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;YACrB,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC9E,MAAM,KAAK,GAAqB,IAAI,CAAC,YAAY,EAAE,CAAA;gBAEnD,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;oBACrC,MAAM,IAAI,KAAK,CAAC,yDAAyD,CAAC,CAAA;gBAC5E,CAAC;gBAED,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAkC,CAAA;gBAChE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAA;gBAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAA;gBACnC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAA;gBAC7B,KAAK,CAAC,GAAG,IAAI,CAAC,CAAA;gBAEd,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,GAAG,GAAG,CAAC,CAAA;oBACb,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;gBACtB,CAAC;qBAAM,IAAI,KAAK,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC;oBAC5B,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;oBAC9B,KAAK,CAAC,GAAG,GAAG,CAAC,CAAA;gBACf,CAAC;gBAED,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;gBACjB,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;gBAEjB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;oBACnB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAA;gBAC/C,CAAC;gBAED,EAAE,CAAC,MAAM,CAAC,CAAA;gBAEV,uEAAuE;gBACvE,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAA;YACvF,CAAC;QACH,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,yCAAyC;YACzC,cAAc,CAAC,GAAG,EAAE;gBAClB,MAAM,IAAI,KAAK,CAAC,sBAAsB,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;YACzD,CAAC,CAAC,CAAA;QACJ,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,SAAS,GAAG,KAAK,CAAA;QACxB,CAAC;IACH,CAAC;IAED,IAAI,KAAK;QACP,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;SACnD,CAAA;IACH,CAAC;CACF"}

package/lib/throttle.d.ts

@@ -0,0 +1,20 @@
+import { Transform } from 'node:stream';
+import { Queue, type Priority } from './queue.ts';
+export declare class Throttle extends Queue {
+    #private;
+    constructor(opts: SharedArrayBuffer | {
+        bytesPerSecond?: number;
+    });
+    static makeSharedState(bytesPerSecond: number): SharedArrayBuffer;
+    stream(priority?: Priority): Transform;
+    acquire(fn: () => unknown, bytes: number, priority?: Priority): boolean;
+    get stats(): {
+        tokens: number;
+        pending: number;
+        queues: {
+            count: number;
+        }[];
+    };
+    refill(): void;
+}
+//# sourceMappingURL=throttle.d.ts.map

package/lib/throttle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"throttle.d.ts","sourceRoot":"","sources":["../src/throttle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EAA4B,KAAK,EAAE,KAAK,QAAQ,EAAE,MAAM,YAAY,CAAA;AAI3E,qBAAa,QAAS,SAAQ,KAAK;;gBAMrB,IAAI,EAAE,iBAAiB,GAAG;QAAE,cAAc,CAAC,EAAE,MAAM,CAAA;KAAE;IAIjE,MAAM,CAAC,eAAe,CAAC,cAAc,EAAE,MAAM;IAI7C,MAAM,CAAC,QAAQ,GAAE,QAAuB;IAcxC,OAAO,CAAC,EAAE,EAAE,MAAM,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,GAAE,QAAuB,GAAG,OAAO;IA2BrF,IAAI,KAAK;;;;;;MAMR;IAcD,MAAM;CAqDP"}

package/lib/throttle.js

@@ -0,0 +1,107 @@
+import { Transform } from 'node:stream';
+import { FastQueue, parsePriority, Queue } from "./queue.js";
+const TOKENS_INDEX = 2;
+export class Throttle extends Queue {
+    #singleThreadTokens = 0;
+    // Set last refill time to zero will mean that we start with a full bucket
+    #lastRefillTime = 0;
+    #drainRunning = false;
+    constructor(opts) {
+        super(opts instanceof SharedArrayBuffer ? opts : { concurrency: opts?.bytesPerSecond });
+    }
+    static makeSharedState(bytesPerSecond) {
+        return super.makeSharedState(bytesPerSecond);
+    }
+    stream(priority = Queue.NORMAL) {
+        return new Transform({
+            transform: (chunk, _encoding, callback) => {
+                this.acquire(() => {
+                    callback(null, chunk);
+                }, chunk.length, priority);
+            },
+        });
+    }
+    acquire(fn, bytes, priority = Queue.NORMAL) {
+        // There is a possiblity that this check passes for two threads, but should only have passed for one of them.
+        // Given that the concurrency limit is a soft limit, this is not a problem and will just mean that we might briefly exceed the concurrency limit until the next refill.
+        if (this.pending === 0 && this.#tokens >= bytes) {
+            // Nothing in the queue, and enough tokens to run immediately.
+            this.#tokens -= bytes;
+            fn();
+            return true;
+        }
+        const p = parsePriority(priority);
+        const queue = this.queues[p + 3];
+        this.pending += 1;
+        this.deferred += 1;
+        queue.arr.push(fn, bytes);
+        queue.cnt += 1;
+        if (!this.#drainRunning) {
+            this.#drainRunning = true;
+            setImmediate(() => this.#drain());
+        }
+        return false;
+    }
+    get stats() {
+        return {
+            tokens: this.#tokens,
+            pending: this.pending,
+            queues: this.queues.map((q) => ({ count: q.cnt })),
+        };
+    }
+    get #tokens() {
+        return this.stateView ? this.stateView[TOKENS_INDEX] : this.#singleThreadTokens;
+    }
+    set #tokens(value) {
+        if (this.stateView) {
+            Atomics.store(this.stateView, TOKENS_INDEX, value);
+        }
+        else {
+            this.#singleThreadTokens = value;
+        }
+    }
+    refill() {
+        const currentToken = this.#tokens;
+        if (currentToken >= this.concurrency) {
+            // We are already at or above capacity, so just update the last refill time and return.
+            this.#lastRefillTime = performance.now();
+            return;
+        }
+        const now = performance.now();
+        const elapsed = (now - this.#lastRefillTime) / 1000;
+        this.#tokens = Math.min(this.concurrency, currentToken + elapsed * this.concurrency);
+        this.#lastRefillTime = now;
+    }
+    #drain() {
+        while (this.pending > 0) {
+            const queue = this.getNextQueue();
+            if (queue == null || queue.cnt === 0) {
+                break;
+            }
+            const bytes = queue.arr[queue.idx + 1];
+            const currentTokens = this.#tokens;
+            if (currentTokens < bytes) {
+                setTimeout(() => this.#drain(), 10);
+                // return to avoid setting drainRunning to false as we will continue draining after the timeout
+                return;
+            }
+            const fn = queue.arr[queue.idx];
+            queue.arr[queue.idx++] = null;
+            queue.arr[queue.idx++] = null;
+            queue.cnt -= 1;
+            this.#tokens -= bytes;
+            this.pending -= 1;
+            if (queue.cnt === 0) {
+                queue.idx = 0;
+                queue.arr.length = 0;
+            }
+            else if (queue.idx > 1024) {
+                queue.arr.splice(0, queue.idx);
+                queue.idx = 0;
+            }
+            fn();
+        }
+        this.#drainRunning = false;
+    }
+}
+//# sourceMappingURL=throttle.js.map

package/lib/throttle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"throttle.js","sourceRoot":"","sources":["../src/throttle.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AACvC,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,KAAK,EAAiB,MAAM,YAAY,CAAA;AAE3E,MAAM,YAAY,GAAG,CAAC,CAAA;AAEtB,MAAM,OAAO,QAAS,SAAQ,KAAK;IACjC,mBAAmB,GAAG,CAAC,CAAA;IACvB,0EAA0E;IAC1E,eAAe,GAAW,CAAC,CAAA;IAC3B,aAAa,GAAG,KAAK,CAAA;IAErB,YAAY,IAAqD;QAC/D,KAAK,CAAC,IAAI,YAAY,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAA;IACzF,CAAC;IAED,MAAM,CAAC,eAAe,CAAC,cAAsB;QAC3C,OAAO,KAAK,CAAC,eAAe,CAAC,cAAc,CAAC,CAAA;IAC9C,CAAC;IAED,MAAM,CAAC,WAAqB,KAAK,CAAC,MAAM;QACtC,OAAO,IAAI,SAAS,CAAC;YACnB,SAAS,EAAE,CAAC,KAAa,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE;gBAChD,IAAI,CAAC,OAAO,CACV,GAAG,EAAE;oBACH,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;gBACvB,CAAC,EACD,KAAK,CAAC,MAAM,EACZ,QAAQ,CACT,CAAA;YACH,CAAC;SACF,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,CAAC,EAAiB,EAAE,KAAa,EAAE,WAAqB,KAAK,CAAC,MAAM;QACzE,6GAA6G;QAC7G,uKAAuK;QACvK,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,EAAE,CAAC;YAChD,8DAA8D;YAC9D,IAAI,CAAC,OAAO,IAAI,KAAK,CAAA;YACrB,EAAE,EAAE,CAAA;YACJ,OAAO,IAAI,CAAA;QACb,CAAC;QAED,MAAM,CAAC,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAA;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAEhC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;QACjB,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAA;QAElB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;QACzB,KAAK,CAAC,GAAG,IAAI,CAAC,CAAA;QAEd,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YACxB,IAAI,CAAC,aAAa,GAAG,IAAI,CAAA;YACzB,YAAY,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QACnC,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED,IAAI,KAAK;QACP,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,OAAO;YACpB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;SACnD,CAAA;IACH,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAA;IACjF,CAAC;IAED,IAAI,OAAO,CAAC,KAAa;QACvB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,KAAK,CAAC,CAAA;QACpD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,mBAAmB,GAAG,KAAK,CAAA;QAClC,CAAC;IACH,CAAC;IAED,MAAM;QACJ,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAA;QACjC,IAAI,YAAY,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrC,uFAAuF;YACvF,IAAI,CAAC,eAAe,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;YACxC,OAAM;QACR,CAAC;QAED,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,CAAA;QAC7B,MAAM,OAAO,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,IAAI,CAAA;QACnD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,YAAY,GAAG,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,CAAA;QACpF,IAAI,CAAC,eAAe,GAAG,GAAG,CAAA;IAC5B,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAqB,IAAI,CAAC,YAAY,EAAE,CAAA;YAEnD,IAAI,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;gBACrC,MAAK;YACP,CAAC;YAED,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAW,CAAA;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAA;YAElC,IAAI,aAAa,GAAG,KAAK,EAAE,CAAC;gBAC1B,UAAU,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAA;gBAEnC,+FAA+F;gBAC/F,OAAM;YACR,CAAC;YAED,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAkC,CAAA;YAChE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAA;YAC7B,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAA;YAC7B,KAAK,CAAC,GAAG,IAAI,CAAC,CAAA;YAEd,IAAI,CAAC,OAAO,IAAI,KAAK,CAAA;YACrB,IAAI,CAAC,OAAO,IAAI,CAAC,CAAA;YAEjB,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,EAAE,CAAC;gBACpB,KAAK,CAAC,GAAG,GAAG,CAAC,CAAA;gBACb,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAA;YACtB,CAAC;iBAAM,IAAI,KAAK,CAAC,GAAG,GAAG,IAAI,EAAE,CAAC;gBAC5B,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;gBAC9B,KAAK,CAAC,GAAG,GAAG,CAAC,CAAA;YACf,CAAC;YAED,EAAE,EAAE,CAAA;QACN,CAAC;QAED,IAAI,CAAC,aAAa,GAAG,KAAK,CAAA;IAC5B,CAAC;CACF"}

package/package.json

@@ -1,9 +1,12 @@
 {
   "name": "@nxtedition/scheduler",
-  "version": "3.0.12",
+  "version": "3.1.0",
   "type": "module",
   "main": "lib/index.js",
   "types": "lib/index.d.ts",
+  "exports": {
+    ".": "./lib/index.js"
+  },
   "files": [
     "lib",
     "README.md",
@@ -14,7 +17,7 @@
     "access": "public"
   },
   "scripts": {
-    "build": "rimraf lib && tsc && amaroc ./src/index.ts && mv src/index.js lib/",
+    "build": "rimraf lib && tsc",
     "prepublishOnly": "yarn build",
     "typecheck": "tsc --noEmit",
     "test": "yarn build && node --test",
@@ -28,5 +31,5 @@
     "rimraf": "^6.1.3",
     "typescript": "^5.9.3"
   },
-  "gitHead": "5c3858acb895ff6ee82b196487a9e2d9ee46f645"
+  "gitHead": "e9a232c708d1b9fbda3a040be054d79dfb64a26b"
 }