actor-ts 0.9.0

package/dist/crdt/LWWMap.d.ts

@@ -0,0 +1,75 @@
+import type { Crdt, ReplicaId } from './Crdt.js';
+import { type LWWRegisterJson } from './LWWRegister.js';
+/**
+ * Map of last-writer-wins registers.  Each entry carries its own
+ * `(value, timestamp, replicaId)` tuple, and per-key conflict
+ * resolution is identical to {@link LWWRegister}: higher timestamp
+ * wins, ties broken by replica id.
+ *
+ * Pattern fits: per-key feature flags, per-user settings, profile
+ * fields where one writer at a time is normal but eventual
+ * consistency across replicas matters.
+ *
+ *   const m = LWWMap.empty<string, string>()
+ *     .put('a', 'theme', 'dark', 100)
+ *     .put('b', 'theme', 'light', 200);     // newer wins
+ *   m.get('theme')                             // → 'light'
+ *
+ * **Removal** is implemented as a tombstone — `remove(replica, key,
+ * timestamp)` writes a `null`-valued register at the given timestamp.
+ * On merge, a newer tombstone wins over an older value (key
+ * disappears) and a newer value wins over an older tombstone (key
+ * reappears).  `get()` returns `undefined` for tombstoned keys.
+ *
+ * **Wall-clock pitfall.**  Default timestamp is `Date.now()` — see
+ * `LWWRegister`'s class doc for the standard caveats.  Pass an
+ * explicit `timestamp` for HLC / Lamport-style semantics.
+ *
+ * **Element identity.**  Same JSON-stringify default + `identity`
+ * override pattern as `GSet` / `ORSet`.  Pass `{ identity: k => ... }`
+ * for non-JSON keys.
+ */
+export interface LWWMapOptions<K> {
+    readonly identity?: (k: K) => string;
+}
+export declare class LWWMap<K, V> implements Crdt<LWWMap<K, V>> {
+    private readonly entries;
+    private readonly identity;
+    /**
+     * `entries` is keyed by `identity(K)`; we keep the original `K`
+     * alongside so iteration returns the user's instance verbatim.
+     *
+     * Each entry's register holds either a real value or `null` (the
+     * tombstone marker).  We don't garbage-collect tombstones — they're
+     * needed to prevent a stale gossip from resurrecting a removed key.
+     */
+    private constructor();
+    static empty<K, V>(opts?: LWWMapOptions<K>): LWWMap<K, V>;
+    /** Set `key` to `value` on behalf of `replica`, stamped at `timestamp`. */
+    put(replica: ReplicaId, key: K, value: V, timestamp?: number): LWWMap<K, V>;
+    /**
+     * Tombstone `key` on behalf of `replica`.  Internally an `assign`
+     * with a `null` value at the given timestamp — older values are
+     * displaced; concurrent values with newer timestamps still win.
+     */
+    remove(replica: ReplicaId, key: K, timestamp?: number): LWWMap<K, V>;
+    /** Read `key` — `undefined` for missing keys or tombstones. */
+    get(key: K): V | undefined;
+    has(key: K): boolean;
+    /** Snapshot of currently-live keys (tombstones excluded). */
+    keys(): ReadonlyArray<K>;
+    /** Snapshot of currently-live `[key, value]` pairs. */
+    entriesArray(): ReadonlyArray<readonly [K, V]>;
+    /** Number of currently-live keys (tombstones excluded). */
+    get size(): number;
+    merge(other: LWWMap<K, V>): LWWMap<K, V>;
+    toJSON(): LWWMapJson<V>;
+    static fromJSON<K, V>(json: LWWMapJson<V>, opts?: LWWMapOptions<K>): LWWMap<K, V>;
+    equals(other: LWWMap<K, V>): boolean;
+}
+export interface LWWMapJson<V> {
+    readonly kind: 'LWWMap';
+    readonly registers: Record<string, LWWRegisterJson<V>>;
+    readonly keyValues?: Record<string, string>;
+}
+//# sourceMappingURL=LWWMap.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"LWWMap.d.ts","sourceRoot":"","sources":["../../src/crdt/LWWMap.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACjD,OAAO,EAAe,KAAK,eAAe,EAAE,MAAM,kBAAkB,CAAC;AAErE;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;CACtC;AASD,qBAAa,MAAM,CAAC,CAAC,EAAE,CAAC,CAAE,YAAW,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAUnD,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAV3B;;;;;;;OAOG;IACH,OAAO;IAKP,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,GAAE,aAAa,CAAC,CAAC,CAAM,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IAO7D,2EAA2E;IAC3E,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,GAAE,MAAmB,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IAUvF;;;;OAIG;IACH,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,SAAS,GAAE,MAAmB,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IAahF,+DAA+D;IAC/D,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAS1B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAEpB,6DAA6D;IAC7D,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC;IAQxB,uDAAuD;IACvD,YAAY,IAAI,aAAa,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAS9C,2DAA2D;IAC3D,IAAI,IAAI,IAAI,MAAM,CAIjB;IAED,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IAaxC,MAAM,IAAI,UAAU,CAAC,CAAC,CAAC;IAUvB,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAClB,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,GAAE,aAAa,CAAC,CAAC,CAAM,GAC/C,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;IAcf,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO;CASrC;AAED,MAAM,WAAW,UAAU,CAAC,CAAC;IAC3B,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC7C"}

package/dist/crdt/LWWMap.js

@@ -0,0 +1,136 @@
+import { LWWRegister } from './LWWRegister.js';
+const defaultIdentity = (k) => JSON.stringify(k);
+export class LWWMap {
+    entries;
+    identity;
+    /**
+     * `entries` is keyed by `identity(K)`; we keep the original `K`
+     * alongside so iteration returns the user's instance verbatim.
+     *
+     * Each entry's register holds either a real value or `null` (the
+     * tombstone marker).  We don't garbage-collect tombstones — they're
+     * needed to prevent a stale gossip from resurrecting a removed key.
+     */
+    constructor(entries, identity) {
+        this.entries = entries;
+        this.identity = identity;
+    }
+    static empty(opts = {}) {
+        return new LWWMap(new Map(), opts.identity ?? defaultIdentity);
+    }
+    /** Set `key` to `value` on behalf of `replica`, stamped at `timestamp`. */
+    put(replica, key, value, timestamp = Date.now()) {
+        const id = this.identity(key);
+        const existing = this.entries.get(id);
+        const register = (existing?.register ?? LWWRegister.empty())
+            .assign(replica, value, timestamp);
+        const next = new Map(this.entries);
+        next.set(id, { key: existing?.key ?? key, register });
+        return new LWWMap(next, this.identity);
+    }
+    /**
+     * Tombstone `key` on behalf of `replica`.  Internally an `assign`
+     * with a `null` value at the given timestamp — older values are
+     * displaced; concurrent values with newer timestamps still win.
+     */
+    remove(replica, key, timestamp = Date.now()) {
+        const id = this.identity(key);
+        const existing = this.entries.get(id);
+        // The register's internal value-type allows null already (its
+        // empty state), so we lean on that.  A tombstone is just a register
+        // whose value is null but whose timestamp says "I happened later".
+        const register = (existing?.register ?? LWWRegister.empty())
+            .assign(replica, null, timestamp);
+        const next = new Map(this.entries);
+        next.set(id, { key: existing?.key ?? key, register });
+        return new LWWMap(next, this.identity);
+    }
+    /** Read `key` — `undefined` for missing keys or tombstones. */
+    get(key) {
+        const e = this.entries.get(this.identity(key));
+        if (!e)
+            return undefined;
+        const v = e.register.value();
+        // Tombstones are stored as null; `undefined` is the user-facing
+        // "not present" answer for both missing and tombstoned keys.
+        return v === null ? undefined : v;
+    }
+    has(key) { return this.get(key) !== undefined; }
+    /** Snapshot of currently-live keys (tombstones excluded). */
+    keys() {
+        const out = [];
+        for (const e of this.entries.values()) {
+            if (e.register.value() !== null)
+                out.push(e.key);
+        }
+        return out;
+    }
+    /** Snapshot of currently-live `[key, value]` pairs. */
+    entriesArray() {
+        const out = [];
+        for (const e of this.entries.values()) {
+            const v = e.register.value();
+            if (v !== null)
+                out.push([e.key, v]);
+        }
+        return out;
+    }
+    /** Number of currently-live keys (tombstones excluded). */
+    get size() {
+        let n = 0;
+        for (const e of this.entries.values())
+            if (e.register.value() !== null)
+                n++;
+        return n;
+    }
+    merge(other) {
+        const next = new Map(this.entries);
+        for (const [id, entry] of other.entries) {
+            const ours = next.get(id);
+            if (!ours) {
+                next.set(id, entry);
+                continue;
+            }
+            next.set(id, {
+                key: ours.key,
+                register: ours.register.merge(entry.register),
+            });
+        }
+        return new LWWMap(next, this.identity);
+    }
+    toJSON() {
+        const registers = {};
+        const keyValues = {};
+        for (const [id, entry] of this.entries) {
+            registers[id] = entry.register.toJSON();
+            keyValues[id] = JSON.stringify(entry.key);
+        }
+        return { kind: 'LWWMap', registers, keyValues };
+    }
+    static fromJSON(json, opts = {}) {
+        if (json.kind !== 'LWWMap') {
+            throw new Error(`LWWMap.fromJSON: unexpected kind ${json.kind}`);
+        }
+        const identity = opts.identity ?? defaultIdentity;
+        const entries = new Map();
+        for (const [id, regJson] of Object.entries(json.registers)) {
+            const raw = json.keyValues?.[id];
+            const key = raw !== undefined ? JSON.parse(raw) : JSON.parse(id);
+            entries.set(id, { key, register: LWWRegister.fromJSON(regJson) });
+        }
+        return new LWWMap(entries, identity);
+    }
+    equals(other) {
+        if (this.entries.size !== other.entries.size)
+            return false;
+        for (const [id, entry] of this.entries) {
+            const o = other.entries.get(id);
+            if (!o)
+                return false;
+            if (!entry.register.equals(o.register))
+                return false;
+        }
+        return true;
+    }
+}
+//# sourceMappingURL=LWWMap.js.map

package/dist/crdt/LWWMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LWWMap.js","sourceRoot":"","sources":["../../src/crdt/LWWMap.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAwB,MAAM,kBAAkB,CAAC;AAoCrE,MAAM,eAAe,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAOlE,MAAM,OAAO,MAAM;IAUE;IACA;IAVnB;;;;;;;OAOG;IACH,YACmB,OAAyC,EACzC,QAA0B;QAD1B,YAAO,GAAP,OAAO,CAAkC;QACzC,aAAQ,GAAR,QAAQ,CAAkB;IAC1C,CAAC;IAEJ,MAAM,CAAC,KAAK,CAAO,OAAyB,EAAE;QAC5C,OAAO,IAAI,MAAM,CACf,IAAI,GAAG,EAAE,EACT,IAAI,CAAC,QAAQ,IAAK,eAAoC,CACvD,CAAC;IACJ,CAAC;IAED,2EAA2E;IAC3E,GAAG,CAAC,OAAkB,EAAE,GAAM,EAAE,KAAQ,EAAE,YAAoB,IAAI,CAAC,GAAG,EAAE;QACtE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,CAAC,QAAQ,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAK,EAAK,CAAC;aAC5D,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,IAAI,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC;QACtD,OAAO,IAAI,MAAM,CAAO,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,OAAkB,EAAE,GAAM,EAAE,YAAoB,IAAI,CAAC,GAAG,EAAE;QAC/D,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtC,8DAA8D;QAC9D,oEAAoE;QACpE,mEAAmE;QACnE,MAAM,QAAQ,GAAG,CAAC,QAAQ,EAAE,QAAQ,IAAI,WAAW,CAAC,KAAK,EAAK,CAAC;aAC5D,MAAM,CAAC,OAAO,EAAE,IAAoB,EAAE,SAAS,CAAC,CAAC;QACpD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,IAAI,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC;QACtD,OAAO,IAAI,MAAM,CAAO,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED,+DAA+D;IAC/D,GAAG,CAAC,GAAM;QACR,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC7B,gEAAgE;QAChE,6DAA6D;QAC7D,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,GAAG,CAAC,GAAM,IAAa,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC;IAE5D,6DAA6D;IAC7D,IAAI;QACF,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,uDAAuD;IACvD,YAAY;QACV,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAU,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2DAA2D;IAC3D,IAAI,IAAI;QACN,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;YAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,IAAI;gBAAE,CAAC,EAAE,CAAC;QAC5E,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK,CAAC,KAAmB;QACvB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnC,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC1B,IAAI,CAAC,IAAI,EAAE,CAAC;gBAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAAC,SAAS;YAAC,CAAC;YAC7C,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE;gBACX,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC;aAC9C,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,MAAM,CAAO,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM;QACJ,MAAM,SAAS,GAAuC,EAAE,CAAC;QACzD,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,SAAS,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACxC,SAAS,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;IAClD,CAAC;IAED,MAAM,CAAC,QAAQ,CACb,IAAmB,EAAE,OAAyB,EAAE;QAEhD,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAK,eAAoC,CAAC;QACxE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC/C,KAAK,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;YAC3D,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,QAAQ,EAAE,WAAW,CAAC,QAAQ,CAAI,OAAO,CAAC,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAI,MAAM,CAAO,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAED,MAAM,CAAC,KAAmB;QACxB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,KAAK,CAAC,OAAO,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC3D,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAAE,OAAO,KAAK,CAAC;QACvD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/crdt/LWWRegister.d.ts

@@ -0,0 +1,54 @@
+import type { Crdt, ReplicaId } from './Crdt.js';
+/**
+ * Last-Writer-Wins register.  A single value with a timestamp; on
+ * `merge` the higher timestamp wins.  Concurrent writes (same ts on
+ * two replicas) are resolved deterministically by `replicaId`
+ * lexicographic order — same input on every node, same winner.
+ *
+ * Use this for **single-value state** that's eventually consistent —
+ * a user's display name, a feature-flag value, the latest-known
+ * health status of a service.  When concurrent writes are common,
+ * pick a CRDT that captures both branches (e.g. an OR-Set of values)
+ * instead.
+ *
+ * **Wall-clock pitfall.**  Default timestamps come from `Date.now()`,
+ * which can drift between machines and even go backwards on the same
+ * machine (NTP correction).  In practice this means a write from a
+ * faster-clocked node always wins; if that's a problem, pass a
+ * `clock` option backed by a hybrid logical clock (HLC) or a Lamport
+ * counter.
+ *
+ *   const a = LWWRegister.empty<string>().assign('a', 'red');
+ *   const b = LWWRegister.empty<string>().assign('b', 'blue');
+ *   a.merge(b).value()   // → whichever assign() was called later
+ */
+export declare class LWWRegister<V> implements Crdt<LWWRegister<V>> {
+    private readonly _value;
+    private readonly _timestamp;
+    private readonly _replica;
+    private constructor();
+    /** Empty register — no value yet.  `value()` returns `null`. */
+    static empty<V>(): LWWRegister<V>;
+    /**
+     * Set the register to `value`, stamped with `timestamp` (default
+     * `Date.now()`) on behalf of `replica`.  The timestamp is what
+     * `merge` uses to decide who wins — pass an explicit one if you
+     * want HLC/Lamport semantics.
+     */
+    assign(replica: ReplicaId, value: V, timestamp?: number): LWWRegister<V>;
+    /** Current value, or `null` if no `assign` has been called. */
+    value(): V | null;
+    /** Timestamp of the last write — `0` for an empty register. */
+    timestamp(): number;
+    merge(other: LWWRegister<V>): LWWRegister<V>;
+    toJSON(): LWWRegisterJson<V>;
+    static fromJSON<V>(json: LWWRegisterJson<V>): LWWRegister<V>;
+    equals(other: LWWRegister<V>): boolean;
+}
+export interface LWWRegisterJson<V> {
+    readonly kind: 'LWWRegister';
+    readonly value: V | null;
+    readonly timestamp: number;
+    readonly replica: ReplicaId;
+}
+//# sourceMappingURL=LWWRegister.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"LWWRegister.d.ts","sourceRoot":"","sources":["../../src/crdt/LWWRegister.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEjD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,qBAAa,WAAW,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAEvD,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAH3B,OAAO;IAMP,gEAAgE;IAChE,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC;IAIjC;;;;;OAKG;IACH,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,GAAE,MAAmB,GAAG,WAAW,CAAC,CAAC,CAAC;IAIpF,+DAA+D;IAC/D,KAAK,IAAI,CAAC,GAAG,IAAI;IAEjB,+DAA+D;IAC/D,SAAS,IAAI,MAAM;IAEnB,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IAY5C,MAAM,IAAI,eAAe,CAAC,CAAC,CAAC;IAS5B,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;IAK5D,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO;CAKvC;AAED,MAAM,WAAW,eAAe,CAAC,CAAC;IAChC,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC;CAC7B"}

package/dist/crdt/LWWRegister.js

@@ -0,0 +1,83 @@
+/**
+ * Last-Writer-Wins register.  A single value with a timestamp; on
+ * `merge` the higher timestamp wins.  Concurrent writes (same ts on
+ * two replicas) are resolved deterministically by `replicaId`
+ * lexicographic order — same input on every node, same winner.
+ *
+ * Use this for **single-value state** that's eventually consistent —
+ * a user's display name, a feature-flag value, the latest-known
+ * health status of a service.  When concurrent writes are common,
+ * pick a CRDT that captures both branches (e.g. an OR-Set of values)
+ * instead.
+ *
+ * **Wall-clock pitfall.**  Default timestamps come from `Date.now()`,
+ * which can drift between machines and even go backwards on the same
+ * machine (NTP correction).  In practice this means a write from a
+ * faster-clocked node always wins; if that's a problem, pass a
+ * `clock` option backed by a hybrid logical clock (HLC) or a Lamport
+ * counter.
+ *
+ *   const a = LWWRegister.empty<string>().assign('a', 'red');
+ *   const b = LWWRegister.empty<string>().assign('b', 'blue');
+ *   a.merge(b).value()   // → whichever assign() was called later
+ */
+export class LWWRegister {
+    _value;
+    _timestamp;
+    _replica;
+    constructor(_value, _timestamp, _replica) {
+        this._value = _value;
+        this._timestamp = _timestamp;
+        this._replica = _replica;
+    }
+    /** Empty register — no value yet.  `value()` returns `null`. */
+    static empty() {
+        return new LWWRegister(null, 0, '');
+    }
+    /**
+     * Set the register to `value`, stamped with `timestamp` (default
+     * `Date.now()`) on behalf of `replica`.  The timestamp is what
+     * `merge` uses to decide who wins — pass an explicit one if you
+     * want HLC/Lamport semantics.
+     */
+    assign(replica, value, timestamp = Date.now()) {
+        return new LWWRegister(value, timestamp, replica);
+    }
+    /** Current value, or `null` if no `assign` has been called. */
+    value() { return this._value; }
+    /** Timestamp of the last write — `0` for an empty register. */
+    timestamp() { return this._timestamp; }
+    merge(other) {
+        // Empty register loses to any non-empty one.
+        if (this._timestamp === 0)
+            return other;
+        if (other._timestamp === 0)
+            return this;
+        if (other._timestamp > this._timestamp)
+            return other;
+        if (other._timestamp < this._timestamp)
+            return this;
+        // Tie on timestamp — break by replica id so every node converges
+        // to the same winner regardless of arrival order.
+        return other._replica > this._replica ? other : this;
+    }
+    toJSON() {
+        return {
+            kind: 'LWWRegister',
+            value: this._value,
+            timestamp: this._timestamp,
+            replica: this._replica,
+        };
+    }
+    static fromJSON(json) {
+        if (json.kind !== 'LWWRegister')
+            throw new Error(`LWWRegister.fromJSON: unexpected kind ${json.kind}`);
+        return new LWWRegister(json.value, json.timestamp, json.replica);
+    }
+    equals(other) {
+        return this._timestamp === other._timestamp
+            && this._replica === other._replica
+            && JSON.stringify(this._value) === JSON.stringify(other._value);
+    }
+}
+//# sourceMappingURL=LWWRegister.js.map

package/dist/crdt/LWWRegister.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LWWRegister.js","sourceRoot":"","sources":["../../src/crdt/LWWRegister.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,OAAO,WAAW;IAEH;IACA;IACA;IAHnB,YACmB,MAAgB,EAChB,UAAkB,EAClB,QAAmB;QAFnB,WAAM,GAAN,MAAM,CAAU;QAChB,eAAU,GAAV,UAAU,CAAQ;QAClB,aAAQ,GAAR,QAAQ,CAAW;IACnC,CAAC;IAEJ,gEAAgE;IAChE,MAAM,CAAC,KAAK;QACV,OAAO,IAAI,WAAW,CAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,OAAkB,EAAE,KAAQ,EAAE,YAAoB,IAAI,CAAC,GAAG,EAAE;QACjE,OAAO,IAAI,WAAW,CAAI,KAAK,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IAED,+DAA+D;IAC/D,KAAK,KAAe,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzC,+DAA+D;IAC/D,SAAS,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAE/C,KAAK,CAAC,KAAqB;QACzB,6CAA6C;QAC7C,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACxC,IAAI,KAAK,CAAC,UAAU,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAExC,IAAI,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAAE,OAAO,KAAK,CAAC;QACrD,IAAI,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAAE,OAAO,IAAI,CAAC;QACpD,iEAAiE;QACjE,kDAAkD;QAClD,OAAO,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAED,MAAM;QACJ,OAAO;YACL,IAAI,EAAE,aAAa;YACnB,KAAK,EAAE,IAAI,CAAC,MAAM;YAClB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,OAAO,EAAE,IAAI,CAAC,QAAQ;SACvB,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,QAAQ,CAAI,IAAwB;QACzC,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa;YAAE,MAAM,IAAI,KAAK,CAAC,yCAAyC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACvG,OAAO,IAAI,WAAW,CAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACtE,CAAC;IAED,MAAM,CAAC,KAAqB;QAC1B,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU;eACtC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ;eAChC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACpE,CAAC;CACF"}

package/dist/crdt/MVRegister.d.ts

@@ -0,0 +1,36 @@
+import type { Crdt, ReplicaId } from './Crdt.js';
+export declare class MVRegister<V> implements Crdt<MVRegister<V>> {
+    private readonly entries;
+    private constructor();
+    static empty<V>(): MVRegister<V>;
+    /**
+     * Assign `value` on behalf of `replica`.  Subsumes everything
+     * currently in the register on **this** replica — the new vector
+     * clock dominates every previous entry's, so on merge they all
+     * lose.  Concurrent assigns on other replicas survive (their
+     * clocks are independent of this one's tick).
+     */
+    assign(replica: ReplicaId, value: V): MVRegister<V>;
+    /**
+     * Snapshot of currently-live values.  Length is 1 in the common
+     * (un-conflicted) case; more than 1 when concurrent writers wrote
+     * branches that haven't yet been subsumed by a later assign.
+     */
+    values(): ReadonlyArray<V>;
+    /** `true` iff `values().length > 1` — two or more concurrent writes. */
+    get hasConflict(): boolean;
+    /** Number of currently-live values (typically 1). */
+    get size(): number;
+    merge(other: MVRegister<V>): MVRegister<V>;
+    toJSON(): MVRegisterJson<V>;
+    static fromJSON<V>(json: MVRegisterJson<V>): MVRegister<V>;
+    equals(other: MVRegister<V>): boolean;
+}
+export interface MVRegisterJson<V> {
+    readonly kind: 'MVRegister';
+    readonly entries: ReadonlyArray<{
+        readonly value: V;
+        readonly vc: Record<ReplicaId, number>;
+    }>;
+}
+//# sourceMappingURL=MVRegister.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MVRegister.d.ts","sourceRoot":"","sources":["../../src/crdt/MVRegister.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAoCjD,qBAAa,UAAU,CAAC,CAAC,CAAE,YAAW,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACnC,OAAO,CAAC,QAAQ,CAAC,OAAO;IAA5C,OAAO;IAEP,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC;IAEhC;;;;;;OAMG;IACH,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAenD;;;;OAIG;IACH,MAAM,IAAI,aAAa,CAAC,CAAC,CAAC;IAI1B,wEAAwE;IACxE,IAAI,WAAW,IAAI,OAAO,CAAoC;IAE9D,qDAAqD;IACrD,IAAI,IAAI,IAAI,MAAM,CAAgC;IAElD,KAAK,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IA+B1C,MAAM,IAAI,cAAc,CAAC,CAAC,CAAC;IAU3B,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;IAY1D,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,OAAO;CAUtC;AAuCD,MAAM,WAAW,cAAc,CAAC,CAAC;IAC/B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;QAC9B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAClB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;KACxC,CAAC,CAAC;CACJ"}

package/dist/crdt/MVRegister.js

@@ -0,0 +1,138 @@
+export class MVRegister {
+    entries;
+    constructor(entries) {
+        this.entries = entries;
+    }
+    static empty() { return new MVRegister([]); }
+    /**
+     * Assign `value` on behalf of `replica`.  Subsumes everything
+     * currently in the register on **this** replica — the new vector
+     * clock dominates every previous entry's, so on merge they all
+     * lose.  Concurrent assigns on other replicas survive (their
+     * clocks are independent of this one's tick).
+     */
+    assign(replica, value) {
+        // Compute the per-replica max across all currently-known entries
+        // and tick the writing replica by one.  This produces a clock
+        // strictly greater than every existing one — so on merge the new
+        // entry is the only survivor from this replica's branch.
+        const max = new Map();
+        for (const e of this.entries) {
+            for (const [k, v] of e.vc) {
+                if (v > (max.get(k) ?? 0))
+                    max.set(k, v);
+            }
+        }
+        max.set(replica, (max.get(replica) ?? 0) + 1);
+        return new MVRegister([{ value, vc: max }]);
+    }
+    /**
+     * Snapshot of currently-live values.  Length is 1 in the common
+     * (un-conflicted) case; more than 1 when concurrent writers wrote
+     * branches that haven't yet been subsumed by a later assign.
+     */
+    values() {
+        return this.entries.map((e) => e.value);
+    }
+    /** `true` iff `values().length > 1` — two or more concurrent writes. */
+    get hasConflict() { return this.entries.length > 1; }
+    /** Number of currently-live values (typically 1). */
+    get size() { return this.entries.length; }
+    merge(other) {
+        const all = [...this.entries, ...other.entries];
+        const survivors = [];
+        const seen = new Set();
+        for (const e of all) {
+            // Drop e if any sibling strictly dominates it (causally
+            // newer writes subsume older ones).
+            let keep = true;
+            for (const o of all) {
+                if (o === e)
+                    continue;
+                if (vcStrictlyDominates(o.vc, e.vc)) {
+                    keep = false;
+                    break;
+                }
+            }
+            if (!keep)
+                continue;
+            // Dedupe by **full state** (value + vc).  Two entries with the
+            // same vc but different values are kept as concurrent — that
+            // can only happen on replica-id reuse, which is technically
+            // unsupported, but treating them as conflicts keeps merge
+            // commutative even in that degenerate case.  Two entries with
+            // identical (value, vc) are the same logical state and dedupe
+            // to one.
+            const key = JSON.stringify([
+                e.value,
+                Array.from(e.vc.entries()).sort(([a], [b]) => (a < b ? -1 : a > b ? 1 : 0)),
+            ]);
+            if (seen.has(key))
+                continue;
+            seen.add(key);
+            survivors.push(e);
+        }
+        return new MVRegister(survivors);
+    }
+    toJSON() {
+        return {
+            kind: 'MVRegister',
+            entries: this.entries.map((e) => ({
+                value: e.value,
+                vc: Object.fromEntries(e.vc),
+            })),
+        };
+    }
+    static fromJSON(json) {
+        if (json.kind !== 'MVRegister') {
+            throw new Error(`MVRegister.fromJSON: unexpected kind ${json.kind}`);
+        }
+        return new MVRegister(json.entries.map((e) => ({
+            value: e.value,
+            vc: new Map(Object.entries(e.vc)),
+        })));
+    }
+    equals(other) {
+        if (this.entries.length !== other.entries.length)
+            return false;
+        // Order-independent: every entry on this side must have a partner
+        // on the other side with the same value + vc.
+        return this.entries.every((a) => other.entries.some((b) => JSON.stringify(a.value) === JSON.stringify(b.value)
+            && vcEqual(a.vc, b.vc)));
+    }
+}
+/* ------------------------------ helpers --------------------------------- */
+function vcEqual(a, b) {
+    if (a.size !== b.size)
+        return false;
+    for (const [k, v] of a)
+        if (b.get(k) !== v)
+            return false;
+    return true;
+}
+/**
+ * `a` strictly dominates `b` iff:
+ *   - `a[k] >= b[k]` for every replica `k` (including those `b` doesn't
+ *     mention — those count as zero on the `b` side), AND
+ *   - there exists at least one replica `k` where `a[k] > b[k]`.
+ *
+ * "Strictly" because equal clocks count as concurrent, not dominating.
+ */
+function vcStrictlyDominates(a, b) {
+    let strict = false;
+    // Check every replica in b — a must be >= there.
+    for (const [k, vb] of b) {
+        const va = a.get(k) ?? 0;
+        if (va < vb)
+            return false;
+        if (va > vb)
+            strict = true;
+    }
+    // Replicas in a but not b: a > 0 → a is strictly ahead.
+    for (const [k, va] of a) {
+        if (!b.has(k) && va > 0)
+            strict = true;
+    }
+    return strict;
+}
+//# sourceMappingURL=MVRegister.js.map

package/dist/crdt/MVRegister.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MVRegister.js","sourceRoot":"","sources":["../../src/crdt/MVRegister.ts"],"names":[],"mappings":"AAoCA,MAAM,OAAO,UAAU;IACgB;IAArC,YAAqC,OAAkC;QAAlC,YAAO,GAAP,OAAO,CAA2B;IAAG,CAAC;IAE3E,MAAM,CAAC,KAAK,KAAuB,OAAO,IAAI,UAAU,CAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAElE;;;;;;OAMG;IACH,MAAM,CAAC,OAAkB,EAAE,KAAQ;QACjC,iEAAiE;QACjE,8DAA8D;QAC9D,iEAAiE;QACjE,yDAAyD;QACzD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAqB,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;gBAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,OAAO,IAAI,UAAU,CAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACH,MAAM;QACJ,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;IAED,wEAAwE;IACxE,IAAI,WAAW,KAAc,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAE9D,qDAAqD;IACrD,IAAI,IAAI,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAElD,KAAK,CAAC,KAAoB;QACxB,MAAM,GAAG,GAAiB,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,wDAAwD;YACxD,oCAAoC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpB,IAAI,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACtB,IAAI,mBAAmB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;oBAAC,IAAI,GAAG,KAAK,CAAC;oBAAC,MAAM;gBAAC,CAAC;YAC/D,CAAC;YACD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,+DAA+D;YAC/D,6DAA6D;YAC7D,4DAA4D;YAC5D,0DAA0D;YAC1D,8DAA8D;YAC9D,8DAA8D;YAC9D,UAAU;YACV,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;gBACzB,CAAC,CAAC,KAAK;gBACP,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC5E,CAAC,CAAC;YACH,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,IAAI,UAAU,CAAI,SAAS,CAAC,CAAC;IACtC,CAAC;IAED,MAAM;QACJ,OAAO;YACL,IAAI,EAAE,YAAY;YAClB,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAChC,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,EAAE,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;aAC7B,CAAC,CAAC;SACJ,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,QAAQ,CAAI,IAAuB;QACxC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,wCAAwC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAI,UAAU,CACnB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,EAAE,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SAClC,CAAC,CAAC,CACJ,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,KAAoB;QACzB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,KAAK,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC/D,kEAAkE;QAClE,8CAA8C;QAC9C,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAC9B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACvB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;eAChD,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CACvB,CAAC,CAAC;IACP,CAAC;CACF;AAED,8EAA8E;AAE9E,SAAS,OAAO,CACd,CAAiC,EACjC,CAAiC;IAEjC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IACzD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAC1B,CAAiC,EACjC,CAAiC;IAEjC,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,iDAAiD;IACjD,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,EAAE,GAAG,EAAE;YAAE,OAAO,KAAK,CAAC;QAC1B,IAAI,EAAE,GAAG,EAAE;YAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,CAAC;IACD,wDAAwD;IACxD,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC;YAAE,MAAM,GAAG,IAAI,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}