@rocicorp/zero 0.5.2024103100 → 0.5.2024110200

package/out/replicache/src/btree/read.js

@@ -1,227 +0,0 @@
-import { deepEqual } from '../../../shared/src/json.js';
-import { emptyHash } from '../hash.js';
-import { getSizeOfEntry } from '../size-of-value.js';
-import { DataNodeImpl, InternalNodeImpl, NODE_ENTRIES, NODE_LEVEL, binarySearch, binarySearchFound, emptyDataNodeImpl, findLeaf, isDataNodeImpl, newNodeImpl, parseBTreeNode, } from './node.js';
-import { SPLICE_ADDED, SPLICE_AT, SPLICE_FROM, SPLICE_REMOVED, computeSplices, } from './splice.js';
-/**
- * The size of the header of a node. (If we had compile time
- * constants we would have used that).
- *
- * There is a test ensuring this is correct.
- */
-export const NODE_HEADER_SIZE = 11;
-export class BTreeRead {
-    _cache = new Map();
-    _dagRead;
-    _formatVersion;
-    rootHash;
-    getEntrySize;
-    chunkHeaderSize;
-    constructor(dagRead, formatVersion, root = emptyHash, getEntrySize = getSizeOfEntry, chunkHeaderSize = NODE_HEADER_SIZE) {
-        this._dagRead = dagRead;
-        this._formatVersion = formatVersion;
-        this.rootHash = root;
-        this.getEntrySize = getEntrySize;
-        this.chunkHeaderSize = chunkHeaderSize;
-    }
-    async getNode(hash) {
-        if (hash === emptyHash) {
-            return emptyDataNodeImpl;
-        }
-        const cached = this._cache.get(hash);
-        if (cached) {
-            return cached;
-        }
-        const chunk = await this._dagRead.mustGetChunk(hash);
-        const data = parseBTreeNode(chunk.data, this._formatVersion, this.getEntrySize);
-        const impl = newNodeImpl(data[NODE_ENTRIES], hash, data[NODE_LEVEL], false);
-        this._cache.set(hash, impl);
-        return impl;
-    }
-    async get(key) {
-        const leaf = await findLeaf(key, this.rootHash, this, this.rootHash);
-        const index = binarySearch(key, leaf.entries);
-        if (!binarySearchFound(index, leaf.entries, key)) {
-            return undefined;
-        }
-        return leaf.entries[index][1];
-    }
-    async has(key) {
-        const leaf = await findLeaf(key, this.rootHash, this, this.rootHash);
-        const index = binarySearch(key, leaf.entries);
-        return binarySearchFound(index, leaf.entries, key);
-    }
-    async isEmpty() {
-        const { rootHash } = this;
-        const node = await this.getNode(this.rootHash);
-        // The root hash has changed, so the tree has been modified.
-        if (this.rootHash !== rootHash) {
-            return this.isEmpty();
-        }
-        return node.entries.length === 0;
-    }
-    // We don't do any encoding of the key in the map, so we have no way of
-    // determining from an entry.key alone whether it is a regular key or an
-    // encoded IndexKey in an index map. Without encoding regular map keys the
-    // caller has to deal with encoding and decoding the keys for the index map.
-    scan(fromKey) {
-        return scanForHash(this.rootHash, () => this.rootHash, this.rootHash, fromKey, async (hash) => {
-            const cached = await this.getNode(hash);
-            if (cached) {
-                return [
-                    cached.level,
-                    cached.isMutable ? cached.entries.slice() : cached.entries,
-                ];
-            }
-            const chunk = await this._dagRead.mustGetChunk(hash);
-            return parseBTreeNode(chunk.data, this._formatVersion, this.getEntrySize);
-        });
-    }
-    async *keys() {
-        const node = await this.getNode(this.rootHash);
-        yield* node.keys(this);
-    }
-    async *entries() {
-        const node = await this.getNode(this.rootHash);
-        yield* node.entriesIter(this);
-    }
-    [Symbol.asyncIterator]() {
-        return this.entries();
-    }
-    async *diff(last) {
-        const [currentNode, lastNode] = await Promise.all([
-            this.getNode(this.rootHash),
-            last.getNode(last.rootHash),
-        ]);
-        yield* diffNodes(lastNode, currentNode, last, this);
-    }
-}
-async function* diffNodes(last, current, lastTree, currentTree) {
-    if (last.level > current.level) {
-        // merge all of last's children into a new node
-        // We know last is an internal node because level > 0.
-        const lastChild = (await last.getCompositeChildren(0, last.entries.length, lastTree));
-        yield* diffNodes(lastChild, current, lastTree, currentTree);
-        return;
-    }
-    if (current.level > last.level) {
-        // We know current is an internal node because level > 0.
-        const currentChild = (await current.getCompositeChildren(0, current.entries.length, currentTree));
-        yield* diffNodes(last, currentChild, lastTree, currentTree);
-        return;
-    }
-    if (isDataNodeImpl(last) && isDataNodeImpl(current)) {
-        yield* diffEntries(last.entries, current.entries);
-        return;
-    }
-    // Now we have two internal nodes with the same level. We compute the diff as
-    // splices for the internal node entries. We then flatten these and call diff
-    // recursively.
-    const initialSplices = computeSplices(last.entries, current.entries);
-    for (const splice of initialSplices) {
-        const [lastChild, currentChild] = await Promise.all([
-            last.getCompositeChildren(splice[SPLICE_AT], splice[SPLICE_REMOVED], lastTree),
-            current.getCompositeChildren(splice[SPLICE_FROM], splice[SPLICE_ADDED], currentTree),
-        ]);
-        yield* diffNodes(lastChild, currentChild, lastTree, currentTree);
-    }
-}
-function* diffEntries(lastEntries, currentEntries) {
-    const lastLength = lastEntries.length;
-    const currentLength = currentEntries.length;
-    let i = 0;
-    let j = 0;
-    while (i < lastLength && j < currentLength) {
-        const lastKey = lastEntries[i][0];
-        const currentKey = currentEntries[j][0];
-        if (lastKey === currentKey) {
-            if (!deepEqual(lastEntries[i][1], currentEntries[j][1])) {
-                yield {
-                    op: 'change',
-                    key: lastKey,
-                    oldValue: lastEntries[i][1],
-                    newValue: currentEntries[j][1],
-                };
-            }
-            i++;
-            j++;
-        }
-        else if (lastKey < currentKey) {
-            yield {
-                op: 'del',
-                key: lastKey,
-                oldValue: lastEntries[i][1],
-            };
-            i++;
-        }
-        else {
-            yield {
-                op: 'add',
-                key: currentKey,
-                newValue: currentEntries[j][1],
-            };
-            j++;
-        }
-    }
-    for (; i < lastLength; i++) {
-        yield {
-            op: 'del',
-            key: lastEntries[i][0],
-            oldValue: lastEntries[i][1],
-        };
-    }
-    for (; j < currentLength; j++) {
-        yield {
-            op: 'add',
-            key: currentEntries[j][0],
-            newValue: currentEntries[j][1],
-        };
-    }
-}
-async function* scanForHash(expectedRootHash, getRootHash, hash, fromKey, readNode) {
-    if (hash === emptyHash) {
-        return;
-    }
-    const data = await readNode(hash);
-    const entries = data[NODE_ENTRIES];
-    let i = 0;
-    if (fromKey) {
-        i = binarySearch(fromKey, entries);
-    }
-    if (data[NODE_LEVEL] > 0) {
-        for (; i < entries.length; i++) {
-            yield* scanForHash(expectedRootHash, getRootHash, entries[i][1], fromKey, readNode);
-            fromKey = '';
-        }
-    }
-    else {
-        for (; i < entries.length; i++) {
-            const rootHash = getRootHash();
-            // If rootHash changed then we start a new iterator from the key.
-            if (expectedRootHash !== rootHash) {
-                yield* scanForHash(rootHash, getRootHash, rootHash, entries[i][0], readNode);
-                return;
-            }
-            yield entries[i];
-        }
-    }
-}
-export async function allEntriesAsDiff(map, op) {
-    const diff = [];
-    const make = op === 'add'
-        ? entry => ({
-            op: 'add',
-            key: entry[0],
-            newValue: entry[1],
-        })
-        : entry => ({
-            op: 'del',
-            key: entry[0],
-            oldValue: entry[1],
-        });
-    for await (const entry of map.entries()) {
-        diff.push(make(entry));
-    }
-    return diff;
-}
-//# sourceMappingURL=read.js.map

package/out/replicache/src/btree/read.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"read.js","sourceRoot":"","sources":["../../../../../replicache/src/btree/read.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,SAAS,EAAC,MAAM,6BAA6B,CAAC;AAItD,OAAO,EAAY,SAAS,EAAC,MAAM,YAAY,CAAC;AAChD,OAAO,EAAC,cAAc,EAAC,MAAM,qBAAqB,CAAC;AACnD,OAAO,EACL,YAAY,EAIZ,gBAAgB,EAChB,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,iBAAiB,EACjB,iBAAiB,EACjB,QAAQ,EACR,cAAc,EACd,WAAW,EACX,cAAc,GACf,MAAM,WAAW,CAAC;AACnB,OAAO,EACL,YAAY,EACZ,SAAS,EACT,WAAW,EACX,cAAc,EACd,cAAc,GACf,MAAM,aAAa,CAAC;AAErB;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAEnC,MAAM,OAAO,SAAS;IACD,MAAM,GACvB,IAAI,GAAG,EAAE,CAAC;IAEO,QAAQ,CAAO;IACf,cAAc,CAAgB;IACjD,QAAQ,CAAO;IACN,YAAY,CAA+B;IAC3C,eAAe,CAAS;IAEjC,YACE,OAAa,EACb,aAA4B,EAC5B,OAAa,SAAS,EACtB,eAA6C,cAAc,EAC3D,eAAe,GAAG,gBAAgB;QAElC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IACzC,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,IAAU;QACtB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,iBAAiB,CAAC;QAC3B,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,cAAc,CACzB,KAAK,CAAC,IAAI,EACV,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,YAAY,CAClB,CAAC;QACF,MAAM,IAAI,GAAG,WAAW,CACtB,IAAI,CAAC,YAAY,CAA6B,EAC9C,IAAI,EACJ,IAAI,CAAC,UAAU,CAAC,EAChB,KAAK,CACN,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,GAAW;QACnB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;YACjD,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,GAAW;QACnB,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrE,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,OAAO,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,KAAK,CAAC,OAAO;QACX,MAAM,EAAC,QAAQ,EAAC,GAAG,IAAI,CAAC;QACxB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,4DAA4D;QAC5D,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QACxB,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,uEAAuE;IACvE,wEAAwE;IACxE,0EAA0E;IAC1E,4EAA4E;IAC5E,IAAI,CAAC,OAAe;QAClB,OAAO,WAAW,CAChB,IAAI,CAAC,QAAQ,EACb,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,EACnB,IAAI,CAAC,QAAQ,EACb,OAAO,EACP,KAAK,EAAC,IAAI,EAAC,EAAE;YACX,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACxC,IAAI,MAAM,EAAE,CAAC;gBACX,OAAO;oBACL,MAAM,CAAC,KAAK;oBACZ,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO;iBAC3D,CAAC;YACJ,CAAC;YACD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YACrD,OAAO,cAAc,CACnB,KAAK,CAAC,IAAI,EACV,IAAI,CAAC,cAAc,EACnB,IAAI,CAAC,YAAY,CAClB,CAAC;QACJ,CAAC,CACF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,CAAC,IAAI;QACT,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,CAAC,OAAO;QACZ,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,CAAC,MAAM,CAAC,aAAa,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED,KAAK,CAAC,CAAC,IAAI,CAAC,IAAe;QACzB,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAChD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;SAC5B,CAAC,CAAC;QACH,KAAK,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACtD,CAAC;CACF;AAED,KAAK,SAAS,CAAC,CAAC,SAAS,CACvB,IAAqC,EACrC,OAAwC,EACxC,QAAmB,EACnB,WAAsB;IAEtB,IAAI,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;QAC/B,+CAA+C;QAC/C,sDAAsD;QACtD,MAAM,SAAS,GAAG,CAAC,MAAO,IAAyB,CAAC,oBAAoB,CACtE,CAAC,EACD,IAAI,CAAC,OAAO,CAAC,MAAM,EACnB,QAAQ,CACT,CAAqB,CAAC;QACvB,KAAK,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;QAC5D,OAAO;IACT,CAAC;IAED,IAAI,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/B,yDAAyD;QACzD,MAAM,YAAY,GAAG,CAAC,MACpB,OACD,CAAC,oBAAoB,CACpB,CAAC,EACD,OAAO,CAAC,OAAO,CAAC,MAAM,EACtB,WAAW,CACZ,CAAqB,CAAC;QACvB,KAAK,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;QAC5D,OAAO;IACT,CAAC;IAED,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;QACpD,KAAK,CAAC,CAAC,WAAW,CACf,IAAqB,CAAC,OAAO,EAC7B,OAAwB,CAAC,OAAO,CAClC,CAAC;QACF,OAAO;IACT,CAAC;IAED,6EAA6E;IAC7E,6EAA6E;IAC7E,eAAe;IACf,MAAM,cAAc,GAAG,cAAc,CAClC,IAAyB,CAAC,OAAO,EACjC,OAA4B,CAAC,OAAO,CACtC,CAAC;IACF,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;QACpC,MAAM,CAAC,SAAS,EAAE,YAAY,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACjD,IAAyB,CAAC,oBAAoB,CAC7C,MAAM,CAAC,SAAS,CAAC,EACjB,MAAM,CAAC,cAAc,CAAC,EACtB,QAAQ,CACT;YACA,OAA4B,CAAC,oBAAoB,CAChD,MAAM,CAAC,WAAW,CAAC,EACnB,MAAM,CAAC,YAAY,CAAC,EACpB,WAAW,CACZ;SACF,CAAC,CAAC;QACH,KAAK,CAAC,CAAC,SAAS,CAAC,SAAS,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,CAAC,WAAW,CACnB,WAA8C,EAC9C,cAAiD;IAEjD,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC;IACtC,MAAM,aAAa,GAAG,cAAc,CAAC,MAAM,CAAC;IAC5C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,UAAU,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxD,MAAM;oBACJ,EAAE,EAAE,QAAQ;oBACZ,GAAG,EAAE,OAAO;oBACZ,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC/B,CAAC;YACJ,CAAC;YACD,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;YAChC,MAAM;gBACJ,EAAE,EAAE,KAAK;gBACT,GAAG,EAAE,OAAO;gBACZ,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC5B,CAAC;YACF,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,CAAC;YACN,MAAM;gBACJ,EAAE,EAAE,KAAK;gBACT,GAAG,EAAE,UAAU;gBACf,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC/B,CAAC;YACF,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM;YACJ,EAAE,EAAE,KAAK;YACT,GAAG,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,QAAQ,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM;YACJ,EAAE,EAAE,KAAK;YACT,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,QAAQ,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC/B,CAAC;IACJ,CAAC;AACH,CAAC;AAUD,KAAK,SAAS,CAAC,CAAC,WAAW,CACzB,gBAAsB,EACtB,WAAuB,EACvB,IAAU,EACV,OAAe,EACf,QAAkB;IAElB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,OAAO;IACT,CAAC;IAED,MAAM,IAAI,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;IACnC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,OAAO,EAAE,CAAC;QACZ,CAAC,GAAG,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACrC,CAAC;IACD,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,KAAK,CAAC,CAAC,WAAW,CAChB,gBAAgB,EAChB,WAAW,EACV,OAAO,CAAC,CAAC,CAAiB,CAAC,CAAC,CAAC,EAC9B,OAAO,EACP,QAAQ,CACT,CAAC;YACF,OAAO,GAAG,EAAE,CAAC;QACf,CAAC;IACH,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,WAAW,EAAE,CAAC;YAC/B,iEAAiE;YACjE,IAAI,gBAAgB,KAAK,QAAQ,EAAE,CAAC;gBAClC,KAAK,CAAC,CAAC,WAAW,CAChB,QAAQ,EACR,WAAW,EACX,QAAQ,EACR,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACb,QAAQ,CACT,CAAC;gBACF,OAAO;YACT,CAAC;YACD,MAAM,OAAO,CAAC,CAAC,CAA2B,CAAC;QAC7C,CAAC;IACH,CAAC;AACH,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,GAAc,EACd,EAAiB;IAEjB,MAAM,IAAI,GAA4B,EAAE,CAAC;IACzC,MAAM,IAAI,GACR,EAAE,KAAK,KAAK;QACV,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACR,EAAE,EAAE,KAAK;YACT,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;YACb,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;SACnB,CAAC;QACJ,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACR,EAAE,EAAE,KAAK;YACT,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;YACb,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC;SACnB,CAAC,CAAC;IAET,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/out/replicache/src/btree/splice.js

@@ -1,79 +0,0 @@
-import { deepEqual } from '../../../shared/src/json.js';
-const SPLICE_UNASSIGNED = -1;
-export const SPLICE_AT = 0;
-export const SPLICE_REMOVED = 1;
-export const SPLICE_ADDED = 2;
-export const SPLICE_FROM = 3;
-const KEY = 0;
-const VALUE = 1;
-export function* computeSplices(previous, current) {
-    let previousIndex = 0;
-    let currentIndex = 0;
-    let splice;
-    function ensureAssigned(splice, index) {
-        if (splice[SPLICE_FROM] === SPLICE_UNASSIGNED) {
-            splice[SPLICE_FROM] = index;
-        }
-    }
-    function newSplice() {
-        return [previousIndex, 0, 0, SPLICE_UNASSIGNED];
-    }
-    while (previousIndex < previous.length && currentIndex < current.length) {
-        if (previous[previousIndex][KEY] === current[currentIndex][KEY]) {
-            if (deepEqual(
-            // These are really Hash | InternalValue
-            previous[previousIndex][VALUE], current[currentIndex][VALUE])) {
-                if (splice) {
-                    ensureAssigned(splice, 0);
-                    yield splice;
-                    splice = undefined;
-                }
-            }
-            else {
-                if (!splice) {
-                    splice = newSplice();
-                }
-                splice[SPLICE_ADDED]++;
-                splice[SPLICE_REMOVED]++;
-                ensureAssigned(splice, currentIndex);
-            }
-            previousIndex++;
-            currentIndex++;
-        }
-        else if (previous[previousIndex][KEY] < current[currentIndex][KEY]) {
-            // previous was removed
-            if (!splice) {
-                splice = newSplice();
-            }
-            splice[SPLICE_REMOVED]++;
-            previousIndex++;
-        }
-        else {
-            // current was added
-            if (!splice) {
-                splice = newSplice();
-            }
-            splice[SPLICE_ADDED]++;
-            ensureAssigned(splice, currentIndex);
-            currentIndex++;
-        }
-    }
-    if (currentIndex < current.length) {
-        if (!splice) {
-            splice = newSplice();
-        }
-        splice[SPLICE_ADDED] += current.length - currentIndex;
-        ensureAssigned(splice, currentIndex);
-    }
-    if (previousIndex < previous.length) {
-        if (!splice) {
-            splice = newSplice();
-        }
-        splice[SPLICE_REMOVED] += previous.length - previousIndex;
-    }
-    if (splice) {
-        ensureAssigned(splice, 0);
-        yield splice;
-    }
-}
-//# sourceMappingURL=splice.js.map

package/out/replicache/src/btree/splice.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"splice.js","sourceRoot":"","sources":["../../../../../replicache/src/btree/splice.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,SAAS,EAAyB,MAAM,6BAA6B,CAAC;AAI9E,MAAM,iBAAiB,GAAG,CAAC,CAAC,CAAC;AAC7B,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,CAAC;AAC3B,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAChC,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAC9B,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAE7B,MAAM,GAAG,GAAG,CAAC,CAAC;AACd,MAAM,KAAK,GAAG,CAAC,CAAC;AAIhB,MAAM,SAAS,CAAC,CAAC,cAAc,CAC7B,QAA6B,EAC7B,OAA4B;IAE5B,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,MAA0B,CAAC;IAE/B,SAAS,cAAc,CAAC,MAAc,EAAE,KAAa;QACnD,IAAI,MAAM,CAAC,WAAW,CAAC,KAAK,iBAAiB,EAAE,CAAC;YAC9C,MAAM,CAAC,WAAW,CAAC,GAAG,KAAK,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,SAAS,SAAS;QAChB,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;IAClD,CAAC;IAED,OAAO,aAAa,GAAG,QAAQ,CAAC,MAAM,IAAI,YAAY,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACxE,IAAI,QAAQ,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,KAAK,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YAChE,IACE,SAAS;YACP,wCAAwC;YACxC,QAAQ,CAAC,aAAa,CAAC,CAAC,KAAK,CAAsB,EACnD,OAAO,CAAC,YAAY,CAAC,CAAC,KAAK,CAAsB,CAClD,EACD,CAAC;gBACD,IAAI,MAAM,EAAE,CAAC;oBACX,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAC1B,MAAM,MAAM,CAAC;oBACb,MAAM,GAAG,SAAS,CAAC;gBACrB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,MAAM,EAAE,CAAC;oBACZ,MAAM,GAAG,SAAS,EAAE,CAAC;gBACvB,CAAC;gBACD,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;gBACzB,cAAc,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACvC,CAAC;YACD,aAAa,EAAE,CAAC;YAChB,YAAY,EAAE,CAAC;QACjB,CAAC;aAAM,IAAI,QAAQ,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACrE,uBAAuB;YACvB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,SAAS,EAAE,CAAC;YACvB,CAAC;YACD,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;YAEzB,aAAa,EAAE,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,oBAAoB;YACpB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,SAAS,EAAE,CAAC;YACvB,CAAC;YACD,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;YACvB,cAAc,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YAErC,YAAY,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAED,IAAI,YAAY,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,SAAS,EAAE,CAAC;QACvB,CAAC;QACD,MAAM,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,YAAY,CAAC;QACtD,cAAc,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IACvC,CAAC;IAED,IAAI,aAAa,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,SAAS,EAAE,CAAC;QACvB,CAAC;QACD,MAAM,CAAC,cAAc,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,aAAa,CAAC;IAC5D,CAAC;IAED,IAAI,MAAM,EAAE,CAAC;QACX,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,MAAM,CAAC;IACf,CAAC;AACH,CAAC"}

package/out/replicache/src/btree/write.js

@@ -1,154 +0,0 @@
-import { Lock } from '@rocicorp/lock';
-import { assert } from '../../../shared/src/asserts.js';
-import { toRefs } from '../dag/chunk.js';
-import { emptyHash, newRandomHash } from '../hash.js';
-import { getSizeOfEntry } from '../size-of-value.js';
-import { DataNodeImpl, InternalNodeImpl, createNewInternalEntryForNode, emptyDataNode, isDataNodeImpl, newNodeImpl, partition, toChunkData, } from './node.js';
-import { BTreeRead } from './read.js';
-export class BTreeWrite extends BTreeRead {
-    /**
-     * This rw lock is used to ensure we do not mutate the btree in parallel. It
-     * would be a problem if we didn't have the lock in cases like this:
-     *
-     * ```ts
-     * const p1 = tree.put('a', 0);
-     * const p2 = tree.put('b', 1);
-     * await p1;
-     * await p2;
-     * ```
-     *
-     * because both `p1` and `p2` would start from the old root hash but a put
-     * changes the root hash so the two concurrent puts would lead to only one of
-     * them actually working, and it is not deterministic which one would finish
-     * last.
-     */
-    #lock = new Lock();
-    #modified = new Map();
-    minSize;
-    maxSize;
-    constructor(dagWrite, formatVersion, root = emptyHash, minSize = 8 * 1024, maxSize = 16 * 1024, getEntrySize = getSizeOfEntry, chunkHeaderSize) {
-        super(dagWrite, formatVersion, root, getEntrySize, chunkHeaderSize);
-        this.minSize = minSize;
-        this.maxSize = maxSize;
-    }
-    #addToModified(node) {
-        assert(node.isMutable);
-        this.#modified.set(node.hash, node);
-        this._cache.set(node.hash, node);
-    }
-    updateNode(node) {
-        assert(node.isMutable);
-        this.#modified.delete(node.hash);
-        node.hash = newRandomHash();
-        this.#addToModified(node);
-    }
-    newInternalNodeImpl(entries, level) {
-        const n = new InternalNodeImpl(entries, newRandomHash(), level, true);
-        this.#addToModified(n);
-        return n;
-    }
-    newDataNodeImpl(entries) {
-        const n = new DataNodeImpl(entries, newRandomHash(), true);
-        this.#addToModified(n);
-        return n;
-    }
-    newNodeImpl(entries, level) {
-        const n = newNodeImpl(entries, newRandomHash(), level, true);
-        this.#addToModified(n);
-        return n;
-    }
-    put(key, value) {
-        return this.#lock.withLock(async () => {
-            const oldRootNode = await this.getNode(this.rootHash);
-            const entrySize = this.getEntrySize(key, value);
-            const rootNode = await oldRootNode.set(key, value, entrySize, this);
-            // We do the rebalancing in the parent so we need to do it here as well.
-            if (rootNode.getChildNodeSize(this) > this.maxSize) {
-                const headerSize = this.chunkHeaderSize;
-                const partitions = partition(rootNode.entries, value => value[2], this.minSize - headerSize, this.maxSize - headerSize);
-                const { level } = rootNode;
-                const entries = partitions.map(entries => {
-                    const node = this.newNodeImpl(entries, level);
-                    return createNewInternalEntryForNode(node, this.getEntrySize);
-                });
-                const newRoot = this.newInternalNodeImpl(entries, level + 1);
-                this.rootHash = newRoot.hash;
-                return;
-            }
-            this.rootHash = rootNode.hash;
-        });
-    }
-    del(key) {
-        return this.#lock.withLock(async () => {
-            const oldRootNode = await this.getNode(this.rootHash);
-            const newRootNode = await oldRootNode.del(key, this);
-            // No need to rebalance here since if root gets too small there is nothing
-            // we can do about that.
-            const found = this.rootHash !== newRootNode.hash;
-            if (found) {
-                // Flatten one layer.
-                if (newRootNode.level > 0 && newRootNode.entries.length === 1) {
-                    this.rootHash = newRootNode.entries[0][1];
-                }
-                else {
-                    this.rootHash = newRootNode.hash;
-                }
-            }
-            return found;
-        });
-    }
-    clear() {
-        return this.#lock.withLock(() => {
-            this.#modified.clear();
-            this.rootHash = emptyHash;
-        });
-    }
-    flush() {
-        return this.#lock.withLock(async () => {
-            const dagWrite = this._dagRead;
-            if (this.rootHash === emptyHash) {
-                // Write a chunk for the empty tree.
-                const chunk = dagWrite.createChunk(emptyDataNode, []);
-                await dagWrite.putChunk(chunk);
-                return chunk.hash;
-            }
-            const newChunks = [];
-            const newRoot = gatherNewChunks(this.rootHash, newChunks, dagWrite.createChunk, this.#modified, this._formatVersion);
-            await Promise.all(newChunks.map(chunk => dagWrite.putChunk(chunk)));
-            this.#modified.clear();
-            this.rootHash = newRoot;
-            return newRoot;
-        });
-    }
-}
-function gatherNewChunks(hash, newChunks, createChunk, modified, formatVersion) {
-    const node = modified.get(hash);
-    if (node === undefined) {
-        // Not modified, use the original.
-        return hash;
-    }
-    if (isDataNodeImpl(node)) {
-        const chunk = createChunk(toChunkData(node, formatVersion), []);
-        newChunks.push(chunk);
-        return chunk.hash;
-    }
-    // The BTree cannot have duplicate keys so the child entry hashes are unique.
-    // No need fot a set to dedupe here.
-    const refs = [];
-    const { entries } = node;
-    for (let i = 0; i < entries.length; i++) {
-        const entry = entries[i];
-        const childHash = entry[1];
-        const newChildHash = gatherNewChunks(childHash, newChunks, createChunk, modified, formatVersion);
-        if (newChildHash !== childHash) {
-            // MUTATES the entries!
-            // Hashes do not change the size of the entry because all hashes have the same length
-            entries[i] = [entry[0], newChildHash, entry[2]];
-        }
-        refs.push(newChildHash);
-    }
-    const chunk = createChunk(toChunkData(node, formatVersion), toRefs(refs));
-    newChunks.push(chunk);
-    return chunk.hash;
-}
-//# sourceMappingURL=write.js.map

package/out/replicache/src/btree/write.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"write.js","sourceRoot":"","sources":["../../../../../replicache/src/btree/write.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,IAAI,EAAC,MAAM,gBAAgB,CAAC;AACpC,OAAO,EAAC,MAAM,EAAC,MAAM,gCAAgC,CAAC;AAEtD,OAAO,EAA+B,MAAM,EAAC,MAAM,iBAAiB,CAAC;AAIrE,OAAO,EAAY,SAAS,EAAE,aAAa,EAAC,MAAM,YAAY,CAAC;AAC/D,OAAO,EAAC,cAAc,EAAC,MAAM,qBAAqB,CAAC;AACnD,OAAO,EACL,YAAY,EAEZ,gBAAgB,EAChB,6BAA6B,EAC7B,aAAa,EACb,cAAc,EACd,WAAW,EACX,SAAS,EACT,WAAW,GACZ,MAAM,WAAW,CAAC;AACnB,OAAO,EAAC,SAAS,EAAC,MAAM,WAAW,CAAC;AAEpC,MAAM,OAAO,UAAW,SAAQ,SAAS;IACvC;;;;;;;;;;;;;;;OAeG;IACM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC;IACnB,SAAS,GAA+C,IAAI,GAAG,EAAE,CAAC;IAIlE,OAAO,CAAS;IAChB,OAAO,CAAS;IAEzB,YACE,QAAe,EACf,aAA4B,EAC5B,OAAa,SAAS,EACtB,OAAO,GAAG,CAAC,GAAG,IAAI,EAClB,OAAO,GAAG,EAAE,GAAG,IAAI,EACnB,eAA6C,cAAc,EAC3D,eAAwB;QAExB,KAAK,CAAC,QAAQ,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;QAEpE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,cAAc,CAAC,IAAqC;QAClD,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,UAAU,CAAC,IAAqC;QAC9C,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,GAAG,aAAa,EAAE,CAAC;QAC5B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,mBAAmB,CACjB,OAA2B,EAC3B,KAAa;QAEb,MAAM,CAAC,GAAG,IAAI,gBAAgB,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QACtE,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,eAAe,CAAC,OAAiC;QAC/C,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3D,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAQD,WAAW,CACT,OAAiD,EACjD,KAAa;QAEb,MAAM,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7D,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACvB,OAAO,CAAC,CAAC;IACX,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,KAAsB;QACrC,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE;YACpC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtD,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,MAAM,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;YAEpE,wEAAwE;YACxE,IAAI,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC;gBACxC,MAAM,UAAU,GAAG,SAAS,CAC1B,QAAQ,CAAC,OAAO,EAChB,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,OAAO,GAAG,UAAU,EACzB,IAAI,CAAC,OAAO,GAAG,UAAU,CAC1B,CAAC;gBACF,MAAM,EAAC,KAAK,EAAC,GAAG,QAAQ,CAAC;gBACzB,MAAM,OAAO,GAAkB,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;oBACtD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;oBAC9C,OAAO,6BAA6B,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;gBAChE,CAAC,CAAC,CAAC;gBACH,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBAC7D,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;gBAC7B,OAAO;YACT,CAAC;YAED,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC;QAChC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE;YACpC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtD,MAAM,WAAW,GAAG,MAAM,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAErD,0EAA0E;YAC1E,wBAAwB;YACxB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,KAAK,WAAW,CAAC,IAAI,CAAC;YACjD,IAAI,KAAK,EAAE,CAAC;gBACV,qBAAqB;gBACrB,IAAI,WAAW,CAAC,KAAK,GAAG,CAAC,IAAI,WAAW,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC9D,IAAI,CAAC,QAAQ,GAAI,WAAgC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClE,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC;gBACnC,CAAC;YACH,CAAC;YAED,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE;YAC9B,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;YACvB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC5B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE;YACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE/B,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAChC,oCAAoC;gBACpC,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;gBACtD,MAAM,QAAQ,CAAC,QAAQ,CAAC,KAAiC,CAAC,CAAC;gBAC3D,OAAO,KAAK,CAAC,IAAI,CAAC;YACpB,CAAC;YAED,MAAM,SAAS,GAAY,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,eAAe,CAC7B,IAAI,CAAC,QAAQ,EACb,SAAS,EACT,QAAQ,CAAC,WAAW,EACpB,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,cAAc,CACpB,CAAC;YACF,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACpE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;YACvB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;YACxB,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC,CAAC;IACL,CAAC;CACF;AAED,SAAS,eAAe,CACtB,IAAU,EACV,SAAkB,EAClB,WAAwB,EACxB,QAAoD,EACpD,aAA4B;IAE5B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,kCAAkC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,EAAE,CAAC,CAAC;QAChE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC;IAED,6EAA6E;IAC7E,oCAAoC;IACpC,MAAM,IAAI,GAAW,EAAE,CAAC;IACxB,MAAM,EAAC,OAAO,EAAC,GAAG,IAAI,CAAC;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,YAAY,GAAG,eAAe,CAClC,SAAS,EACT,SAAS,EACT,WAAW,EACX,QAAQ,EACR,aAAa,CACd,CAAC;QACF,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,uBAAuB;YACvB,qFAAqF;YACrF,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,WAAW,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1E,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,KAAK,CAAC,IAAI,CAAC;AACpB,CAAC"}

package/out/replicache/src/call-default-fetch.js

@@ -1,37 +0,0 @@
-/**
- * Helper function for {@link getDefaultPuller} and {@link getDefaultPusher}.
- */
-export async function callDefaultFetch(url, auth, requestID, requestBody) {
-    const init = {
-        headers: {
-            // eslint-disable-next-line @typescript-eslint/naming-convention
-            'Content-type': 'application/json',
-            // eslint-disable-next-line @typescript-eslint/naming-convention
-            'Authorization': auth,
-            // eslint-disable-next-line @typescript-eslint/naming-convention
-            'X-Replicache-RequestID': requestID,
-        },
-        body: JSON.stringify(requestBody),
-        method: 'POST',
-    };
-    const request = new Request(url, init);
-    const response = await fetch(request);
-    const httpStatusCode = response.status;
-    if (httpStatusCode !== 200) {
-        return [
-            undefined,
-            {
-                httpStatusCode,
-                errorMessage: await response.text(),
-            },
-        ];
-    }
-    return [
-        response,
-        {
-            httpStatusCode,
-            errorMessage: '',
-        },
-    ];
-}
-//# sourceMappingURL=call-default-fetch.js.map

package/out/replicache/src/call-default-fetch.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"call-default-fetch.js","sourceRoot":"","sources":["../../../../replicache/src/call-default-fetch.ts"],"names":[],"mappings":"AAEA;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,GAAW,EACX,IAAY,EACZ,SAAiB,EACjB,WAAiB;IAEjB,MAAM,IAAI,GAAG;QACX,OAAO,EAAE;YACP,gEAAgE;YAChE,cAAc,EAAE,kBAAkB;YAClC,gEAAgE;YAChE,eAAe,EAAE,IAAI;YACrB,gEAAgE;YAChE,wBAAwB,EAAE,SAAS;SACpC;QACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC;QACjC,MAAM,EAAE,MAAM;KACf,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACvC,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;IACtC,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC;IACvC,IAAI,cAAc,KAAK,GAAG,EAAE,CAAC;QAC3B,OAAO;YACL,SAAS;YACT;gBACE,cAAc;gBACd,YAAY,EAAE,MAAM,QAAQ,CAAC,IAAI,EAAE;aACpC;SACF,CAAC;IACJ,CAAC;IACD,OAAO;QACL,QAAQ;QACR;YACE,cAAc;YACd,YAAY,EAAE,EAAE;SACjB;KACF,CAAC;AACJ,CAAC"}

package/out/replicache/src/config.js

@@ -1,13 +0,0 @@
-import { isProd } from '../../shared/src/config.js';
-export { isProd as skipBTreeNodeAsserts, isProd as skipCommitDataAsserts, 
-/**
- * In debug mode we deeply freeze the values we read out of the IDB store and we
- * deeply freeze the values we put into the stores.
- */
-isProd as skipFreeze, 
-/**
- * In debug mode we assert that chunks and BTree data is deeply frozen. In
- * release mode we skip these asserts.
- */
-isProd as skipFrozenAsserts, isProd as skipGCAsserts, };
-//# sourceMappingURL=config.js.map

package/out/replicache/src/config.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"config.js","sourceRoot":"","sources":["../../../../replicache/src/config.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,MAAM,EAAC,MAAM,4BAA4B,CAAC;AAElD,OAAO,EACL,MAAM,IAAI,oBAAoB,EAC9B,MAAM,IAAI,qBAAqB;AAC/B;;;GAGG;AACH,MAAM,IAAI,UAAU;AACpB;;;GAGG;AACH,MAAM,IAAI,iBAAiB,EAC3B,MAAM,IAAI,aAAa,GACxB,CAAC"}

package/out/replicache/src/connection-loop-delegates.js

@@ -1,30 +0,0 @@
-class ConnectionLoopDelegateImpl {
-    rep;
-    invokeSend;
-    // TODO: Remove the ability to have more than one concurrent connection and update tests.
-    // Bug: https://github.com/rocicorp/replicache-internal/issues/303
-    maxConnections = 1;
-    constructor(rep, invokeSend) {
-        this.rep = rep;
-        this.invokeSend = invokeSend;
-    }
-    get maxDelayMs() {
-        return this.rep.requestOptions.maxDelayMs;
-    }
-    get minDelayMs() {
-        return this.rep.requestOptions.minDelayMs;
-    }
-}
-export class PullDelegate extends ConnectionLoopDelegateImpl {
-    debounceDelay = 0;
-    get watchdogTimer() {
-        return this.rep.pullInterval;
-    }
-}
-export class PushDelegate extends ConnectionLoopDelegateImpl {
-    get debounceDelay() {
-        return this.rep.pushDelay;
-    }
-    watchdogTimer = null;
-}
-//# sourceMappingURL=connection-loop-delegates.js.map

package/out/replicache/src/connection-loop-delegates.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"connection-loop-delegates.js","sourceRoot":"","sources":["../../../../replicache/src/connection-loop-delegates.ts"],"names":[],"mappings":"AAGA,MAAM,0BAA0B;IACrB,GAAG,CAAiB;IACpB,UAAU,CAAyB;IAE5C,yFAAyF;IACzF,kEAAkE;IACzD,cAAc,GAAG,CAAC,CAAC;IAE5B,YAAY,GAAmB,EAAE,UAAkC;QACjE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,UAAU,CAAC;IAC5C,CAAC;IAED,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,UAAU,CAAC;IAC5C,CAAC;CACF;AAED,MAAM,OAAO,YACX,SAAQ,0BAA0B;IAGzB,aAAa,GAAG,CAAC,CAAC;IAE3B,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC;IAC/B,CAAC;CACF;AAED,MAAM,OAAO,YACX,SAAQ,0BAA0B;IAGlC,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;IAC5B,CAAC;IAED,aAAa,GAAG,IAAI,CAAC;CACtB"}