actor-ts 0.9.0

package/dist/crdt/ORMap.d.ts

@@ -0,0 +1,104 @@
+import type { Crdt, ReplicaId } from './Crdt.js';
+import { type ORSetJson } from './ORSet.js';
+/**
+ * Observed-Remove map, where each **value** is itself a CRDT.  Keys
+ * follow OR-Set add-wins semantics; values merge per-key via their
+ * own `merge`.  The natural fit when you want a logical map and each
+ * cell needs its own conflict-free type — e.g. carts where every
+ * cart is itself an `ORSet` of items, or per-tenant settings where
+ * each tenant's settings is an `LWWMap`.
+ *
+ *   const empty = ORMap.empty<string, ORSet<string>>();
+ *   const a = empty.update('alice', 'cart-1', () => ORSet.empty<string>(),
+ *               (cart) => cart.add('alice', 'apple'));
+ *   const b = empty.update('bob',   'cart-1', () => ORSet.empty<string>(),
+ *               (cart) => cart.add('bob', 'banana'));
+ *   a.merge(b).get('cart-1')!.value()
+ *   // → ['apple', 'banana']  (per-key inner-CRDT merge)
+ *
+ * **Add-wins for keys.**  Concurrent `put(key) | remove(key)` resolves
+ * via the underlying `ORSet`'s tag rules: the `put` carries a tag the
+ * `remove` never saw, so it survives.  See {@link ORSet} for the
+ * formal mechanism.
+ *
+ * **Inner-CRDT decoder injection (fromJSON).**  Because the value
+ * type is itself a CRDT, deserialisation needs to know **which**
+ * CRDT to build for each value.  Pass a `decodeValue: (json) => V`
+ * callback to `fromJSON`; the `DistributedData` extension wires its
+ * `decodeCrdt` dispatcher in for you.  Standalone usage:
+ *
+ *   ORMap.fromJSON(json, (v) => ORSet.fromJSON<string>(v as ORSetJson))
+ *
+ * **Element identity.**  Same JSON-stringify default + `identity`
+ * override pattern as the rest of the map types — pass
+ * `{ identity: k => ... }` for non-JSON-serialisable keys.
+ */
+export interface ORMapOptions<K> {
+    readonly identity?: (k: K) => string;
+}
+export declare class ORMap<K, V extends Crdt<V>> implements Crdt<ORMap<K, V>> {
+    private readonly keyset;
+    private readonly entries;
+    private readonly identity;
+    /**
+     * Logical structure:
+     *   - `keyset`: an `ORSet` of identity-strings (the dedup keys),
+     *     handling add-wins semantics for membership.
+     *   - `entries`: `identity(K) → { key, value }`, holding the actual
+     *     values keyed by the same identity-string.  We store the
+     *     original `K` so iteration returns the user's instance.
+     *
+     * Invariant: every `entries` key is a member of `keyset`.  On merge
+     * we drop value entries whose identity is no longer in the merged
+     * keyset (i.e. a remove dominated the add).
+     */
+    private constructor();
+    static empty<K, V extends Crdt<V>>(opts?: ORMapOptions<K>): ORMap<K, V>;
+    /** Set `key` to `value` on `replica`. */
+    put(replica: ReplicaId, key: K, value: V): ORMap<K, V>;
+    /**
+     * Mutate the value under `key` in place (functionally — returns a
+     * new map).  If the key doesn't exist yet, `factory()` provides the
+     * empty CRDT.  Equivalent to `put(replica, key, fn(get(key) ?? factory()))`
+     * but with a single re-tag, so concurrent `update` + `remove`
+     * resolves the same as concurrent `put` + `remove` would.
+     */
+    update(replica: ReplicaId, key: K, factory: () => V, fn: (current: V) => V): ORMap<K, V>;
+    /**
+     * Remove `key`.  Concurrent puts with tags this remove never saw
+     * survive — keyset-level OR-Set semantics decide liveness.  We keep
+     * the value entry around even after a remove because a future merge
+     * with a peer that re-added the key needs both sides' inner-CRDT
+     * state to compute the right merged value (associativity demands
+     * it; without it, `merge(a, b).merge(c)` can drop state that
+     * `merge(a, merge(b, c))` would preserve).  Read APIs filter by
+     * keyset so stale entries are invisible to users.
+     */
+    remove(key: K): ORMap<K, V>;
+    /** Read `key` — `undefined` if not present. */
+    get(key: K): V | undefined;
+    has(key: K): boolean;
+    /** Snapshot of currently-live keys. */
+    keys(): ReadonlyArray<K>;
+    /** Snapshot of `[key, value]` pairs. */
+    entriesArray(): ReadonlyArray<readonly [K, V]>;
+    get size(): number;
+    merge(other: ORMap<K, V>): ORMap<K, V>;
+    toJSON(): ORMapJson;
+    /**
+     * Reconstruct an ORMap.  `decodeValue` must build the inner CRDT
+     * from its JSON shape — typically `(json) => SomeCrdt.fromJSON(json)`.
+     * The `DistributedData` extension provides a `decodeCrdt` that
+     * dispatches across every registered CRDT kind.
+     */
+    static fromJSON<K, V extends Crdt<V>>(json: ORMapJson, decodeValue: (json: unknown) => V, opts?: ORMapOptions<K>): ORMap<K, V>;
+    equals(other: ORMap<K, V>): boolean;
+}
+export interface ORMapJson {
+    readonly kind: 'ORMap';
+    readonly keyset: ORSetJson;
+    /** Per-key inner-CRDT JSON.  Decoder supplied at fromJSON time. */
+    readonly values: Record<string, unknown>;
+    readonly keyValues?: Record<string, string>;
+}
+//# sourceMappingURL=ORMap.d.ts.map

package/dist/crdt/ORMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ORMap.d.ts","sourceRoot":"","sources":["../../src/crdt/ORMap.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAS,KAAK,SAAS,EAAE,MAAM,YAAY,CAAC;AAEnD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAEH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;CACtC;AASD,qBAAa,KAAK,CAAC,CAAC,EAAE,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAcjE,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAf3B;;;;;;;;;;;OAWG;IACH,OAAO;IAMP,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,YAAY,CAAC,CAAC,CAAM,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAQ3E,yCAAyC;IACzC,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAQtD;;;;;;OAMG;IACH,MAAM,CACJ,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAC1B,OAAO,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,GACtC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAKd;;;;;;;;;OASG;IACH,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAM3B,+CAA+C;IAC/C,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAM1B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,uCAAuC;IACvC,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC;IAQxB,wCAAwC;IACxC,YAAY,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAQ9C,IAAI,IAAI,IAAI,MAAM,CAIjB;IAED,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAyBtC,MAAM,IAAI,SAAS;IAgBnB;;;;;OAKG;IACH,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,EAClC,IAAI,EAAE,SAAS,EACf,WAAW,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,CAAC,EACjC,IAAI,GAAE,YAAY,CAAC,CAAC,CAAM,GACzB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAed,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO;CAiBpC;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,mEAAmE;IACnE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACzC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7C"}

package/dist/crdt/ORMap.js

@@ -0,0 +1,178 @@
+import { ORSet } from './ORSet.js';
+const defaultIdentity = (k) => JSON.stringify(k);
+export class ORMap {
+    keyset;
+    entries;
+    identity;
+    /**
+     * Logical structure:
+     *   - `keyset`: an `ORSet` of identity-strings (the dedup keys),
+     *     handling add-wins semantics for membership.
+     *   - `entries`: `identity(K) → { key, value }`, holding the actual
+     *     values keyed by the same identity-string.  We store the
+     *     original `K` so iteration returns the user's instance.
+     *
+     * Invariant: every `entries` key is a member of `keyset`.  On merge
+     * we drop value entries whose identity is no longer in the merged
+     * keyset (i.e. a remove dominated the add).
+     */
+    constructor(keyset, entries, identity) {
+        this.keyset = keyset;
+        this.entries = entries;
+        this.identity = identity;
+    }
+    static empty(opts = {}) {
+        return new ORMap(ORSet.empty(), new Map(), opts.identity ?? defaultIdentity);
+    }
+    /** Set `key` to `value` on `replica`. */
+    put(replica, key, value) {
+        const id = this.identity(key);
+        const nextKeyset = this.keyset.add(replica, id);
+        const nextEntries = new Map(this.entries);
+        nextEntries.set(id, { key, value });
+        return new ORMap(nextKeyset, nextEntries, this.identity);
+    }
+    /**
+     * Mutate the value under `key` in place (functionally — returns a
+     * new map).  If the key doesn't exist yet, `factory()` provides the
+     * empty CRDT.  Equivalent to `put(replica, key, fn(get(key) ?? factory()))`
+     * but with a single re-tag, so concurrent `update` + `remove`
+     * resolves the same as concurrent `put` + `remove` would.
+     */
+    update(replica, key, factory, fn) {
+        const current = this.get(key) ?? factory();
+        return this.put(replica, key, fn(current));
+    }
+    /**
+     * Remove `key`.  Concurrent puts with tags this remove never saw
+     * survive — keyset-level OR-Set semantics decide liveness.  We keep
+     * the value entry around even after a remove because a future merge
+     * with a peer that re-added the key needs both sides' inner-CRDT
+     * state to compute the right merged value (associativity demands
+     * it; without it, `merge(a, b).merge(c)` can drop state that
+     * `merge(a, merge(b, c))` would preserve).  Read APIs filter by
+     * keyset so stale entries are invisible to users.
+     */
+    remove(key) {
+        const id = this.identity(key);
+        const nextKeyset = this.keyset.remove(id);
+        return new ORMap(nextKeyset, this.entries, this.identity);
+    }
+    /** Read `key` — `undefined` if not present. */
+    get(key) {
+        const id = this.identity(key);
+        if (!this.keyset.has(id))
+            return undefined;
+        return this.entries.get(id)?.value;
+    }
+    has(key) {
+        return this.keyset.has(this.identity(key));
+    }
+    /** Snapshot of currently-live keys. */
+    keys() {
+        const out = [];
+        for (const [id, entry] of this.entries) {
+            if (this.keyset.has(id))
+                out.push(entry.key);
+        }
+        return out;
+    }
+    /** Snapshot of `[key, value]` pairs. */
+    entriesArray() {
+        const out = [];
+        for (const [id, entry] of this.entries) {
+            if (this.keyset.has(id))
+                out.push([entry.key, entry.value]);
+        }
+        return out;
+    }
+    get size() {
+        let n = 0;
+        for (const id of this.entries.keys())
+            if (this.keyset.has(id))
+                n++;
+        return n;
+    }
+    merge(other) {
+        const mergedKeyset = this.keyset.merge(other.keyset);
+        const mergedEntries = new Map();
+        // Iterate over the union of every id either side has ever seen —
+        // not just `mergedKeyset.value()` (the live ids).  An id that's
+        // currently tombstoned can be revived by a later merge with a
+        // peer holding a fresh add tag; the inner-CRDT merge then needs
+        // both sides' historical values.  Read APIs filter by keyset so
+        // tombstoned entries stay invisible.
+        const allIds = new Set([...this.entries.keys(), ...other.entries.keys()]);
+        for (const id of allIds) {
+            const a = this.entries.get(id);
+            const b = other.entries.get(id);
+            if (a && b) {
+                mergedEntries.set(id, { key: a.key, value: a.value.merge(b.value) });
+            }
+            else if (a) {
+                mergedEntries.set(id, a);
+            }
+            else if (b) {
+                mergedEntries.set(id, b);
+            }
+        }
+        return new ORMap(mergedKeyset, mergedEntries, this.identity);
+    }
+    toJSON() {
+        const values = {};
+        const keyValues = {};
+        for (const [id, entry] of this.entries) {
+            // Each value is a CRDT — its toJSON is the standard discriminated shape.
+            values[id] = entry.value.toJSON();
+            keyValues[id] = JSON.stringify(entry.key);
+        }
+        return {
+            kind: 'ORMap',
+            keyset: this.keyset.toJSON(),
+            values,
+            keyValues,
+        };
+    }
+    /**
+     * Reconstruct an ORMap.  `decodeValue` must build the inner CRDT
+     * from its JSON shape — typically `(json) => SomeCrdt.fromJSON(json)`.
+     * The `DistributedData` extension provides a `decodeCrdt` that
+     * dispatches across every registered CRDT kind.
+     */
+    static fromJSON(json, decodeValue, opts = {}) {
+        if (json.kind !== 'ORMap') {
+            throw new Error(`ORMap.fromJSON: unexpected kind ${json.kind}`);
+        }
+        const identity = opts.identity ?? defaultIdentity;
+        const keyset = ORSet.fromJSON(json.keyset);
+        const entries = new Map();
+        for (const [id, valueJson] of Object.entries(json.values)) {
+            const raw = json.keyValues?.[id];
+            const key = raw !== undefined ? JSON.parse(raw) : JSON.parse(id);
+            entries.set(id, { key, value: decodeValue(valueJson) });
+        }
+        return new ORMap(keyset, entries, identity);
+    }
+    equals(other) {
+        if (!this.keyset.equals(other.keyset))
+            return false;
+        // Compare entries only for keys the keyset reports as live.  Stale
+        // entries (kept around in `entries` to support associative merges)
+        // are an implementation detail that mustn't leak into equality.
+        for (const id of this.keyset.value()) {
+            const a = this.entries.get(id);
+            const b = other.entries.get(id);
+            if (!a || !b)
+                return a === b;
+            if (typeof a.value.equals === 'function') {
+                if (!a.value.equals(b.value))
+                    return false;
+            }
+            else if (JSON.stringify(a.value.toJSON()) !== JSON.stringify(b.value.toJSON())) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+//# sourceMappingURL=ORMap.js.map

package/dist/crdt/ORMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ORMap.js","sourceRoot":"","sources":["../../src/crdt/ORMap.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAkB,MAAM,YAAY,CAAC;AAwCnD,MAAM,eAAe,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAOlE,MAAM,OAAO,KAAK;IAcG;IACA;IACA;IAfnB;;;;;;;;;;;OAWG;IACH,YACmB,MAAqB,EACrB,OAAyC,EACzC,QAA0B;QAF1B,WAAM,GAAN,MAAM,CAAe;QACrB,YAAO,GAAP,OAAO,CAAkC;QACzC,aAAQ,GAAR,QAAQ,CAAkB;IAC1C,CAAC;IAEJ,MAAM,CAAC,KAAK,CAAuB,OAAwB,EAAE;QAC3D,OAAO,IAAI,KAAK,CACd,KAAK,CAAC,KAAK,EAAU,EACrB,IAAI,GAAG,EAAE,EACT,IAAI,CAAC,QAAQ,IAAK,eAAoC,CACvD,CAAC;IACJ,CAAC;IAED,yCAAyC;IACzC,GAAG,CAAC,OAAkB,EAAE,GAAM,EAAE,KAAQ;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1C,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QACpC,OAAO,IAAI,KAAK,CAAO,UAAU,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjE,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CACJ,OAAkB,EAAE,GAAM,EAC1B,OAAgB,EAAE,EAAqB;QAEvC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;QAC3C,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,GAAM;QACX,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1C,OAAO,IAAI,KAAK,CAAO,UAAU,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClE,CAAC;IAED,+CAA+C;IAC/C,GAAG,CAAC,GAAM;QACR,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,SAAS,CAAC;QAC3C,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC;IACrC,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,uCAAuC;IACvC,IAAI;QACF,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,wCAAwC;IACxC,YAAY;QACV,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAU,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAI,IAAI;QACN,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;YAAE,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,CAAC,EAAE,CAAC;QACnE,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK,CAAC,KAAkB;QACtB,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAC;QAErD,iEAAiE;QACjE,gEAAgE;QAChE,8DAA8D;QAC9D,gEAAgE;QAChE,gEAAgE;QAChE,qCAAqC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClF,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACX,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACvE,CAAC;iBAAM,IAAI,CAAC,EAAE,CAAC;gBACb,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3B,CAAC;iBAAM,IAAI,CAAC,EAAE,CAAC;gBACb,aAAa,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,IAAI,KAAK,CAAO,YAAY,EAAE,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrE,CAAC;IAED,MAAM;QACJ,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,yEAAyE;YACzE,MAAM,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAClC,SAAS,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO;YACL,IAAI,EAAE,OAAO;YACb,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;YAC5B,MAAM;YACN,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,QAAQ,CACb,IAAe,EACf,WAAiC,EACjC,OAAwB,EAAE;QAE1B,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,mCAAmC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAClE,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAK,eAAoC,CAAC;QACxE,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAS,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAO,CAAC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAO,CAAC;YAC/E,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,IAAI,KAAK,CAAO,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,CAAC,KAAkB;QACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QACpD,mEAAmE;QACnE,mEAAmE;QACnE,gEAAgE;QAChE,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;YACrC,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,OAAQ,CAAC,CAAC,KAA8B,CAAC,MAAM,KAAK,UAAU,EAAE,CAAC;gBACnE,IAAI,CAAE,CAAC,CAAC,KAA8C,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;YACvF,CAAC;iBAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;gBACjF,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/crdt/ORSet.d.ts

@@ -0,0 +1,81 @@
+import type { Crdt, ReplicaId } from './Crdt.js';
+/**
+ * Observed-Remove Set.  Like a regular set with `add` / `remove` —
+ * but with a twist that makes concurrent ops converge: every `add`
+ * stamps the element with a **unique tag**, and `remove(e)` removes
+ * **only the tags currently present at the removing replica**.
+ *
+ * Why that matters: if replica A removes `e` while replica B
+ * concurrently adds a fresh `e`, B's add carries a tag A never saw,
+ * so the merged result still contains `e`.  This is the "add wins"
+ * semantics that makes OR-Set a popular choice for shopping carts,
+ * presence sets, etc.
+ *
+ *   // Concurrent add (B) and remove (A)
+ *   const a0 = ORSet.empty<string>().add('node-a', 'apple');
+ *   const b0 = a0;                                  // both replicas see one entry
+ *   const a1 = a0.remove('apple');                  // A removes
+ *   const b1 = b0.add('node-b', 'apple');           // B re-adds with a fresh tag
+ *   a1.merge(b1).value()                            // → ['apple'] (add wins)
+ *
+ * **Tag generation**: each add takes a `replicaId` and combines it
+ * with a per-replica monotonic counter so tags are unique even
+ * across calls in the same millisecond.  The counter is part of the
+ * CRDT state; we keep one counter per replica and bump it on every add.
+ *
+ * **Element identity**.  By default elements are deduplicated by
+ * `JSON.stringify(element)` — same caveats as `GSet`: BigInt throws,
+ * Map/Set silently over-deduplicate, Date round-trips lossily.  Pass
+ * an `identity: (e) => string` option to override:
+ *
+ *   const cart = ORSet.empty<Item>({ identity: (i) => i.sku });
+ */
+export interface ORSetOptions<E> {
+    /** Custom identity function — see class doc. */
+    readonly identity?: (e: E) => string;
+}
+export declare class ORSet<E> implements Crdt<ORSet<E>> {
+    private readonly elements;
+    private readonly tombstones;
+    private readonly counters;
+    private readonly identity;
+    /**
+     * `elements`   — element-key (identity-fn output) → entry holding
+     *                the original element instance plus its current
+     *                tag set.  Storing the element (not just its
+     *                identity-string) lets `value()` return the
+     *                original instances even when a custom identity
+     *                callback is configured.
+     * `tombstones` — tags removed for an element-key.  Veto on merge
+     *                so a stale state from a slow peer can't resurrect
+     *                an already-removed tag.
+     * `counters`   — per-replica monotonic seq used to mint fresh tags.
+     */
+    private constructor();
+    static empty<E>(opts?: ORSetOptions<E>): ORSet<E>;
+    add(replica: ReplicaId, element: E): ORSet<E>;
+    /**
+     * Remove every tag currently present for `element`.  Concurrent
+     * adds carrying tags this replica hasn't observed survive the
+     * merge — that's the OR-Set "add wins" property.
+     */
+    remove(element: E): ORSet<E>;
+    has(element: E): boolean;
+    value(): ReadonlyArray<E>;
+    get size(): number;
+    merge(other: ORSet<E>): ORSet<E>;
+    toJSON(): ORSetJson;
+    static fromJSON<E>(json: ORSetJson, opts?: ORSetOptions<E>): ORSet<E>;
+    equals(other: ORSet<E>): boolean;
+}
+export interface ORSetJson {
+    readonly kind: 'ORSet';
+    /** Per-element-key tag list. */
+    readonly elements: Record<string, string[]>;
+    /** Per-element-key JSON-stringified element value.  Optional for
+     *  backwards-compat with v0 wire shape (default identity only). */
+    readonly elementValues?: Record<string, string>;
+    readonly tombstones: Record<string, string[]>;
+    readonly counters: Record<ReplicaId, number>;
+}
+//# sourceMappingURL=ORSet.d.ts.map

package/dist/crdt/ORSet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ORSet.d.ts","sourceRoot":"","sources":["../../src/crdt/ORSet.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEjD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B,gDAAgD;IAChD,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;CACtC;AASD,qBAAa,KAAK,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAc3C,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IACzB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAhB3B;;;;;;;;;;;OAWG;IACH,OAAO;IAOP,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,GAAE,YAAY,CAAC,CAAC,CAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IAOrD,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAiB7C;;;;OAIG;IACH,MAAM,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAgB5B,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,OAAO;IAIxB,KAAK,IAAI,aAAa,CAAC,CAAC,CAAC;IAQzB,IAAI,IAAI,IAAI,MAAM,CAIjB;IAED,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAkChC,MAAM,IAAI,SAAS;IAqBnB,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,GAAE,YAAY,CAAC,CAAC,CAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IAsBzE,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO;CAUjC;AA+CD,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,gCAAgC;IAChC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC5C;uEACmE;IACnE,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChD,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC9C,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;CAC9C"}

package/dist/crdt/ORSet.js

@@ -0,0 +1,206 @@
+const defaultIdentity = (e) => JSON.stringify(e);
+export class ORSet {
+    elements;
+    tombstones;
+    counters;
+    identity;
+    /**
+     * `elements`   — element-key (identity-fn output) → entry holding
+     *                the original element instance plus its current
+     *                tag set.  Storing the element (not just its
+     *                identity-string) lets `value()` return the
+     *                original instances even when a custom identity
+     *                callback is configured.
+     * `tombstones` — tags removed for an element-key.  Veto on merge
+     *                so a stale state from a slow peer can't resurrect
+     *                an already-removed tag.
+     * `counters`   — per-replica monotonic seq used to mint fresh tags.
+     */
+    constructor(elements, tombstones, counters, identity) {
+        this.elements = elements;
+        this.tombstones = tombstones;
+        this.counters = counters;
+        this.identity = identity;
+    }
+    static empty(opts = {}) {
+        return new ORSet(new Map(), new Map(), new Map(), opts.identity ?? defaultIdentity);
+    }
+    add(replica, element) {
+        const key = this.identity(element);
+        const seq = (this.counters.get(replica) ?? 0) + 1;
+        const tag = `${replica}#${seq}`;
+        const nextElements = new Map(this.elements);
+        const existing = nextElements.get(key);
+        const tagsForKey = new Set(existing?.tags ?? []);
+        tagsForKey.add(tag);
+        nextElements.set(key, { element, tags: tagsForKey });
+        const nextCounters = new Map(this.counters);
+        nextCounters.set(replica, seq);
+        return new ORSet(nextElements, this.tombstones, nextCounters, this.identity);
+    }
+    /**
+     * Remove every tag currently present for `element`.  Concurrent
+     * adds carrying tags this replica hasn't observed survive the
+     * merge — that's the OR-Set "add wins" property.
+     */
+    remove(element) {
+        const key = this.identity(element);
+        const existing = this.elements.get(key);
+        if (!existing || existing.tags.size === 0)
+            return this;
+        const nextElements = new Map(this.elements);
+        nextElements.delete(key);
+        const nextTombstones = new Map(this.tombstones);
+        const t = new Set(nextTombstones.get(key) ?? []);
+        for (const tag of existing.tags)
+            t.add(tag);
+        nextTombstones.set(key, t);
+        return new ORSet(nextElements, nextTombstones, this.counters, this.identity);
+    }
+    has(element) {
+        return (this.elements.get(this.identity(element))?.tags.size ?? 0) > 0;
+    }
+    value() {
+        const out = [];
+        for (const entry of this.elements.values()) {
+            if (entry.tags.size > 0)
+                out.push(entry.element);
+        }
+        return out;
+    }
+    get size() {
+        let count = 0;
+        for (const entry of this.elements.values())
+            if (entry.tags.size > 0)
+                count++;
+        return count;
+    }
+    merge(other) {
+        // 1. Tombstones are unioned — once removed, always removed.
+        const mergedTombstones = unionMapOfSets(this.tombstones, other.tombstones);
+        // 2. Elements are merged per-key: union the tag sets, drop any
+        //    tag that appears in the merged tombstones, then drop empty
+        //    entries so `has` / `value` reflect cleanly.
+        const allKeys = new Set([...this.elements.keys(), ...other.elements.keys()]);
+        const mergedElements = new Map();
+        for (const key of allKeys) {
+            const a = this.elements.get(key);
+            const b = other.elements.get(key);
+            const tomb = mergedTombstones.get(key) ?? EMPTY_SET;
+            const merged = new Set();
+            if (a)
+                for (const t of a.tags)
+                    if (!tomb.has(t))
+                        merged.add(t);
+            if (b)
+                for (const t of b.tags)
+                    if (!tomb.has(t))
+                        merged.add(t);
+            if (merged.size > 0) {
+                // Prefer the locally-known element; fall back to the peer's.
+                const element = a?.element ?? b?.element;
+                mergedElements.set(key, { element, tags: merged });
+            }
+        }
+        // 3. Counters: per-replica max so the next-issued tag is fresh
+        //    no matter which replica the merged state is used on.
+        const mergedCounters = new Map(this.counters);
+        for (const [replica, seq] of other.counters) {
+            const ours = mergedCounters.get(replica) ?? 0;
+            if (seq > ours)
+                mergedCounters.set(replica, seq);
+        }
+        return new ORSet(mergedElements, mergedTombstones, mergedCounters, this.identity);
+    }
+    toJSON() {
+        // Wire shape — each element is JSON-stringified verbatim so
+        // the default round-trip works.  Custom identity does NOT
+        // change the wire shape: callers must pass the same `identity`
+        // option to `fromJSON` to reconstruct a set with the same
+        // dedup rule.
+        const elements = {};
+        const elementValues = {};
+        for (const [key, entry] of this.elements) {
+            elements[key] = Array.from(entry.tags);
+            elementValues[key] = JSON.stringify(entry.element);
+        }
+        return {
+            kind: 'ORSet',
+            elements,
+            elementValues,
+            tombstones: mapOfSetsToObject(this.tombstones),
+            counters: Object.fromEntries(this.counters),
+        };
+    }
+    static fromJSON(json, opts = {}) {
+        if (json.kind !== 'ORSet')
+            throw new Error(`ORSet.fromJSON: unexpected kind ${json.kind}`);
+        const identity = opts.identity ?? defaultIdentity;
+        const elements = new Map();
+        for (const [key, tags] of Object.entries(json.elements)) {
+            // Backwards-compat: old wire shape didn't carry
+            // `elementValues` — fall back to JSON.parse(key) which is
+            // exactly the default-identity round-trip.
+            const raw = json.elementValues?.[key];
+            const element = raw !== undefined
+                ? JSON.parse(raw)
+                : JSON.parse(key);
+            elements.set(key, { element, tags: new Set(tags) });
+        }
+        return new ORSet(elements, objectToMapOfSets(json.tombstones), new Map(Object.entries(json.counters)), identity);
+    }
+    equals(other) {
+        if (this.elements.size !== other.elements.size)
+            return false;
+        for (const [k, v] of this.elements) {
+            const o = other.elements.get(k);
+            if (!o)
+                return false;
+            if (v.tags.size !== o.tags.size)
+                return false;
+            for (const t of v.tags)
+                if (!o.tags.has(t))
+                    return false;
+        }
+        return mapOfSetsEqual(this.tombstones, other.tombstones);
+    }
+}
+const EMPTY_SET = new Set();
+function unionMapOfSets(a, b) {
+    const out = new Map();
+    const keys = new Set([...a.keys(), ...b.keys()]);
+    for (const k of keys) {
+        const merged = new Set(a.get(k) ?? []);
+        for (const v of (b.get(k) ?? []))
+            merged.add(v);
+        if (merged.size > 0)
+            out.set(k, merged);
+    }
+    return out;
+}
+function mapOfSetsEqual(a, b) {
+    if (a.size !== b.size)
+        return false;
+    for (const [k, va] of a) {
+        const vb = b.get(k);
+        if (!vb || vb.size !== va.size)
+            return false;
+        for (const t of va)
+            if (!vb.has(t))
+                return false;
+    }
+    return true;
+}
+function mapOfSetsToObject(m) {
+    const out = {};
+    for (const [k, v] of m)
+        out[k] = Array.from(v);
+    return out;
+}
+function objectToMapOfSets(obj) {
+    const out = new Map();
+    for (const [k, v] of Object.entries(obj))
+        out.set(k, new Set(v));
+    return out;
+}
+//# sourceMappingURL=ORSet.js.map

package/dist/crdt/ORSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ORSet.js","sourceRoot":"","sources":["../../src/crdt/ORSet.ts"],"names":[],"mappings":"AAuCA,MAAM,eAAe,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAOlE,MAAM,OAAO,KAAK;IAcG;IACA;IACA;IACA;IAhBnB;;;;;;;;;;;OAWG;IACH,YACmB,QAA8C,EAC9C,UAAoD,EACpD,QAAwC,EACxC,QAA0B;QAH1B,aAAQ,GAAR,QAAQ,CAAsC;QAC9C,eAAU,GAAV,UAAU,CAA0C;QACpD,aAAQ,GAAR,QAAQ,CAAgC;QACxC,aAAQ,GAAR,QAAQ,CAAkB;IAC1C,CAAC;IAEJ,MAAM,CAAC,KAAK,CAAI,OAAwB,EAAE;QACxC,OAAO,IAAI,KAAK,CACd,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAC/B,IAAI,CAAC,QAAQ,IAAK,eAAoC,CACvD,CAAC;IACJ,CAAC;IAED,GAAG,CAAC,OAAkB,EAAE,OAAU;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAClD,MAAM,GAAG,GAAG,GAAG,OAAO,IAAI,GAAG,EAAE,CAAC;QAEhC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC;QACjD,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QAErD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAE/B,OAAO,IAAI,KAAK,CAAI,YAAY,EAAE,IAAI,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClF,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,OAAU;QACf,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAEvD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAEzB,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;QACjD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,IAAI;YAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5C,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAE3B,OAAO,IAAI,KAAK,CAAI,YAAY,EAAE,cAAc,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClF,CAAC;IAED,GAAG,CAAC,OAAU;QACZ,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACzE,CAAC;IAED,KAAK;QACH,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAI,IAAI;QACN,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;YAAE,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;gBAAE,KAAK,EAAE,CAAC;QAC7E,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,KAAe;QACnB,4DAA4D;QAC5D,MAAM,gBAAgB,GAAG,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;QAE3E,+DAA+D;QAC/D,gEAAgE;QAChE,iDAAiD;QACjD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACrF,MAAM,cAAc,GAAG,IAAI,GAAG,EAA2B,CAAC;QAC1D,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC;YACpD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;YACjC,IAAI,CAAC;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,IAAI,CAAC;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACpB,6DAA6D;gBAC7D,MAAM,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,CAAC,EAAE,OAAY,CAAC;gBAC9C,cAAc,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,+DAA+D;QAC/D,0DAA0D;QAC1D,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,GAAG,GAAG,IAAI;gBAAE,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACnD,CAAC;QAED,OAAO,IAAI,KAAK,CAAI,cAAc,EAAE,gBAAgB,EAAE,cAAc,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvF,CAAC;IAED,MAAM;QACJ,4DAA4D;QAC5D,0DAA0D;QAC1D,+DAA+D;QAC/D,0DAA0D;QAC1D,cAAc;QACd,MAAM,QAAQ,GAA6B,EAAE,CAAC;QAC9C,MAAM,aAAa,GAA2B,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACvC,aAAa,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACrD,CAAC;QACD,OAAO;YACL,IAAI,EAAE,OAAO;YACb,QAAQ;YACR,aAAa;YACb,UAAU,EAAE,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC;YAC9C,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC;SAC5C,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,QAAQ,CAAI,IAAe,EAAE,OAAwB,EAAE;QAC5D,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC3F,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAK,eAAoC,CAAC;QACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2B,CAAC;QACpD,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACxD,gDAAgD;YAChD,0DAA0D;YAC1D,2CAA2C;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC;YACtC,MAAM,OAAO,GAAM,GAAG,KAAK,SAAS;gBAClC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAO;gBACxB,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAO,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,IAAI,KAAK,CACd,QAAQ,EACR,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,EAClC,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EACtC,QAAQ,CACT,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,KAAe;QACpB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,KAAK,CAAC,QAAQ,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC7D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC9C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;gBAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;QAC3D,CAAC;QACD,OAAO,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAC3D,CAAC;CACF;AAED,MAAM,SAAS,GAAwB,IAAI,GAAG,EAAE,CAAC;AAEjD,SAAS,cAAc,CACrB,CAA2C,EAC3C,CAA2C;IAE3C,MAAM,GAAG,GAAG,IAAI,GAAG,EAA+B,CAAC;IACnD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACzD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC1C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,cAAc,CACrB,CAA2C,EAC3C,CAA2C;IAE3C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;IACnD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,iBAAiB,CACxB,CAA2C;IAE3C,MAAM,GAAG,GAA6B,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,iBAAiB,CACxB,GAA6B;IAE7B,MAAM,GAAG,GAAG,IAAI,GAAG,EAA+B,CAAC;IACnD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/crdt/PNCounter.d.ts

@@ -0,0 +1,34 @@
+import type { Crdt, ReplicaId } from './Crdt.js';
+import { type GCounterJson } from './GCounter.js';
+/**
+ * Positive/Negative counter — supports both increments and decrements
+ * by tracking two grow-only counters: `p` (sum of increments) and
+ * `n` (sum of decrements).  Final value = `p.value() - n.value()`.
+ *
+ * Use this when the count can go up AND down — items in a cart,
+ * connected sessions, available inventory.  For pure-increment
+ * workloads use the lighter {@link GCounter}.
+ *
+ *   const a = PNCounter.empty().increment('node-a', 5);
+ *   const b = PNCounter.empty().decrement('node-b', 2);
+ *   a.merge(b).value()                          // → 3
+ */
+export declare class PNCounter implements Crdt<PNCounter> {
+    private readonly p;
+    private readonly n;
+    private constructor();
+    static empty(): PNCounter;
+    increment(replica: ReplicaId, delta?: number): PNCounter;
+    decrement(replica: ReplicaId, delta?: number): PNCounter;
+    value(): number;
+    merge(other: PNCounter): PNCounter;
+    toJSON(): PNCounterJson;
+    static fromJSON(json: PNCounterJson): PNCounter;
+    equals(other: PNCounter): boolean;
+}
+export interface PNCounterJson {
+    readonly kind: 'PNCounter';
+    readonly p: GCounterJson;
+    readonly n: GCounterJson;
+}
+//# sourceMappingURL=PNCounter.d.ts.map

package/dist/crdt/PNCounter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PNCounter.d.ts","sourceRoot":"","sources":["../../src/crdt/PNCounter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAY,KAAK,YAAY,EAAE,MAAM,eAAe,CAAC;AAE5D;;;;;;;;;;;;GAYG;AACH,qBAAa,SAAU,YAAW,IAAI,CAAC,SAAS,CAAC;IAE7C,OAAO,CAAC,QAAQ,CAAC,CAAC;IAClB,OAAO,CAAC,QAAQ,CAAC,CAAC;IAFpB,OAAO;IAKP,MAAM,CAAC,KAAK,IAAI,SAAS;IAIzB,SAAS,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,GAAE,MAAU,GAAG,SAAS;IAK3D,SAAS,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,GAAE,MAAU,GAAG,SAAS;IAK3D,KAAK,IAAI,MAAM;IAEf,KAAK,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS;IAIlC,MAAM,IAAI,aAAa;IAIvB,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS;IAK/C,MAAM,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;CAGlC;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B,QAAQ,CAAC,CAAC,EAAE,YAAY,CAAC;IACzB,QAAQ,CAAC,CAAC,EAAE,YAAY,CAAC;CAC1B"}