@weaveprotocol/core 0.1.1 → 0.2.0

package/dist/storage/mst.js

@@ -1,402 +0,0 @@
-/**
- * @module mst
- * Merkle Search Tree (MST) — a deterministic, content-addressed ordered map.
- *
- * Every key carries a height derived from its own hash (see {@link nodeHeight}),
- * and a key lives in the node at exactly that height. Because the height comes
- * from the key rather than from insertion order, the same set of entries always
- * produces the same tree — and therefore the same root CID — no matter what
- * order it was built in. That determinism is what makes the root usable as a
- * one-word summary of a peer's state, and what lets two peers skip any subtree
- * whose CID they both already hold.
- *
- * Nodes are immutable: an insert rewrites only the path from the touched node
- * up to the root, which is O(log N) nodes rather than the whole tree.
- */
-import { utf8Encode, utf8Decode } from '../utils/encoding.js';
-import { sha256, cidFromBytes } from '../utils/hash.js';
-/**
- * Creates an empty MST node at the given height.
- * @param height The height the node sits at.
- * @returns An empty node.
- */
-export function createEmptyNode(height = 0) {
-    return Object.freeze({
-        height,
-        keys: Object.freeze([]),
-        values: Object.freeze([]),
-        children: Object.freeze([null])
-    });
-}
-/**
- * Canonical JSON serialization of an MST node.
- * @param node The node to serialize.
- * @returns The canonical bytes.
- */
-export function serializeNode(node) {
-    // Field order is fixed so the same node always hashes to the same CID.
-    const obj = {
-        height: node.height,
-        keys: node.keys,
-        values: node.values,
-        children: node.children
-    };
-    return utf8Encode(JSON.stringify(obj));
-}
-/**
- * Deserialize an MST node.
- * @param data The canonical bytes.
- * @returns The node.
- */
-export function deserializeNode(data) {
-    const obj = JSON.parse(utf8Decode(data));
-    return Object.freeze({
-        height: obj.height ?? 0,
-        keys: Object.freeze([...obj.keys]),
-        values: Object.freeze([...obj.values]),
-        children: Object.freeze([...obj.children])
-    });
-}
-/**
- * Hashes a node to get its CID.
- * @param node The node to hash.
- * @returns The node's CID.
- */
-export async function hashNode(node) {
-    const bytes = serializeNode(node);
-    return cidFromBytes(bytes);
-}
-/**
- * Calculate the deterministic height of a key using SHA-256.
- * Counts leading zero bits in the hash, divided by 4 — so roughly one key in
- * 16 sits a level higher than the last, giving the tree its branching factor.
- * @param key The key to place.
- * @returns The height the key belongs at.
- */
-export async function nodeHeight(key) {
-    const hashBytes = await sha256(utf8Encode(key));
-    let zeros = 0;
-    for (let i = 0; i < hashBytes.length; i++) {
-        const byte = hashBytes[i];
-        if (byte === 0) {
-            zeros += 8;
-        }
-        else {
-            let temp = byte;
-            while ((temp & 0x80) === 0) {
-                zeros++;
-                temp <<= 1;
-            }
-            break;
-        }
-    }
-    return Math.floor(zeros / 4);
-}
-/**
- * Load a node from the storage adapter.
- * @param adapter The storage adapter.
- * @param cid The node's CID.
- * @returns The node.
- */
-export async function loadNode(adapter, cid) {
-    const data = await adapter.get(cid);
-    if (!data)
-        throw new Error(`Node not found: ${cid}`);
-    return deserializeNode(data);
-}
-/**
- * Save a node to the storage adapter and return its CID.
- * @param adapter The storage adapter.
- * @param node The node to store.
- * @returns The node's CID.
- */
-export async function saveNode(adapter, node) {
-    const bytes = serializeNode(node);
-    const cid = await cidFromBytes(bytes);
-    await adapter.put(cid, bytes);
-    return cid;
-}
-// --------------------------------------------------------------- internals
-/** Index of the first key that is greater than or equal to `target`. */
-function lowerBound(keys, target) {
-    let lo = 0;
-    let hi = keys.length;
-    while (lo < hi) {
-        const mid = (lo + hi) >> 1;
-        if (keys[mid] < target)
-            lo = mid + 1;
-        else
-            hi = mid;
-    }
-    return lo;
-}
-/**
- * Stores a node, unless it carries nothing at all — an empty node with no
- * surviving child is simply an absent subtree, and representing it as `null`
- * keeps the tree canonical.
- */
-async function saveOrPrune(adapter, node) {
-    if (node.keys.length === 0 && node.children.every(child => child === null))
-        return null;
-    return saveNode(adapter, node);
-}
-/**
- * Wraps a subtree in empty parent nodes until it sits at `toHeight`.
- *
- * A height gap has to be filled with real nodes rather than skipped, because
- * every tree holding the same keys must produce the same CIDs.
- */
-async function lift(adapter, cid, fromHeight, toHeight) {
-    if (cid === null)
-        return null;
-    let current = cid;
-    for (let h = fromHeight + 1; h <= toHeight; h++) {
-        current = await saveNode(adapter, Object.freeze({
-            height: h,
-            keys: Object.freeze([]),
-            values: Object.freeze([]),
-            children: Object.freeze([current])
-        }));
-    }
-    return current;
-}
-/** Builds a subtree topped at `topHeight` holding exactly one entry. */
-async function singleton(adapter, key, value, keyHeight, topHeight) {
-    const leaf = await saveNode(adapter, Object.freeze({
-        height: keyHeight,
-        keys: Object.freeze([key]),
-        values: Object.freeze([value]),
-        children: Object.freeze([null, null])
-    }));
-    return (await lift(adapter, leaf, keyHeight, topHeight));
-}
-/**
- * Splits a subtree into the entries below `key` and those above it, both
- * returned at the input subtree's height.
- */
-async function splitSubtree(adapter, cid, key) {
-    if (cid === null)
-        return [null, null];
-    const node = await loadNode(adapter, cid);
-    const idx = lowerBound(node.keys, key);
-    // The child at `idx` straddles the split point, so it splits too.
-    const [childLeft, childRight] = await splitSubtree(adapter, node.children[idx] ?? null, key);
-    const left = {
-        height: node.height,
-        keys: node.keys.slice(0, idx),
-        values: node.values.slice(0, idx),
-        children: [...node.children.slice(0, idx), childLeft]
-    };
-    const right = {
-        height: node.height,
-        keys: node.keys.slice(idx),
-        values: node.values.slice(idx),
-        children: [childRight, ...node.children.slice(idx + 1)]
-    };
-    return [await saveOrPrune(adapter, left), await saveOrPrune(adapter, right)];
-}
-/**
- * Merges two adjacent subtrees of equal height, where every key on the left
- * sorts before every key on the right.
- */
-async function mergeSubtrees(adapter, left, right) {
-    if (left === null)
-        return right;
-    if (right === null)
-        return left;
-    const leftNode = await loadNode(adapter, left);
-    const rightNode = await loadNode(adapter, right);
-    // The two subtrees meet at the left's last child and the right's first.
-    const middle = await mergeSubtrees(adapter, leftNode.children[leftNode.children.length - 1] ?? null, rightNode.children[0] ?? null);
-    return saveOrPrune(adapter, {
-        height: leftNode.height,
-        keys: [...leftNode.keys, ...rightNode.keys],
-        values: [...leftNode.values, ...rightNode.values],
-        children: [...leftNode.children.slice(0, -1), middle, ...rightNode.children.slice(1)]
-    });
-}
-/** Inserts into a subtree known to sit at `subtreeHeight`. */
-async function insertInto(adapter, cid, subtreeHeight, key, value, keyHeight) {
-    if (cid === null)
-        return singleton(adapter, key, value, keyHeight, subtreeHeight);
-    const node = await loadNode(adapter, cid);
-    const idx = lowerBound(node.keys, key);
-    if (keyHeight === node.height) {
-        if (node.keys[idx] === key) {
-            const values = [...node.values];
-            values[idx] = value;
-            return saveNode(adapter, { ...node, values });
-        }
-        // The key lands between two existing keys, so the subtree that currently
-        // spans that gap has to be split around it.
-        const [childLeft, childRight] = await splitSubtree(adapter, node.children[idx] ?? null, key);
-        return saveNode(adapter, {
-            height: node.height,
-            keys: [...node.keys.slice(0, idx), key, ...node.keys.slice(idx)],
-            values: [...node.values.slice(0, idx), value, ...node.values.slice(idx)],
-            children: [...node.children.slice(0, idx), childLeft, childRight, ...node.children.slice(idx + 1)]
-        });
-    }
-    // The key belongs further down; only this child changes.
-    const child = await insertInto(adapter, node.children[idx] ?? null, node.height - 1, key, value, keyHeight);
-    const children = [...node.children];
-    children[idx] = child;
-    return saveNode(adapter, { ...node, children });
-}
-/** Removes from a subtree, returning its new CID, or `null` if nothing is left. */
-async function deleteFrom(adapter, cid, key, keyHeight) {
-    if (cid === null)
-        return null;
-    const node = await loadNode(adapter, cid);
-    // A key sitting above this node cannot appear anywhere beneath it.
-    if (keyHeight > node.height)
-        return cid;
-    const idx = lowerBound(node.keys, key);
-    if (keyHeight === node.height) {
-        if (node.keys[idx] !== key)
-            return cid;
-        // Removing the separator joins the subtrees on either side of it.
-        const merged = await mergeSubtrees(adapter, node.children[idx] ?? null, node.children[idx + 1] ?? null);
-        return saveOrPrune(adapter, {
-            height: node.height,
-            keys: [...node.keys.slice(0, idx), ...node.keys.slice(idx + 1)],
-            values: [...node.values.slice(0, idx), ...node.values.slice(idx + 1)],
-            children: [...node.children.slice(0, idx), merged, ...node.children.slice(idx + 2)]
-        });
-    }
-    const existing = node.children[idx] ?? null;
-    const child = await deleteFrom(adapter, existing, key, keyHeight);
-    if (child === existing)
-        return cid;
-    const children = [...node.children];
-    children[idx] = child;
-    return saveOrPrune(adapter, { ...node, children });
-}
-/**
- * Walks the entries whose keys start with `prefix`, in key order, skipping
- * every subtree that lies wholly outside that range.
- */
-async function walkEntries(adapter, cid, prefix, visit) {
-    if (cid === null)
-        return;
-    const node = await loadNode(adapter, cid);
-    const { keys } = node;
-    // Child i holds the keys between keys[i - 1] and keys[i].
-    for (let i = 0; i <= keys.length; i++) {
-        const below = keys[i - 1];
-        const above = keys[i];
-        const afterRange = below !== undefined && below > prefix && !below.startsWith(prefix);
-        if (afterRange)
-            return;
-        const beforeRange = above !== undefined && above < prefix;
-        if (!beforeRange)
-            await walkEntries(adapter, node.children[i] ?? null, prefix, visit);
-        if (above !== undefined && above.startsWith(prefix))
-            visit(above, node.values[i]);
-    }
-}
-/** Collects the CID of every node reachable from `cid`. */
-async function collectCids(adapter, cid, out = new Set()) {
-    if (cid === null || out.has(cid))
-        return out;
-    out.add(cid);
-    const node = await loadNode(adapter, cid);
-    for (const child of node.children) {
-        await collectCids(adapter, child ?? null, out);
-    }
-    return out;
-}
-// ------------------------------------------------------------ public API
-/**
- * Every node CID reachable from a root: the tree as it stands, without the
- * orphans older versions left behind in the store. Sync uses it to decide
- * which of a peer's subtrees it already holds; garbage collection uses it to
- * decide what to keep.
- * @param adapter The storage adapter.
- * @param rootCid The root, or null for an empty tree.
- */
-export async function collectReachableCids(adapter, rootCid) {
-    return collectCids(adapter, rootCid);
-}
-/**
- * Insert a key-value pair into the MST.
- * @param adapter The storage adapter.
- * @param rootCid The current root, or null for an empty tree.
- * @param key The key to insert.
- * @param value The value to store against it.
- * @returns The new root CID.
- */
-export async function insertIntoMST(adapter, rootCid, key, value) {
-    const keyHeight = await nodeHeight(key);
-    if (rootCid === null)
-        return singleton(adapter, key, value, keyHeight, keyHeight);
-    const root = await loadNode(adapter, rootCid);
-    if (keyHeight > root.height) {
-        // The key outranks everything already stored, so it becomes the new root
-        // and the existing tree is split to sit beneath it.
-        const [left, right] = await splitSubtree(adapter, rootCid, key);
-        return saveNode(adapter, {
-            height: keyHeight,
-            keys: [key],
-            values: [value],
-            children: [
-                await lift(adapter, left, root.height, keyHeight - 1),
-                await lift(adapter, right, root.height, keyHeight - 1)
-            ]
-        });
-    }
-    return insertInto(adapter, rootCid, root.height, key, value, keyHeight);
-}
-/**
- * Delete a key from the MST.
- * @param adapter The storage adapter.
- * @param rootCid The current root, or null for an empty tree.
- * @param key The key to remove.
- * @returns The new root CID, or null once the tree is empty.
- */
-export async function deleteFromMST(adapter, rootCid, key) {
-    if (!rootCid)
-        return null;
-    const keyHeight = await nodeHeight(key);
-    let next = await deleteFrom(adapter, rootCid, key, keyHeight);
-    // Removing the tallest key can leave empty wrappers on top; drop them so the
-    // root is always the highest node that actually holds a key.
-    while (next !== null) {
-        const node = await loadNode(adapter, next);
-        if (node.keys.length > 0)
-            break;
-        next = node.children[0] ?? null;
-    }
-    return next;
-}
-/**
- * Lookup a value by key.
- * @param adapter The storage adapter.
- * @param rootCid The root to search from.
- * @param key The key to find.
- * @returns The value, or null when absent.
- */
-export async function lookupInMST(adapter, rootCid, key) {
-    let cid = rootCid;
-    while (cid !== null) {
-        const node = await loadNode(adapter, cid);
-        const idx = lowerBound(node.keys, key);
-        if (node.keys[idx] === key)
-            return node.values[idx];
-        cid = node.children[idx] ?? null;
-    }
-    return null;
-}
-/**
- * Lists entries — keys with their values — in key order: all of them, or
- * those under a prefix, reading only the nodes that can hold them.
- * @param adapter The storage adapter.
- * @param rootCid The root, or null for an empty tree.
- * @param prefix Only keys starting with this
- */
-export async function listMSTEntries(adapter, rootCid, prefix = '') {
-    const entries = [];
-    await walkEntries(adapter, rootCid, prefix, (key, value) => { entries.push({ key, value }); });
-    return entries;
-}
-//# sourceMappingURL=mst.js.map

package/dist/storage/mst.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mst.js","sourceRoot":"","sources":["../../src/storage/mst.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAgBxD;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,MAAM,GAAG,CAAC;IACxC,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,MAAM;QACN,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACvB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;KAChC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,IAAa;IACzC,uEAAuE;IACvE,MAAM,GAAG,GAAG;QACV,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,QAAQ,EAAE,IAAI,CAAC,QAAQ;KACxB,CAAC;IACF,OAAO,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAgB;IAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,CAAC;QACvB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;KAC3C,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,IAAa;IAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAClC,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC;AAC7B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,GAAW;IAC1C,MAAM,SAAS,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;QAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;aAAM,CAAC;YACN,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,KAAK,EAAE,CAAC;gBACR,IAAI,KAAK,CAAC,CAAC;YACb,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,OAAuB,EAAE,GAAW;IACjE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,GAAG,EAAE,CAAC,CAAC;IACrD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAAC,OAAuB,EAAE,IAAa;IACnE,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,GAAG,GAAG,MAAM,YAAY,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4EAA4E;AAE5E,wEAAwE;AACxE,SAAS,UAAU,CAAC,IAA2B,EAAE,MAAc;IAC7D,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;IACrB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,GAAG,CAAE,GAAG,MAAM;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YACjC,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,KAAK,UAAU,WAAW,CAAC,OAAuB,EAAE,IAAa;IAC/D,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACxF,OAAO,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,KAAK,UAAU,IAAI,CACjB,OAAuB,EACvB,GAAkB,EAClB,UAAkB,EAClB,QAAgB;IAEhB,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,OAAO,GAAG,GAAG,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,OAAO,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC;YAC9C,MAAM,EAAE,CAAC;YACT,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YACvB,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;YACzB,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC;SACnC,CAAC,CAAC,CAAC;IACN,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,wEAAwE;AACxE,KAAK,UAAU,SAAS,CACtB,OAAuB,EACvB,GAAW,EACX,KAAa,EACb,SAAiB,EACjB,SAAiB;IAEjB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC;QACjD,MAAM,EAAE,SAAS;QACjB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9B,QAAQ,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;KACtC,CAAC,CAAC,CAAC;IACJ,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,CAAC,CAAE,CAAC;AAC5D,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,YAAY,CACzB,OAAuB,EACvB,GAAkB,EAClB,GAAW;IAEX,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEtC,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAEvC,kEAAkE;IAClE,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC;IAE7F,MAAM,IAAI,GAAY;QACpB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;QAC7B,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;QACjC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,CAAC;KACtD,CAAC;IACF,MAAM,KAAK,GAAY;QACrB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;QAC1B,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC;QAC9B,QAAQ,EAAE,CAAC,UAAU,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;KACxD,CAAC;IAEF,OAAO,CAAC,MAAM,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;AAC/E,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,aAAa,CAC1B,OAAuB,EACvB,IAAmB,EACnB,KAAoB;IAEpB,IAAI,IAAI,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAChC,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAEhC,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,SAAS,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IAEjD,wEAAwE;IACxE,MAAM,MAAM,GAAG,MAAM,aAAa,CAChC,OAAO,EACP,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,IAAI,EACvD,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAC9B,CAAC;IAEF,OAAO,WAAW,CAAC,OAAO,EAAE;QAC1B,MAAM,EAAE,QAAQ,CAAC,MAAM;QACvB,IAAI,EAAE,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC;QAC3C,MAAM,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC;QACjD,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;KACtF,CAAC,CAAC;AACL,CAAC;AAED,8DAA8D;AAC9D,KAAK,UAAU,UAAU,CACvB,OAAuB,EACvB,GAAkB,EAClB,aAAqB,EACrB,GAAW,EACX,KAAa,EACb,SAAiB;IAEjB,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;IAElF,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAEvC,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACpB,OAAO,QAAQ,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAChD,CAAC;QAED,yEAAyE;QACzE,4CAA4C;QAC5C,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7F,OAAO,QAAQ,CAAC,OAAO,EAAE;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAChE,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACxE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;SACnG,CAAC,CAAC;IACL,CAAC;IAED,yDAAyD;IACzD,MAAM,KAAK,GAAG,MAAM,UAAU,CAC5B,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,CAC5E,CAAC;IACF,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACtB,OAAO,QAAQ,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AAClD,CAAC;AAED,mFAAmF;AACnF,KAAK,UAAU,UAAU,CACvB,OAAuB,EACvB,GAAkB,EAClB,GAAW,EACX,SAAiB;IAEjB,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAE9B,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAE1C,mEAAmE;IACnE,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM;QAAE,OAAO,GAAG,CAAC;IAExC,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAEvC,IAAI,SAAS,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG;YAAE,OAAO,GAAG,CAAC;QAEvC,kEAAkE;QAClE,MAAM,MAAM,GAAG,MAAM,aAAa,CAChC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CACpE,CAAC;QACF,OAAO,WAAW,CAAC,OAAO,EAAE;YAC1B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAC/D,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACrE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;SACpF,CAAC,CAAC;IACL,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IAC5C,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;IAClE,IAAI,KAAK,KAAK,QAAQ;QAAE,OAAO,GAAG,CAAC;IAEnC,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpC,QAAQ,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACtB,OAAO,WAAW,CAAC,OAAO,EAAE,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,KAAK,UAAU,WAAW,CACxB,OAAuB,EACvB,GAAkB,EAClB,MAAc,EACd,KAA2C;IAE3C,IAAI,GAAG,KAAK,IAAI;QAAE,OAAO;IAEzB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;IACtB,0DAA0D;IAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,UAAU,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QACtF,IAAI,UAAU;YAAE,OAAO;QACvB,MAAM,WAAW,GAAG,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,MAAM,CAAC;QAC1D,IAAI,CAAC,WAAW;YAAE,MAAM,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACtF,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC;YAAE,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;IACrF,CAAC;AACH,CAAC;AAED,2DAA2D;AAC3D,KAAK,UAAU,WAAW,CACxB,OAAuB,EACvB,GAAkB,EAClB,MAAmB,IAAI,GAAG,EAAE;IAE5B,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7C,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACb,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAC1C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClC,MAAM,WAAW,CAAC,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,0EAA0E;AAE1E;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,OAAuB,EAAE,OAAsB;IACxF,OAAO,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,OAAuB,EACvB,OAAsB,EACtB,GAAW,EACX,KAAa;IAEb,MAAM,SAAS,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC;IAExC,IAAI,OAAO,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IAElF,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAE9C,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,yEAAyE;QACzE,oDAAoD;QACpD,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;QAChE,OAAO,QAAQ,CAAC,OAAO,EAAE;YACvB,MAAM,EAAE,SAAS;YACjB,IAAI,EAAE,CAAC,GAAG,CAAC;YACX,MAAM,EAAE,CAAC,KAAK,CAAC;YACf,QAAQ,EAAE;gBACR,MAAM,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC;gBACrD,MAAM,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,SAAS,GAAG,CAAC,CAAC;aACvD;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AAC1E,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,OAAuB,EACvB,OAAsB,EACtB,GAAW;IAEX,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,MAAM,SAAS,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,IAAI,GAAG,MAAM,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;IAE9D,6EAA6E;IAC7E,6DAA6D;IAC7D,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;QACrB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM;QAChC,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IAClC,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,OAAuB,EACvB,OAAsB,EACtB,GAAW;IAEX,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC;QACrD,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IACnC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,OAAuB,EACvB,OAAsB,EACtB,MAAM,GAAG,EAAE;IAEX,MAAM,OAAO,GAA0C,EAAE,CAAC;IAC1D,MAAM,WAAW,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,OAAO,OAAO,CAAC;AACjB,CAAC"}

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

@@ -1,49 +0,0 @@
-/**
- * @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

@@ -1 +0,0 @@
-{"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

@@ -1,62 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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"}