@weaveprotocol/core 0.1.0

package/dist/storage/storage-provider.js

@@ -0,0 +1,220 @@
+/**
+ * @module storage-provider
+ * A space's store: record versions, and the Merkle Search Tree that indexes them.
+ *
+ * The tree maps **record keys to version ids**:
+ *
+ * ```
+ * r/<key>              → the current version          (every record)
+ * g/<key>              → the record's first version   (once it has been edited)
+ * h/<key>/<seq>/<id>   → a superseded version         (only if marked `retain`)
+ * ```
+ *
+ * A version that arrives is compared with the one at `r/<key>` by the ordering
+ * rule (`records/version.ts`). The winner takes `r/<key>`; the loser's body is
+ * dropped — unless it is the record's first version, kept as proof of who
+ * created it, or its writer marked it `retain`. The same set of versions gives
+ * the same tree whatever order they arrive in, which is what lets two peers
+ * converge.
+ */
+import { insertIntoMST, deleteFromMST, lookupInMST, listMSTEntries, collectReachableCids } from './mst.js';
+import { byVersion, supersedes } from '../records/version.js';
+import { utf8Encode, utf8Decode } from '../utils/encoding.js';
+const ROOT_KEY = '__mst_root';
+/** Unreachable nodes found by the last compaction, and when */
+const CONDEMNED_KEY = '__condemned';
+/** A tree node's key in the store: its CID, `b` and 52 base32 characters */
+const NODE_KEY = /^b[a-z2-7]{52}$/;
+export const CURRENT_PREFIX = 'r/';
+export const GENESIS_PREFIX = 'g/';
+export const HISTORY_PREFIX = 'h/';
+const currentKey = (key) => `${CURRENT_PREFIX}${key}`;
+const genesisKey = (key) => `${GENESIS_PREFIX}${key}`;
+/** `seq` padded so a key's history lists in order */
+const historyKey = (e) => `${HISTORY_PREFIX}${e.key}/${String(e.seq).padStart(15, '0')}/${e.id}`;
+/**
+ * Creates a StorageProvider wrapping an adapter.
+ * @param adapter The initialized storage adapter.
+ * @returns The StorageProvider orchestrator.
+ */
+export function createStorageProvider(adapter, options = {}) {
+    async function getRootCid(store = adapter) {
+        const bytes = await store.get(ROOT_KEY);
+        return bytes ? utf8Decode(bytes) : null;
+    }
+    // Every change reads the root, rewrites the path to one entry, and writes a
+    // new root. Two of those interleaved would each start from the same root and
+    // the second would silently drop the first's entry. So changes take turns.
+    let tail = Promise.resolve();
+    const exclusively = (change) => {
+        const run = tail.then(change, change);
+        tail = run.catch(() => { });
+        return run;
+    };
+    /**
+     * Runs one change of the tree. Its node writes are held and made in one
+     * batch with the new root, so a change lands whole or not at all, in one
+     * transaction rather than one per node. Versions it drops are deleted only
+     * after, so the tree never names a record that is gone.
+     */
+    const change = (run) => exclusively(async () => {
+        const writes = new Map();
+        const tree = {
+            ...adapter,
+            get: async (key) => (writes.has(key) ? writes.get(key) : adapter.get(key)),
+            has: async (key) => (writes.has(key) ? writes.get(key) !== null : adapter.has(key)),
+            put: async (key, value) => void writes.set(key, value),
+            delete: async (key) => void writes.set(key, null),
+        };
+        const dropped = [];
+        const before = await getRootCid();
+        const root = await run(tree, before, (id) => dropped.push(id));
+        if (root === before && writes.size === 0 && dropped.length === 0)
+            return root;
+        writes.set(ROOT_KEY, root ? utf8Encode(root) : null);
+        await adapter.batch([...writes].map(([key, value]) => (value ? { type: 'put', key, value } : { type: 'delete', key })));
+        for (const id of dropped)
+            await adapter.deleteExpression(id);
+        changed();
+        return root;
+    });
+    const graceMs = options.graceMs ?? 60_000;
+    const compact = () => exclusively(async () => {
+        const reachable = await collectReachableCids(adapter, await getRootCid());
+        const dead = (await adapter.list('b')).filter((key) => NODE_KEY.test(key) && !reachable.has(key));
+        const saved = await adapter.get(CONDEMNED_KEY);
+        const earlier = saved ? JSON.parse(utf8Decode(saved)) : null;
+        const ripe = graceMs === 0 ? dead : earlier && Date.now() - earlier.at >= graceMs ? earlier.cids : null;
+        const condemn = (cids) => ({ type: 'put', key: CONDEMNED_KEY, value: utf8Encode(JSON.stringify({ at: Date.now(), cids })) });
+        // Too soon to delete anything: remember what is dead now, unless an earlier list is already waiting.
+        if (ripe === null) {
+            if (!earlier)
+                await adapter.batch([condemn(dead)]);
+            return 0;
+        }
+        const doomed = new Set(ripe);
+        const deleting = dead.filter((key) => doomed.has(key));
+        await adapter.batch([...deleting.map((key) => ({ type: 'delete', key })), condemn(dead.filter((key) => !doomed.has(key)))]);
+        return deleting.length;
+    });
+    let changes = 0;
+    /** Counts a change, and compacts once enough have piled up */
+    const changed = () => {
+        if (options.compactEvery && ++changes >= options.compactEvery) {
+            changes = 0;
+            void compact().catch(() => { });
+        }
+    };
+    /**
+     * Places a version that is not current: the record's first version if it is
+     * the lowest-id one seen, history if retained, otherwise gone.
+     */
+    async function demote(tree, root, version, current, drop) {
+        // A first version is kept as proof of who created the record — the one
+        // with the lowest id, if several devices each created the same chosen key.
+        // Not while the record is still at seq 0: then the current version is it.
+        if (version.seq === 0 && current.seq > 0) {
+            const heldId = await lookupInMST(tree, root, genesisKey(version.key));
+            if (heldId === version.id)
+                return root;
+            if (heldId === null || version.id < heldId) {
+                await adapter.putExpression(version);
+                root = await insertIntoMST(tree, root, genesisKey(version.key), version.id);
+                const displaced = heldId ? await adapter.getExpression(heldId) : null;
+                return displaced ? keepOrDrop(tree, root, displaced, drop) : root;
+            }
+        }
+        return keepOrDrop(tree, root, version, drop);
+    }
+    async function keepOrDrop(tree, root, version, drop) {
+        if (version.retain) {
+            await adapter.putExpression(version);
+            return insertIntoMST(tree, root, historyKey(version), version.id);
+        }
+        drop(version.id);
+        return root;
+    }
+    const load = async (ids) => (await Promise.all([...ids].map((id) => adapter.getExpression(id)))).filter((v) => v !== null);
+    async function histories(prefix) {
+        const root = await getRootCid();
+        const ids = new Map();
+        for (const tree of [CURRENT_PREFIX, GENESIS_PREFIX, HISTORY_PREFIX]) {
+            for (const entry of await listMSTEntries(adapter, root, `${tree}${prefix}`)) {
+                // `r/<key>`, `g/<key>`, `h/<key>/<seq>/<id>` — a record key holds no `/`.
+                const key = entry.key.split('/')[1];
+                (ids.get(key) ?? ids.set(key, new Set()).get(key)).add(entry.value);
+            }
+        }
+        const result = new Map();
+        for (const [key, held] of ids)
+            result.set(key, (await load(held)).sort(byVersion));
+        return result;
+    }
+    async function currentOf(tree, root, key) {
+        const id = await lookupInMST(tree, root, currentKey(key));
+        return id ? adapter.getExpression(id) : null;
+    }
+    return Object.freeze({
+        addExpression(incoming) {
+            return change(async (tree, root, drop) => {
+                const current = await currentOf(tree, root, incoming.key);
+                if (current?.id === incoming.id)
+                    return root;
+                if (current && !supersedes(incoming, current))
+                    return demote(tree, root, incoming, current, drop);
+                await adapter.putExpression(incoming);
+                root = await insertIntoMST(tree, root, currentKey(incoming.key), incoming.id);
+                return current ? demote(tree, root, current, incoming, drop) : root;
+            });
+        },
+        removeExpression(id) {
+            return change(async (tree, root, drop) => {
+                const version = await adapter.getExpression(id);
+                for (const key of version ? [currentKey(version.key), genesisKey(version.key), historyKey(version)] : []) {
+                    if ((await lookupInMST(tree, root, key)) === id)
+                        root = await deleteFromMST(tree, root, key);
+                }
+                drop(id);
+                return root;
+            });
+        },
+        async getExpression(id) {
+            return adapter.getExpression(id);
+        },
+        async getCurrent(key) {
+            return currentOf(adapter, await getRootCid(), key);
+        },
+        async getGenesis(key) {
+            const id = await lookupInMST(adapter, await getRootCid(), genesisKey(key));
+            return id ? adapter.getExpression(id) : null;
+        },
+        async history(key) {
+            return (await histories(key)).get(key) ?? [];
+        },
+        histories,
+        async listCurrent() {
+            return load((await listMSTEntries(adapter, await getRootCid(), CURRENT_PREFIX)).map((e) => e.value));
+        },
+        async queryExpressions(collection) {
+            // The index holds every version kept, not only current ones; the tree says which is current.
+            const root = await getRootCid();
+            const held = await adapter.queryExpressions(collection, Infinity);
+            const current = await Promise.all(held.map(async (v) => (await lookupInMST(adapter, root, currentKey(v.key))) === v.id));
+            return held.filter((_, i) => current[i]);
+        },
+        async entries() {
+            return listMSTEntries(adapter, await getRootCid());
+        },
+        async getRootCid() {
+            return getRootCid();
+        },
+        compact,
+        getAdapter() {
+            return adapter;
+        },
+        async close() {
+            await adapter.close();
+        }
+    });
+}
+//# sourceMappingURL=storage-provider.js.map

package/dist/storage/storage-provider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"storage-provider.js","sourceRoot":"","sources":["../../src/storage/storage-provider.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,UAAU,CAAC;AAC3G,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAC9D,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAiD9D,MAAM,QAAQ,GAAG,YAAY,CAAC;AAC9B,+DAA+D;AAC/D,MAAM,aAAa,GAAG,aAAa,CAAC;AACpC,4EAA4E;AAC5E,MAAM,QAAQ,GAAG,iBAAiB,CAAC;AASnC,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,CAAC;AACnC,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,CAAC;AACnC,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,CAAC;AAEnC,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,cAAc,GAAG,GAAG,EAAE,CAAC;AAC9D,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,cAAc,GAAG,GAAG,EAAE,CAAC;AAC9D,qDAAqD;AACrD,MAAM,UAAU,GAAG,CAAC,CAAa,EAAE,EAAE,CAAC,GAAG,cAAc,GAAG,CAAC,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC;AAE7G;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAuB,EAAE,UAAkC,EAAE;IACjG,KAAK,UAAU,UAAU,CAAC,QAAwB,OAAO;QACvD,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxC,OAAO,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1C,CAAC;IAED,4EAA4E;IAC5E,6EAA6E;IAC7E,2EAA2E;IAC3E,IAAI,IAAI,GAAqB,OAAO,CAAC,OAAO,EAAE,CAAC;IAC/C,MAAM,WAAW,GAAG,CAAI,MAAwB,EAAc,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACtC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC3B,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IAEF;;;;;OAKG;IACH,MAAM,MAAM,GAAG,CAAC,GAAsG,EAAE,EAAE,CACxH,WAAW,CAAC,KAAK,IAAI,EAAE;QACrB,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6B,CAAC;QACpD,MAAM,IAAI,GAAmB;YAC3B,GAAG,OAAO;YACV,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3E,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACnF,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC;YACtD,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC;SAClD,CAAC;QACF,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,MAAM,UAAU,EAAE,CAAC;QAClC,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,IAAI,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC9E,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjI,KAAK,MAAM,EAAE,IAAI,OAAO;YAAE,MAAM,OAAO,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAC7D,OAAO,EAAE,CAAC;QACV,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEL,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,MAAM,CAAC;IAC1C,MAAM,OAAO,GAAG,GAAoB,EAAE,CACpC,WAAW,CAAC,KAAK,IAAI,EAAE;QACrB,MAAM,SAAS,GAAG,MAAM,oBAAoB,CAAC,OAAO,EAAE,MAAM,UAAU,EAAE,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAG,CAAC,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAoC,CAAC,CAAC,CAAC,IAAI,CAAC;QACjG,MAAM,IAAI,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,EAAE,IAAI,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACxG,MAAM,OAAO,GAAG,CAAC,IAAc,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QAChJ,qGAAqG;QACrG,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,IAAI,CAAC,OAAO;gBAAE,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAW,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrI,OAAO,QAAQ,CAAC,MAAM,CAAC;IACzB,CAAC,CAAC,CAAC;IAEL,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,8DAA8D;IAC9D,MAAM,OAAO,GAAG,GAAG,EAAE;QACnB,IAAI,OAAO,CAAC,YAAY,IAAI,EAAE,OAAO,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;YAC9D,OAAO,GAAG,CAAC,CAAC;YACZ,KAAK,OAAO,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,CAAC;IAEF;;;OAGG;IACH,KAAK,UAAU,MAAM,CAAC,IAAoB,EAAE,IAAmB,EAAE,OAAmB,EAAE,OAAmB,EAAE,IAA0B;QACnI,uEAAuE;QACvE,2EAA2E;QAC3E,0EAA0E;QAC1E,IAAI,OAAO,CAAC,GAAG,KAAK,CAAC,IAAI,OAAO,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,IAAI,MAAM,KAAK,OAAO,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YACvC,IAAI,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC,EAAE,GAAG,MAAM,EAAE,CAAC;gBAC3C,MAAM,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;gBACrC,IAAI,GAAG,MAAM,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;gBAC5E,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACtE,OAAO,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACpE,CAAC;QACH,CAAC;QACD,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,KAAK,UAAU,UAAU,CAAC,IAAoB,EAAE,IAAmB,EAAE,OAAmB,EAAE,IAA0B;QAClH,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,MAAM,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACrC,OAAO,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,EAAE,GAAqB,EAAyB,EAAE,CAClE,CAAC,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAElH,KAAK,UAAU,SAAS,CAAC,MAAc;QACrC,MAAM,IAAI,GAAG,MAAM,UAAU,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,CAAC,cAAc,EAAE,cAAc,EAAE,cAAc,CAAC,EAAE,CAAC;YACpE,KAAK,MAAM,KAAK,IAAI,MAAM,cAAc,CAAC,OAAO,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,MAAM,EAAE,CAAC,EAAE,CAAC;gBAC5E,0EAA0E;gBAC1E,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;gBACrC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;QAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,GAAG;YAAE,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;QACnF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,UAAU,SAAS,CAAC,IAAoB,EAAE,IAAmB,EAAE,GAAW;QAC7E,MAAM,EAAE,GAAG,MAAM,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/C,CAAC;IAED,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,aAAa,CAAC,QAAoB;YAChC,OAAO,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;gBACvC,MAAM,OAAO,GAAG,MAAM,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC;gBAC1D,IAAI,OAAO,EAAE,EAAE,KAAK,QAAQ,CAAC,EAAE;oBAAE,OAAO,IAAI,CAAC;gBAC7C,IAAI,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,EAAE,OAAO,CAAC;oBAAE,OAAO,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;gBAElG,MAAM,OAAO,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;gBACtC,IAAI,GAAG,MAAM,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAC9E,OAAO,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACtE,CAAC,CAAC,CAAC;QACL,CAAC;QAED,gBAAgB,CAAC,EAAU;YACzB,OAAO,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE;gBACvC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;gBAChD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;oBACzG,IAAI,CAAC,MAAM,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE;wBAAE,IAAI,GAAG,MAAM,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC/F,CAAC;gBACD,IAAI,CAAC,EAAE,CAAC,CAAC;gBACT,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;QACL,CAAC;QAED,KAAK,CAAC,aAAa,CAAC,EAAU;YAC5B,OAAO,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC;QAED,KAAK,CAAC,UAAU,CAAC,GAAW;YAC1B,OAAO,SAAS,CAAC,OAAO,EAAE,MAAM,UAAU,EAAE,EAAE,GAAG,CAAC,CAAC;QACrD,CAAC;QAED,KAAK,CAAC,UAAU,CAAC,GAAW;YAC1B,MAAM,EAAE,GAAG,MAAM,WAAW,CAAC,OAAO,EAAE,MAAM,UAAU,EAAE,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3E,OAAO,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,CAAC;QAED,KAAK,CAAC,OAAO,CAAC,GAAW;YACvB,OAAO,CAAC,MAAM,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAC/C,CAAC;QAED,SAAS;QAET,KAAK,CAAC,WAAW;YACf,OAAO,IAAI,CAAC,CAAC,MAAM,cAAc,CAAC,OAAO,EAAE,MAAM,UAAU,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACvG,CAAC;QAED,KAAK,CAAC,gBAAgB,CAAC,UAAkB;YACvC,6FAA6F;YAC7F,MAAM,IAAI,GAAG,MAAM,UAAU,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,gBAAgB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzH,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;QAED,KAAK,CAAC,OAAO;YACX,OAAO,cAAc,CAAC,OAAO,EAAE,MAAM,UAAU,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,KAAK,CAAC,UAAU;YACd,OAAO,UAAU,EAAE,CAAC;QACtB,CAAC;QAED,OAAO;QAEP,UAAU;YACR,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,KAAK,CAAC,KAAK;YACT,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;KACF,CAAC,CAAC;AACL,CAAC"}

package/dist/sync/anti-entropy.d.ts

@@ -0,0 +1,49 @@
+/**
+ * @module anti-entropy
+ * The pieces of reconciliation that do not depend on messages.
+ *
+ * Two peers reconcile by walking each other's Merkle Search Tree from the root,
+ * descending only into subtrees they do not already have. Nodes are content
+ * addressed, so a subtree whose CID you hold is one you have and can be
+ * skipped whole. Two trees differing by one entry exchange only
+ * the nodes on the path to it — a handful at any size — instead of every key.
+ */
+import type { StorageAdapter } from '../types.js';
+import { type MSTNode } from '../storage/mst.js';
+/**
+ * Checks a node a peer sent: it must be well formed, and hash to the CID it
+ * was sent as.
+ *
+ * A peer can send anything. Only the four fields of a node are read, and they
+ * are hashed the one canonical way — so whatever else came with it, a node
+ * that checks out is exactly the node that CID names.
+ *
+ * @returns The node, or null when it is malformed or does not match the CID
+ */
+export declare function verifyNode(cid: string, value: unknown): Promise<MSTNode | null>;
+/**
+ * The children of a peer's node worth fetching: those this store does not hold.
+ *
+ * A node is only ever stored by building this store's own tree, so holding
+ * one means holding — or having since superseded — every entry beneath it,
+ * whether or not the current root still reaches it. Asking the store is one
+ * lookup per child, where collecting the local tree first read all of it.
+ *
+ * @param adapter The local store
+ * @param node A node from the peer's tree
+ */
+export declare function unknownChildren(adapter: StorageAdapter, node: MSTNode): Promise<string[]>;
+/**
+ * The version ids a peer's node names that differ from this store's.
+ *
+ * A key is a record key under a prefix (`r/`, `g/`, `h/`) and its value a
+ * version id, so two peers can hold the same key with different values — two
+ * versions of one record. Either way the other side's version is worth
+ * fetching: the ordering rule decides, on arrival, whether it is kept.
+ *
+ * @param adapter The local store
+ * @param localRoot The local tree's root
+ * @param node A node from the peer's tree
+ */
+export declare function differingEntries(adapter: StorageAdapter, localRoot: string | null, node: MSTNode): Promise<string[]>;
+//# sourceMappingURL=anti-entropy.d.ts.map

package/dist/sync/anti-entropy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"anti-entropy.d.ts","sourceRoot":"","sources":["../../src/sync/anti-entropy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAClD,OAAO,EAAyB,KAAK,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAIxE;;;;;;;;;GASG;AACH,wBAAsB,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,CAWrF;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,eAAe,CAAC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAI/F;AAED;;;;;;;;;;;GAWG;AACH,wBAAsB,gBAAgB,CAAC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAQ1H"}

package/dist/sync/anti-entropy.js

@@ -0,0 +1,62 @@
+import { hashNode, lookupInMST } from '../storage/mst.js';
+const isString = (value) => typeof value === 'string';
+/**
+ * Checks a node a peer sent: it must be well formed, and hash to the CID it
+ * was sent as.
+ *
+ * A peer can send anything. Only the four fields of a node are read, and they
+ * are hashed the one canonical way — so whatever else came with it, a node
+ * that checks out is exactly the node that CID names.
+ *
+ * @returns The node, or null when it is malformed or does not match the CID
+ */
+export async function verifyNode(cid, value) {
+    const { height, keys, values, children } = (value ?? {});
+    if (!Number.isSafeInteger(height) ||
+        !Array.isArray(keys) || !keys.every(isString) ||
+        !Array.isArray(values) || values.length !== keys.length || !values.every(isString) ||
+        !Array.isArray(children) || children.length !== keys.length + 1 ||
+        !children.every((child) => child === null || isString(child)))
+        return null;
+    const node = { height: height, keys, values, children };
+    return (await hashNode(node)) === cid ? node : null;
+}
+/**
+ * The children of a peer's node worth fetching: those this store does not hold.
+ *
+ * A node is only ever stored by building this store's own tree, so holding
+ * one means holding — or having since superseded — every entry beneath it,
+ * whether or not the current root still reaches it. Asking the store is one
+ * lookup per child, where collecting the local tree first read all of it.
+ *
+ * @param adapter The local store
+ * @param node A node from the peer's tree
+ */
+export async function unknownChildren(adapter, node) {
+    const children = node.children.filter((child) => child !== null);
+    const held = await Promise.all(children.map((child) => adapter.has(child)));
+    return children.filter((_, i) => !held[i]);
+}
+/**
+ * The version ids a peer's node names that differ from this store's.
+ *
+ * A key is a record key under a prefix (`r/`, `g/`, `h/`) and its value a
+ * version id, so two peers can hold the same key with different values — two
+ * versions of one record. Either way the other side's version is worth
+ * fetching: the ordering rule decides, on arrival, whether it is kept.
+ *
+ * @param adapter The local store
+ * @param localRoot The local tree's root
+ * @param node A node from the peer's tree
+ */
+export async function differingEntries(adapter, localRoot, node) {
+    const ours = await Promise.all(node.keys.map((key) => lookupInMST(adapter, localRoot, key)));
+    const wanted = [];
+    for (let i = 0; i < node.keys.length; i++) {
+        const theirs = node.values[i];
+        if (typeof theirs === 'string' && ours[i] !== theirs && !(await adapter.getExpression(theirs)))
+            wanted.push(theirs);
+    }
+    return wanted;
+}
+//# sourceMappingURL=anti-entropy.js.map

package/dist/sync/anti-entropy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"anti-entropy.js","sourceRoot":"","sources":["../../src/sync/anti-entropy.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAgB,MAAM,mBAAmB,CAAC;AAExE,MAAM,QAAQ,GAAG,CAAC,KAAc,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,CAAC;AAEhF;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,GAAW,EAAE,KAAc;IAC1D,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,CAAC,KAAK,IAAI,EAAE,CAA4C,CAAC;IACpG,IACE,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC;QAC7B,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;QAC7C,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC;QAClF,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC;QAC/D,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IACd,MAAM,IAAI,GAAY,EAAE,MAAM,EAAE,MAAgB,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;IAC3E,OAAO,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACtD,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,OAAuB,EAAE,IAAa;IAC1E,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAmB,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;IAClF,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5E,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,OAAuB,EAAE,SAAwB,EAAE,IAAa;IACrG,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7F,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/sync/index.d.ts

@@ -0,0 +1,4 @@
+export * from './sync-messages.js';
+export * from './anti-entropy.js';
+export * from './sync-engine.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/sync/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC;AACnC,cAAc,mBAAmB,CAAC;AAClC,cAAc,kBAAkB,CAAC"}

package/dist/sync/index.js

@@ -0,0 +1,4 @@
+export * from './sync-messages.js';
+export * from './anti-entropy.js';
+export * from './sync-engine.js';
+//# sourceMappingURL=index.js.map

package/dist/sync/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/sync/index.ts"],"names":[],"mappings":"AAAA,cAAc,oBAAoB,CAAC;AACnC,cAAc,mBAAmB,CAAC;AAClC,cAAc,kBAAkB,CAAC"}

package/dist/sync/sync-engine.d.ts

@@ -0,0 +1,71 @@
+/**
+ * @module sync-engine
+ * Keeps one store in step with its peers.
+ *
+ * Reconciliation is a pull, and both sides do it:
+ *
+ * 1. A tells B its root. Equal roots mean identical data — one round trip, done.
+ * 2. Otherwise each walks the other's tree from the root, asking for nodes in
+ *    batches and skipping any subtree that is already part of its own tree.
+ * 3. The keys found in the nodes it fetched, less the records it already
+ *    holds, are what it is missing. It asks for those, and every one of them
+ *    passes the gatekeeper before it is stored.
+ *
+ * Cost follows the difference, not the size: two trees differing by one entry
+ * exchange the few nodes on the path to it.
+ */
+import type { Expression } from '../types.js';
+import type { StorageProvider } from '../storage/storage-provider.js';
+import { type SyncMessage } from './sync-messages.js';
+/** Verdict on an expression that arrived from a peer */
+export interface IncomingValidation {
+    readonly valid: boolean;
+    readonly reason?: string;
+    /**
+     * Not judged yet, rather than refused: it depends on something that has not
+     * arrived — a record's first version, the definition it was written under.
+     * It is held and tried again as other records come in, and fetched again on
+     * the next round if it is still waiting.
+     */
+    readonly later?: boolean;
+}
+export interface SyncEngineConfig {
+    readonly storageProvider: StorageProvider;
+    readonly sendToPeer: (peerId: string, message: SyncMessage) => void;
+    readonly heartbeatInterval?: number;
+    /**
+     * Gatekeeper for expressions arriving from peers — typically a
+     * `ValidationEngine`. Anything it rejects is dropped instead of committed,
+     * and surfaces as a `rejected` event.
+     *
+     * Leaving it out accepts whatever peers send, which is only ever appropriate
+     * for a trusted transport or a test.
+     */
+    readonly validate?: (expression: Expression) => Promise<IncomingValidation>;
+}
+export type SyncEvent = 'synced' | 'expression-received' | 'rejected' | 'error';
+type EventHandler = (...args: any[]) => void;
+export interface SyncEngine {
+    start(): void;
+    stop(): void;
+    /** Handles whatever a peer sent; anything that is not a sync message this peer speaks is ignored. */
+    handleMessage(peerId: string, message: unknown): Promise<void>;
+    notifyPeers(peers: ReadonlyArray<string>): void;
+    onLocalChange(expression: Expression): void;
+    addPeer(peerId: string): void;
+    removePeer(peerId: string): void;
+    on(event: SyncEvent, callback: EventHandler): void;
+    off(event: SyncEvent, callback: EventHandler): void;
+}
+/** Nodes asked for in one message. Nodes are small; this keeps round trips few. */
+export declare const MAX_CIDS_PER_REQUEST = 64;
+/** Records asked for in one message. */
+export declare const MAX_IDS_PER_REQUEST = 200;
+/**
+ * Creates a sync engine orchestrator.
+ * @param config Sync engine configuration.
+ * @returns A sync engine instance.
+ */
+export declare function createSyncEngine(config: SyncEngineConfig): SyncEngine;
+export {};
+//# sourceMappingURL=sync-engine.d.ts.map

package/dist/sync/sync-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sync-engine.d.ts","sourceRoot":"","sources":["../../src/sync/sync-engine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAC9C,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gCAAgC,CAAC;AAItE,OAAO,EAA2C,KAAK,WAAW,EAAwB,MAAM,oBAAoB,CAAC;AAGrH,wDAAwD;AACxD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB;;;;;OAKG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC;CAC1B;AAQD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,eAAe,EAAE,eAAe,CAAC;IAC1C,QAAQ,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,KAAK,IAAI,CAAC;IACpE,QAAQ,CAAC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IACpC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,EAAE,UAAU,KAAK,OAAO,CAAC,kBAAkB,CAAC,CAAC;CAC7E;AAED,MAAM,MAAM,SAAS,GAAG,QAAQ,GAAG,qBAAqB,GAAG,UAAU,GAAG,OAAO,CAAC;AAChF,KAAK,YAAY,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,IAAI,CAAC;AAE7C,MAAM,WAAW,UAAU;IACzB,KAAK,IAAI,IAAI,CAAC;IACd,IAAI,IAAI,IAAI,CAAC;IACb,qGAAqG;IACrG,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/D,WAAW,CAAC,KAAK,EAAE,aAAa,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC;IAChD,aAAa,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAAC;IAC5C,OAAO,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAC9B,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,EAAE,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;IACnD,GAAG,CAAC,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,GAAG,IAAI,CAAC;CACrD;AAED,mFAAmF;AACnF,eAAO,MAAM,oBAAoB,KAAK,CAAC;AACvC,wCAAwC;AACxC,eAAO,MAAM,mBAAmB,MAAM,CAAC;AA0BvC;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,gBAAgB,GAAG,UAAU,CA6RrE"}