@markwharton/eh-payroll 3.0.1 → 3.2.0

package/dist/rate-limiter.d.ts

@@ -1,33 +0,0 @@
-/**
- * Sliding window rate limiter
- *
- * Enforces a maximum number of requests per time window.
- * Callers that exceed the limit are queued and released when capacity opens.
- *
- * Uses a sliding window approach: tracks timestamps of recent requests and
- * checks that no more than `maxRequests` fall within any `windowMs` period.
- *
- * Thread-safe in single-threaded JS — no races between concurrent acquire() calls.
- */
-export declare class RateLimiter {
-    private maxRequests;
-    private windowMs;
-    private timestamps;
-    private queue;
-    private timer;
-    /**
-     * @param maxRequests - Maximum requests allowed per window
-     * @param windowMs - Window size in milliseconds (default: 1000)
-     */
-    constructor(maxRequests: number, windowMs?: number);
-    /**
-     * Acquire a rate limit token.
-     *
-     * Resolves immediately if under the limit, otherwise queues until capacity opens.
-     */
-    acquire(): Promise<void>;
-    /** Remove timestamps outside the current window */
-    private pruneTimestamps;
-    /** Schedule a flush to release queued callers when the oldest timestamp expires */
-    private scheduleFlush;
-}

package/dist/rate-limiter.js

@@ -1,63 +0,0 @@
-/**
- * Sliding window rate limiter
- *
- * Enforces a maximum number of requests per time window.
- * Callers that exceed the limit are queued and released when capacity opens.
- *
- * Uses a sliding window approach: tracks timestamps of recent requests and
- * checks that no more than `maxRequests` fall within any `windowMs` period.
- *
- * Thread-safe in single-threaded JS — no races between concurrent acquire() calls.
- */
-export class RateLimiter {
-    /**
-     * @param maxRequests - Maximum requests allowed per window
-     * @param windowMs - Window size in milliseconds (default: 1000)
-     */
-    constructor(maxRequests, windowMs = 1000) {
-        this.maxRequests = maxRequests;
-        this.windowMs = windowMs;
-        this.timestamps = [];
-        this.queue = [];
-        this.timer = null;
-    }
-    /**
-     * Acquire a rate limit token.
-     *
-     * Resolves immediately if under the limit, otherwise queues until capacity opens.
-     */
-    acquire() {
-        this.pruneTimestamps();
-        if (this.timestamps.length < this.maxRequests) {
-            this.timestamps.push(Date.now());
-            return Promise.resolve();
-        }
-        return new Promise(resolve => {
-            this.queue.push({ resolve });
-            this.scheduleFlush();
-        });
-    }
-    /** Remove timestamps outside the current window */
-    pruneTimestamps() {
-        const cutoff = Date.now() - this.windowMs;
-        this.timestamps = this.timestamps.filter(t => t > cutoff);
-    }
-    /** Schedule a flush to release queued callers when the oldest timestamp expires */
-    scheduleFlush() {
-        if (this.timer || this.queue.length === 0 || this.timestamps.length === 0)
-            return;
-        const oldest = this.timestamps[0];
-        const delay = Math.max(0, this.windowMs - (Date.now() - oldest) + 1);
-        this.timer = setTimeout(() => {
-            this.timer = null;
-            this.pruneTimestamps();
-            while (this.queue.length > 0 && this.timestamps.length < this.maxRequests) {
-                this.timestamps.push(Date.now());
-                this.queue.shift().resolve();
-            }
-            if (this.queue.length > 0) {
-                this.scheduleFlush();
-            }
-        }, delay);
-    }
-}