@hikae/jev-algorithms 0.1.0-rc.0

package/dist/algorithms/cluster.js

@@ -0,0 +1,87 @@
+import { noul } from "../client.js";
+import { UnionFind } from "../lib/unionFind.js";
+/** Total comparisons allowed before the pair set is sampled. */
+export const DEFAULT_MAX_COMPARISONS = 2000;
+/** Pairs per Jev request. */
+export const DEFAULT_MAX_CLUSTER_PAIRS_PER_REQUEST = 40;
+export function createRelationComparator(client, items, options) {
+    const { relation, stateOf, maxPairsPerRequest = DEFAULT_MAX_CLUSTER_PAIRS_PER_REQUEST, } = options;
+    return async (pairs) => {
+        const same = new Array(pairs.length).fill(0);
+        for (let start = 0; start < pairs.length; start += maxPairsPerRequest) {
+            const part = pairs.slice(start, start + maxPairsPerRequest);
+            const localIndex = new Map();
+            const candidates = [];
+            const localize = (i) => {
+                let local = localIndex.get(i);
+                if (local === undefined) {
+                    local = candidates.length;
+                    localIndex.set(i, local);
+                    candidates.push(stateOf(items[i]));
+                }
+                return local;
+            };
+            const localPairs = part.map(([a, b]) => [localize(a), localize(b)]);
+            const questions = {};
+            localPairs.forEach(([a, b], k) => {
+                questions[`p${k}`] = noul(`Do \`candidates[${a}]\` and \`candidates[${b}]\` refer to the same ${relation}?`, {
+                    true: `they are the same ${relation}`,
+                    false: `they are different ${relation}s`,
+                });
+            });
+            const answers = await client.evaluate({
+                state: { candidates, pairs: localPairs },
+                questions,
+            });
+            localPairs.forEach((_, k) => {
+                const answer = answers[`p${k}`];
+                const probability = answer && "noul" in answer ? answer.noul : undefined;
+                if (typeof probability !== "number" || !Number.isFinite(probability)) {
+                    throw new Error("cluster: Jev returned no answer for a pair");
+                }
+                same[start + k] = probability;
+            });
+        }
+        return same;
+    };
+}
+/** Union-find clustering over an injected equivalence comparator. */
+export async function clusterWith(items, compare, options = {}) {
+    const { threshold = 0.5, maxComparisons = DEFAULT_MAX_COMPARISONS, random = Math.random, } = options;
+    const unionFind = new UnionFind(items.map((_, i) => i));
+    let pairs = [];
+    for (let i = 0; i < items.length; i++) {
+        for (let j = i + 1; j < items.length; j++) {
+            pairs.push([i, j]);
+        }
+    }
+    if (pairs.length > maxComparisons) {
+        // ponytail: sampled instead of exhaustive above the cap. Raise the cap or
+        // block candidates before clustering when recall matters.
+        pairs = shuffle(pairs, random).slice(0, maxComparisons);
+    }
+    const probabilities = await compare(pairs);
+    pairs.forEach(([i, j], k) => {
+        if ((probabilities[k] ?? 0) >= threshold)
+            unionFind.union(i, j);
+    });
+    return unionFind.groups().map((group) => group.map((i) => items[i]));
+}
+/** Cluster items by a Jev equivalence question, one request per 40 pairs. */
+export async function clusterByRelation(client, items, options) {
+    const { threshold, maxComparisons, random } = options;
+    return clusterWith(items, createRelationComparator(client, items, options), {
+        threshold,
+        maxComparisons,
+        random,
+    });
+}
+function shuffle(items, random) {
+    const out = [...items];
+    for (let i = out.length - 1; i > 0; i--) {
+        const j = Math.floor(random() * (i + 1));
+        [out[i], out[j]] = [out[j], out[i]];
+    }
+    return out;
+}
+//# sourceMappingURL=cluster.js.map

package/dist/algorithms/cluster.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cluster.js","sourceRoot":"","sources":["../../src/algorithms/cluster.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAoD,MAAM,cAAc,CAAC;AACtF,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAEhD,gEAAgE;AAChE,MAAM,CAAC,MAAM,uBAAuB,GAAG,IAAI,CAAC;AAC5C,6BAA6B;AAC7B,MAAM,CAAC,MAAM,qCAAqC,GAAG,EAAE,CAAC;AAqBxD,MAAM,UAAU,wBAAwB,CACvC,MAAiB,EACjB,KAAmB,EACnB,OAA+E;IAE/E,MAAM,EACL,QAAQ,EACR,OAAO,EACP,kBAAkB,GAAG,qCAAqC,GAC1D,GAAG,OAAO,CAAC;IAEZ,OAAO,KAAK,EAAE,KAAK,EAAE,EAAE;QACtB,MAAM,IAAI,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEvD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,kBAAkB,EAAE,CAAC;YACvE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,kBAAkB,CAAC,CAAC;YAE5D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC7C,MAAM,UAAU,GAAe,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;gBAC9B,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACzB,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC;oBAC1B,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACzB,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,CAAC;gBACD,OAAO,KAAK,CAAC;YACd,CAAC,CAAC;YACF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAC1B,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAqB,CAC1D,CAAC;YAEF,MAAM,SAAS,GAAiB,EAAE,CAAC;YACnC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CACxB,mBAAmB,CAAC,wBAAwB,CAAC,yBAAyB,QAAQ,GAAG,EACjF;oBACC,IAAI,EAAE,qBAAqB,QAAQ,EAAE;oBACrC,KAAK,EAAE,sBAAsB,QAAQ,GAAG;iBACxC,CACD,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,QAAQ,CAAC;gBACrC,KAAK,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE;gBACxC,SAAS;aACT,CAAC,CAAC;YAEH,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAChC,MAAM,WAAW,GAAG,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;gBACzE,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;oBACtE,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBAC/D,CAAC;gBACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC;YAC/B,CAAC,CAAC,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED,qEAAqE;AACrE,MAAM,CAAC,KAAK,UAAU,WAAW,CAChC,KAAmB,EACnB,OAA8B,EAC9B,UAII,EAAE;IAEN,MAAM,EACL,SAAS,GAAG,GAAG,EACf,cAAc,GAAG,uBAAuB,EACxC,MAAM,GAAG,IAAI,CAAC,MAAM,GACpB,GAAG,OAAO,CAAC;IAEZ,MAAM,SAAS,GAAG,IAAI,SAAS,CAAS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhE,IAAI,KAAK,GAA4B,EAAE,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;IACF,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,GAAG,cAAc,EAAE,CAAC;QACnC,0EAA0E;QAC1E,0DAA0D;QAC1D,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IACzD,CAAC;IAED,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC;IAC3C,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC3B,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,SAAS;YAAE,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,OAAO,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtE,CAAC;AAED,6EAA6E;AAC7E,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACtC,MAAiB,EACjB,KAAmB,EACnB,OAA0B;IAE1B,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IACtD,OAAO,WAAW,CAAC,KAAK,EAAE,wBAAwB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE;QAC3E,SAAS;QACT,cAAc;QACd,MAAM;KACN,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,OAAO,CAAI,KAAmB,EAAE,MAAoB;IAC5D,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/algorithms/match.d.ts

@@ -0,0 +1,16 @@
+import type { JevClient, JevState } from "../client.js";
+/** Proposer-optimal stable matching (Gale-Shapley). */
+export declare function stableMatching(proposers: readonly string[], receivers: readonly string[], proposerPrefs: Record<string, readonly string[]>, receiverPrefs: Record<string, readonly string[]>): Array<[string, string]>;
+export interface BuildPreferencesOptions<C, D> {
+    /** Ranking goal woven into the question, e.g. "for this support ticket". */
+    task: string;
+    /** Build the Jev state for one chooser and one candidate. */
+    stateOf: (chooser: C, candidate: D) => JevState;
+    idOfChooser: (chooser: C) => string;
+    idOfCandidate: (candidate: D) => string;
+    maxPairsPerRequest?: number;
+    random?: () => number;
+}
+/** Rank every candidate for every chooser; one pairwise sort per chooser. */
+export declare function buildPreferences<C, D>(client: JevClient, choosers: readonly C[], candidates: readonly D[], options: BuildPreferencesOptions<C, D>): Promise<Record<string, string[]>>;
+//# sourceMappingURL=match.d.ts.map

package/dist/algorithms/match.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"match.d.ts","sourceRoot":"","sources":["../../src/algorithms/match.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAOxD,uDAAuD;AACvD,wBAAgB,cAAc,CAC7B,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,EAChD,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,GAC9C,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CA+CzB;AAED,MAAM,WAAW,uBAAuB,CAAC,CAAC,EAAE,CAAC;IAC5C,4EAA4E;IAC5E,IAAI,EAAE,MAAM,CAAC;IACb,6DAA6D;IAC7D,OAAO,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,KAAK,QAAQ,CAAC;IAChD,WAAW,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,MAAM,CAAC;IACpC,aAAa,EAAE,CAAC,SAAS,EAAE,CAAC,KAAK,MAAM,CAAC;IACxC,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC;CACtB;AAED,6EAA6E;AAC7E,wBAAsB,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAC1C,MAAM,EAAE,SAAS,EACjB,QAAQ,EAAE,SAAS,CAAC,EAAE,EACtB,UAAU,EAAE,SAAS,CAAC,EAAE,EACxB,OAAO,EAAE,uBAAuB,CAAC,CAAC,EAAE,CAAC,CAAC,GACpC,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAyBnC"}

package/dist/algorithms/match.js

@@ -0,0 +1,63 @@
+import { createPairComparator, sortByPairwiseWith, } from "./pairwise.js";
+/** Proposer-optimal stable matching (Gale-Shapley). */
+export function stableMatching(proposers, receivers, proposerPrefs, receiverPrefs) {
+    // Rank of each proposer in each receiver's list, for O(1) comparisons.
+    const receiverRank = new Map();
+    for (const receiver of receivers) {
+        const ranks = new Map();
+        (receiverPrefs[receiver] ?? []).forEach((proposer, i) => ranks.set(proposer, i));
+        receiverRank.set(receiver, ranks);
+    }
+    const free = [...proposers];
+    const nextChoice = new Map();
+    const heldBy = new Map(); // receiver -> proposer
+    while (free.length > 0) {
+        const proposer = free.shift();
+        const prefs = proposerPrefs[proposer] ?? [];
+        let index = nextChoice.get(proposer) ?? 0;
+        if (index >= prefs.length)
+            continue; // proposer exhausted its list
+        const receiver = prefs[index];
+        nextChoice.set(proposer, index + 1);
+        // Skip partners that are not valid receivers, but keep the proposer
+        // free for its next choice instead of dropping it.
+        if (!receivers.includes(receiver)) {
+            free.push(proposer);
+            continue;
+        }
+        const current = heldBy.get(receiver);
+        if (current === undefined) {
+            heldBy.set(receiver, proposer);
+            continue;
+        }
+        const ranks = receiverRank.get(receiver);
+        const currentRank = ranks.get(current) ?? Number.POSITIVE_INFINITY;
+        const challengerRank = ranks.get(proposer) ?? Number.POSITIVE_INFINITY;
+        if (challengerRank < currentRank) {
+            heldBy.set(receiver, proposer);
+            free.push(current);
+        }
+        else {
+            free.push(proposer);
+        }
+    }
+    return [...heldBy.entries()].map(([receiver, proposer]) => [proposer, receiver]);
+}
+/** Rank every candidate for every chooser; one pairwise sort per chooser. */
+export async function buildPreferences(client, choosers, candidates, options) {
+    const { task, stateOf, idOfChooser, idOfCandidate, maxPairsPerRequest, random, } = options;
+    const runtime = { random };
+    const prefs = {};
+    for (const chooser of choosers) {
+        const compare = createPairComparator(client, candidates, {
+            task,
+            stateOf: (candidate) => stateOf(chooser, candidate),
+            maxPairsPerRequest,
+            random,
+        });
+        const ordered = await sortByPairwiseWith(candidates, compare, runtime);
+        prefs[idOfChooser(chooser)] = ordered.map(idOfCandidate);
+    }
+    return prefs;
+}
+//# sourceMappingURL=match.js.map

package/dist/algorithms/match.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"match.js","sourceRoot":"","sources":["../../src/algorithms/match.ts"],"names":[],"mappings":"AACA,OAAO,EACN,oBAAoB,EACpB,kBAAkB,GAElB,MAAM,eAAe,CAAC;AAEvB,uDAAuD;AACvD,MAAM,UAAU,cAAc,CAC7B,SAA4B,EAC5B,SAA4B,EAC5B,aAAgD,EAChD,aAAgD;IAEhD,uEAAuE;IACvE,MAAM,YAAY,GAAG,IAAI,GAAG,EAA+B,CAAC;IAC5D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QAClC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QACjF,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IAC5B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,uBAAuB;IAEjE,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAY,CAAC;QACxC,MAAM,KAAK,GAAG,aAAa,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAC5C,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,KAAK,IAAI,KAAK,CAAC,MAAM;YAAE,SAAS,CAAC,8BAA8B;QAEnE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAEpC,oEAAoE;QACpE,mDAAmD;QACnD,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpB,SAAS;QACV,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC/B,SAAS;QACV,CAAC;QAED,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAwB,CAAC;QAChE,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC;QACnE,MAAM,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC;QACvE,IAAI,cAAc,GAAG,WAAW,EAAE,CAAC;YAClC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrB,CAAC;IACF,CAAC;IAED,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;AAClF,CAAC;AAaD,6EAA6E;AAC7E,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACrC,MAAiB,EACjB,QAAsB,EACtB,UAAwB,EACxB,OAAsC;IAEtC,MAAM,EACL,IAAI,EACJ,OAAO,EACP,WAAW,EACX,aAAa,EACb,kBAAkB,EAClB,MAAM,GACN,GAAG,OAAO,CAAC;IAEZ,MAAM,OAAO,GAAuB,EAAE,MAAM,EAAE,CAAC;IAC/C,MAAM,KAAK,GAA6B,EAAE,CAAC;IAE3C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAChC,MAAM,OAAO,GAAG,oBAAoB,CAAC,MAAM,EAAE,UAAU,EAAE;YACxD,IAAI;YACJ,OAAO,EAAE,CAAC,SAAS,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC;YACnD,kBAAkB;YAClB,MAAM;SACN,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,kBAAkB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACvE,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAC1D,CAAC;IAED,OAAO,KAAK,CAAC;AACd,CAAC"}

package/dist/algorithms/pairwise.d.ts

@@ -0,0 +1,45 @@
+import { type JevClient, type JevState } from "../client.js";
+/** Pairs per Jev request. Bounds the prompt and the answer count. */
+export declare const DEFAULT_MAX_PAIRS_PER_REQUEST = 40;
+/** Hard cap on sort/selection rounds before falling back to the current order. */
+export declare const DEFAULT_MAX_ROUNDS = 40;
+export interface PairwiseOptions<T> {
+    /** Ranking goal woven into the question, e.g. "for replying first". */
+    task: string;
+    /** Map an item to the Jev state Jev compares. */
+    stateOf: (item: T) => JevState;
+    /** Pairs per request. Default {@link DEFAULT_MAX_PAIRS_PER_REQUEST}. */
+    maxPairsPerRequest?: number;
+    /** Injectable RNG for pivot choice. Default `Math.random`. */
+    random?: () => number;
+    /** Round cap. Default {@link DEFAULT_MAX_ROUNDS}. */
+    maxRounds?: number;
+}
+/** Answers one batch of pairs: true means `pairs[i][0]` outranks `pairs[i][1]`. */
+export type PairComparator = (pairs: Array<[number, number]>) => Promise<boolean[]>;
+/** Comparator asking Jev which of two items ranks higher, batched per request. */
+export declare function createPairComparator<T>(client: JevClient, items: readonly T[], options: PairwiseOptions<T>): PairComparator;
+/** Randomized quicksort, one recursion level per `compare` call. */
+export declare function sortIndicesByPairwise(indices: readonly number[], compare: PairComparator, options?: {
+    random?: () => number;
+    maxRounds?: number;
+}): Promise<number[]>;
+export interface SortRuntimeOptions {
+    random?: () => number;
+    maxRounds?: number;
+}
+/** Sort items highest-first using an injected comparator. */
+export declare function sortByPairwiseWith<T>(items: readonly T[], compare: PairComparator, options?: SortRuntimeOptions): Promise<T[]>;
+/** Sort items highest-first using Jev as the pairwise oracle. */
+export declare function sortByPairwise<T>(client: JevClient, items: readonly T[], options: PairwiseOptions<T>): Promise<T[]>;
+/**
+ * Pick the top-k indices with quickselect: only the pivot side that can still
+ * contain the k-th item is explored, so this beats a full sort on comparisons.
+ * Returns the k winners (unordered).
+ */
+export declare function selectTopKIndices(indices: readonly number[], k: number, compare: PairComparator, options?: SortRuntimeOptions): Promise<number[]>;
+/** Pick the top-k items, ordered highest-first, using an injected comparator. */
+export declare function selectTopKWith<T>(items: readonly T[], k: number, compare: PairComparator, options?: SortRuntimeOptions): Promise<T[]>;
+/** Pick the top-k items, ordered highest-first, using Jev as the oracle. */
+export declare function selectTopK<T>(client: JevClient, items: readonly T[], k: number, options: PairwiseOptions<T>): Promise<T[]>;
+//# sourceMappingURL=pairwise.d.ts.map

package/dist/algorithms/pairwise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pairwise.d.ts","sourceRoot":"","sources":["../../src/algorithms/pairwise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAQ,KAAK,SAAS,EAAqB,KAAK,QAAQ,EAAE,MAAM,cAAc,CAAC;AAGtF,qEAAqE;AACrE,eAAO,MAAM,6BAA6B,KAAK,CAAC;AAChD,kFAAkF;AAClF,eAAO,MAAM,kBAAkB,KAAK,CAAC;AAErC,MAAM,WAAW,eAAe,CAAC,CAAC;IACjC,uEAAuE;IACvE,IAAI,EAAE,MAAM,CAAC;IACb,iDAAiD;IACjD,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,QAAQ,CAAC;IAC/B,wEAAwE;IACxE,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,8DAA8D;IAC9D,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC;IACtB,qDAAqD;IACrD,SAAS,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,mFAAmF;AACnF,MAAM,MAAM,cAAc,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,KAAK,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC;AAEpF,kFAAkF;AAClF,wBAAgB,oBAAoB,CAAC,CAAC,EACrC,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,GACzB,cAAc,CA0DhB;AAUD,oEAAoE;AACpE,wBAAsB,qBAAqB,CAC1C,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,OAAO,EAAE,cAAc,EACvB,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GACzD,OAAO,CAAC,MAAM,EAAE,CAAC,CA8CnB;AASD,MAAM,WAAW,kBAAkB;IAClC,MAAM,CAAC,EAAE,MAAM,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,6DAA6D;AAC7D,wBAAsB,kBAAkB,CAAC,CAAC,EACzC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,OAAO,EAAE,cAAc,EACvB,OAAO,GAAE,kBAAuB,GAC9B,OAAO,CAAC,CAAC,EAAE,CAAC,CAOd;AAED,iEAAiE;AACjE,wBAAsB,cAAc,CAAC,CAAC,EACrC,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,GACzB,OAAO,CAAC,CAAC,EAAE,CAAC,CAEd;AAED;;;;GAIG;AACH,wBAAsB,iBAAiB,CACtC,OAAO,EAAE,SAAS,MAAM,EAAE,EAC1B,CAAC,EAAE,MAAM,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,GAAE,kBAAuB,GAC9B,OAAO,CAAC,MAAM,EAAE,CAAC,CAuCnB;AAED,iFAAiF;AACjF,wBAAsB,cAAc,CAAC,CAAC,EACrC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,CAAC,EAAE,MAAM,EACT,OAAO,EAAE,cAAc,EACvB,OAAO,GAAE,kBAAuB,GAC9B,OAAO,CAAC,CAAC,EAAE,CAAC,CASd;AAED,4EAA4E;AAC5E,wBAAsB,UAAU,CAAC,CAAC,EACjC,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,CAAC,EAAE,MAAM,EACT,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,GACzB,OAAO,CAAC,CAAC,EAAE,CAAC,CAEd"}

package/dist/algorithms/pairwise.js

@@ -0,0 +1,165 @@
+import { noul } from "../client.js";
+/** Pairs per Jev request. Bounds the prompt and the answer count. */
+export const DEFAULT_MAX_PAIRS_PER_REQUEST = 40;
+/** Hard cap on sort/selection rounds before falling back to the current order. */
+export const DEFAULT_MAX_ROUNDS = 40;
+/** Comparator asking Jev which of two items ranks higher, batched per request. */
+export function createPairComparator(client, items, options) {
+    const { task, stateOf, maxPairsPerRequest = DEFAULT_MAX_PAIRS_PER_REQUEST, } = options;
+    return async (pairs) => {
+        const decisions = new Array(pairs.length).fill(false);
+        for (let start = 0; start < pairs.length; start += maxPairsPerRequest) {
+            const part = pairs.slice(start, start + maxPairsPerRequest);
+            // Only the items referenced by this chunk travel in the state.
+            const localIndex = new Map();
+            const candidates = [];
+            const localize = (i) => {
+                let local = localIndex.get(i);
+                if (local === undefined) {
+                    local = candidates.length;
+                    localIndex.set(i, local);
+                    candidates.push(stateOf(items[i]));
+                }
+                return local;
+            };
+            const localPairs = part.map(([a, b]) => [localize(a), localize(b)]);
+            const questions = {};
+            localPairs.forEach(([a, b], k) => {
+                questions[`c${k}`] = noul(`Does \`candidates[${a}]\` rank higher than \`candidates[${b}]\` ${task}? ` +
+                    `Answer true only if \`candidates[${a}]\` should come first.`, {
+                    true: `candidates[${a}] comes first`,
+                    false: `candidates[${b}] comes first, or the two tie`,
+                });
+            });
+            const answers = await client.evaluate({
+                state: { candidates, pairs: localPairs },
+                questions,
+            });
+            localPairs.forEach((_, k) => {
+                const value = answers[`c${k}`];
+                const probability = value && "noul" in value ? value.noul : undefined;
+                if (typeof probability !== "number" || !Number.isFinite(probability)) {
+                    throw new Error("pairwise: Jev returned no answer for a comparison");
+                }
+                decisions[start + k] = probability >= 0.5;
+            });
+        }
+        return decisions;
+    };
+}
+/** Randomized quicksort, one recursion level per `compare` call. */
+export async function sortIndicesByPairwise(indices, compare, options = {}) {
+    const { random = Math.random, maxRounds = DEFAULT_MAX_ROUNDS } = options;
+    if (indices.length <= 1)
+        return [...indices];
+    const root = { ids: [...indices] };
+    let frontier = [root];
+    let rounds = 0;
+    while (frontier.length > 0 && rounds < maxRounds) {
+        const pairs = [];
+        const pending = [];
+        for (const node of frontier) {
+            if (node.ids.length <= 1)
+                continue;
+            const pivot = node.ids[Math.floor(random() * node.ids.length)];
+            const others = node.ids.filter((id) => id !== pivot);
+            node.pivot = pivot;
+            pending.push({ node, others });
+            for (const other of others)
+                pairs.push([other, pivot]);
+        }
+        if (pairs.length === 0)
+            break;
+        const decisions = await compare(pairs);
+        let cursor = 0;
+        const next = [];
+        for (const { node, others } of pending) {
+            const high = [];
+            const low = [];
+            for (const other of others) {
+                (decisions[cursor++] ? high : low).push(other);
+            }
+            if (high.length > 0) {
+                node.high = { ids: high };
+                next.push(node.high);
+            }
+            if (low.length > 0) {
+                node.low = { ids: low };
+                next.push(node.low);
+            }
+        }
+        frontier = next;
+        rounds++;
+    }
+    return flatten(root);
+}
+/** In-order walk: high subtree first, so the result is highest-ranked first. */
+function flatten(node) {
+    if (!node)
+        return [];
+    if (node.pivot === undefined)
+        return node.ids;
+    return [...flatten(node.high), node.pivot, ...flatten(node.low)];
+}
+/** Sort items highest-first using an injected comparator. */
+export async function sortByPairwiseWith(items, compare, options = {}) {
+    const order = await sortIndicesByPairwise(items.map((_, i) => i), compare, options);
+    return order.map((i) => items[i]);
+}
+/** Sort items highest-first using Jev as the pairwise oracle. */
+export async function sortByPairwise(client, items, options) {
+    return sortByPairwiseWith(items, createPairComparator(client, items, options), options);
+}
+/**
+ * Pick the top-k indices with quickselect: only the pivot side that can still
+ * contain the k-th item is explored, so this beats a full sort on comparisons.
+ * Returns the k winners (unordered).
+ */
+export async function selectTopKIndices(indices, k, compare, options = {}) {
+    const { random = Math.random, maxRounds = DEFAULT_MAX_ROUNDS } = options;
+    if (k <= 0)
+        return [];
+    if (k >= indices.length)
+        return sortIndicesByPairwise(indices, compare, options);
+    const confirmed = [];
+    let candidates = [...indices];
+    let rounds = 0;
+    while (confirmed.length < k && candidates.length > 0) {
+        const remaining = k - confirmed.length;
+        if (candidates.length <= remaining) {
+            confirmed.push(...candidates);
+            break;
+        }
+        if (rounds >= maxRounds) {
+            // Adversarial or noisy answers: stop probing and keep the rest.
+            confirmed.push(...candidates);
+            break;
+        }
+        const pivot = candidates[Math.floor(random() * candidates.length)];
+        const others = candidates.filter((id) => id !== pivot);
+        const decisions = await compare(others.map((id) => [id, pivot]));
+        const high = [];
+        const low = [];
+        others.forEach((id, i) => (decisions[i] ? high : low).push(id));
+        if (high.length >= remaining) {
+            candidates = high; // pivot and low are below the top k
+        }
+        else {
+            confirmed.push(...high, pivot);
+            candidates = low;
+        }
+        rounds++;
+    }
+    return confirmed.slice(0, k);
+}
+/** Pick the top-k items, ordered highest-first, using an injected comparator. */
+export async function selectTopKWith(items, k, compare, options = {}) {
+    const indices = await selectTopKIndices(items.map((_, i) => i), k, compare, options);
+    const ordered = await sortIndicesByPairwise(indices, compare, options);
+    return ordered.map((i) => items[i]);
+}
+/** Pick the top-k items, ordered highest-first, using Jev as the oracle. */
+export async function selectTopK(client, items, k, options) {
+    return selectTopKWith(items, k, createPairComparator(client, items, options), options);
+}
+//# sourceMappingURL=pairwise.js.map

package/dist/algorithms/pairwise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pairwise.js","sourceRoot":"","sources":["../../src/algorithms/pairwise.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAoD,MAAM,cAAc,CAAC;AAGtF,qEAAqE;AACrE,MAAM,CAAC,MAAM,6BAA6B,GAAG,EAAE,CAAC;AAChD,kFAAkF;AAClF,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAkBrC,kFAAkF;AAClF,MAAM,UAAU,oBAAoB,CACnC,MAAiB,EACjB,KAAmB,EACnB,OAA2B;IAE3B,MAAM,EACL,IAAI,EACJ,OAAO,EACP,kBAAkB,GAAG,6BAA6B,GAClD,GAAG,OAAO,CAAC;IAEZ,OAAO,KAAK,EAAE,KAAK,EAAE,EAAE;QACtB,MAAM,SAAS,GAAc,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEjE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,kBAAkB,EAAE,CAAC;YACvE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,kBAAkB,CAAC,CAAC;YAE5D,+DAA+D;YAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC7C,MAAM,UAAU,GAAe,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE;gBAC9B,IAAI,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACzB,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC;oBAC1B,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;oBACzB,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,CAAC;gBACD,OAAO,KAAK,CAAC;YACd,CAAC,CAAC;YACF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAC1B,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAqB,CAC1D,CAAC;YAEF,MAAM,SAAS,GAAiB,EAAE,CAAC;YACnC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAChC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CACxB,qBAAqB,CAAC,qCAAqC,CAAC,OAAO,IAAI,IAAI;oBAC1E,oCAAoC,CAAC,wBAAwB,EAC9D;oBACC,IAAI,EAAE,cAAc,CAAC,eAAe;oBACpC,KAAK,EAAE,cAAc,CAAC,+BAA+B;iBACrD,CACD,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,QAAQ,CAAC;gBACrC,KAAK,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE;gBACxC,SAAS;aACT,CAAC,CAAC;YAEH,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC3B,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC/B,MAAM,WAAW,GAAG,KAAK,IAAI,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;gBACtE,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;oBACtE,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;gBACtE,CAAC;gBACD,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,WAAW,IAAI,GAAG,CAAC;YAC3C,CAAC,CAAC,CAAC;QACJ,CAAC;QAED,OAAO,SAAS,CAAC;IAClB,CAAC,CAAC;AACH,CAAC;AAUD,oEAAoE;AACpE,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAC1C,OAA0B,EAC1B,OAAuB,EACvB,UAAyD,EAAE;IAE3D,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,kBAAkB,EAAE,GAAG,OAAO,CAAC;IACzE,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;IAE7C,MAAM,IAAI,GAAa,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;IAC7C,IAAI,QAAQ,GAAe,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;QAClD,MAAM,KAAK,GAA4B,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAgD,EAAE,CAAC;QAEhE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC;gBAAE,SAAS;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,MAAM;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QAE9B,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC;QAEvC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,IAAI,GAAe,EAAE,CAAC;QAC5B,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACxC,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC5B,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;YACD,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;QACF,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;QAChB,MAAM,EAAE,CAAC;IACV,CAAC;IAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC;AACtB,CAAC;AAED,gFAAgF;AAChF,SAAS,OAAO,CAAC,IAAe;IAC/B,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC;IAC9C,OAAO,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AAClE,CAAC;AAOD,6DAA6D;AAC7D,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACvC,KAAmB,EACnB,OAAuB,EACvB,UAA8B,EAAE;IAEhC,MAAM,KAAK,GAAG,MAAM,qBAAqB,CACxC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EACtB,OAAO,EACP,OAAO,CACP,CAAC;IACF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACnC,CAAC;AAED,iEAAiE;AACjE,MAAM,CAAC,KAAK,UAAU,cAAc,CACnC,MAAiB,EACjB,KAAmB,EACnB,OAA2B;IAE3B,OAAO,kBAAkB,CAAC,KAAK,EAAE,oBAAoB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;AACzF,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACtC,OAA0B,EAC1B,CAAS,EACT,OAAuB,EACvB,UAA8B,EAAE;IAEhC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,kBAAkB,EAAE,GAAG,OAAO,CAAC;IACzE,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IACtB,IAAI,CAAC,IAAI,OAAO,CAAC,MAAM;QAAE,OAAO,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAEjF,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,UAAU,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IAC9B,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtD,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QACvC,IAAI,UAAU,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;YACpC,SAAS,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;YAC9B,MAAM;QACP,CAAC;QACD,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC;YACzB,gEAAgE;YAChE,SAAS,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;YAC9B,MAAM;QACP,CAAC;QAED,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACnE,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,CAAqB,CAAC,CAAC,CAAC;QAErF,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhE,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;YAC9B,UAAU,GAAG,IAAI,CAAC,CAAC,oCAAoC;QACxD,CAAC;aAAM,CAAC;YACP,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC;YAC/B,UAAU,GAAG,GAAG,CAAC;QAClB,CAAC;QACD,MAAM,EAAE,CAAC;IACV,CAAC;IAED,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9B,CAAC;AAED,iFAAiF;AACjF,MAAM,CAAC,KAAK,UAAU,cAAc,CACnC,KAAmB,EACnB,CAAS,EACT,OAAuB,EACvB,UAA8B,EAAE;IAEhC,MAAM,OAAO,GAAG,MAAM,iBAAiB,CACtC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EACtB,CAAC,EACD,OAAO,EACP,OAAO,CACP,CAAC;IACF,MAAM,OAAO,GAAG,MAAM,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACvE,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,4EAA4E;AAC5E,MAAM,CAAC,KAAK,UAAU,UAAU,CAC/B,MAAiB,EACjB,KAAmB,EACnB,CAAS,EACT,OAA2B;IAE3B,OAAO,cAAc,CAAC,KAAK,EAAE,CAAC,EAAE,oBAAoB,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;AACxF,CAAC"}

package/dist/algorithms/search.d.ts

@@ -0,0 +1,25 @@
+import { type JevClient, type JevState } from "../client.js";
+export interface FindFirstTrueOptions<T> {
+    /** Map an item to the Jev state the question inspects. */
+    stateOf: (item: T) => JevState;
+    /** Question about the single candidate under the cursor. */
+    instruction: string;
+    criteria?: {
+        true?: string;
+        false?: string;
+    };
+}
+export interface FindFirstTrueResult<T> {
+    /** Index of the first item the predicate is true for, or `items.length`. */
+    index: number;
+    /** That item, or null when the predicate is never true. */
+    item: T | null;
+    /** Jev calls spent (one binary-search step each). */
+    steps: number;
+}
+/**
+ * Binary search for the first item a Jev predicate is true for.
+ * `items` must be ordered so the predicate is monotone. One call per step.
+ */
+export declare function findFirstTrue<T>(client: JevClient, items: readonly T[], options: FindFirstTrueOptions<T>): Promise<FindFirstTrueResult<T>>;
+//# sourceMappingURL=search.d.ts.map

package/dist/algorithms/search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/algorithms/search.ts"],"names":[],"mappings":"AAAA,OAAO,EAAQ,KAAK,SAAS,EAAE,KAAK,QAAQ,EAAE,MAAM,cAAc,CAAC;AAEnE,MAAM,WAAW,oBAAoB,CAAC,CAAC;IACtC,0DAA0D;IAC1D,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,QAAQ,CAAC;IAC/B,4DAA4D;IAC5D,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CAC7C;AAED,MAAM,WAAW,mBAAmB,CAAC,CAAC;IACrC,4EAA4E;IAC5E,KAAK,EAAE,MAAM,CAAC;IACd,2DAA2D;IAC3D,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC;IACf,qDAAqD;IACrD,KAAK,EAAE,MAAM,CAAC;CACd;AAED;;;GAGG;AACH,wBAAsB,aAAa,CAAC,CAAC,EACpC,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,OAAO,EAAE,oBAAoB,CAAC,CAAC,CAAC,GAC9B,OAAO,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CA4BjC"}

package/dist/algorithms/search.js

@@ -0,0 +1,32 @@
+import { noul } from "../client.js";
+/**
+ * Binary search for the first item a Jev predicate is true for.
+ * `items` must be ordered so the predicate is monotone. One call per step.
+ */
+export async function findFirstTrue(client, items, options) {
+    const { stateOf, instruction, criteria } = options;
+    let low = 0;
+    let high = items.length;
+    let steps = 0;
+    while (low < high) {
+        const mid = low + Math.floor((high - low) / 2);
+        const answers = await client.evaluate({
+            state: { candidate: stateOf(items[mid]) },
+            questions: { is_true: noul(instruction, criteria) },
+        });
+        steps++;
+        const answer = answers.is_true;
+        const probability = answer && "noul" in answer ? answer.noul : undefined;
+        if (typeof probability !== "number" || !Number.isFinite(probability)) {
+            throw new Error("findFirstTrue: Jev returned no answer");
+        }
+        if (probability >= 0.5) {
+            high = mid;
+        }
+        else {
+            low = mid + 1;
+        }
+    }
+    return { index: low, item: low < items.length ? items[low] : null, steps };
+}
+//# sourceMappingURL=search.js.map

package/dist/algorithms/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/algorithms/search.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAiC,MAAM,cAAc,CAAC;AAmBnE;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAClC,MAAiB,EACjB,KAAmB,EACnB,OAAgC;IAEhC,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;IACnD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;IACxB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,QAAQ,CAAC;YACrC,KAAK,EAAE,EAAE,SAAS,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE;YACzC,SAAS,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,EAAE;SACnD,CAAC,CAAC;QACH,KAAK,EAAE,CAAC;QAER,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;QAC/B,MAAM,WAAW,GAAG,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;QACzE,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;YACtE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC1D,CAAC;QAED,IAAI,WAAW,IAAI,GAAG,EAAE,CAAC;YACxB,IAAI,GAAG,GAAG,CAAC;QACZ,CAAC;aAAM,CAAC;YACP,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QACf,CAAC;IACF,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;AAC5E,CAAC"}

package/dist/client.d.ts

@@ -0,0 +1,75 @@
+/** The Jev client contract: one state, many typed questions, typed answers. */
+/** Any JSON value Jev can read as shared state. */
+export type JevState = string | number | boolean | null | JevState[] | {
+    [key: string]: JevState;
+};
+/** Is this true? Answers with `noul`, the probability the answer is yes. */
+export interface NoulQuestion {
+    type: "noul";
+    instructions: string;
+    criteria?: {
+        true?: string;
+        false?: string;
+    };
+}
+/** Which of these options? Answers with one key from `criteria`. */
+export interface ChoiceQuestion {
+    type: "choice";
+    instructions: string;
+    /** Option key -> description. */
+    criteria: Record<string, string>;
+}
+/** Where on this ordered scale? Answers with an interpolated `score`. */
+export interface ScoreQuestion {
+    type: "score";
+    instructions: string;
+    /** At least two ordered labels, lowest first. */
+    criteria: string[];
+}
+export type JevQuestion = NoulQuestion | ChoiceQuestion | ScoreQuestion;
+export type JevQuestions = Record<string, JevQuestion>;
+export interface NoulAnswer {
+    type?: "noul";
+    /** Probability the answer is yes, 0–1. */
+    noul: number;
+}
+export interface ChoiceAnswer {
+    type?: "choice";
+    choice: string;
+    confidence?: number;
+    probabilities?: Record<string, number>;
+}
+export interface ScoreAnswer {
+    type?: "score";
+    /** Interpolated position on the scale, 0..criteria.length-1. */
+    score: number;
+    confidence?: number;
+    legend?: Record<string, string>;
+    probabilities?: Record<string, number>;
+}
+export type JevAnswer = NoulAnswer | ChoiceAnswer | ScoreAnswer;
+export type JevAnswers = Record<string, JevAnswer>;
+export interface JevEvaluation {
+    state: JevState;
+    questions: JevQuestions;
+}
+export interface JevClient {
+    /** Evaluate one state against many questions in a single round trip. */
+    evaluate(input: JevEvaluation): Promise<JevAnswers>;
+}
+/** Build a Noul question. `criteria` sharpens what true and false mean. */
+export declare function noul(instructions: string, criteria?: {
+    true?: string;
+    false?: string;
+}): NoulQuestion;
+/** Build a Choice question from an option map. */
+export declare function choice(instructions: string, criteria: Record<string, string>): ChoiceQuestion;
+/** Build a Score question from ordered labels, lowest first. */
+export declare function score(instructions: string, criteria: string[]): ScoreQuestion;
+/** Read a Noul answer as a probability, or null if Jev did not answer it. */
+export declare function readNoul(answers: JevAnswers, id: string): number | null;
+/** Read a Choice answer, or null if Jev did not answer it. */
+export declare function readChoice(answers: JevAnswers, id: string): ChoiceAnswer | null;
+/** Read a Score answer, or null if Jev did not answer it. */
+export declare function readScore(answers: JevAnswers, id: string): ScoreAnswer | null;
+//# sourceMappingURL=client.d.ts.map

package/dist/client.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.d.ts","sourceRoot":"","sources":["../src/client.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAE/E,mDAAmD;AACnD,MAAM,MAAM,QAAQ,GACjB,MAAM,GACN,MAAM,GACN,OAAO,GACP,IAAI,GACJ,QAAQ,EAAE,GACV;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,QAAQ,CAAA;CAAE,CAAC;AAE/B,4EAA4E;AAC5E,MAAM,WAAW,YAAY;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,EAAE;QAAE,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC;CAC7C;AAED,oEAAoE;AACpE,MAAM,WAAW,cAAc;IAC9B,IAAI,EAAE,QAAQ,CAAC;IACf,YAAY,EAAE,MAAM,CAAC;IACrB,iCAAiC;IACjC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACjC;AAED,yEAAyE;AACzE,MAAM,WAAW,aAAa;IAC7B,IAAI,EAAE,OAAO,CAAC;IACd,YAAY,EAAE,MAAM,CAAC;IACrB,iDAAiD;IACjD,QAAQ,EAAE,MAAM,EAAE,CAAC;CACnB;AAED,MAAM,MAAM,WAAW,GAAG,YAAY,GAAG,cAAc,GAAG,aAAa,CAAC;AACxE,MAAM,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAEvD,MAAM,WAAW,UAAU;IAC1B,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,0CAA0C;IAC1C,IAAI,EAAE,MAAM,CAAC;CACb;AAED,MAAM,WAAW,YAAY;IAC5B,IAAI,CAAC,EAAE,QAAQ,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACvC;AAED,MAAM,WAAW,WAAW;IAC3B,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,gEAAgE;IAChE,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACvC;AAED,MAAM,MAAM,SAAS,GAAG,UAAU,GAAG,YAAY,GAAG,WAAW,CAAC;AAChE,MAAM,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;AAEnD,MAAM,WAAW,aAAa;IAC7B,KAAK,EAAE,QAAQ,CAAC;IAChB,SAAS,EAAE,YAAY,CAAC;CACxB;AAED,MAAM,WAAW,SAAS;IACzB,wEAAwE;IACxE,QAAQ,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;CACpD;AAED,2EAA2E;AAC3E,wBAAgB,IAAI,CACnB,YAAY,EAAE,MAAM,EACpB,QAAQ,CAAC,EAAE;IAAE,IAAI,CAAC,EAAE,MAAM,CAAC;IAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAE,GAC1C,YAAY,CAEd;AAED,kDAAkD;AAClD,wBAAgB,MAAM,CACrB,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC9B,cAAc,CAEhB;AAED,gEAAgE;AAChE,wBAAgB,KAAK,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,aAAa,CAK7E;AAED,6EAA6E;AAC7E,wBAAgB,QAAQ,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAKvE;AAED,8DAA8D;AAC9D,wBAAgB,UAAU,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI,CAG/E;AAED,6DAA6D;AAC7D,wBAAgB,SAAS,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CAG7E"}

package/dist/client.js

@@ -0,0 +1,35 @@
+/** The Jev client contract: one state, many typed questions, typed answers. */
+/** Build a Noul question. `criteria` sharpens what true and false mean. */
+export function noul(instructions, criteria) {
+    return criteria ? { type: "noul", instructions, criteria } : { type: "noul", instructions };
+}
+/** Build a Choice question from an option map. */
+export function choice(instructions, criteria) {
+    return { type: "choice", instructions, criteria };
+}
+/** Build a Score question from ordered labels, lowest first. */
+export function score(instructions, criteria) {
+    if (criteria.length < 2) {
+        throw new Error("score() needs at least two criteria labels");
+    }
+    return { type: "score", instructions, criteria };
+}
+/** Read a Noul answer as a probability, or null if Jev did not answer it. */
+export function readNoul(answers, id) {
+    const answer = answers[id];
+    if (!answer || !("noul" in answer))
+        return null;
+    const value = answer.noul;
+    return typeof value === "number" && Number.isFinite(value) ? value : null;
+}
+/** Read a Choice answer, or null if Jev did not answer it. */
+export function readChoice(answers, id) {
+    const answer = answers[id];
+    return answer && "choice" in answer ? answer : null;
+}
+/** Read a Score answer, or null if Jev did not answer it. */
+export function readScore(answers, id) {
+    const answer = answers[id];
+    return answer && "score" in answer ? answer : null;
+}
+//# sourceMappingURL=client.js.map

package/dist/client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.js","sourceRoot":"","sources":["../src/client.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAwE/E,2EAA2E;AAC3E,MAAM,UAAU,IAAI,CACnB,YAAoB,EACpB,QAA4C;IAE5C,OAAO,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;AAC7F,CAAC;AAED,kDAAkD;AAClD,MAAM,UAAU,MAAM,CACrB,YAAoB,EACpB,QAAgC;IAEhC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC;AACnD,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,KAAK,CAAC,YAAoB,EAAE,QAAkB;IAC7D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAC/D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC;AAClD,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,QAAQ,CAAC,OAAmB,EAAE,EAAU;IACvD,MAAM,MAAM,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IAC3B,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAChD,MAAM,KAAK,GAAI,MAAqB,CAAC,IAAI,CAAC;IAC1C,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3E,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,UAAU,CAAC,OAAmB,EAAE,EAAU;IACzD,MAAM,MAAM,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IAC3B,OAAO,MAAM,IAAI,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAE,MAAuB,CAAC,CAAC,CAAC,IAAI,CAAC;AACvE,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,SAAS,CAAC,OAAmB,EAAE,EAAU;IACxD,MAAM,MAAM,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;IAC3B,OAAO,MAAM,IAAI,OAAO,IAAI,MAAM,CAAC,CAAC,CAAE,MAAsB,CAAC,CAAC,CAAC,IAAI,CAAC;AACrE,CAAC"}

package/dist/index.d.ts

@@ -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.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","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"}