@rocicorp/zero 0.2.2024101100 → 0.3.2024102300

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

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

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

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

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

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

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

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

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

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

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

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

@@ -0,0 +1,268 @@
+import { resolver } from '@rocicorp/resolver';
+import { sleep } from '../../shared/src/sleep.js';
+export const DEBOUNCE_DELAY_MS = 10;
+export const MIN_DELAY_MS = 30;
+export const MAX_DELAY_MS = 60_000;
+export class ConnectionLoop {
+    // ConnectionLoop runs a loop sending network requests (either pushes or
+    // pulls) to the server. Our goal, generally, is to send requests as fast as
+    // we can, but to adjust in case of slowness, network errors, etc. We will
+    // send requests in parallel if the server supports it. We also debounce
+    // pushes since they frequently happen in series very near to one another
+    // (e.g., during drag'n drops).
+    //
+    // The loop flows through the following states forever, until it is closed:
+    //
+    // Pending: Wait for event or watchdog
+    //          |
+    //          v
+    // Debounce: Wait for more events (we debounce pushes)
+    //          |
+    //          v
+    // Wait for available connection (we limit number of parallel requests
+    // allowed)
+    //          |
+    //          v
+    // Wait to send (if requests are taking too long, we will slow down)
+    //          |
+    //          v
+    // Send (asynchronously, wrt the loop)
+    //          |
+    //          v
+    // Back to the pending!
+    // Controls whether the next iteration of the loop will wait at the pending
+    // state.
+    #pendingResolver = resolver();
+    /**
+     * This resolver is used to allow us to skip sleeps when we do send(true)
+     */
+    #skipSleepsResolver = resolver();
+    /**
+     * Resolver for the next send. Never rejects. Returns an error instead since
+     * this resolver is used in cases where they might not be someone waiting,
+     * and we don't want an unhandled promise rejection in that case.
+     */
+    #sendResolver = resolver();
+    #delegate;
+    #closed = false;
+    /**
+     * Number of pending send calls.
+     *
+     * We keep track of this because if close happens while we are waiting for the
+     * send to resolve we should reject the send promise.
+     */
+    #sendCounter = 0;
+    #lc;
+    #visibilityWatcher;
+    constructor(lc, delegate, visibilityWatcher) {
+        this.#lc = lc;
+        this.#delegate = delegate;
+        this.#visibilityWatcher = visibilityWatcher;
+        void this.run();
+    }
+    close() {
+        this.#closed = true;
+        if (this.#sendCounter > 0) {
+            this.#sendResolver.resolve({ error: closeError() });
+        }
+    }
+    /**
+     *
+     * @returns Returns undefined if ok, otherwise it return the error that caused
+     * the send to fail.
+     */
+    async send(now) {
+        if (this.#closed) {
+            return { error: closeError() };
+        }
+        this.#sendCounter++;
+        this.#lc.debug?.('send', now);
+        if (now) {
+            this.#skipSleepsResolver.resolve();
+        }
+        else {
+            await this.#visibilityWatcher?.waitForVisible();
+        }
+        this.#pendingResolver.resolve();
+        const result = await this.#sendResolver.promise;
+        this.#sendCounter--;
+        return result;
+    }
+    async run() {
+        const sendRecords = [];
+        let recoverResolver = resolver();
+        let lastSendTime;
+        // The number of active connections.
+        let counter = 0;
+        const delegate = this.#delegate;
+        const { debug } = this.#lc;
+        let delay = 0;
+        debug?.('Starting connection loop');
+        const sleepMaybeSkip = ms => Promise.race([this.#skipSleepsResolver.promise, sleep(ms)]);
+        while (!this.#closed) {
+            debug?.(didLastSendRequestFail(sendRecords)
+                ? 'Last request failed. Trying again'
+                : 'Waiting for a send');
+            // Wait until send is called or until the watchdog timer fires.
+            const races = [this.#pendingResolver.promise];
+            const t = delegate.watchdogTimer;
+            if (t !== null) {
+                races.push(sleep(t));
+            }
+            await Promise.race(races);
+            if (this.#closed)
+                break;
+            debug?.('Waiting for debounce');
+            await sleepMaybeSkip(delegate.debounceDelay);
+            if (this.#closed)
+                break;
+            debug?.('debounced');
+            // This resolver is used to wait for incoming push calls.
+            this.#pendingResolver = resolver();
+            if (counter >= delegate.maxConnections) {
+                debug?.('Too many request in flight. Waiting until one finishes...');
+                await this.#waitUntilAvailableConnection();
+                if (this.#closed)
+                    break;
+                debug?.('...finished');
+            }
+            // We need to delay the next request even if there are no active requests
+            // in case of error.
+            if (counter > 0 || didLastSendRequestFail(sendRecords)) {
+                delay = computeDelayAndUpdateDurations(delay, delegate, sendRecords);
+                debug?.(didLastSendRequestFail(sendRecords)
+                    ? 'Last connection errored. Sleeping for'
+                    : 'More than one outstanding connection (' +
+                        counter +
+                        '). Sleeping for', delay, 'ms');
+            }
+            else {
+                // We set this to 0 here in case minDelayMs is mutated to a lower value
+                // than the old delay so that we still get minDelayMs. This can happen
+                // if we get an error during a run where minDelayMs is larger than the
+                // current value of minDelayMs.
+                delay = 0;
+            }
+            const clampedDelay = Math.min(delegate.maxDelayMs, Math.max(delegate.minDelayMs, delay));
+            if (lastSendTime !== undefined) {
+                const timeSinceLastSend = Date.now() - lastSendTime;
+                if (clampedDelay > timeSinceLastSend) {
+                    await Promise.race([
+                        sleepMaybeSkip(clampedDelay - timeSinceLastSend),
+                        recoverResolver.promise,
+                    ]);
+                    if (this.#closed)
+                        break;
+                }
+            }
+            counter++;
+            // eslint-disable-next-line @typescript-eslint/no-floating-promises
+            (async () => {
+                const start = Date.now();
+                let ok;
+                let error;
+                try {
+                    lastSendTime = start;
+                    debug?.('Sending request');
+                    this.#skipSleepsResolver = resolver();
+                    ok = await delegate.invokeSend();
+                    debug?.('Send returned', ok);
+                }
+                catch (e) {
+                    debug?.('Send failed', e);
+                    error = e;
+                    ok = false;
+                }
+                if (this.#closed) {
+                    debug?.('Closed after invokeSend');
+                    return;
+                }
+                debug?.('Request done', { duration: Date.now() - start, ok });
+                sendRecords.push({ duration: Date.now() - start, ok });
+                if (recovered(sendRecords)) {
+                    recoverResolver.resolve();
+                    recoverResolver = resolver();
+                }
+                counter--;
+                this.#connectionAvailable();
+                const sendResolver = this.#sendResolver;
+                this.#sendResolver = resolver();
+                if (error) {
+                    sendResolver.resolve({ error });
+                }
+                else {
+                    sendResolver.resolve(undefined);
+                }
+                if (!ok) {
+                    // Keep trying
+                    this.#pendingResolver.resolve();
+                }
+            })();
+        }
+    }
+    #waitingConnectionResolve = undefined;
+    #connectionAvailable() {
+        if (this.#waitingConnectionResolve) {
+            const resolve = this.#waitingConnectionResolve;
+            this.#waitingConnectionResolve = undefined;
+            resolve();
+        }
+    }
+    #waitUntilAvailableConnection() {
+        const { promise, resolve } = resolver();
+        this.#waitingConnectionResolve = resolve;
+        return promise;
+    }
+}
+// Number of connections to remember when computing the new delay.
+const CONNECTION_MEMORY_COUNT = 9;
+function closeError() {
+    return new Error('Closed');
+}
+// Computes a new delay based on the previous requests. We use the median of the
+// previous successful request divided by `maxConnections`. When we get errors
+// we do exponential backoff. As soon as we recover from an error we reset back
+// to delegate.minDelayMs.
+function computeDelayAndUpdateDurations(delay, delegate, sendRecords) {
+    const { length } = sendRecords;
+    if (length === 0) {
+        return delay;
+    }
+    const { ok } = sendRecords[sendRecords.length - 1];
+    const { maxConnections, minDelayMs } = delegate;
+    if (!ok) {
+        return delay === 0 ? minDelayMs : delay * 2;
+    }
+    if (length > 1) {
+        // length > 1
+        const previous = sendRecords[sendRecords.length - 2];
+        // Prune
+        while (sendRecords.length > CONNECTION_MEMORY_COUNT) {
+            sendRecords.shift();
+        }
+        if (ok && !previous.ok) {
+            // Recovered
+            return minDelayMs;
+        }
+    }
+    const med = median(sendRecords.filter(({ ok }) => ok).map(({ duration }) => duration));
+    return (med / maxConnections) | 0;
+}
+function median(values) {
+    values.sort();
+    const { length } = values;
+    const half = length >> 1;
+    if (length % 2 === 1) {
+        return values[half];
+    }
+    return (values[half - 1] + values[half]) / 2;
+}
+function didLastSendRequestFail(sendRecords) {
+    return sendRecords.length > 0 && !sendRecords[sendRecords.length - 1].ok;
+}
+function recovered(sendRecords) {
+    return (sendRecords.length > 1 &&
+        !sendRecords[sendRecords.length - 2].ok &&
+        sendRecords[sendRecords.length - 1].ok);
+}
+//# sourceMappingURL=connection-loop.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"connection-loop.js","sourceRoot":"","sources":["../../../../replicache/src/connection-loop.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,QAAQ,EAAC,MAAM,oBAAoB,CAAC;AAE5C,OAAO,EAAC,KAAK,EAAC,MAAM,2BAA2B,CAAC;AAEhD,MAAM,CAAC,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAEpC,MAAM,CAAC,MAAM,YAAY,GAAG,EAAE,CAAC;AAC/B,MAAM,CAAC,MAAM,YAAY,GAAG,MAAM,CAAC;AAcnC,MAAM,OAAO,cAAc;IACzB,wEAAwE;IACxE,4EAA4E;IAC5E,0EAA0E;IAC1E,wEAAwE;IACxE,yEAAyE;IACzE,+BAA+B;IAC/B,EAAE;IACF,2EAA2E;IAC3E,EAAE;IACF,sCAAsC;IACtC,aAAa;IACb,aAAa;IACb,sDAAsD;IACtD,aAAa;IACb,aAAa;IACb,sEAAsE;IACtE,WAAW;IACX,aAAa;IACb,aAAa;IACb,oEAAoE;IACpE,aAAa;IACb,aAAa;IACb,sCAAsC;IACtC,aAAa;IACb,aAAa;IACb,uBAAuB;IAEvB,2EAA2E;IAC3E,SAAS;IACT,gBAAgB,GAAG,QAAQ,EAAQ,CAAC;IAEpC;;OAEG;IACH,mBAAmB,GAAG,QAAQ,EAAQ,CAAC;IAEvC;;;;OAIG;IACH,aAAa,GAAG,QAAQ,EAAgC,CAAC;IAEhD,SAAS,CAAyB;IAC3C,OAAO,GAAG,KAAK,CAAC;IAEhB;;;;;OAKG;IACH,YAAY,GAAG,CAAC,CAAC;IACR,GAAG,CAAa;IAChB,kBAAkB,CAAwC;IAEnE,YACE,EAAc,EACd,QAAgC,EAChC,iBAA6C;QAE7C,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,kBAAkB,GAAG,iBAAiB,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,EAAC,KAAK,EAAE,UAAU,EAAE,EAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,IAAI,CAAC,GAAY;QACrB,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,OAAO,EAAC,KAAK,EAAE,UAAU,EAAE,EAAC,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC9B,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC;QACrC,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,CAAC,kBAAkB,EAAE,cAAc,EAAE,CAAC;QAClD,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAEhC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC;QAChD,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,CAAC,GAAG;QACP,MAAM,WAAW,GAAiB,EAAE,CAAC;QAErC,IAAI,eAAe,GAAG,QAAQ,EAAE,CAAC;QACjC,IAAI,YAAY,CAAC;QAEjB,oCAAoC;QACpC,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,EAAC,KAAK,EAAC,GAAG,IAAI,CAAC,GAAG,CAAC;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,EAAE,CAAC,0BAA0B,CAAC,CAAC;QAEpC,MAAM,cAAc,GAAiB,EAAE,CAAC,EAAE,CACxC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE9D,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YACrB,KAAK,EAAE,CACL,sBAAsB,CAAC,WAAW,CAAC;gBACjC,CAAC,CAAC,mCAAmC;gBACrC,CAAC,CAAC,oBAAoB,CACzB,CAAC;YAEF,+DAA+D;YAC/D,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAC9C,MAAM,CAAC,GAAG,QAAQ,CAAC,aAAa,CAAC;YACjC,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACvB,CAAC;YACD,MAAM,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,IAAI,IAAI,CAAC,OAAO;gBAAE,MAAM;YAExB,KAAK,EAAE,CAAC,sBAAsB,CAAC,CAAC;YAChC,MAAM,cAAc,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;YAC7C,IAAI,IAAI,CAAC,OAAO;gBAAE,MAAM;YACxB,KAAK,EAAE,CAAC,WAAW,CAAC,CAAC;YAErB,yDAAyD;YACzD,IAAI,CAAC,gBAAgB,GAAG,QAAQ,EAAE,CAAC;YAEnC,IAAI,OAAO,IAAI,QAAQ,CAAC,cAAc,EAAE,CAAC;gBACvC,KAAK,EAAE,CAAC,2DAA2D,CAAC,CAAC;gBACrE,MAAM,IAAI,CAAC,6BAA6B,EAAE,CAAC;gBAC3C,IAAI,IAAI,CAAC,OAAO;oBAAE,MAAM;gBACxB,KAAK,EAAE,CAAC,aAAa,CAAC,CAAC;YACzB,CAAC;YAED,yEAAyE;YACzE,oBAAoB;YACpB,IAAI,OAAO,GAAG,CAAC,IAAI,sBAAsB,CAAC,WAAW,CAAC,EAAE,CAAC;gBACvD,KAAK,GAAG,8BAA8B,CAAC,KAAK,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;gBACrE,KAAK,EAAE,CACL,sBAAsB,CAAC,WAAW,CAAC;oBACjC,CAAC,CAAC,uCAAuC;oBACzC,CAAC,CAAC,wCAAwC;wBACtC,OAAO;wBACP,iBAAiB,EACvB,KAAK,EACL,IAAI,CACL,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,uEAAuE;gBACvE,sEAAsE;gBACtE,sEAAsE;gBACtE,+BAA+B;gBAC/B,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,QAAQ,CAAC,UAAU,EACnB,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC,CACrC,CAAC;YACF,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAC/B,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC;gBACpD,IAAI,YAAY,GAAG,iBAAiB,EAAE,CAAC;oBACrC,MAAM,OAAO,CAAC,IAAI,CAAC;wBACjB,cAAc,CAAC,YAAY,GAAG,iBAAiB,CAAC;wBAChD,eAAe,CAAC,OAAO;qBACxB,CAAC,CAAC;oBACH,IAAI,IAAI,CAAC,OAAO;wBAAE,MAAM;gBAC1B,CAAC;YACH,CAAC;YAED,OAAO,EAAE,CAAC;YACV,mEAAmE;YACnE,CAAC,KAAK,IAAI,EAAE;gBACV,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBACzB,IAAI,EAAW,CAAC;gBAChB,IAAI,KAAc,CAAC;gBACnB,IAAI,CAAC;oBACH,YAAY,GAAG,KAAK,CAAC;oBACrB,KAAK,EAAE,CAAC,iBAAiB,CAAC,CAAC;oBAC3B,IAAI,CAAC,mBAAmB,GAAG,QAAQ,EAAE,CAAC;oBACtC,EAAE,GAAG,MAAM,QAAQ,CAAC,UAAU,EAAE,CAAC;oBACjC,KAAK,EAAE,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;gBAC/B,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,KAAK,EAAE,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;oBAC1B,KAAK,GAAG,CAAC,CAAC;oBACV,EAAE,GAAG,KAAK,CAAC;gBACb,CAAC;gBACD,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACjB,KAAK,EAAE,CAAC,yBAAyB,CAAC,CAAC;oBACnC,OAAO;gBACT,CAAC;gBACD,KAAK,EAAE,CAAC,cAAc,EAAE,EAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,EAAE,EAAC,CAAC,CAAC;gBAC5D,WAAW,CAAC,IAAI,CAAC,EAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,EAAE,EAAC,CAAC,CAAC;gBACrD,IAAI,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC3B,eAAe,CAAC,OAAO,EAAE,CAAC;oBAC1B,eAAe,GAAG,QAAQ,EAAE,CAAC;gBAC/B,CAAC;gBACD,OAAO,EAAE,CAAC;gBACV,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC;gBACxC,IAAI,CAAC,aAAa,GAAG,QAAQ,EAAE,CAAC;gBAChC,IAAI,KAAK,EAAE,CAAC;oBACV,YAAY,CAAC,OAAO,CAAC,EAAC,KAAK,EAAC,CAAC,CAAC;gBAChC,CAAC;qBAAM,CAAC;oBACN,YAAY,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,CAAC;gBACD,IAAI,CAAC,EAAE,EAAE,CAAC;oBACR,cAAc;oBACd,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,CAAC;gBAClC,CAAC;YACH,CAAC,CAAC,EAAE,CAAC;QACP,CAAC;IACH,CAAC;IAED,yBAAyB,GAA6B,SAAS,CAAC;IAEhE,oBAAoB;QAClB,IAAI,IAAI,CAAC,yBAAyB,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,IAAI,CAAC,yBAAyB,CAAC;YAC/C,IAAI,CAAC,yBAAyB,GAAG,SAAS,CAAC;YAC3C,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,6BAA6B;QAC3B,MAAM,EAAC,OAAO,EAAE,OAAO,EAAC,GAAG,QAAQ,EAAE,CAAC;QACtC,IAAI,CAAC,yBAAyB,GAAG,OAAO,CAAC;QACzC,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAED,kEAAkE;AAClE,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAElC,SAAS,UAAU;IACjB,OAAO,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;AAC7B,CAAC;AAED,gFAAgF;AAChF,8EAA8E;AAC9E,+EAA+E;AAC/E,0BAA0B;AAC1B,SAAS,8BAA8B,CACrC,KAAa,EACb,QAAgC,EAChC,WAAyB;IAEzB,MAAM,EAAC,MAAM,EAAC,GAAG,WAAW,CAAC;IAC7B,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,EAAC,EAAE,EAAC,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACjD,MAAM,EAAC,cAAc,EAAE,UAAU,EAAC,GAAG,QAAQ,CAAC;IAE9C,IAAI,CAAC,EAAE,EAAE,CAAC;QACR,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;QACf,aAAa;QACb,MAAM,QAAQ,GAAe,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEjE,QAAQ;QACR,OAAO,WAAW,CAAC,MAAM,GAAG,uBAAuB,EAAE,CAAC;YACpD,WAAW,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;QAED,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;YACvB,YAAY;YACZ,OAAO,UAAU,CAAC;QACpB,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,MAAM,CAChB,WAAW,CAAC,MAAM,CAAC,CAAC,EAAC,EAAE,EAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAC,QAAQ,EAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAC/D,CAAC;IAEF,OAAO,CAAC,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,MAAM,CAAC,MAAgB;IAC9B,MAAM,CAAC,IAAI,EAAE,CAAC;IACd,MAAM,EAAC,MAAM,EAAC,GAAG,MAAM,CAAC;IACxB,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,CAAC;IACzB,IAAI,MAAM,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;AAC/C,CAAC;AAED,SAAS,sBAAsB,CAAC,WAAyB;IACvD,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3E,CAAC;AAED,SAAS,SAAS,CAAC,WAAyB;IAC1C,OAAO,CACL,WAAW,CAAC,MAAM,GAAG,CAAC;QACtB,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;QACvC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CACvC,CAAC;AACJ,CAAC"}