@hikae/jev-algorithms 0.1.0-rc.0

package/dist/index.js

@@ -0,0 +1,13 @@
+export * from "./client.js";
+export * from "./adapters/typesafe.js";
+export * from "./adapters/workers-ai.js";
+export * from "./adapters/memory.js";
+export * from "./algorithms/pairwise.js";
+export * from "./algorithms/search.js";
+export * from "./algorithms/aggregate.js";
+export * from "./algorithms/cluster.js";
+export * from "./algorithms/classify.js";
+export * from "./algorithms/match.js";
+export * from "./lib/chunk.js";
+export * from "./lib/unionFind.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAE5B,cAAc,wBAAwB,CAAC;AACvC,cAAc,0BAA0B,CAAC;AACzC,cAAc,sBAAsB,CAAC;AAErC,cAAc,0BAA0B,CAAC;AACzC,cAAc,wBAAwB,CAAC;AACvC,cAAc,2BAA2B,CAAC;AAC1C,cAAc,yBAAyB,CAAC;AACxC,cAAc,0BAA0B,CAAC;AACzC,cAAc,uBAAuB,CAAC;AAEtC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,oBAAoB,CAAC"}

package/dist/lib/chunk.d.ts

@@ -0,0 +1,3 @@
+/** Split `items` into consecutive groups of at most `size`. */
+export declare function chunk<T>(items: readonly T[], size: number): T[][];
+//# sourceMappingURL=chunk.d.ts.map

package/dist/lib/chunk.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.d.ts","sourceRoot":"","sources":["../../src/lib/chunk.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAC/D,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,CASjE"}

package/dist/lib/chunk.js

@@ -0,0 +1,12 @@
+/** Split `items` into consecutive groups of at most `size`. */
+export function chunk(items, size) {
+    if (!Number.isInteger(size) || size < 1) {
+        throw new Error(`chunk size must be a positive integer, got ${size}`);
+    }
+    const out = [];
+    for (let i = 0; i < items.length; i += size) {
+        out.push(items.slice(i, i + size));
+    }
+    return out;
+}
+//# sourceMappingURL=chunk.js.map

package/dist/lib/chunk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../../src/lib/chunk.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAC/D,MAAM,UAAU,KAAK,CAAI,KAAmB,EAAE,IAAY;IACzD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,KAAK,CAAC,8CAA8C,IAAI,EAAE,CAAC,CAAC;IACvE,CAAC;IACD,MAAM,GAAG,GAAU,EAAE,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC7C,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/lib/unionFind.d.ts

@@ -0,0 +1,12 @@
+/** Disjoint-set forest with path compression and union by size. */
+export declare class UnionFind<T> {
+    #private;
+    constructor(items?: Iterable<T>);
+    add(item: T): void;
+    find(item: T): T;
+    union(a: T, b: T): void;
+    connected(a: T, b: T): boolean;
+    /** Group all items into clusters keyed by their representative. */
+    groups(): T[][];
+}
+//# sourceMappingURL=unionFind.d.ts.map

package/dist/lib/unionFind.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unionFind.d.ts","sourceRoot":"","sources":["../../src/lib/unionFind.ts"],"names":[],"mappings":"AAAA,mEAAmE;AACnE,qBAAa,SAAS,CAAC,CAAC;;gBAIX,KAAK,GAAE,QAAQ,CAAC,CAAC,CAAM;IAInC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI;IAOlB,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC;IAgBhB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI;IAWvB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAO;IAI9B,mEAAmE;IACnE,MAAM,IAAI,CAAC,EAAE,EAAE;CAUf"}

package/dist/lib/unionFind.js

@@ -0,0 +1,58 @@
+/** Disjoint-set forest with path compression and union by size. */
+export class UnionFind {
+    #parent = new Map();
+    #size = new Map();
+    constructor(items = []) {
+        for (const item of items)
+            this.add(item);
+    }
+    add(item) {
+        if (!this.#parent.has(item)) {
+            this.#parent.set(item, item);
+            this.#size.set(item, 1);
+        }
+    }
+    find(item) {
+        this.add(item);
+        let root = item;
+        while (this.#parent.get(root) !== root) {
+            root = this.#parent.get(root);
+        }
+        // Path compression.
+        let cursor = item;
+        while (cursor !== root) {
+            const next = this.#parent.get(cursor);
+            this.#parent.set(cursor, root);
+            cursor = next;
+        }
+        return root;
+    }
+    union(a, b) {
+        const rootA = this.find(a);
+        const rootB = this.find(b);
+        if (rootA === rootB)
+            return;
+        const sizeA = this.#size.get(rootA);
+        const sizeB = this.#size.get(rootB);
+        const [small, large] = sizeA < sizeB ? [rootA, rootB] : [rootB, rootA];
+        this.#parent.set(small, large);
+        this.#size.set(large, sizeA + sizeB);
+    }
+    connected(a, b) {
+        return this.find(a) === this.find(b);
+    }
+    /** Group all items into clusters keyed by their representative. */
+    groups() {
+        const out = new Map();
+        for (const item of this.#parent.keys()) {
+            const root = this.find(item);
+            const group = out.get(root);
+            if (group)
+                group.push(item);
+            else
+                out.set(root, [item]);
+        }
+        return [...out.values()];
+    }
+}
+//# sourceMappingURL=unionFind.js.map

package/dist/lib/unionFind.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unionFind.js","sourceRoot":"","sources":["../../src/lib/unionFind.ts"],"names":[],"mappings":"AAAA,mEAAmE;AACnE,MAAM,OAAO,SAAS;IACrB,OAAO,GAAG,IAAI,GAAG,EAAQ,CAAC;IAC1B,KAAK,GAAG,IAAI,GAAG,EAAa,CAAC;IAE7B,YAAY,QAAqB,EAAE;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK;YAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,GAAG,CAAC,IAAO;QACV,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;IACF,CAAC;IAED,IAAI,CAAC,IAAO;QACX,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACf,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACxC,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAM,CAAC;QACpC,CAAC;QACD,oBAAoB;QACpB,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,OAAO,MAAM,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAM,CAAC;YAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC/B,MAAM,GAAG,IAAI,CAAC;QACf,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,KAAK,CAAC,CAAI,EAAE,CAAI;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,KAAK,KAAK,KAAK;YAAE,OAAO;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAW,CAAC;QAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAW,CAAC;QAC9C,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACvE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,SAAS,CAAC,CAAI,EAAE,CAAI;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,mEAAmE;IACnE,MAAM;QACL,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;gBACvB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1B,CAAC;CACD"}

package/package.json

@@ -0,0 +1,53 @@
+{
+	"name": "@hikae/jev-algorithms",
+	"version": "0.1.0-rc.0",
+	"description": "Runtime-agnostic algorithms built on TypeSafe's Jev structured-evaluation model.",
+	"keywords": [
+		"jev",
+		"typesafe",
+		"evaluation",
+		"algorithms",
+		"sorting",
+		"ranking",
+		"clustering",
+		"matching"
+	],
+	"license": "MIT",
+	"repository": {
+		"type": "git",
+		"url": "git+https://github.com/HikaruEgashira/jev-algorithms.git"
+	},
+	"publishConfig": {
+		"access": "public",
+		"registry": "https://registry.npmjs.org"
+	},
+	"type": "module",
+	"sideEffects": false,
+	"engines": {
+		"node": ">=20"
+	},
+	"exports": {
+		".": {
+			"types": "./dist/index.d.ts",
+			"import": "./dist/index.js"
+		}
+	},
+	"types": "./dist/index.d.ts",
+	"files": [
+		"dist",
+		"docs/animations/*.gif"
+	],
+	"scripts": {
+		"build": "tsc -p tsconfig.build.json",
+		"typecheck": "tsc --noEmit",
+		"test": "npm run build && node --test",
+		"mutation": "npm run build && stryker run",
+		"animations": "npm run build && node scripts/render-animations.mjs",
+		"prepublishOnly": "npm test"
+	},
+	"devDependencies": {
+		"@stryker-mutator/core": "^10.0.0",
+		"typescript": "^5.6.0"
+	},
+	"packageManager": "pnpm@11.26.0"
+}