@amalgm/live 0.1.0

package/dist/machines/presence.js

@@ -0,0 +1,49 @@
+/**
+ * Presence receiver — arrival-clock TTL over replace-not-merge frames.
+ *
+ * A presence frame carries the FULL peer list for one resource; receivers
+ * replace their view and treat absence as the default that publishing
+ * re-earns (local-live-protocol.md §2). The server already expires stale
+ * publishers, but receivers must apply their OWN arrival-clock TTL — a
+ * frozen stream must not preserve ghosts.
+ */
+import { SERVER_TTL_MS } from '../contracts/presence.js';
+export class PresenceView {
+    ttlMs;
+    #byResource = new Map();
+    constructor(ttlMs = SERVER_TTL_MS) {
+        this.ttlMs = ttlMs;
+    }
+    /** Replace one resource's peer view. `nowMs` is the receiver's clock (host-supplied — the SDK holds no clock). */
+    accept(frame, nowMs) {
+        const peers = new Map();
+        for (const peer of frame.peers) {
+            peers.set(peer.session, { ...peer, arrivedAtMs: nowMs });
+        }
+        if (peers.size === 0)
+            this.#byResource.delete(frame.resource);
+        else
+            this.#byResource.set(frame.resource, peers);
+    }
+    /** Live peers for a resource, with expired entries dropped as of `nowMs`. */
+    peers(resource, nowMs) {
+        const peers = this.#byResource.get(resource);
+        if (!peers)
+            return [];
+        const alive = [];
+        for (const [session, peer] of peers) {
+            if (nowMs - peer.arrivedAtMs > this.ttlMs)
+                peers.delete(session);
+            else
+                alive.push(peer);
+        }
+        if (peers.size === 0)
+            this.#byResource.delete(resource);
+        return alive;
+    }
+    /** Delivery was lost: presence is not replayed after a gap, so the view must not outlive its stream. */
+    clear() {
+        this.#byResource.clear();
+    }
+}
+//# sourceMappingURL=presence.js.map

package/dist/machines/presence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"presence.js","sourceRoot":"","sources":["../../src/machines/presence.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,aAAa,EAAyC,MAAM,0BAA0B,CAAC;AAOhG,MAAM,OAAO,YAAY;IAGM;IAF7B,WAAW,GAAG,IAAI,GAAG,EAAiC,CAAC;IAEvD,YAA6B,QAAgB,aAAa;QAA7B,UAAK,GAAL,KAAK,CAAwB;IAAG,CAAC;IAE9D,kHAAkH;IAClH,MAAM,CAAC,KAAoB,EAAE,KAAa;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;;YACzD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnD,CAAC;IAED,6EAA6E;IAC7E,KAAK,CAAC,QAAgB,EAAE,KAAa;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QACtB,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC;YACpC,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK;gBAAE,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;;gBAC5D,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,wGAAwG;IACxG,KAAK;QACH,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;CACF"}

package/dist/merge/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * The merge layer: the text-reconciliation engine behind live documents.
+ * `merge3` is the diff3 core; the doc-write decision policy
+ * (`decideDocWrite` — outcome selection, retention-ring base resolution,
+ * overwrite-deletes-text) joins it here as the next extraction slice
+ * (ROADMAP.md #1).
+ */
+export * from './merge3.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/merge/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/merge/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,cAAc,aAAa,CAAC"}

package/dist/merge/index.js

@@ -0,0 +1,9 @@
+/**
+ * The merge layer: the text-reconciliation engine behind live documents.
+ * `merge3` is the diff3 core; the doc-write decision policy
+ * (`decideDocWrite` — outcome selection, retention-ring base resolution,
+ * overwrite-deletes-text) joins it here as the next extraction slice
+ * (ROADMAP.md #1).
+ */
+export * from './merge3.js';
+//# sourceMappingURL=index.js.map

package/dist/merge/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/merge/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,cAAc,aAAa,CAAC"}

package/dist/merge/merge3.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Minimal three-way line-based merge (diff3) for live-document reconcile —
+ * the engine behind every `MergeOutcome` in `contracts/docs.ts`.
+ *
+ * merge3(base, ours, theirs) — all three are whole-file strings — answers:
+ * given that both OURS and THEIRS evolved from BASE, what single text keeps
+ * both sides' changes? Hunks (line regions changed relative to BASE) that
+ * touch different base regions merge automatically; hunks that overlap are
+ * conflicts. On conflict this module NEVER picks a winner silently: the
+ * merged text keeps OURS for the conflicted region and the conflict is
+ * reported to the caller, which is responsible for preserving THEIRS
+ * durably (the engine writes a sidecar file — axiom: never a silent
+ * winner).
+ *
+ * No dependencies by design. The diff is a plain LCS over lines (common
+ * prefix/suffix trimmed first); regions too large to LCS degrade to a
+ * single whole-region hunk, which can only ever OVER-report a conflict,
+ * never lose an edit.
+ */
+/** An overlapping region: line indices into BASE, each side's text for it. */
+export interface MergeConflict {
+    readonly baseStart: number;
+    readonly baseEnd: number;
+    readonly ours: string;
+    readonly theirs: string;
+}
+export interface MergeResult {
+    /** The merged text; for conflicted regions it keeps OURS. */
+    readonly text: string;
+    readonly conflicts: readonly MergeConflict[];
+}
+/**
+ * Three-way merge of whole-file strings.
+ *
+ * Fast paths: either side identical to base (or to the other side)
+ * short-circuits without diffing.
+ */
+export declare function merge3(baseText: string, oursText: string, theirsText: string): MergeResult;
+//# sourceMappingURL=merge3.d.ts.map

package/dist/merge/merge3.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge3.d.ts","sourceRoot":"","sources":["../../src/merge/merge3.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAwBH,8EAA8E;AAC9E,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,WAAW;IAC1B,6DAA6D;IAC7D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,SAAS,EAAE,SAAS,aAAa,EAAE,CAAC;CAC9C;AA+GD;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,WAAW,CA2D1F"}

package/dist/merge/merge3.js

@@ -0,0 +1,188 @@
+/**
+ * Minimal three-way line-based merge (diff3) for live-document reconcile —
+ * the engine behind every `MergeOutcome` in `contracts/docs.ts`.
+ *
+ * merge3(base, ours, theirs) — all three are whole-file strings — answers:
+ * given that both OURS and THEIRS evolved from BASE, what single text keeps
+ * both sides' changes? Hunks (line regions changed relative to BASE) that
+ * touch different base regions merge automatically; hunks that overlap are
+ * conflicts. On conflict this module NEVER picks a winner silently: the
+ * merged text keeps OURS for the conflicted region and the conflict is
+ * reported to the caller, which is responsible for preserving THEIRS
+ * durably (the engine writes a sidecar file — axiom: never a silent
+ * winner).
+ *
+ * No dependencies by design. The diff is a plain LCS over lines (common
+ * prefix/suffix trimmed first); regions too large to LCS degrade to a
+ * single whole-region hunk, which can only ever OVER-report a conflict,
+ * never lose an edit.
+ */
+/**
+ * Cap on the LCS DP table (cells = changed-lines² after prefix/suffix
+ * trim). 4M cells ≈ 16MB of Int32 — beyond it the changed region collapses
+ * into one hunk per side, trading merge granularity for bounded memory.
+ */
+const MAX_LCS_CELLS = 4 * 1024 * 1024;
+/** Split into lines with their terminators kept, so join('') reassembles exactly. */
+function splitLines(text) {
+    if (text === '')
+        return [];
+    return text.split(/(?<=\n)/);
+}
+/**
+ * Longest common subsequence between a[aStart..aEnd) and b[bStart..bEnd),
+ * returned as matched index pairs [aIndex, bIndex] in increasing order.
+ */
+function lcsMatches(a, aStart, aEnd, b, bStart, bEnd) {
+    const n = aEnd - aStart;
+    const m = bEnd - bStart;
+    const width = m + 1;
+    const table = new Int32Array((n + 1) * width);
+    for (let i = 1; i <= n; i += 1) {
+        const line = a[aStart + i - 1];
+        for (let j = 1; j <= m; j += 1) {
+            table[i * width + j] =
+                line === b[bStart + j - 1]
+                    ? table[(i - 1) * width + (j - 1)] + 1
+                    : Math.max(table[(i - 1) * width + j], table[i * width + (j - 1)]);
+        }
+    }
+    const matches = [];
+    let i = n;
+    let j = m;
+    while (i > 0 && j > 0) {
+        if (a[aStart + i - 1] === b[bStart + j - 1] &&
+            table[i * width + j] === table[(i - 1) * width + (j - 1)] + 1) {
+            matches.push([aStart + i - 1, bStart + j - 1]);
+            i -= 1;
+            j -= 1;
+        }
+        else if (table[(i - 1) * width + j] >= table[i * width + (j - 1)]) {
+            i -= 1;
+        }
+        else {
+            j -= 1;
+        }
+    }
+    matches.reverse();
+    return matches;
+}
+/**
+ * Regions where `side` differs from `base`, in base order. Outside these
+ * hunks the two arrays match line for line.
+ */
+function diffHunks(base, side) {
+    let prefix = 0;
+    const maxPrefix = Math.min(base.length, side.length);
+    while (prefix < maxPrefix && base[prefix] === side[prefix])
+        prefix += 1;
+    let baseEnd = base.length;
+    let sideEnd = side.length;
+    while (baseEnd > prefix && sideEnd > prefix && base[baseEnd - 1] === side[sideEnd - 1]) {
+        baseEnd -= 1;
+        sideEnd -= 1;
+    }
+    const n = baseEnd - prefix;
+    const m = sideEnd - prefix;
+    if (n === 0 && m === 0)
+        return [];
+    if (n === 0 || m === 0 || n * m > MAX_LCS_CELLS) {
+        return [{ baseStart: prefix, baseLength: n, sideStart: prefix, sideLength: m }];
+    }
+    const hunks = [];
+    let b = prefix;
+    let s = prefix;
+    for (const [mb, ms] of lcsMatches(base, prefix, baseEnd, side, prefix, sideEnd)) {
+        if (mb > b || ms > s) {
+            hunks.push({ baseStart: b, baseLength: mb - b, sideStart: s, sideLength: ms - s });
+        }
+        b = mb + 1;
+        s = ms + 1;
+    }
+    if (baseEnd > b || sideEnd > s) {
+        hunks.push({ baseStart: b, baseLength: baseEnd - b, sideStart: s, sideLength: sideEnd - s });
+    }
+    return hunks;
+}
+/**
+ * The side's lines corresponding to the group's base range [start, end).
+ * Between its own hunks a side matches the base line for line, so the range
+ * extends from the first hunk (pulled back by the matched lead-in) to the
+ * last hunk (pushed forward by the matched tail).
+ */
+function sideSlice(group, sideHunks, baseLines, sideLines) {
+    if (sideHunks.length === 0)
+        return baseLines.slice(group.start, group.end);
+    const first = sideHunks[0];
+    const last = sideHunks[sideHunks.length - 1];
+    const lo = first.sideStart - (first.baseStart - group.start);
+    const hi = last.sideStart + last.sideLength + (group.end - (last.baseStart + last.baseLength));
+    return sideLines.slice(lo, hi);
+}
+/**
+ * Three-way merge of whole-file strings.
+ *
+ * Fast paths: either side identical to base (or to the other side)
+ * short-circuits without diffing.
+ */
+export function merge3(baseText, oursText, theirsText) {
+    if (oursText === theirsText)
+        return { text: oursText, conflicts: [] };
+    if (oursText === baseText)
+        return { text: theirsText, conflicts: [] };
+    if (theirsText === baseText)
+        return { text: oursText, conflicts: [] };
+    const base = splitLines(baseText);
+    const ours = splitLines(oursText);
+    const theirs = splitLines(theirsText);
+    const hunks = [
+        ...diffHunks(base, ours).map((h) => ({ ...h, side: 'ours' })),
+        ...diffHunks(base, theirs).map((h) => ({ ...h, side: 'theirs' })),
+    ].sort((a, b) => a.baseStart - b.baseStart || (a.side === b.side ? 0 : a.side === 'ours' ? -1 : 1));
+    // Group hunks whose base ranges overlap. Adjacent (touching) ranges stay
+    // separate — they merge cleanly — with one exception: insertions from both
+    // sides at the exact same base point have no defined order, so they group
+    // (and therefore conflict) too.
+    const groups = [];
+    for (const hunk of hunks) {
+        const group = groups[groups.length - 1];
+        const joins = group &&
+            (hunk.baseStart < group.end ||
+                (hunk.baseStart === group.end &&
+                    hunk.baseLength === 0 &&
+                    group.hunks.some((h) => h.side !== hunk.side && h.baseLength === 0 && h.baseStart === hunk.baseStart)));
+        if (joins) {
+            group.hunks.push(hunk);
+            group.end = Math.max(group.end, hunk.baseStart + hunk.baseLength);
+        }
+        else {
+            groups.push({ start: hunk.baseStart, end: hunk.baseStart + hunk.baseLength, hunks: [hunk] });
+        }
+    }
+    const out = [];
+    const conflicts = [];
+    let cursor = 0;
+    for (const group of groups) {
+        out.push(base.slice(cursor, group.start).join(''));
+        const oursHunks = group.hunks.filter((h) => h.side === 'ours');
+        const theirsHunks = group.hunks.filter((h) => h.side === 'theirs');
+        const oursRegion = sideSlice(group, oursHunks, base, ours).join('');
+        const theirsRegion = sideSlice(group, theirsHunks, base, theirs).join('');
+        if (theirsHunks.length === 0 || oursRegion === theirsRegion) {
+            out.push(oursRegion);
+        }
+        else if (oursHunks.length === 0) {
+            out.push(theirsRegion);
+        }
+        else {
+            // Overlap with different content on each side: keep OURS in the text,
+            // surface the conflict to the caller.
+            conflicts.push({ baseStart: group.start, baseEnd: group.end, ours: oursRegion, theirs: theirsRegion });
+            out.push(oursRegion);
+        }
+        cursor = group.end;
+    }
+    out.push(base.slice(cursor).join(''));
+    return { text: out.join(''), conflicts };
+}
+//# sourceMappingURL=merge3.js.map

package/dist/merge/merge3.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge3.js","sourceRoot":"","sources":["../../src/merge/merge3.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH;;;;GAIG;AACH,MAAM,aAAa,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;AA+BtC,qFAAqF;AACrF,SAAS,UAAU,CAAC,IAAY;IAC9B,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CACjB,CAAoB,EACpB,MAAc,EACd,IAAY,EACZ,CAAoB,EACpB,MAAc,EACd,IAAY;IAEZ,MAAM,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;IACxB,MAAM,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;IACxB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IACpB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,KAAK,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;gBAClB,IAAI,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;oBACxB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC;oBACvC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAA4B,EAAE,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IACE,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;YACvC,KAAK,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,EAC9D,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC,IAAI,CAAC,CAAC;YACP,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAE,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC;YACtE,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;aAAM,CAAC;YACN,CAAC,IAAI,CAAC,CAAC;QACT,CAAC;IACH,CAAC;IACD,OAAO,CAAC,OAAO,EAAE,CAAC;IAClB,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,IAAuB,EAAE,IAAuB;IACjE,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACrD,OAAO,MAAM,GAAG,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC;QAAE,MAAM,IAAI,CAAC,CAAC;IACxE,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,OAAO,OAAO,GAAG,MAAM,IAAI,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC;QACvF,OAAO,IAAI,CAAC,CAAC;QACb,OAAO,IAAI,CAAC,CAAC;IACf,CAAC;IACD,MAAM,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC;IAC3B,MAAM,CAAC,GAAG,OAAO,GAAG,MAAM,CAAC;IAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAClC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,aAAa,EAAE,CAAC;QAChD,OAAO,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,IAAI,CAAC,GAAG,MAAM,CAAC;IACf,IAAI,CAAC,GAAG,MAAM,CAAC;IACf,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC;QAChF,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QACrF,CAAC;QACD,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACX,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACb,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,OAAO,GAAG,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,UAAU,EAAE,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC;IAC/F,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAS,SAAS,CAChB,KAAqC,EACrC,SAA0B,EAC1B,SAA4B,EAC5B,SAA4B;IAE5B,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3E,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;IAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;IAC9C,MAAM,EAAE,GAAG,KAAK,CAAC,SAAS,GAAG,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAC7D,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/F,OAAO,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAC,QAAgB,EAAE,QAAgB,EAAE,UAAkB;IAC3E,IAAI,QAAQ,KAAK,UAAU;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IACtE,IAAI,QAAQ,KAAK,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IACtE,IAAI,UAAU,KAAK,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;IAEtE,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAClC,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,UAAU,CAAC,UAAU,CAAC,CAAC;IACtC,MAAM,KAAK,GAAgB;QACzB,GAAG,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACxE,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;KAC7E,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpG,yEAAyE;IACzE,2EAA2E;IAC3E,0EAA0E;IAC1E,gCAAgC;IAChC,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GACT,KAAK;YACL,CAAC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG;gBACzB,CAAC,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,GAAG;oBAC3B,IAAI,CAAC,UAAU,KAAK,CAAC;oBACrB,KAAK,CAAC,KAAK,CAAC,IAAI,CACd,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,CACpF,CAAC,CAAC,CAAC;QACV,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;QACpE,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/F,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;QAC/D,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;QACnE,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpE,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1E,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,KAAK,YAAY,EAAE,CAAC;YAC5D,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvB,CAAC;aAAM,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzB,CAAC;aAAM,CAAC;YACN,sEAAsE;YACtE,sCAAsC;YACtC,SAAS,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;YACvG,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvB,CAAC;QACD,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC;IACrB,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC;AAC3C,CAAC"}

package/package.json

@@ -0,0 +1,48 @@
+{
+  "name": "@amalgm/live",
+  "version": "0.1.0",
+  "description": "Portable realtime SDK for Amalgm — wire contracts, mutation discipline, and delivery state machines behind host-injected adapters.",
+  "type": "module",
+  "license": "UNLICENSED",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/amalgm-inc/amalgm-live.git"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    },
+    "./contracts": {
+      "types": "./dist/contracts/index.d.ts",
+      "default": "./dist/contracts/index.js"
+    },
+    "./machines": {
+      "types": "./dist/machines/index.d.ts",
+      "default": "./dist/machines/index.js"
+    },
+    "./adapters": {
+      "types": "./dist/adapters/index.d.ts",
+      "default": "./dist/adapters/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "PURPOSE.md"
+  ],
+  "engines": {
+    "node": ">=18"
+  },
+  "scripts": {
+    "build": "tsc -p tsconfig.json",
+    "test": "npm run build && node --test tests/",
+    "test:parity": "npm run build && node --test tests/parity/",
+    "test:conformance": "npm run build && node --test tests/conformance/"
+  },
+  "devDependencies": {
+    "typescript": "^5.7.3"
+  }
+}