@adaptive-concurrency-toolkit/core 1.0.0

package/dist/util/ema.js

@@ -0,0 +1,53 @@
+/**
+ * Exponential moving average with lazy initialization. The first value seeds
+ * the average so the EMA does not bias toward zero during warm-up.
+ *
+ * Update formula (after init):
+ *   v ← α·x + (1 − α)·v
+ *
+ * Hot path is one multiply + one fused-multiply-add equivalent; no allocations.
+ */
+export class Ema {
+    alpha;
+    _value = 0;
+    _initialized = false;
+    /**
+     * @param alpha smoothing factor in (0, 1]. Higher α reacts faster, lower α
+     * smooths more. Equivalent time constant ≈ 1/α samples.
+     */
+    constructor(alpha) {
+        if (!(alpha > 0 && alpha <= 1)) {
+            throw new RangeError(`alpha must be in (0, 1], got ${alpha}`);
+        }
+        this.alpha = alpha;
+    }
+    /**
+     * Construct an EMA whose smoothing factor approximates `n` samples of memory.
+     */
+    static withWindow(n) {
+        if (!(n >= 1))
+            throw new RangeError(`n must be >= 1, got ${n}`);
+        return new Ema(2 / (n + 1));
+    }
+    update(x) {
+        if (this._initialized) {
+            this._value = this.alpha * x + (1 - this.alpha) * this._value;
+        }
+        else {
+            this._value = x;
+            this._initialized = true;
+        }
+        return this._value;
+    }
+    get value() {
+        return this._value;
+    }
+    get initialized() {
+        return this._initialized;
+    }
+    reset() {
+        this._value = 0;
+        this._initialized = false;
+    }
+}
+//# sourceMappingURL=ema.js.map

package/dist/util/ema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ema.js","sourceRoot":"","sources":["../../src/util/ema.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,OAAO,GAAG;IACL,KAAK,CAAS;IACf,MAAM,GAAG,CAAC,CAAC;IACX,YAAY,GAAG,KAAK,CAAC;IAE7B;;;OAGG;IACH,YAAY,KAAa;QACvB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;YAC/B,MAAM,IAAI,UAAU,CAAC,gCAAgC,KAAK,EAAE,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,CAAS;QACzB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QAChE,OAAO,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,CAAS;QACd,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QAChE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QAC3B,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IAC5B,CAAC;CACF"}

package/dist/util/listeners.d.ts

@@ -0,0 +1,12 @@
+import type { LimitChangeListener, Unsubscribe } from '../types.ts';
+/**
+ * Tiny multi-listener registry. Optimized for the common case of zero or one
+ * subscriber — avoids allocating an array in that case.
+ */
+export declare class ChangeListeners {
+    private single;
+    private many;
+    add(listener: LimitChangeListener): Unsubscribe;
+    emit(newLimit: number): void;
+    private remove;
+}

package/dist/util/listeners.js

@@ -0,0 +1,49 @@
+/**
+ * Tiny multi-listener registry. Optimized for the common case of zero or one
+ * subscriber — avoids allocating an array in that case.
+ */
+export class ChangeListeners {
+    single;
+    many;
+    add(listener) {
+        if (this.many !== undefined) {
+            this.many.push(listener);
+        }
+        else if (this.single === undefined) {
+            this.single = listener;
+        }
+        else {
+            this.many = [this.single, listener];
+            this.single = undefined;
+        }
+        return () => this.remove(listener);
+    }
+    emit(newLimit) {
+        if (this.single !== undefined) {
+            this.single(newLimit);
+            return;
+        }
+        const list = this.many;
+        if (list !== undefined) {
+            for (let i = 0; i < list.length; i++)
+                list[i](newLimit);
+        }
+    }
+    remove(listener) {
+        if (this.single === listener) {
+            this.single = undefined;
+            return;
+        }
+        const list = this.many;
+        if (list === undefined)
+            return;
+        const idx = list.indexOf(listener);
+        if (idx >= 0)
+            list.splice(idx, 1);
+        if (list.length === 1) {
+            this.single = list[0];
+            this.many = undefined;
+        }
+    }
+}
+//# sourceMappingURL=listeners.js.map

package/dist/util/listeners.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"listeners.js","sourceRoot":"","sources":["../../src/util/listeners.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,OAAO,eAAe;IAClB,MAAM,CAAkC;IACxC,IAAI,CAAoC;IAEhD,GAAG,CAAC,QAA6B;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACrC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QAC1B,CAAC;QACD,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACrC,CAAC;IAED,IAAI,CAAC,QAAgB;QACnB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtB,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,IAAI,CAAC,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,QAA6B;QAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YACxB,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,GAAG,IAAI,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACxB,CAAC;IACH,CAAC;CACF"}

package/dist/util/math.d.ts

@@ -0,0 +1 @@
+export declare function clamp(x: number, lo: number, hi: number): number;

package/dist/util/math.js

@@ -0,0 +1,4 @@
+export function clamp(x, lo, hi) {
+    return x < lo ? lo : x > hi ? hi : x;
+}
+//# sourceMappingURL=math.js.map

package/dist/util/math.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.js","sourceRoot":"","sources":["../../src/util/math.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,KAAK,CAAC,CAAS,EAAE,EAAU,EAAE,EAAU;IACrD,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC"}

package/package.json

@@ -0,0 +1,54 @@
+{
+  "name": "@adaptive-concurrency-toolkit/core",
+  "version": "1.0.0",
+  "description": "Core adaptive concurrency algorithms (AIMD, Vegas, Gradient2) inspired by Netflix concurrency-limits",
+  "license": "MIT",
+  "files": [
+    "dist",
+    "!dist/**/*.tsbuildinfo",
+    "!**/*.test.*"
+  ],
+  "type": "module",
+  "sideEffects": false,
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./dist/index.d.ts",
+        "default": "./dist/index.js"
+      }
+    },
+    "./limit": {
+      "import": {
+        "types": "./dist/limit/index.d.ts",
+        "default": "./dist/limit/index.js"
+      }
+    },
+    "./limiter": {
+      "import": {
+        "types": "./dist/limiter/index.d.ts",
+        "default": "./dist/limiter/index.js"
+      }
+    },
+    "./package.json": "./package.json"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "devDependencies": {
+    "@types/node": "^25.9.0",
+    "@vitest/coverage-v8": "^4.1.6",
+    "rimraf": "^6.0.1",
+    "typescript": "^6.0.3",
+    "vitest": "^4.1.6"
+  },
+  "engines": {
+    "node": ">=20"
+  },
+  "scripts": {
+    "build": "tsc -b tsconfig.build.json",
+    "typecheck": "tsc -b tsconfig.json",
+    "test": "vitest run --coverage",
+    "test:watch": "vitest",
+    "clean": "rimraf dist .turbo *.tsbuildinfo"
+  }
+}