@rayfold/server 0.1.0

package/live.js

@@ -0,0 +1,240 @@
+export class ChangeBus {
+    subs = new Set();
+    publish(c) {
+        if (!c.keys.size && !c.ops.size)
+            return;
+        for (const fn of this.subs)
+            fn(c);
+    }
+    subscribe(fn) {
+        this.subs.add(fn);
+        return () => this.subs.delete(fn);
+    }
+    get size() {
+        return this.subs.size;
+    }
+}
+export function changeFromPatch(patch) {
+    const keys = new Set();
+    const ops = new Set();
+    for (const p of patch) {
+        if ("set" in p)
+            keys.add(p.set);
+        else if ("list" in p || "at" in p)
+            continue; // result-scoped: names no entity and no operation
+        else if ("del" in p)
+            keys.add(p.del);
+        else if ("inv" in p)
+            p.inv.forEach((k) => keys.add(k));
+        else if ("invOp" in p)
+            p.invOp.forEach((o) => ops.add(o));
+    }
+    return { keys, ops };
+}
+/** Entities keyed by "$type:id" with nested entities replaced by refs; plus the skeleton. */
+export function normalizeResult(data) {
+    const entities = new Map();
+    const walk = (v) => {
+        if (v === null || typeof v !== "object")
+            return v;
+        if (Array.isArray(v))
+            return v.map(walk);
+        const o = v;
+        const tn = o["$type"];
+        const id = o["id"];
+        const out = {};
+        for (const [k, x] of Object.entries(o))
+            out[k] = walk(x);
+        if (typeof tn === "string" && (typeof id === "string" || typeof id === "number")) {
+            const key = `${tn}:${id}`;
+            entities.set(key, { ...(entities.get(key) ?? {}), ...out });
+            return { $ref: key };
+        }
+        return out;
+    };
+    const skeleton = walk(data);
+    return { entities, skeleton };
+}
+export function readSetOf(data) {
+    return new Set(normalizeResult(data).entities.keys());
+}
+/** The key that gives a value its identity in a list: its entity key, or its own content. */
+function identityOf(v) {
+    if (v && typeof v === "object" && !Array.isArray(v)) {
+        const o = v;
+        const tn = o["$type"];
+        const id = o["id"];
+        if (typeof tn === "string" && (typeof id === "string" || typeof id === "number"))
+            return `${tn}:${id}`;
+    }
+    return `#${JSON.stringify(v)}`;
+}
+const entityAt = (v) => {
+    const k = identityOf(v);
+    return k.startsWith("#") ? null : k;
+};
+const sameJson = (a, b) => JSON.stringify(a) === JSON.stringify(b);
+const joinPath = (path, part) => (path === "" ? String(part) : `${path}.${part}`);
+const isLeaf = (v) => v === null || typeof v !== "object";
+/**
+ * Describes how `b` differs from `a` as ops the client can apply to its stored result, or returns false when the
+ * difference cannot be expressed (a reorder, a changed set of fields) and the whole result has to be sent.
+ * Entities are not descended into: their fields travel as `set` ops. `carried` collects the entity keys whose
+ * values travel inside an insertion, so the caller does not send them twice.
+ */
+function structuralDiff(a, b, path, ops, carried) {
+    if (sameJson(a, b))
+        return true;
+    const ea = entityAt(a);
+    const eb = entityAt(b);
+    if (ea || eb)
+        return ea !== null && ea === eb; // same entity: covered by `set`; a different one is structural
+    if (Array.isArray(a) && Array.isArray(b))
+        return listDiff(a, b, path, ops, carried);
+    if (a && b && typeof a === "object" && typeof b === "object" && !Array.isArray(a) && !Array.isArray(b)) {
+        const ao = a;
+        const bo = b;
+        const keys = Object.keys(bo);
+        if (keys.length !== Object.keys(ao).length || keys.some((k) => !(k in ao)))
+            return false;
+        const merge = {};
+        for (const k of keys) {
+            const av = ao[k];
+            const bv = bo[k];
+            if (sameJson(av, bv))
+                continue;
+            if (isLeaf(av) && isLeaf(bv)) {
+                merge[k] = bv;
+                continue;
+            }
+            if (!structuralDiff(av, bv, joinPath(path, k), ops, carried))
+                return false;
+        }
+        if (Object.keys(merge).length)
+            ops.push({ at: path, value: merge });
+        return true;
+    }
+    return false;
+}
+/** Positions removed and elements inserted, verified by replaying them: anything else (a reorder) is refused. */
+function listDiff(a, b, path, ops, carried) {
+    const identified = (xs) => xs.length > 0 && xs.every((x) => entityAt(x) !== null);
+    const objects = (xs) => xs.every((x) => x !== null && typeof x === "object" && !Array.isArray(x));
+    // Rows with an identity of their own are matched by it. Elements without one (plain objects, such as a board's
+    // columns) are matched by position, so a change inside one of them is described in place rather than resent.
+    if (!(identified(a) && identified(b)) && a.length === b.length && objects(a) && objects(b)) {
+        for (let n = 0; n < b.length; n++)
+            if (!structuralDiff(a[n], b[n], joinPath(path, n), ops, carried))
+                return false;
+        return true;
+    }
+    const oldKeys = a.map(identityOf);
+    const newKeys = b.map(identityOf);
+    const del = [];
+    const ins = [];
+    const pairs = [];
+    let i = 0;
+    let j = 0;
+    while (i < a.length && j < b.length) {
+        if (oldKeys[i] === newKeys[j]) {
+            pairs.push([i, j]);
+            i++;
+            j++;
+        }
+        else if (!newKeys.includes(oldKeys[i], j)) {
+            del.push(i);
+            i++;
+        }
+        else {
+            ins.push({ at: j, value: b[j] });
+            j++;
+        }
+    }
+    while (i < a.length)
+        del.push(i++);
+    while (j < b.length) {
+        ins.push({ at: j, value: b[j] });
+        j++;
+    }
+    // The client removes the old positions, then inserts at the new ones. Refuse anything that does not replay exactly.
+    const replay = a.filter((_, n) => !del.includes(n));
+    for (const x of ins)
+        replay.splice(x.at, 0, x.value);
+    if (!sameJson(replay.map(identityOf), newKeys))
+        return false;
+    for (const [x, y] of pairs)
+        if (!structuralDiff(a[x], b[y], joinPath(path, y), ops, carried))
+            return false;
+    if (del.length || ins.length) {
+        for (const x of ins)
+            for (const k of normalizeResult(x.value).entities.keys())
+                carried.add(k);
+        const op = { list: path };
+        if (del.length)
+            op.del = del;
+        if (ins.length)
+            op.ins = ins;
+        ops.push(op);
+    }
+    return true;
+}
+/**
+ * Compare two results. Returns a `patch` frame body when the difference can be described (changed entity fields,
+ * changed fields of a plain object, rows added to or removed from a list), a full `data` replacement when it
+ * cannot, or null when nothing changed. A patch that would cost more than the result itself is not worth sending.
+ */
+export function diffResults(prev, next) {
+    const a = normalizeResult(prev);
+    const b = normalizeResult(next);
+    const structural = [];
+    const carried = new Set();
+    if (JSON.stringify(a.skeleton) !== JSON.stringify(b.skeleton) && !structuralDiff(prev, next, "", structural, carried)) {
+        return { data: next };
+    }
+    const patch = [];
+    for (const [key, fields] of b.entities) {
+        if (carried.has(key))
+            continue; // its fields travel inside an insertion
+        const before = a.entities.get(key);
+        const changed = {};
+        for (const [k, v] of Object.entries(fields)) {
+            if (!before || JSON.stringify(before[k]) !== JSON.stringify(v))
+                changed[k] = v;
+        }
+        if (Object.keys(changed).length)
+            patch.push({ set: key, value: changed });
+    }
+    // Describing the structure costs more than resending it only when nearly every row changed; then send the result.
+    if (structural.length && JSON.stringify(structural).length >= JSON.stringify(next).length)
+        return { data: next };
+    patch.push(...structural);
+    return patch.length ? { patch } : null;
+}
+/** Fold `at` frames into a data value so deferred parts take part in diffs. */
+export function foldFrames(frames) {
+    let data;
+    for (const f of frames) {
+        if ("at" in f) {
+            if (f.at === "")
+                Object.assign(data, f.data);
+            else {
+                const target = getPath(data, f.at.split("."));
+                if (target && typeof target === "object")
+                    Object.assign(target, f.data);
+            }
+        }
+        else if ("data" in f)
+            data = f.data;
+    }
+    return data;
+}
+function getPath(v, path) {
+    let cur = v;
+    for (const p of path) {
+        if (cur === null || cur === undefined || typeof cur !== "object")
+            return undefined;
+        cur = Array.isArray(cur) ? cur[Number(p)] : cur[p];
+    }
+    return cur;
+}
+//# sourceMappingURL=live.js.map

package/live.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"live.js","sourceRoot":"","sources":["../src/live.ts"],"names":[],"mappings":"AAcA,MAAM,OAAO,SAAS;IACH,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvD,OAAO,CAAC,CAAS;QACf,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI;YAAE,OAAO;QACxC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI;YAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,SAAS,CAAC,EAAuB;QAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClB,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;CACF;AAED,MAAM,UAAU,eAAe,CAAC,KAAgB;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,KAAK,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aAC3B,IAAI,MAAM,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;YAAE,SAAS,CAAC,kDAAkD;aAC1F,IAAI,KAAK,IAAI,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aAChC,IAAI,KAAK,IAAI,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAClD,IAAI,OAAO,IAAI,CAAC;YAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;AACvB,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,eAAe,CAAC,IAAa;IAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmC,CAAC;IAC5D,MAAM,IAAI,GAAG,CAAC,CAAU,EAAW,EAAE;QACnC,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC;QAClD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,CAA4B,CAAC;QACvC,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACzD,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,CAAC,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC,EAAE,CAAC;YACjF,MAAM,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1B,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;YAC5D,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC;QACvB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,IAAa;IACrC,OAAO,IAAI,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,6FAA6F;AAC7F,SAAS,UAAU,CAAC,CAAU;IAC5B,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACpD,MAAM,CAAC,GAAG,CAA4B,CAAC;QACvC,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,OAAO,EAAE,KAAK,QAAQ,IAAI,CAAC,OAAO,EAAE,KAAK,QAAQ,IAAI,OAAO,EAAE,KAAK,QAAQ,CAAC;YAAE,OAAO,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;IACzG,CAAC;IACD,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;AACjC,CAAC;AAED,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAiB,EAAE;IAC7C,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACxB,OAAO,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AACtC,CAAC,CAAC;AACF,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,CAAU,EAAW,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC9F,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,IAAqB,EAAU,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC;AACnH,MAAM,MAAM,GAAG,CAAC,CAAU,EAAW,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC;AAI5E;;;;;GAKG;AACH,SAAS,cAAc,CAAC,CAAU,EAAE,CAAU,EAAE,IAAY,EAAE,GAAmB,EAAE,OAAoB;IACrG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,EAAE,IAAI,EAAE;QAAE,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,+DAA+D;IAC9G,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IACpF,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACvG,MAAM,EAAE,GAAG,CAA4B,CAAC;QACxC,MAAM,EAAE,GAAG,CAA4B,CAAC;QACxC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACzF,MAAM,KAAK,GAA4B,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC;gBAAE,SAAS;YAC/B,IAAI,MAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7B,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACd,SAAS;YACX,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC7E,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iHAAiH;AACjH,SAAS,QAAQ,CAAC,CAAY,EAAE,CAAY,EAAE,IAAY,EAAE,GAAmB,EAAE,OAAoB;IACnG,MAAM,UAAU,GAAG,CAAC,EAAa,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAC7F,MAAM,OAAO,GAAG,CAAC,EAAa,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7G,+GAA+G;IAC/G,6GAA6G;IAC7G,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClH,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAClC,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,GAAG,GAA0C,EAAE,CAAC;IACtD,MAAM,KAAK,GAA4B,EAAE,CAAC;IAC1C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,EAAE,CAAC;YAC7C,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjC,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM;QAAE,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;QACpB,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC,EAAE,CAAC;IACN,CAAC;IACD,oHAAoH;IACpH,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,KAAK,MAAM,CAAC,IAAI,GAAG;QAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACrD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC;IAC3G,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,GAAG;YAAE,KAAK,MAAM,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9F,MAAM,EAAE,GAAkF,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACzG,IAAI,GAAG,CAAC,MAAM;YAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC;QAC7B,IAAI,GAAG,CAAC,MAAM;YAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC;QAC7B,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,IAAa,EAAE,IAAa;IACtD,MAAM,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,UAAU,GAAmB,EAAE,CAAC;IACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,CAAC;QACtH,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACxB,CAAC;IACD,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;QACvC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,wCAAwC;QACxE,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACnC,MAAM,OAAO,GAA4B,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC5C,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IAC5E,CAAC;IACD,kHAAkH;IAClH,IAAI,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM;QAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACjH,KAAK,CAAC,IAAI,CAAC,GAAI,UAAwB,CAAC,CAAC;IACzC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AACzC,CAAC;AAED,+EAA+E;AAC/E,MAAM,UAAU,UAAU,CAAC,MAAe;IACxC,IAAI,IAAa,CAAC;IAClB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;YACd,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE;gBAAE,MAAM,CAAC,MAAM,CAAC,IAA+B,EAAE,CAAC,CAAC,IAA+B,CAAC,CAAC;iBAC9F,CAAC;gBACJ,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9C,IAAI,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ;oBAAE,MAAM,CAAC,MAAM,CAAC,MAAiC,EAAE,CAAC,CAAC,IAA+B,CAAC,CAAC;YAChI,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,IAAI,CAAC;YAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;IACxC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,OAAO,CAAC,CAAU,EAAE,IAAc;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,SAAS,IAAI,OAAO,GAAG,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QACnF,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,GAA+B,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["/**\n * Live queries (extension `live`, spec/08): the query is the subscription.\n * A live query records its read set (entity keys + op name). Every command's patch and every explicit\n * `changes.publish()` feeds a ChangeBus; when a change intersects a read set the query re-runs and the\n * client receives either a minimal `patch` frame (same result structure, changed fields) or a fresh\n * `data` frame (membership/order changed).\n */\nimport type { Frame, PatchOp } from \"./protocol.ts\";\n\nexport interface Change {\n  keys: Set<string>;\n  ops: Set<string>;\n}\n\nexport class ChangeBus {\n  private readonly subs = new Set<(c: Change) => void>();\n  publish(c: Change): void {\n    if (!c.keys.size && !c.ops.size) return;\n    for (const fn of this.subs) fn(c);\n  }\n  subscribe(fn: (c: Change) => void): () => void {\n    this.subs.add(fn);\n    return () => this.subs.delete(fn);\n  }\n  get size(): number {\n    return this.subs.size;\n  }\n}\n\nexport function changeFromPatch(patch: PatchOp[]): Change {\n  const keys = new Set<string>();\n  const ops = new Set<string>();\n  for (const p of patch) {\n    if (\"set\" in p) keys.add(p.set);\n    else if (\"list\" in p || \"at\" in p) continue; // result-scoped: names no entity and no operation\n    else if (\"del\" in p) keys.add(p.del);\n    else if (\"inv\" in p) p.inv.forEach((k) => keys.add(k));\n    else if (\"invOp\" in p) p.invOp.forEach((o) => ops.add(o));\n  }\n  return { keys, ops };\n}\n\n/** Entities keyed by \"$type:id\" with nested entities replaced by refs; plus the skeleton. */\nexport function normalizeResult(data: unknown): { entities: Map<string, Record<string, unknown>>; skeleton: unknown } {\n  const entities = new Map<string, Record<string, unknown>>();\n  const walk = (v: unknown): unknown => {\n    if (v === null || typeof v !== \"object\") return v;\n    if (Array.isArray(v)) return v.map(walk);\n    const o = v as Record<string, unknown>;\n    const tn = o[\"$type\"];\n    const id = o[\"id\"];\n    const out: Record<string, unknown> = {};\n    for (const [k, x] of Object.entries(o)) out[k] = walk(x);\n    if (typeof tn === \"string\" && (typeof id === \"string\" || typeof id === \"number\")) {\n      const key = `${tn}:${id}`;\n      entities.set(key, { ...(entities.get(key) ?? {}), ...out });\n      return { $ref: key };\n    }\n    return out;\n  };\n  const skeleton = walk(data);\n  return { entities, skeleton };\n}\n\nexport function readSetOf(data: unknown): Set<string> {\n  return new Set(normalizeResult(data).entities.keys());\n}\n\n/** The key that gives a value its identity in a list: its entity key, or its own content. */\nfunction identityOf(v: unknown): string {\n  if (v && typeof v === \"object\" && !Array.isArray(v)) {\n    const o = v as Record<string, unknown>;\n    const tn = o[\"$type\"];\n    const id = o[\"id\"];\n    if (typeof tn === \"string\" && (typeof id === \"string\" || typeof id === \"number\")) return `${tn}:${id}`;\n  }\n  return `#${JSON.stringify(v)}`;\n}\n\nconst entityAt = (v: unknown): string | null => {\n  const k = identityOf(v);\n  return k.startsWith(\"#\") ? null : k;\n};\nconst sameJson = (a: unknown, b: unknown): boolean => JSON.stringify(a) === JSON.stringify(b);\nconst joinPath = (path: string, part: string | number): string => (path === \"\" ? String(part) : `${path}.${part}`);\nconst isLeaf = (v: unknown): boolean => v === null || typeof v !== \"object\";\n\ntype StructuralOp = { at: string; value: Record<string, unknown> } | { list: string; del?: number[]; ins?: Array<{ at: number; value: unknown }> };\n\n/**\n * Describes how `b` differs from `a` as ops the client can apply to its stored result, or returns false when the\n * difference cannot be expressed (a reorder, a changed set of fields) and the whole result has to be sent.\n * Entities are not descended into: their fields travel as `set` ops. `carried` collects the entity keys whose\n * values travel inside an insertion, so the caller does not send them twice.\n */\nfunction structuralDiff(a: unknown, b: unknown, path: string, ops: StructuralOp[], carried: Set<string>): boolean {\n  if (sameJson(a, b)) return true;\n  const ea = entityAt(a);\n  const eb = entityAt(b);\n  if (ea || eb) return ea !== null && ea === eb; // same entity: covered by `set`; a different one is structural\n  if (Array.isArray(a) && Array.isArray(b)) return listDiff(a, b, path, ops, carried);\n  if (a && b && typeof a === \"object\" && typeof b === \"object\" && !Array.isArray(a) && !Array.isArray(b)) {\n    const ao = a as Record<string, unknown>;\n    const bo = b as Record<string, unknown>;\n    const keys = Object.keys(bo);\n    if (keys.length !== Object.keys(ao).length || keys.some((k) => !(k in ao))) return false;\n    const merge: Record<string, unknown> = {};\n    for (const k of keys) {\n      const av = ao[k];\n      const bv = bo[k];\n      if (sameJson(av, bv)) continue;\n      if (isLeaf(av) && isLeaf(bv)) {\n        merge[k] = bv;\n        continue;\n      }\n      if (!structuralDiff(av, bv, joinPath(path, k), ops, carried)) return false;\n    }\n    if (Object.keys(merge).length) ops.push({ at: path, value: merge });\n    return true;\n  }\n  return false;\n}\n\n/** Positions removed and elements inserted, verified by replaying them: anything else (a reorder) is refused. */\nfunction listDiff(a: unknown[], b: unknown[], path: string, ops: StructuralOp[], carried: Set<string>): boolean {\n  const identified = (xs: unknown[]) => xs.length > 0 && xs.every((x) => entityAt(x) !== null);\n  const objects = (xs: unknown[]) => xs.every((x) => x !== null && typeof x === \"object\" && !Array.isArray(x));\n  // Rows with an identity of their own are matched by it. Elements without one (plain objects, such as a board's\n  // columns) are matched by position, so a change inside one of them is described in place rather than resent.\n  if (!(identified(a) && identified(b)) && a.length === b.length && objects(a) && objects(b)) {\n    for (let n = 0; n < b.length; n++) if (!structuralDiff(a[n], b[n], joinPath(path, n), ops, carried)) return false;\n    return true;\n  }\n  const oldKeys = a.map(identityOf);\n  const newKeys = b.map(identityOf);\n  const del: number[] = [];\n  const ins: Array<{ at: number; value: unknown }> = [];\n  const pairs: Array<[number, number]> = [];\n  let i = 0;\n  let j = 0;\n  while (i < a.length && j < b.length) {\n    if (oldKeys[i] === newKeys[j]) {\n      pairs.push([i, j]);\n      i++;\n      j++;\n    } else if (!newKeys.includes(oldKeys[i]!, j)) {\n      del.push(i);\n      i++;\n    } else {\n      ins.push({ at: j, value: b[j] });\n      j++;\n    }\n  }\n  while (i < a.length) del.push(i++);\n  while (j < b.length) {\n    ins.push({ at: j, value: b[j] });\n    j++;\n  }\n  // The client removes the old positions, then inserts at the new ones. Refuse anything that does not replay exactly.\n  const replay = a.filter((_, n) => !del.includes(n));\n  for (const x of ins) replay.splice(x.at, 0, x.value);\n  if (!sameJson(replay.map(identityOf), newKeys)) return false;\n  for (const [x, y] of pairs) if (!structuralDiff(a[x], b[y], joinPath(path, y), ops, carried)) return false;\n  if (del.length || ins.length) {\n    for (const x of ins) for (const k of normalizeResult(x.value).entities.keys()) carried.add(k);\n    const op: { list: string; del?: number[]; ins?: Array<{ at: number; value: unknown }> } = { list: path };\n    if (del.length) op.del = del;\n    if (ins.length) op.ins = ins;\n    ops.push(op);\n  }\n  return true;\n}\n\n/**\n * Compare two results. Returns a `patch` frame body when the difference can be described (changed entity fields,\n * changed fields of a plain object, rows added to or removed from a list), a full `data` replacement when it\n * cannot, or null when nothing changed. A patch that would cost more than the result itself is not worth sending.\n */\nexport function diffResults(prev: unknown, next: unknown): { patch: PatchOp[] } | { data: unknown } | null {\n  const a = normalizeResult(prev);\n  const b = normalizeResult(next);\n  const structural: StructuralOp[] = [];\n  const carried = new Set<string>();\n  if (JSON.stringify(a.skeleton) !== JSON.stringify(b.skeleton) && !structuralDiff(prev, next, \"\", structural, carried)) {\n    return { data: next };\n  }\n  const patch: PatchOp[] = [];\n  for (const [key, fields] of b.entities) {\n    if (carried.has(key)) continue; // its fields travel inside an insertion\n    const before = a.entities.get(key);\n    const changed: Record<string, unknown> = {};\n    for (const [k, v] of Object.entries(fields)) {\n      if (!before || JSON.stringify(before[k]) !== JSON.stringify(v)) changed[k] = v;\n    }\n    if (Object.keys(changed).length) patch.push({ set: key, value: changed });\n  }\n  // Describing the structure costs more than resending it only when nearly every row changed; then send the result.\n  if (structural.length && JSON.stringify(structural).length >= JSON.stringify(next).length) return { data: next };\n  patch.push(...(structural as PatchOp[]));\n  return patch.length ? { patch } : null;\n}\n\n/** Fold `at` frames into a data value so deferred parts take part in diffs. */\nexport function foldFrames(frames: Frame[]): unknown {\n  let data: unknown;\n  for (const f of frames) {\n    if (\"at\" in f) {\n      if (f.at === \"\") Object.assign(data as Record<string, unknown>, f.data as Record<string, unknown>);\n      else {\n        const target = getPath(data, f.at.split(\".\"));\n        if (target && typeof target === \"object\") Object.assign(target as Record<string, unknown>, f.data as Record<string, unknown>);\n      }\n    } else if (\"data\" in f) data = f.data;\n  }\n  return data;\n}\n\nfunction getPath(v: unknown, path: string[]): unknown {\n  let cur = v;\n  for (const p of path) {\n    if (cur === null || cur === undefined || typeof cur !== \"object\") return undefined;\n    cur = Array.isArray(cur) ? cur[Number(p)] : (cur as Record<string, unknown>)[p];\n  }\n  return cur;\n}\n"]}

package/mcp.d.ts

@@ -0,0 +1,55 @@
+/**
+ * MCP bridge (spec 10): any Rayfold server is an MCP server.
+ * Streamable HTTP, stateless (revision 2026-07-28): POST JSON-RPC to /mcp, JSON response.
+ * commands -> tools (plus a `simulate` variant), queries -> tools and resources, schema docs -> descriptions.
+ */
+import type { IncomingMessage, ServerResponse } from "node:http";
+import { annotation, type RayfoldSchemaIR, type TypeRef } from "@rayfold/schema";
+import type { RayfoldServer } from "./server.js";
+import { type OriginOptions } from "./guard.js";
+export declare const MCP_PROTOCOL_VERSION = "2026-07-28";
+interface JsonRpcRequest {
+    jsonrpc: "2.0";
+    id?: number | string | null;
+    method: string;
+    params?: Record<string, unknown>;
+}
+export interface McpTool {
+    name: string;
+    title?: string;
+    description?: string;
+    inputSchema: Record<string, unknown>;
+    outputSchema?: Record<string, unknown>;
+    annotations?: {
+        readOnlyHint?: boolean;
+        destructiveHint?: boolean;
+        idempotentHint?: boolean;
+    };
+}
+export interface McpResource {
+    uri: string;
+    name: string;
+    description?: string;
+    mimeType: string;
+}
+/** JSON Schema 2020-12 for a Rayfold type reference. */
+export declare function jsonSchemaFor(ir: RayfoldSchemaIR, t: TypeRef, defs: Record<string, unknown>, forInput: boolean): Record<string, unknown>;
+/**
+ * @range becomes JSON Schema keywords the validator understands (minimum/maximum on numbers, minLength/maxLength
+ * on strings) plus `x-rayfold-range`, which also covers Decimal (a string on the wire).
+ */
+export declare function withRange(s: Record<string, unknown>, annotations: {
+    name: string;
+    args: Record<string, unknown>;
+}[], typeName: string): Record<string, unknown>;
+export declare function mcpTools(server: RayfoldServer): McpTool[];
+export declare function mcpResources(server: RayfoldServer): McpResource[];
+/** Handle one JSON-RPC request (stateless). */
+export declare function handleMcp(server: RayfoldServer, req: JsonRpcRequest, viewer: unknown): Promise<Record<string, unknown> | null>;
+export interface McpHttpOptions extends OriginOptions {
+    path?: string;
+    viewer?: (req: IncomingMessage) => unknown | Promise<unknown>;
+}
+/** Streamable HTTP endpoint: POST JSON-RPC, JSON reply. */
+export declare function createMcpHandler(server: RayfoldServer, opts?: McpHttpOptions): (req: IncomingMessage, res: ServerResponse) => Promise<boolean>;
+export { annotation as _annotation };

package/mcp.js

@@ -0,0 +1,314 @@
+import { annotation, baseName } from "@rayfold/schema";
+import { hostProblem, mediaType, originProblem, refuse } from "./guard.js";
+export const MCP_PROTOCOL_VERSION = "2026-07-28";
+/** JSON Schema 2020-12 for a Rayfold type reference. */
+export function jsonSchemaFor(ir, t, defs, forInput) {
+    const nullable = (s) => (t.nullable ? { anyOf: [s, { type: "null" }] } : s);
+    if (t.kind === "list")
+        return nullable({ type: "array", items: jsonSchemaFor(ir, t.of, defs, forInput) });
+    const def = ir.types[t.name];
+    if (!def)
+        return {};
+    switch (def.kind) {
+        case "scalar": {
+            const map = {
+                ID: { type: "string" },
+                String: { type: "string" },
+                Int: { type: "integer" },
+                Long: { type: ["integer", "string"] },
+                Float: { type: "number" },
+                Boolean: { type: "boolean" },
+                Decimal: { type: "string", pattern: "^-?\\d+(\\.\\d+)?$" },
+                Instant: { type: "string", format: "date-time" },
+                Date: { type: "string", format: "date" },
+                Duration: { type: ["string", "integer"] },
+                Bytes: { type: "string", contentEncoding: "base64url" },
+                JSON: {},
+            };
+            return nullable(map[t.name] ?? { type: ["string", "number"] });
+        }
+        case "enum":
+            return nullable({ type: "string", enum: def.values.map((v) => v.name) });
+        case "union":
+            return nullable({ anyOf: def.members.map((m) => jsonSchemaFor(ir, { kind: "named", name: m, nullable: false }, defs, forInput)) });
+        default: {
+            const key = t.name === "Page" && t.args?.[0] ? `Page_${baseName(t.args[0])}` : t.name;
+            if (!(key in defs)) {
+                defs[key] = {}; // placeholder for recursion
+                const fields = def.kind === "object" && def.typeParams?.length && t.args ? substituteFields(ir, def.fields, def.typeParams, t.args) : def.fields;
+                const properties = {};
+                const required = [];
+                if (def.kind === "entity")
+                    properties["$type"] = { const: def.name };
+                for (const f of fields) {
+                    if (forInput && f.args.length)
+                        continue;
+                    const s = withRange(jsonSchemaFor(ir, f.type, defs, forInput), f.annotations, baseName(f.type));
+                    properties[f.name] = f.description ? { ...s, description: f.description } : s;
+                    if (!f.type.nullable && f.default === undefined)
+                        required.push(f.name);
+                }
+                const schema = { type: "object", properties, additionalProperties: false };
+                if (required.length)
+                    schema["required"] = required;
+                if (def.description)
+                    schema["description"] = def.description;
+                defs[key] = schema;
+            }
+            return nullable({ $ref: `#/$defs/${key}` });
+        }
+    }
+}
+function substituteFields(ir, fields, params, args) {
+    void ir;
+    const bind = new Map(params.map((p, i) => [p, args[i]]));
+    const sub = (t) => {
+        if (t.kind === "list")
+            return { kind: "list", of: sub(t.of), nullable: t.nullable };
+        const b = bind.get(t.name);
+        return b ? { ...b, nullable: t.nullable || b.nullable } : t;
+    };
+    return fields.map((f) => ({ ...f, type: sub(f.type) }));
+}
+/**
+ * @range becomes JSON Schema keywords the validator understands (minimum/maximum on numbers, minLength/maxLength
+ * on strings) plus `x-rayfold-range`, which also covers Decimal (a string on the wire).
+ */
+export function withRange(s, annotations, typeName) {
+    const r = annotations.find((a) => a.name === "range");
+    if (!r)
+        return s;
+    const min = typeof r.args["min"] === "number" ? r.args["min"] : undefined;
+    const max = typeof r.args["max"] === "number" ? r.args["max"] : undefined;
+    const out = { ...s, "x-rayfold-range": { ...(min !== undefined ? { min } : {}), ...(max !== undefined ? { max } : {}) } };
+    const numeric = ["Int", "Long", "Float"].includes(typeName);
+    const text = typeName === "String";
+    if (numeric || text) {
+        if (min !== undefined)
+            out[numeric ? "minimum" : "minLength"] = min;
+        if (max !== undefined)
+            out[numeric ? "maximum" : "maxLength"] = max;
+    }
+    return out;
+}
+function argsSchema(ir, args) {
+    const defs = {};
+    const properties = {};
+    const required = [];
+    for (const a of args) {
+        const s = withRange(jsonSchemaFor(ir, a.type, defs, true), a.annotations, baseName(a.type));
+        properties[a.name] = a.description ? { ...s, description: a.description } : s;
+        if (!a.type.nullable && a.default === undefined)
+            required.push(a.name);
+    }
+    const schema = { $schema: "https://json-schema.org/draft/2020-12/schema", type: "object", properties, additionalProperties: false };
+    if (required.length)
+        schema["required"] = required;
+    if (Object.keys(defs).length)
+        schema["$defs"] = defs;
+    return schema;
+}
+function resultSchema(ir, t) {
+    const defs = {};
+    const inner = jsonSchemaFor(ir, t, defs, false);
+    const schema = { $schema: "https://json-schema.org/draft/2020-12/schema", type: "object", properties: { result: inner }, required: ["result"] };
+    if (Object.keys(defs).length)
+        schema["$defs"] = defs;
+    return schema;
+}
+export function mcpTools(server) {
+    const ir = server.ir;
+    const tools = [];
+    for (const op of Object.values(ir.ops)) {
+        if (op.kind === "stream")
+            continue;
+        const base = { name: op.name, inputSchema: argsSchema(ir, op.args), outputSchema: resultSchema(ir, op.returns) };
+        const desc = [op.description, op.throws.length ? `May fail with: ${op.throws.join(", ")}.` : "", op.kind === "query" ? "Read-only." : "Changes state; idempotent per call key."].filter(Boolean).join(" ");
+        if (desc)
+            base.description = desc;
+        base.annotations = op.kind === "query" ? { readOnlyHint: true, idempotentHint: true } : { readOnlyHint: false, destructiveHint: true, idempotentHint: true };
+        tools.push(base);
+        // A dry-run tool is offered only where the command declares @simulate: the runtime cannot stop a resolver that ignores ctx.simulate.
+        if (op.kind === "command" && op.annotations.some((a) => a.name === "simulate")) {
+            tools.push({
+                ...base,
+                name: `${op.name}.simulate`,
+                description: `Dry run of ${op.name}: returns the would-be result and effects without committing.`,
+                annotations: { readOnlyHint: true, idempotentHint: true },
+            });
+        }
+    }
+    return tools;
+}
+export function mcpResources(server) {
+    const out = [{ uri: "rayfold://schema", name: "Rayfold schema (IR)", description: "The full schema as JSON IR", mimeType: "application/json" }];
+    for (const op of Object.values(server.ir.ops)) {
+        if (op.kind !== "query" || op.args.some((a) => !a.type.nullable && a.default === undefined))
+            continue;
+        const r = { uri: `rayfold://query/${op.name}`, name: op.name, mimeType: "application/json" };
+        if (op.description)
+            r.description = op.description;
+        out.push(r);
+    }
+    return out;
+}
+async function callTool(server, name, args, viewer) {
+    const simulate = name.endsWith(".simulate");
+    const opName = simulate ? name.slice(0, -".simulate".length) : name;
+    const op = server.ir.ops[opName];
+    if (!op || op.kind === "stream")
+        return { isError: true, content: [{ type: "text", text: `Unknown tool ${name}` }] };
+    const req = { id: 1, op: opName, args };
+    if (op.kind === "command") {
+        const optedOut = op.annotations.some((a) => a.name === "idempotent" && a.args["value"] === false);
+        if (!optedOut)
+            req.key = `mcp-${hashKey(JSON.stringify(args))}`;
+        if (simulate)
+            req.simulate = true;
+    }
+    const frames = await server.collect({ ops: [req], meta: { client: "mcp" } }, { viewer });
+    const data = foldForMcp(frames);
+    if ("error" in data) {
+        const e = data.error;
+        return { isError: true, content: [{ type: "text", text: `${e.code}${e.type ? ` ${e.type}` : ""}: ${e.message}` }], structuredContent: { error: e } };
+    }
+    const structured = { result: data.result };
+    if (data.patch)
+        structured["effects"] = data.patch;
+    return { content: [{ type: "text", text: JSON.stringify(structured.result, null, 2) }], structuredContent: structured, resultType: "complete" };
+}
+function foldForMcp(frames) {
+    let result;
+    let patch;
+    for (const f of frames) {
+        if ("error" in f)
+            return { error: f.error };
+        if ("ok" in f) {
+            result = f.ok;
+            patch = f.patch;
+        }
+        else if ("data" in f && !("at" in f))
+            result = f.data;
+        else if ("at" in f && result && typeof result === "object") {
+            const target = f.at === "" ? result : getPath(result, f.at.split("."));
+            if (target && typeof target === "object")
+                Object.assign(target, f.data);
+        }
+    }
+    return patch !== undefined ? { result, patch } : { result };
+}
+function getPath(v, path) {
+    let cur = v;
+    for (const p of path) {
+        if (cur === null || cur === undefined || typeof cur !== "object")
+            return undefined;
+        cur = Array.isArray(cur) ? cur[Number(p)] : cur[p];
+    }
+    return cur;
+}
+function hashKey(s) {
+    let h = 2166136261;
+    for (let i = 0; i < s.length; i++)
+        h = Math.imul(h ^ s.charCodeAt(i), 16777619);
+    return (h >>> 0).toString(16).padStart(8, "0") + s.length.toString(16).padStart(8, "0");
+}
+/** Handle one JSON-RPC request (stateless). */
+export async function handleMcp(server, req, viewer) {
+    const reply = (result) => ({ jsonrpc: "2.0", id: req.id ?? null, result });
+    const fail = (code, message) => ({ jsonrpc: "2.0", id: req.id ?? null, error: { code, message } });
+    const p = req.params ?? {};
+    switch (req.method) {
+        case "initialize":
+            return reply({ protocolVersion: MCP_PROTOCOL_VERSION, capabilities: { tools: { listChanged: false }, resources: { subscribe: false, listChanged: false } }, serverInfo: { name: "rayfold", version: "0.1", schemaHash: server.hash } });
+        case "server/discover":
+            return reply({ protocolVersion: MCP_PROTOCOL_VERSION, capabilities: { tools: {}, resources: {} }, serverInfo: { name: "rayfold", version: "0.1", schemaHash: server.hash } });
+        case "ping":
+            return reply({});
+        case "notifications/initialized":
+            return null;
+        case "tools/list":
+            return reply({ tools: mcpTools(server), ttlMs: 300_000, cacheScope: "public" });
+        case "tools/call": {
+            const name = p["name"];
+            if (typeof name !== "string")
+                return fail(-32602, "name is required");
+            return reply(await callTool(server, name, p["arguments"] ?? {}, viewer));
+        }
+        case "resources/list":
+            return reply({ resources: mcpResources(server), ttlMs: 300_000, cacheScope: "public" });
+        case "resources/read": {
+            const uri = p["uri"];
+            if (typeof uri !== "string")
+                return fail(-32602, "uri is required");
+            if (uri === "rayfold://schema")
+                return reply({ contents: [{ uri, mimeType: "application/json", text: JSON.stringify(server.ir) }] });
+            const m = /^rayfold:\/\/query\/([A-Za-z_][A-Za-z0-9_]*)(\?(.*))?$/.exec(uri);
+            if (!m)
+                return fail(-32602, `Unknown resource ${uri}`);
+            const args = {};
+            for (const [k, v] of new URLSearchParams(m[3] ?? ""))
+                args[k] = v;
+            const r = await callTool(server, m[1], args, viewer);
+            if (r["isError"])
+                return fail(-32000, r["content"][0]?.text ?? "error");
+            return reply({ contents: [{ uri, mimeType: "application/json", text: JSON.stringify(r["structuredContent"].result) }] });
+        }
+        case "prompts/list":
+            return reply({ prompts: [] });
+        default:
+            return fail(-32601, `Method not found: ${req.method}`);
+    }
+}
+/** Streamable HTTP endpoint: POST JSON-RPC, JSON reply. */
+export function createMcpHandler(server, opts = {}) {
+    const path = opts.path ?? "/mcp";
+    return async (req, res) => {
+        const url = new URL(req.url ?? "/", "http://localhost");
+        if (url.pathname !== path)
+            return false;
+        if (req.method !== "POST") {
+            res.writeHead(405, { Allow: "POST", "X-Content-Type-Options": "nosniff" }).end();
+            return true;
+        }
+        // The MCP transport requires Origin validation: without it any web page could drive a local or intranet server.
+        const refused = hostProblem(req, opts) ?? originProblem(req, opts);
+        if (refused) {
+            refuse(res, 403, "permission_denied", refused);
+            return true;
+        }
+        if (mediaType(req) !== "application/json") {
+            refuse(res, 415, "invalid_argument", `Content-Type ${mediaType(req) || "(none)"} is not accepted; send application/json`, "unsupported_media_type");
+            return true;
+        }
+        res.setHeader("X-Content-Type-Options", "nosniff");
+        const chunks = [];
+        for await (const c of req)
+            chunks.push(c);
+        let body;
+        try {
+            body = JSON.parse(Buffer.concat(chunks).toString("utf8"));
+        }
+        catch {
+            res.writeHead(400, { "Content-Type": "application/json" }).end(JSON.stringify({ jsonrpc: "2.0", id: null, error: { code: -32700, message: "Parse error" } }));
+            return true;
+        }
+        const viewer = opts.viewer ? await opts.viewer(req) : null;
+        const headerMethod = req.headers["mcp-method"];
+        const first = Array.isArray(body) ? body[0] : body;
+        if (typeof headerMethod === "string" && first && headerMethod !== first.method) {
+            res.writeHead(400, { "Content-Type": "application/json" }).end(JSON.stringify({ jsonrpc: "2.0", id: first.id ?? null, error: { code: -32020, message: "HeaderMismatch" } }));
+            return true;
+        }
+        const results = await Promise.all((Array.isArray(body) ? body : [body]).map((r) => handleMcp(server, r, viewer)));
+        const out = Array.isArray(body) ? results.filter(Boolean) : results[0];
+        res.setHeader("MCP-Protocol-Version", MCP_PROTOCOL_VERSION);
+        if (out === null || out === undefined) {
+            res.writeHead(202).end();
+            return true;
+        }
+        res.writeHead(200, { "Content-Type": "application/json" }).end(JSON.stringify(out));
+        return true;
+    };
+}
+export { annotation as _annotation };
+//# sourceMappingURL=mcp.js.map