@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/shared-tree-core/editManager.js

@@ -0,0 +1,428 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import BTree from "sorted-btree";
+import { assert } from "@fluidframework/core-utils";
+import { brand, fail, getOrCreate, mapIterable } from "../util";
+import { assertIsRevisionTag, findAncestor, findCommonAncestor, mintCommit, rebaseChange, } from "../core";
+import { getChangeReplaceType, onForkTransitive, SharedTreeBranch } from "./branch";
+import { sequenceIdComparator, equalSequenceIds, minSequenceId, decrementSequenceId, maxSequenceId, } from "./editManagerFormat";
+export const minimumPossibleSequenceNumber = brand(Number.MIN_SAFE_INTEGER);
+const minimumPossibleSequenceId = {
+    sequenceNumber: minimumPossibleSequenceNumber,
+};
+/**
+ * Represents a local branch of a document and interprets the effect on the document of adding sequenced changes,
+ * which were based on a given session's branch, to the document history
+ */
+// TODO: Try to reduce this to a single type parameter
+export class EditManager {
+    /**
+     * @param changeFamily - the change family of changes on the trunk and local branch
+     * @param localSessionId - the id of the local session that will be used for local commits
+     */
+    constructor(changeFamily, 
+    // TODO: Change this type to be the Session ID type provided by the IdCompressor when available.
+    localSessionId) {
+        this.changeFamily = changeFamily;
+        this.localSessionId = localSessionId;
+        /**
+         * Records extra data associated with commits in the {@link trunk}.
+         * This does not include an entry for the {@link trunkBase}.
+         */
+        this.trunkMetadata = new Map();
+        /**
+         * A map from a sequence id to the commit in the {@link trunk} which has that sequence id.
+         * This also includes an entry for the {@link trunkBase} which always has the lowest key in the map.
+         */
+        this.sequenceMap = new BTree(undefined, sequenceIdComparator);
+        /**
+         * Branches are maintained to represent the local change list that the issuing client had
+         * at the time of submitting the latest known edit on the branch.
+         * This means the head commit of each branch is always in its original (non-rebased) form.
+         */
+        // TODO:#4593: Add test to ensure that peer branches are never initialized with a repairDataStoreProvider
+        this.peerLocalBranches = new Map();
+        /**
+         * Tracks where on the trunk all registered branches are based. Each key is the sequence id of a commit on
+         * the trunk, and the value is the set of all branches who have that commit as their common ancestor with the trunk.
+         */
+        this.trunkBranches = new BTree(undefined, sequenceIdComparator);
+        /**
+         * The sequence number of the newest commit on the trunk that has been received by all peers.
+         * Defaults to {@link minimumPossibleSequenceNumber} if no commits have been received.
+         *
+         * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.
+         */
+        this.minimumSequenceNumber = minimumPossibleSequenceNumber;
+        this.trunkBase = {
+            revision: assertIsRevisionTag("00000000-0000-4000-8000-000000000000"),
+            change: changeFamily.rebaser.compose([]),
+        };
+        this.sequenceMap.set(minimumPossibleSequenceId, this.trunkBase);
+        this.trunk = new SharedTreeBranch(this.trunkBase, changeFamily);
+        this.localBranch = new SharedTreeBranch(this.trunk.getHead(), changeFamily);
+        this.localBranch.on("revertibleDispose", this.onRevertibleDisposed());
+        // Track all forks of the local branch for purposes of trunk eviction. Unlike the local branch, they have
+        // an unknown lifetime and rebase frequency, so we can not make any assumptions about which trunk commits
+        // they require and therefore we monitor them explicitly.
+        onForkTransitive(this.localBranch, (fork) => this.registerBranch(fork));
+    }
+    /**
+     * Make the given branch known to the `EditManager`. The `EditManager` will ensure that all registered
+     * branches remain usable even as the minimum sequence number advances.
+     */
+    registerBranch(branch) {
+        const trackBranch = (b) => {
+            const trunkCommit = findCommonAncestor(this.trunk.getHead(), b.getHead()) ??
+                fail("Expected branch to be related to trunk");
+            const sequenceId = this.trunkMetadata.get(trunkCommit.revision)?.sequenceId ??
+                minimumPossibleSequenceId;
+            const branches = getOrCreate(this.trunkBranches, sequenceId, () => new Set());
+            assert(!branches.has(b), 0x670 /* Branch was registered more than once */);
+            branches.add(b);
+            return sequenceId;
+        };
+        const untrackBranch = (b, sequenceId) => {
+            const branches = this.trunkBranches.get(sequenceId) ?? fail("Expected branch to be tracked");
+            assert(branches.delete(b), 0x671 /* Expected branch to be tracked */);
+            if (branches.size === 0) {
+                this.trunkBranches.delete(sequenceId);
+            }
+        };
+        // Record the sequence id of the branch's base commit on the trunk
+        const trunkBase = { sequenceId: trackBranch(branch) };
+        // Whenever the branch is rebased, update our record of its base trunk commit
+        const offRebase = branch.on("afterChange", (args) => {
+            if (args.type === "replace" && getChangeReplaceType(args) === "rebase") {
+                untrackBranch(branch, trunkBase.sequenceId);
+                trunkBase.sequenceId = trackBranch(branch);
+                this.trimTrunk();
+            }
+        });
+        // When the branch is disposed, update our branch set and trim the trunk
+        const offDispose = branch.on("dispose", () => {
+            untrackBranch(branch, trunkBase.sequenceId);
+            this.trimTrunk();
+            offRebase();
+            offDispose();
+        });
+    }
+    /**
+     * Returns the sequence id of the oldest sequenced revertible commit on the local branch.
+     *
+     * TODO: may be more performant to maintain the oldest revertible on the branches themselves
+     * this should be tested and revisited once branches are supported
+     */
+    getOldestRevertibleSequenceId() {
+        if (this._oldestRevertibleSequenceId === undefined) {
+            let oldest;
+            for (const revision of this.localBranch.revertibleCommits()) {
+                if (oldest === undefined) {
+                    oldest = this.trunkMetadata.get(revision)?.sequenceId;
+                }
+                else {
+                    const current = this.trunkMetadata.get(revision)?.sequenceId;
+                    if (current !== undefined) {
+                        oldest = minSequenceId(oldest, current);
+                    }
+                }
+            }
+            this._oldestRevertibleSequenceId = oldest;
+        }
+        return this._oldestRevertibleSequenceId;
+    }
+    onRevertibleDisposed() {
+        return (revision) => {
+            const metadata = this.trunkMetadata.get(revision);
+            // if this revision hasn't been sequenced, it won't be evicted
+            if (metadata !== undefined) {
+                const { sequenceId: id } = metadata;
+                // if this revision corresponds with the current oldest revertible sequence id, replace it with the new oldest
+                if (id === this._oldestRevertibleSequenceId) {
+                    this._oldestRevertibleSequenceId = undefined;
+                }
+            }
+        };
+    }
+    /**
+     * Advances the minimum sequence number, and removes all commits from the trunk which lie outside the collaboration window.
+     * @param minimumSequenceNumber - the sequence number of the newest commit that all peers (including this one) have received and applied to their trunks.
+     *
+     * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.
+     */
+    advanceMinimumSequenceNumber(minimumSequenceNumber) {
+        if (minimumSequenceNumber === this.minimumSequenceNumber) {
+            return;
+        }
+        assert(minimumSequenceNumber > this.minimumSequenceNumber, 0x476 /* number must be larger or equal to current minimumSequenceNumber. */);
+        this.minimumSequenceNumber = minimumSequenceNumber;
+        this.trimTrunk();
+    }
+    /**
+     * Examines the latest known minimum sequence number and the trunk bases of any registered branches to determine
+     * if any commits on the trunk are unreferenced and unneeded for future computation; those found are evicted from the trunk.
+     * @returns the number of commits that were removed from the trunk
+     */
+    trimTrunk() {
+        /** The sequence id of the oldest commit on the trunk that will be retained */
+        let trunkTailSequenceId = {
+            sequenceNumber: this.minimumSequenceNumber,
+            indexInBatch: Number.POSITIVE_INFINITY,
+        };
+        // If there are any outstanding registered branches, get the one that is the oldest (has the "most behind" trunk base)
+        const minimumBranchBaseSequenceId = this.trunkBranches.minKey();
+        if (minimumBranchBaseSequenceId !== undefined) {
+            // If that branch is behind the minimum sequence id, we only want to evict commits older than it,
+            // even if those commits are behind the minimum sequence id
+            const sequenceIdBeforeMinimumBranchBase = decrementSequenceId(minimumBranchBaseSequenceId);
+            trunkTailSequenceId = minSequenceId(trunkTailSequenceId, sequenceIdBeforeMinimumBranchBase);
+        }
+        // TODO get the oldest revertible sequence id from all registered branches, not just the local branch
+        const oldestRevertibleSequenceId = this.getOldestRevertibleSequenceId();
+        if (oldestRevertibleSequenceId !== undefined) {
+            // use a smaller sequence number so that the oldest revertible is not trimmed
+            const sequenceIdBeforeOldestRevertible = decrementSequenceId(oldestRevertibleSequenceId);
+            trunkTailSequenceId = minSequenceId(trunkTailSequenceId, sequenceIdBeforeOldestRevertible);
+        }
+        const [sequenceId, latestEvicted] = this.getClosestTrunkCommit(maxSequenceId(trunkTailSequenceId, this.sequenceMap.minKey() ?? minimumPossibleSequenceId));
+        // Don't do any work if the commit found by the search is already the tail of the trunk
+        if (latestEvicted !== this.trunkBase) {
+            // The minimum sequence number informs us that all peer branches are at least caught up to the tail commit,
+            // so rebase them accordingly. This is necessary to prevent peer branches from referencing any evicted commits.
+            for (const [, branch] of this.peerLocalBranches) {
+                branch.rebaseOnto(this.trunk, latestEvicted);
+            }
+            // This mutation is a performance hack. If commits are truly immutable, then changing the trunk's tail requires
+            // regenerating the entire commit graph. Instead, we can simply chop off the tail like this if we're certain
+            // that there are no outstanding references to any of the commits being removed (other than the references via
+            // the trunk). The peer branches have been rebased to the head of the trunk, the local branch is already rebased
+            // to the head of the trunk, and all other branches are tracked by `trunkBranches` and known to be ahead of or at
+            // `newTrunkBase`. Therefore, no branches should have unique references to any of the commits being evicted here.
+            // We mutate the most recent of the evicted commits to become the new trunk base. That way, any other commits that
+            // have parent pointers to the latest evicted commit will stay linked, even though that it is no longer part of the trunk.
+            const newTrunkBase = latestEvicted;
+            // The metadata for new trunk base revision needs to be deleted before modifying it.
+            this.trunkMetadata.delete(newTrunkBase.revision);
+            // Copying the revision of the old trunk base into the new trunk base means we don't need to write out the original
+            // revision to summaries. All clients agree that the trunk base always has the same hardcoded revision.
+            newTrunkBase.revision = this.trunkBase.revision;
+            // Overwriting the change is not strictly necessary, but done here for consistency (so all trunk bases are deeply equal).
+            newTrunkBase.change = this.trunkBase.change;
+            // Dropping the parent field removes (transitively) all references to the evicted commits so they can be garbage collected.
+            delete newTrunkBase.parent;
+            this.trunkBase = newTrunkBase;
+            // Update any state that is derived from trunk commits
+            this.sequenceMap.editRange(minimumPossibleSequenceId, sequenceId, true, (s, { revision }) => {
+                // Cleanup look-aside data for each evicted commit
+                this.trunkMetadata.delete(revision);
+                // Delete all evicted commits from `sequenceMap` except for the latest one, which is the new `trunkBase`
+                if (equalSequenceIds(s, sequenceId)) {
+                    assert(revision === newTrunkBase.revision, 0x729 /* Expected last evicted commit to be new trunk base */);
+                }
+                else {
+                    return { delete: true };
+                }
+            });
+            const trunkSize = getPathFromBase(this.trunk.getHead(), this.trunkBase).length;
+            assert(this.sequenceMap.size === trunkSize + 1, 0x744 /* The size of the sequenceMap must have one element more than the trunk */);
+            assert(this.trunkMetadata.size === trunkSize, 0x745 /* The size of the trunkMetadata must be the same as the trunk */);
+        }
+    }
+    isEmpty() {
+        return (this.trunk.getHead() === this.trunkBase &&
+            this.peerLocalBranches.size === 0 &&
+            this.localBranch.getHead() === this.trunk.getHead() &&
+            this.minimumSequenceNumber === minimumPossibleSequenceNumber);
+    }
+    getSummaryData() {
+        // The assert below is acceptable at present because summarization only ever occurs on a client with no
+        // local/in-flight changes.
+        // In the future we may wish to relax this constraint. For that to work, the current implementation of
+        // `EditManager` would have to be amended in one of two ways:
+        // A) Changes made by the local session should be represented by a branch in `EditManager.branches`.
+        // B) The contents of such a branch should be computed on demand based on the trunk.
+        // Note that option (A) would be a simple change to `addSequencedChange` whereas (B) would likely require
+        // rebasing trunk changes over the inverse of trunk changes.
+        assert(this.localBranch.getHead() === this.trunk.getHead(), 0x428 /* Clients with local changes cannot be used to generate summaries */);
+        const trunk = getPathFromBase(this.trunk.getHead(), this.trunkBase).map((c) => {
+            const metadata = this.trunkMetadata.get(c.revision) ?? fail("Expected metadata for trunk commit");
+            const commit = {
+                change: c.change,
+                revision: c.revision,
+                sequenceNumber: metadata.sequenceId.sequenceNumber,
+                sessionId: metadata.sessionId,
+            };
+            if (metadata.sequenceId.indexInBatch !== undefined) {
+                commit.indexInBatch = metadata.sequenceId.indexInBatch;
+            }
+            return commit;
+        });
+        const branches = new Map(mapIterable(this.peerLocalBranches.entries(), ([sessionId, branch]) => {
+            const branchPath = [];
+            const ancestor = findCommonAncestor([branch.getHead(), branchPath], this.trunk.getHead()) ??
+                fail("Expected branch to be based on trunk");
+            return [
+                sessionId,
+                {
+                    base: ancestor.revision,
+                    commits: branchPath.map((c) => {
+                        const commit = {
+                            change: c.change,
+                            revision: c.revision,
+                            sessionId,
+                        };
+                        return commit;
+                    }),
+                },
+            ];
+        }));
+        return { trunk, branches };
+    }
+    loadSummaryData(data) {
+        assert(this.isEmpty(), 0x68a /* Attempted to load from summary after edit manager was already mutated */);
+        // Record the tags of each trunk commit as we generate the trunk so they can be looked up quickly
+        // when hydrating the peer branches below
+        const trunkRevisionCache = new Map();
+        trunkRevisionCache.set(this.trunkBase.revision, this.trunkBase);
+        this.trunk.setHead(data.trunk.reduce((base, c) => {
+            const sequenceId = c.indexInBatch === undefined
+                ? {
+                    sequenceNumber: c.sequenceNumber,
+                }
+                : {
+                    sequenceNumber: c.sequenceNumber,
+                    indexInBatch: c.indexInBatch,
+                };
+            const commit = mintCommit(base, c);
+            this.sequenceMap.set(sequenceId, commit);
+            this.trunkMetadata.set(c.revision, {
+                sequenceId,
+                sessionId: c.sessionId,
+            });
+            trunkRevisionCache.set(c.revision, commit);
+            return commit;
+        }, this.trunkBase));
+        this.localBranch.setHead(this.trunk.getHead());
+        for (const [sessionId, branch] of data.branches) {
+            const commit = trunkRevisionCache.get(branch.base) ??
+                fail("Expected summary branch to be based off of a revision in the trunk");
+            this.peerLocalBranches.set(sessionId, new SharedTreeBranch(branch.commits.reduce(mintCommit, commit), this.changeFamily));
+        }
+    }
+    getTrunkChanges() {
+        return getPathFromBase(this.trunk.getHead(), this.trunkBase).map((c) => c.change);
+    }
+    getTrunkHead() {
+        return this.trunk.getHead();
+    }
+    getLocalChanges() {
+        return getPathFromBase(this.localBranch.getHead(), this.trunk.getHead()).map((c) => c.change);
+    }
+    /**
+     * @returns The length of the longest branch maintained by this EditManager.
+     * This may be the length of a peer branch or the local branch.
+     * The length is counted from the lowest common ancestor with the trunk such that a fully sequenced branch would
+     * have length zero.
+     */
+    getLongestBranchLength() {
+        let max = 0;
+        const trunkHead = this.trunk.getHead();
+        for (const branch of this.peerLocalBranches.values()) {
+            const branchPath = getPathFromBase(branch.getHead(), trunkHead);
+            if (branchPath.length > max) {
+                max = branchPath.length;
+            }
+        }
+        const localPath = getPathFromBase(this.localBranch.getHead(), trunkHead);
+        return Math.max(max, localPath.length);
+    }
+    addSequencedChange(newCommit, sequenceNumber, referenceSequenceNumber) {
+        assert(sequenceNumber > this.minimumSequenceNumber, 0x713 /* Expected change sequence number to exceed the last known minimum sequence number */);
+        const commitsSequenceNumber = this.getBatch(sequenceNumber);
+        const sequenceId = commitsSequenceNumber.length === 0
+            ? {
+                sequenceNumber,
+            }
+            : {
+                sequenceNumber,
+                indexInBatch: commitsSequenceNumber.length,
+            };
+        if (newCommit.sessionId === this.localSessionId) {
+            const [firstLocalCommit] = getPathFromBase(this.localBranch.getHead(), this.trunk.getHead());
+            assert(firstLocalCommit !== undefined, 0x6b5 /* Received a sequenced change from the local session despite having no local changes */);
+            // The first local branch commit is already rebased over the trunk, so we can push it directly to the trunk.
+            this.pushToTrunk(sequenceId, { ...firstLocalCommit, sessionId: this.localSessionId }, true);
+            this.localBranch.rebaseOnto(this.trunk);
+            return;
+        }
+        // Get the revision that the remote change is based on
+        const [, baseRevisionInTrunk] = this.getClosestTrunkCommit(referenceSequenceNumber);
+        // Rebase that branch over the part of the trunk up to the base revision
+        // This will be a no-op if the sending client has not advanced since the last time we received an edit from it
+        const peerLocalBranch = getOrCreate(this.peerLocalBranches, newCommit.sessionId, () => new SharedTreeBranch(baseRevisionInTrunk, this.changeFamily));
+        peerLocalBranch.rebaseOnto(this.trunk, baseRevisionInTrunk);
+        if (peerLocalBranch.getHead() === this.trunk.getHead()) {
+            // If the branch is fully caught up and empty after being rebased, then push to the trunk directly
+            this.pushToTrunk(sequenceId, newCommit);
+            peerLocalBranch.setHead(this.trunk.getHead());
+        }
+        else {
+            // Otherwise, rebase the change over the trunk and append it, and append the original change to the peer branch.
+            const newChangeFullyRebased = rebaseChange(this.changeFamily.rebaser, newCommit.change, peerLocalBranch.getHead(), this.trunk.getHead());
+            peerLocalBranch.apply(newCommit.change, newCommit.revision);
+            this.pushToTrunk(sequenceId, {
+                ...newCommit,
+                change: newChangeFullyRebased,
+            });
+        }
+        this.localBranch.rebaseOnto(this.trunk);
+    }
+    findLocalCommit(revision) {
+        const commits = [];
+        const commit = findAncestor([this.localBranch.getHead(), commits], (c) => c.revision === revision);
+        assert(commit !== undefined, 0x599 /* Expected local branch to contain revision */);
+        return [commit, commits];
+    }
+    pushToTrunk(sequenceId, commit, local = false) {
+        const mintedCommit = mintCommit(this.trunk.getHead(), commit);
+        this.trunk.setHead(mintedCommit);
+        this.localBranch.updateRevertibleCommit(mintedCommit);
+        const trunkHead = this.trunk.getHead();
+        this.sequenceMap.set(sequenceId, trunkHead);
+        this.trunkMetadata.set(trunkHead.revision, { sequenceId, sessionId: commit.sessionId });
+    }
+    getClosestTrunkCommit(searchBy) {
+        const sequenceId = typeof searchBy === "number"
+            ? {
+                // This is to make sure that the correct commit is selected in this 2 scenarios:
+                // 1) The commit is unique for that sequence number
+                // 2) There are more than one commit for the same sequence number, in this case we need to select the last one.
+                sequenceNumber: searchBy,
+                indexInBatch: Number.POSITIVE_INFINITY,
+            }
+            : searchBy;
+        const commit = this.sequenceMap.getPairOrNextLower(sequenceId);
+        assert(commit !== undefined, 0x746 /* sequence id has been evicted */);
+        return commit;
+    }
+    getBatch(sequenceNumber) {
+        const startSequenceId = {
+            sequenceNumber,
+        };
+        const endSequenceId = {
+            sequenceNumber: brand(sequenceNumber + 1),
+        };
+        return this.sequenceMap.getRange(startSequenceId, endSequenceId, false);
+    }
+}
+/**
+ * @returns the path from the base of a branch to its head
+ */
+function getPathFromBase(branchHead, baseBranchHead) {
+    const path = [];
+    assert(findCommonAncestor([branchHead, path], baseBranchHead) !== undefined, 0x573 /* Expected branches to be related */);
+    return path;
+}
+//# sourceMappingURL=editManager.js.map

package/lib/shared-tree-core/editManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"editManager.js","sourceRoot":"","sources":["../../src/shared-tree-core/editManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,MAAM,cAAc,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAA8B,MAAM,SAAS,CAAC;AAC5F,OAAO,EACN,mBAAmB,EAGnB,YAAY,EACZ,kBAAkB,EAElB,UAAU,EACV,YAAY,GAGZ,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACpF,OAAO,EAIN,oBAAoB,EACpB,gBAAgB,EAChB,aAAa,EAGb,mBAAmB,EACnB,aAAa,GACb,MAAM,qBAAqB,CAAC;AAE7B,MAAM,CAAC,MAAM,6BAA6B,GAAc,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;AACvF,MAAM,yBAAyB,GAAe;IAC7C,cAAc,EAAE,6BAA6B;CAC7C,CAAC;AAEF;;;GAGG;AACH,sDAAsD;AACtD,MAAM,OAAO,WAAW;IAsEvB;;;OAGG;IACH,YACiB,YAA2B;IAC3C,gGAAgG;IAChF,cAAyB;QAFzB,iBAAY,GAAZ,YAAY,CAAe;QAE3B,mBAAc,GAAd,cAAc,CAAW;QArE1C;;;WAGG;QACc,kBAAa,GAAG,IAAI,GAAG,EAGrC,CAAC;QACJ;;;WAGG;QACc,gBAAW,GAAG,IAAI,KAAK,CACvC,SAAS,EACT,oBAAoB,CACpB,CAAC;QAEF;;;;WAIG;QACH,yGAAyG;QACxF,sBAAiB,GACjC,IAAI,GAAG,EAAE,CAAC;QAOX;;;WAGG;QACc,kBAAa,GAAG,IAAI,KAAK,CAGxC,SAAS,EAAE,oBAAoB,CAAC,CAAC;QAEnC;;;;;WAKG;QACK,0BAAqB,GAAG,6BAA6B,CAAC;QAyB7D,IAAI,CAAC,SAAS,GAAG;YAChB,QAAQ,EAAE,mBAAmB,CAAC,sCAAsC,CAAC;YACrE,MAAM,EAAE,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;SACxC,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,yBAAyB,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,GAAG,IAAI,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAChE,IAAI,CAAC,WAAW,GAAG,IAAI,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,YAAY,CAAC,CAAC;QAE5E,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,mBAAmB,EAAE,IAAI,CAAC,oBAAoB,EAAE,CAAC,CAAC;QAEtE,yGAAyG;QACzG,yGAAyG;QACzG,yDAAyD;QACzD,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,CAAC;IAED;;;OAGG;IACK,cAAc,CAAC,MAA6C;QACnE,MAAM,WAAW,GAAG,CAAC,CAAwC,EAAc,EAAE;YAC5E,MAAM,WAAW,GAChB,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;gBACrD,IAAI,CAAC,wCAAwC,CAAC,CAAC;YAChD,MAAM,UAAU,GACf,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,UAAU;gBACxD,yBAAyB,CAAC;YAC3B,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;YAE9E,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;YAC3E,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChB,OAAO,UAAU,CAAC;QACnB,CAAC,CAAC;QAEF,MAAM,aAAa,GAAG,CACrB,CAAwC,EACxC,UAAsB,EACf,EAAE;YACT,MAAM,QAAQ,GACb,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,+BAA+B,CAAC,CAAC;YAE7E,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACtE,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;gBACxB,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;aACtC;QACF,CAAC,CAAC;QAEF,kEAAkE;QAClE,MAAM,SAAS,GAAG,EAAE,UAAU,EAAE,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;QACtD,6EAA6E;QAC7E,MAAM,SAAS,GAAG,MAAM,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,IAAI,EAAE,EAAE;YACnD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,oBAAoB,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;gBACvE,aAAa,CAAC,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC;gBAC5C,SAAS,CAAC,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;gBAC3C,IAAI,CAAC,SAAS,EAAE,CAAC;aACjB;QACF,CAAC,CAAC,CAAC;QACH,wEAAwE;QACxE,MAAM,UAAU,GAAG,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAC5C,aAAa,CAAC,MAAM,EAAE,SAAS,CAAC,UAAU,CAAC,CAAC;YAC5C,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,SAAS,EAAE,CAAC;YACZ,UAAU,EAAE,CAAC;QACd,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,6BAA6B;QACpC,IAAI,IAAI,CAAC,2BAA2B,KAAK,SAAS,EAAE;YACnD,IAAI,MAA8B,CAAC;YACnC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,EAAE,EAAE;gBAC5D,IAAI,MAAM,KAAK,SAAS,EAAE;oBACzB,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC;iBACtD;qBAAM;oBACN,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC;oBAC7D,IAAI,OAAO,KAAK,SAAS,EAAE;wBAC1B,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;qBACxC;iBACD;aACD;YACD,IAAI,CAAC,2BAA2B,GAAG,MAAM,CAAC;SAC1C;QAED,OAAO,IAAI,CAAC,2BAA2B,CAAC;IACzC,CAAC;IAEO,oBAAoB;QAC3B,OAAO,CAAC,QAAqB,EAAE,EAAE;YAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAElD,8DAA8D;YAC9D,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,QAAQ,CAAC;gBACpC,8GAA8G;gBAC9G,IAAI,EAAE,KAAK,IAAI,CAAC,2BAA2B,EAAE;oBAC5C,IAAI,CAAC,2BAA2B,GAAG,SAAS,CAAC;iBAC7C;aACD;QACF,CAAC,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,4BAA4B,CAAC,qBAAgC;QACnE,IAAI,qBAAqB,KAAK,IAAI,CAAC,qBAAqB,EAAE;YACzD,OAAO;SACP;QAED,MAAM,CACL,qBAAqB,GAAG,IAAI,CAAC,qBAAqB,EAClD,KAAK,CAAC,sEAAsE,CAC5E,CAAC;QAEF,IAAI,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;QACnD,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,SAAS;QAChB,8EAA8E;QAC9E,IAAI,mBAAmB,GAAe;YACrC,cAAc,EAAE,IAAI,CAAC,qBAAqB;YAC1C,YAAY,EAAE,MAAM,CAAC,iBAAiB;SACtC,CAAC;QACF,sHAAsH;QACtH,MAAM,2BAA2B,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;QAChE,IAAI,2BAA2B,KAAK,SAAS,EAAE;YAC9C,iGAAiG;YACjG,2DAA2D;YAC3D,MAAM,iCAAiC,GAAG,mBAAmB,CAC5D,2BAA2B,CAC3B,CAAC;YACF,mBAAmB,GAAG,aAAa,CAClC,mBAAmB,EACnB,iCAAiC,CACjC,CAAC;SACF;QAED,qGAAqG;QACrG,MAAM,0BAA0B,GAAG,IAAI,CAAC,6BAA6B,EAAE,CAAC;QACxE,IAAI,0BAA0B,KAAK,SAAS,EAAE;YAC7C,6EAA6E;YAC7E,MAAM,gCAAgC,GAAG,mBAAmB,CAC3D,0BAA0B,CAC1B,CAAC;YACF,mBAAmB,GAAG,aAAa,CAClC,mBAAmB,EACnB,gCAAgC,CAChC,CAAC;SACF;QAED,MAAM,CAAC,UAAU,EAAE,aAAa,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAC7D,aAAa,CACZ,mBAAmB,EACnB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,yBAAyB,CACtD,CACD,CAAC;QAEF,uFAAuF;QACvF,IAAI,aAAa,KAAK,IAAI,CAAC,SAAS,EAAE;YACrC,2GAA2G;YAC3G,+GAA+G;YAC/G,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE;gBAChD,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;aAC7C;YAED,+GAA+G;YAC/G,4GAA4G;YAC5G,8GAA8G;YAC9G,gHAAgH;YAChH,iHAAiH;YACjH,iHAAiH;YACjH,kHAAkH;YAClH,0HAA0H;YAC1H,MAAM,YAAY,GAAG,aAA8C,CAAC;YACpE,oFAAoF;YACpF,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACjD,mHAAmH;YACnH,uGAAuG;YACvG,YAAY,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;YAChD,yHAAyH;YACzH,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;YAC5C,2HAA2H;YAC3H,OAAO,YAAY,CAAC,MAAM,CAAC;YAC3B,IAAI,CAAC,SAAS,GAAG,YAAY,CAAC;YAE9B,sDAAsD;YACtD,IAAI,CAAC,WAAW,CAAC,SAAS,CACzB,yBAAyB,EACzB,UAAU,EACV,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE;gBACnB,kDAAkD;gBAClD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACpC,wGAAwG;gBACxG,IAAI,gBAAgB,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE;oBACpC,MAAM,CACL,QAAQ,KAAK,YAAY,CAAC,QAAQ,EAClC,KAAK,CAAC,uDAAuD,CAC7D,CAAC;iBACF;qBAAM;oBACN,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;iBACxB;YACF,CAAC,CACD,CAAC;YAEF,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC;YAC/E,MAAM,CACL,IAAI,CAAC,WAAW,CAAC,IAAI,KAAK,SAAS,GAAG,CAAC,EACvC,KAAK,CAAC,2EAA2E,CACjF,CAAC;YACF,MAAM,CACL,IAAI,CAAC,aAAa,CAAC,IAAI,KAAK,SAAS,EACrC,KAAK,CAAC,iEAAiE,CACvE,CAAC;SACF;IACF,CAAC;IAEM,OAAO;QACb,OAAO,CACN,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,SAAS;YACvC,IAAI,CAAC,iBAAiB,CAAC,IAAI,KAAK,CAAC;YACjC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE;YACnD,IAAI,CAAC,qBAAqB,KAAK,6BAA6B,CAC5D,CAAC;IACH,CAAC;IAEM,cAAc;QACpB,uGAAuG;QACvG,2BAA2B;QAC3B,sGAAsG;QACtG,6DAA6D;QAC7D,oGAAoG;QACpG,oFAAoF;QACpF,yGAAyG;QACzG,4DAA4D;QAC5D,MAAM,CACL,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EACnD,KAAK,CAAC,qEAAqE,CAC3E,CAAC;QAEF,MAAM,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC7E,MAAM,QAAQ,GACb,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC;YAClF,MAAM,MAAM,GAAgC;gBAC3C,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,cAAc,EAAE,QAAQ,CAAC,UAAU,CAAC,cAAc;gBAClD,SAAS,EAAE,QAAQ,CAAC,SAAS;aAC7B,CAAC;YACF,IAAI,QAAQ,CAAC,UAAU,CAAC,YAAY,KAAK,SAAS,EAAE;gBACnD,MAAM,CAAC,YAAY,GAAG,QAAQ,CAAC,UAAU,CAAC,YAAY,CAAC;aACvD;YACD,OAAO,MAAM,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,IAAI,GAAG,CACvB,WAAW,CAAC,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,EAAE;YACrE,MAAM,UAAU,GAA8B,EAAE,CAAC;YACjD,MAAM,QAAQ,GACb,kBAAkB,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,UAAU,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;gBACxE,IAAI,CAAC,sCAAsC,CAAC,CAAC;YAE9C,OAAO;gBACN,SAAS;gBACT;oBACC,IAAI,EAAE,QAAQ,CAAC,QAAQ;oBACvB,OAAO,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;wBAC7B,MAAM,MAAM,GAAuB;4BAClC,MAAM,EAAE,CAAC,CAAC,MAAM;4BAChB,QAAQ,EAAE,CAAC,CAAC,QAAQ;4BACpB,SAAS;yBACT,CAAC;wBACF,OAAO,MAAM,CAAC;oBACf,CAAC,CAAC;iBACF;aACD,CAAC;QACH,CAAC,CAAC,CACF,CAAC;QAEF,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IAC5B,CAAC;IAEM,eAAe,CAAC,IAA6B;QACnD,MAAM,CACL,IAAI,CAAC,OAAO,EAAE,EACd,KAAK,CAAC,2EAA2E,CACjF,CAAC;QACF,iGAAiG;QACjG,yCAAyC;QACzC,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAwC,CAAC;QAC3E,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,CAAC,KAAK,CAAC,OAAO,CACjB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,UAAU,GACf,CAAC,CAAC,YAAY,KAAK,SAAS;gBAC3B,CAAC,CAAC;oBACA,cAAc,EAAE,CAAC,CAAC,cAAc;iBAC/B;gBACH,CAAC,CAAC;oBACA,cAAc,EAAE,CAAC,CAAC,cAAc;oBAChC,YAAY,EAAE,CAAC,CAAC,YAAY;iBAC3B,CAAC;YACN,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACnC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YACzC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE;gBAClC,UAAU;gBACV,SAAS,EAAE,CAAC,CAAC,SAAS;aACtB,CAAC,CAAC;YACH,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC3C,OAAO,MAAM,CAAC;QACf,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAClB,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QAE/C,KAAK,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAChD,MAAM,MAAM,GACX,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;gBACnC,IAAI,CAAC,oEAAoE,CAAC,CAAC;YAE5E,IAAI,CAAC,iBAAiB,CAAC,GAAG,CACzB,SAAS,EACT,IAAI,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAClF,CAAC;SACF;IACF,CAAC;IAEM,eAAe;QACrB,OAAO,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACnF,CAAC;IAEM,YAAY;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAEM,eAAe;QACrB,OAAO,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAC3E,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CACf,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,sBAAsB;QAC5B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,EAAE;YACrD,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,SAAS,CAAC,CAAC;YAChE,IAAI,UAAU,CAAC,MAAM,GAAG,GAAG,EAAE;gBAC5B,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC;aACxB;SACD;QACD,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,SAAS,CAAC,CAAC;QACzE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;IACxC,CAAC;IAEM,kBAAkB,CACxB,SAA6B,EAC7B,cAAyB,EACzB,uBAAkC;QAElC,MAAM,CACL,cAAc,GAAG,IAAI,CAAC,qBAAqB,EAC3C,KAAK,CAAC,sFAAsF,CAC5F,CAAC;QAEF,MAAM,qBAAqB,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;QAC5D,MAAM,UAAU,GACf,qBAAqB,CAAC,MAAM,KAAK,CAAC;YACjC,CAAC,CAAC;gBACA,cAAc;aACb;YACH,CAAC,CAAC;gBACA,cAAc;gBACd,YAAY,EAAE,qBAAqB,CAAC,MAAM;aACzC,CAAC;QAEN,IAAI,SAAS,CAAC,SAAS,KAAK,IAAI,CAAC,cAAc,EAAE;YAChD,MAAM,CAAC,gBAAgB,CAAC,GAAG,eAAe,CACzC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CACpB,CAAC;YACF,MAAM,CACL,gBAAgB,KAAK,SAAS,EAC9B,KAAK,CAAC,wFAAwF,CAC9F,CAAC;YAEF,4GAA4G;YAC5G,IAAI,CAAC,WAAW,CACf,UAAU,EACV,EAAE,GAAG,gBAAgB,EAAE,SAAS,EAAE,IAAI,CAAC,cAAc,EAAE,EACvD,IAAI,CACJ,CAAC;YACF,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxC,OAAO;SACP;QAED,sDAAsD;QACtD,MAAM,CAAC,EAAE,mBAAmB,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,uBAAuB,CAAC,CAAC;QACpF,wEAAwE;QACxE,8GAA8G;QAC9G,MAAM,eAAe,GAAG,WAAW,CAClC,IAAI,CAAC,iBAAiB,EACtB,SAAS,CAAC,SAAS,EACnB,GAAG,EAAE,CAAC,IAAI,gBAAgB,CAAC,mBAAmB,EAAE,IAAI,CAAC,YAAY,CAAC,CAClE,CAAC;QACF,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;QAE5D,IAAI,eAAe,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE;YACvD,kGAAkG;YAClG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YACxC,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;SAC9C;aAAM;YACN,gHAAgH;YAChH,MAAM,qBAAqB,GAAG,YAAY,CACzC,IAAI,CAAC,YAAY,CAAC,OAAO,EACzB,SAAS,CAAC,MAAM,EAChB,eAAe,CAAC,OAAO,EAAE,EACzB,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CACpB,CAAC;YAEF,eAAe,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC;YAC5D,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE;gBAC5B,GAAG,SAAS;gBACZ,MAAM,EAAE,qBAAqB;aAC7B,CAAC,CAAC;SACH;QAED,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IAEM,eAAe,CACrB,QAAqB;QAErB,MAAM,OAAO,GAA8B,EAAE,CAAC;QAC9C,MAAM,MAAM,GAAG,YAAY,CAC1B,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,EACrC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAC9B,CAAC;QACF,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACpF,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1B,CAAC;IAEO,WAAW,CAAC,UAAsB,EAAE,MAA0B,EAAE,KAAK,GAAG,KAAK;QACpF,MAAM,YAAY,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,sBAAsB,CAAC,YAAY,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACvC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC5C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;IACzF,CAAC;IAUO,qBAAqB,CAC5B,QAAgC;QAEhC,MAAM,UAAU,GACf,OAAO,QAAQ,KAAK,QAAQ;YAC3B,CAAC,CAAC;gBACA,gFAAgF;gBAChF,mDAAmD;gBACnD,+GAA+G;gBAC/G,cAAc,EAAE,QAAQ;gBACxB,YAAY,EAAE,MAAM,CAAC,iBAAiB;aACrC;YACH,CAAC,CAAC,QAAQ,CAAC;QAEb,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;QAC/D,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACvE,OAAO,MAAM,CAAC;IACf,CAAC;IAEO,QAAQ,CAAC,cAAyB;QACzC,MAAM,eAAe,GAAe;YACnC,cAAc;SACd,CAAC;QACF,MAAM,aAAa,GAAe;YACjC,cAAc,EAAE,KAAK,CAAE,cAAyB,GAAG,CAAC,CAAC;SACrD,CAAC;QAEF,OAAO,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,eAAe,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;IACzE,CAAC;CACD;AAUD;;GAEG;AACH,SAAS,eAAe,CACvB,UAAmB,EACnB,cAAuB;IAEvB,MAAM,IAAI,GAAc,EAAE,CAAC;IAC3B,MAAM,CACL,kBAAkB,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,cAAc,CAAC,KAAK,SAAS,EACpE,KAAK,CAAC,qCAAqC,CAC3C,CAAC;IACF,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport BTree from \"sorted-btree\";\nimport { assert } from \"@fluidframework/core-utils\";\nimport { brand, fail, getOrCreate, mapIterable, Mutable, RecursiveReadonly } from \"../util\";\nimport {\n\tassertIsRevisionTag,\n\tChangeFamily,\n\tChangeFamilyEditor,\n\tfindAncestor,\n\tfindCommonAncestor,\n\tGraphCommit,\n\tmintCommit,\n\trebaseChange,\n\tRevisionTag,\n\tSessionId,\n} from \"../core\";\nimport { getChangeReplaceType, onForkTransitive, SharedTreeBranch } from \"./branch\";\nimport {\n\tCommit,\n\tSeqNumber,\n\tSequenceId,\n\tsequenceIdComparator,\n\tequalSequenceIds,\n\tminSequenceId,\n\tSequencedCommit,\n\tSummarySessionBranch,\n\tdecrementSequenceId,\n\tmaxSequenceId,\n} from \"./editManagerFormat\";\n\nexport const minimumPossibleSequenceNumber: SeqNumber = brand(Number.MIN_SAFE_INTEGER);\nconst minimumPossibleSequenceId: SequenceId = {\n\tsequenceNumber: minimumPossibleSequenceNumber,\n};\n\n/**\n * Represents a local branch of a document and interprets the effect on the document of adding sequenced changes,\n * which were based on a given session's branch, to the document history\n */\n// TODO: Try to reduce this to a single type parameter\nexport class EditManager<\n\tTEditor extends ChangeFamilyEditor,\n\tTChangeset,\n\tTChangeFamily extends ChangeFamily<TEditor, TChangeset>,\n> {\n\t/** The \"trunk\" branch. The trunk represents the list of received sequenced changes. */\n\tprivate readonly trunk: SharedTreeBranch<TEditor, TChangeset>;\n\n\t/**\n\t * Records extra data associated with commits in the {@link trunk}.\n\t * This does not include an entry for the {@link trunkBase}.\n\t */\n\tprivate readonly trunkMetadata = new Map<\n\t\tRevisionTag,\n\t\t{ sequenceId: SequenceId; sessionId: SessionId }\n\t>();\n\t/**\n\t * A map from a sequence id to the commit in the {@link trunk} which has that sequence id.\n\t * This also includes an entry for the {@link trunkBase} which always has the lowest key in the map.\n\t */\n\tprivate readonly sequenceMap = new BTree<SequenceId, GraphCommit<TChangeset>>(\n\t\tundefined,\n\t\tsequenceIdComparator,\n\t);\n\n\t/**\n\t * Branches are maintained to represent the local change list that the issuing client had\n\t * at the time of submitting the latest known edit on the branch.\n\t * This means the head commit of each branch is always in its original (non-rebased) form.\n\t */\n\t// TODO:#4593: Add test to ensure that peer branches are never initialized with a repairDataStoreProvider\n\tprivate readonly peerLocalBranches: Map<SessionId, SharedTreeBranch<TEditor, TChangeset>> =\n\t\tnew Map();\n\n\t/**\n\t * This branch holds the changes made by this client which have not yet been confirmed as sequenced changes.\n\t */\n\tpublic readonly localBranch: SharedTreeBranch<TEditor, TChangeset>;\n\n\t/**\n\t * Tracks where on the trunk all registered branches are based. Each key is the sequence id of a commit on\n\t * the trunk, and the value is the set of all branches who have that commit as their common ancestor with the trunk.\n\t */\n\tprivate readonly trunkBranches = new BTree<\n\t\tSequenceId,\n\t\tSet<SharedTreeBranch<TEditor, TChangeset>>\n\t>(undefined, sequenceIdComparator);\n\n\t/**\n\t * The sequence number of the newest commit on the trunk that has been received by all peers.\n\t * Defaults to {@link minimumPossibleSequenceNumber} if no commits have been received.\n\t *\n\t * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.\n\t */\n\tprivate minimumSequenceNumber = minimumPossibleSequenceNumber;\n\n\t/**\n\t * The sequence ID corresponding to the oldest revertible commit owned by the local branch. This is used\n\t * to prevent the trunk from trimming this commit or commits after it as they're needed for undo.\n\t */\n\tprivate _oldestRevertibleSequenceId?: SequenceId;\n\n\t/**\n\t * A special commit that is a \"base\" (tail) of the trunk, though not part of the trunk itself.\n\t * This makes it possible to model the trunk in the same way as any other branch (it branches off of a base commit)\n\t * which allows it to use branching APIs to interact with the other branches.\n\t * Each time trunk eviction occurs, the most recent evicted commit becomes the new `trunkBase`.\n\t */\n\tprivate trunkBase: GraphCommit<TChangeset>;\n\n\t/**\n\t * @param changeFamily - the change family of changes on the trunk and local branch\n\t * @param localSessionId - the id of the local session that will be used for local commits\n\t */\n\tpublic constructor(\n\t\tpublic readonly changeFamily: TChangeFamily,\n\t\t// TODO: Change this type to be the Session ID type provided by the IdCompressor when available.\n\t\tpublic readonly localSessionId: SessionId,\n\t) {\n\t\tthis.trunkBase = {\n\t\t\trevision: assertIsRevisionTag(\"00000000-0000-4000-8000-000000000000\"),\n\t\t\tchange: changeFamily.rebaser.compose([]),\n\t\t};\n\t\tthis.sequenceMap.set(minimumPossibleSequenceId, this.trunkBase);\n\t\tthis.trunk = new SharedTreeBranch(this.trunkBase, changeFamily);\n\t\tthis.localBranch = new SharedTreeBranch(this.trunk.getHead(), changeFamily);\n\n\t\tthis.localBranch.on(\"revertibleDispose\", this.onRevertibleDisposed());\n\n\t\t// Track all forks of the local branch for purposes of trunk eviction. Unlike the local branch, they have\n\t\t// an unknown lifetime and rebase frequency, so we can not make any assumptions about which trunk commits\n\t\t// they require and therefore we monitor them explicitly.\n\t\tonForkTransitive(this.localBranch, (fork) => this.registerBranch(fork));\n\t}\n\n\t/**\n\t * Make the given branch known to the `EditManager`. The `EditManager` will ensure that all registered\n\t * branches remain usable even as the minimum sequence number advances.\n\t */\n\tprivate registerBranch(branch: SharedTreeBranch<TEditor, TChangeset>): void {\n\t\tconst trackBranch = (b: SharedTreeBranch<TEditor, TChangeset>): SequenceId => {\n\t\t\tconst trunkCommit =\n\t\t\t\tfindCommonAncestor(this.trunk.getHead(), b.getHead()) ??\n\t\t\t\tfail(\"Expected branch to be related to trunk\");\n\t\t\tconst sequenceId =\n\t\t\t\tthis.trunkMetadata.get(trunkCommit.revision)?.sequenceId ??\n\t\t\t\tminimumPossibleSequenceId;\n\t\t\tconst branches = getOrCreate(this.trunkBranches, sequenceId, () => new Set());\n\n\t\t\tassert(!branches.has(b), 0x670 /* Branch was registered more than once */);\n\t\t\tbranches.add(b);\n\t\t\treturn sequenceId;\n\t\t};\n\n\t\tconst untrackBranch = (\n\t\t\tb: SharedTreeBranch<TEditor, TChangeset>,\n\t\t\tsequenceId: SequenceId,\n\t\t): void => {\n\t\t\tconst branches =\n\t\t\t\tthis.trunkBranches.get(sequenceId) ?? fail(\"Expected branch to be tracked\");\n\n\t\t\tassert(branches.delete(b), 0x671 /* Expected branch to be tracked */);\n\t\t\tif (branches.size === 0) {\n\t\t\t\tthis.trunkBranches.delete(sequenceId);\n\t\t\t}\n\t\t};\n\n\t\t// Record the sequence id of the branch's base commit on the trunk\n\t\tconst trunkBase = { sequenceId: trackBranch(branch) };\n\t\t// Whenever the branch is rebased, update our record of its base trunk commit\n\t\tconst offRebase = branch.on(\"afterChange\", (args) => {\n\t\t\tif (args.type === \"replace\" && getChangeReplaceType(args) === \"rebase\") {\n\t\t\t\tuntrackBranch(branch, trunkBase.sequenceId);\n\t\t\t\ttrunkBase.sequenceId = trackBranch(branch);\n\t\t\t\tthis.trimTrunk();\n\t\t\t}\n\t\t});\n\t\t// When the branch is disposed, update our branch set and trim the trunk\n\t\tconst offDispose = branch.on(\"dispose\", () => {\n\t\t\tuntrackBranch(branch, trunkBase.sequenceId);\n\t\t\tthis.trimTrunk();\n\t\t\toffRebase();\n\t\t\toffDispose();\n\t\t});\n\t}\n\n\t/**\n\t * Returns the sequence id of the oldest sequenced revertible commit on the local branch.\n\t *\n\t * TODO: may be more performant to maintain the oldest revertible on the branches themselves\n\t * this should be tested and revisited once branches are supported\n\t */\n\tprivate getOldestRevertibleSequenceId(): SequenceId | undefined {\n\t\tif (this._oldestRevertibleSequenceId === undefined) {\n\t\t\tlet oldest: SequenceId | undefined;\n\t\t\tfor (const revision of this.localBranch.revertibleCommits()) {\n\t\t\t\tif (oldest === undefined) {\n\t\t\t\t\toldest = this.trunkMetadata.get(revision)?.sequenceId;\n\t\t\t\t} else {\n\t\t\t\t\tconst current = this.trunkMetadata.get(revision)?.sequenceId;\n\t\t\t\t\tif (current !== undefined) {\n\t\t\t\t\t\toldest = minSequenceId(oldest, current);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis._oldestRevertibleSequenceId = oldest;\n\t\t}\n\n\t\treturn this._oldestRevertibleSequenceId;\n\t}\n\n\tprivate onRevertibleDisposed(): (revision: RevisionTag) => void {\n\t\treturn (revision: RevisionTag) => {\n\t\t\tconst metadata = this.trunkMetadata.get(revision);\n\n\t\t\t// if this revision hasn't been sequenced, it won't be evicted\n\t\t\tif (metadata !== undefined) {\n\t\t\t\tconst { sequenceId: id } = metadata;\n\t\t\t\t// if this revision corresponds with the current oldest revertible sequence id, replace it with the new oldest\n\t\t\t\tif (id === this._oldestRevertibleSequenceId) {\n\t\t\t\t\tthis._oldestRevertibleSequenceId = undefined;\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t}\n\n\t/**\n\t * Advances the minimum sequence number, and removes all commits from the trunk which lie outside the collaboration window.\n\t * @param minimumSequenceNumber - the sequence number of the newest commit that all peers (including this one) have received and applied to their trunks.\n\t *\n\t * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.\n\t */\n\tpublic advanceMinimumSequenceNumber(minimumSequenceNumber: SeqNumber): void {\n\t\tif (minimumSequenceNumber === this.minimumSequenceNumber) {\n\t\t\treturn;\n\t\t}\n\n\t\tassert(\n\t\t\tminimumSequenceNumber > this.minimumSequenceNumber,\n\t\t\t0x476 /* number must be larger or equal to current minimumSequenceNumber. */,\n\t\t);\n\n\t\tthis.minimumSequenceNumber = minimumSequenceNumber;\n\t\tthis.trimTrunk();\n\t}\n\n\t/**\n\t * Examines the latest known minimum sequence number and the trunk bases of any registered branches to determine\n\t * if any commits on the trunk are unreferenced and unneeded for future computation; those found are evicted from the trunk.\n\t * @returns the number of commits that were removed from the trunk\n\t */\n\tprivate trimTrunk(): void {\n\t\t/** The sequence id of the oldest commit on the trunk that will be retained */\n\t\tlet trunkTailSequenceId: SequenceId = {\n\t\t\tsequenceNumber: this.minimumSequenceNumber,\n\t\t\tindexInBatch: Number.POSITIVE_INFINITY,\n\t\t};\n\t\t// If there are any outstanding registered branches, get the one that is the oldest (has the \"most behind\" trunk base)\n\t\tconst minimumBranchBaseSequenceId = this.trunkBranches.minKey();\n\t\tif (minimumBranchBaseSequenceId !== undefined) {\n\t\t\t// If that branch is behind the minimum sequence id, we only want to evict commits older than it,\n\t\t\t// even if those commits are behind the minimum sequence id\n\t\t\tconst sequenceIdBeforeMinimumBranchBase = decrementSequenceId(\n\t\t\t\tminimumBranchBaseSequenceId,\n\t\t\t);\n\t\t\ttrunkTailSequenceId = minSequenceId(\n\t\t\t\ttrunkTailSequenceId,\n\t\t\t\tsequenceIdBeforeMinimumBranchBase,\n\t\t\t);\n\t\t}\n\n\t\t// TODO get the oldest revertible sequence id from all registered branches, not just the local branch\n\t\tconst oldestRevertibleSequenceId = this.getOldestRevertibleSequenceId();\n\t\tif (oldestRevertibleSequenceId !== undefined) {\n\t\t\t// use a smaller sequence number so that the oldest revertible is not trimmed\n\t\t\tconst sequenceIdBeforeOldestRevertible = decrementSequenceId(\n\t\t\t\toldestRevertibleSequenceId,\n\t\t\t);\n\t\t\ttrunkTailSequenceId = minSequenceId(\n\t\t\t\ttrunkTailSequenceId,\n\t\t\t\tsequenceIdBeforeOldestRevertible,\n\t\t\t);\n\t\t}\n\n\t\tconst [sequenceId, latestEvicted] = this.getClosestTrunkCommit(\n\t\t\tmaxSequenceId(\n\t\t\t\ttrunkTailSequenceId,\n\t\t\t\tthis.sequenceMap.minKey() ?? minimumPossibleSequenceId,\n\t\t\t),\n\t\t);\n\n\t\t// Don't do any work if the commit found by the search is already the tail of the trunk\n\t\tif (latestEvicted !== this.trunkBase) {\n\t\t\t// The minimum sequence number informs us that all peer branches are at least caught up to the tail commit,\n\t\t\t// so rebase them accordingly. This is necessary to prevent peer branches from referencing any evicted commits.\n\t\t\tfor (const [, branch] of this.peerLocalBranches) {\n\t\t\t\tbranch.rebaseOnto(this.trunk, latestEvicted);\n\t\t\t}\n\n\t\t\t// This mutation is a performance hack. If commits are truly immutable, then changing the trunk's tail requires\n\t\t\t// regenerating the entire commit graph. Instead, we can simply chop off the tail like this if we're certain\n\t\t\t// that there are no outstanding references to any of the commits being removed (other than the references via\n\t\t\t// the trunk). The peer branches have been rebased to the head of the trunk, the local branch is already rebased\n\t\t\t// to the head of the trunk, and all other branches are tracked by `trunkBranches` and known to be ahead of or at\n\t\t\t// `newTrunkBase`. Therefore, no branches should have unique references to any of the commits being evicted here.\n\t\t\t// We mutate the most recent of the evicted commits to become the new trunk base. That way, any other commits that\n\t\t\t// have parent pointers to the latest evicted commit will stay linked, even though that it is no longer part of the trunk.\n\t\t\tconst newTrunkBase = latestEvicted as Mutable<typeof latestEvicted>;\n\t\t\t// The metadata for new trunk base revision needs to be deleted before modifying it.\n\t\t\tthis.trunkMetadata.delete(newTrunkBase.revision);\n\t\t\t// Copying the revision of the old trunk base into the new trunk base means we don't need to write out the original\n\t\t\t// revision to summaries. All clients agree that the trunk base always has the same hardcoded revision.\n\t\t\tnewTrunkBase.revision = this.trunkBase.revision;\n\t\t\t// Overwriting the change is not strictly necessary, but done here for consistency (so all trunk bases are deeply equal).\n\t\t\tnewTrunkBase.change = this.trunkBase.change;\n\t\t\t// Dropping the parent field removes (transitively) all references to the evicted commits so they can be garbage collected.\n\t\t\tdelete newTrunkBase.parent;\n\t\t\tthis.trunkBase = newTrunkBase;\n\n\t\t\t// Update any state that is derived from trunk commits\n\t\t\tthis.sequenceMap.editRange(\n\t\t\t\tminimumPossibleSequenceId,\n\t\t\t\tsequenceId,\n\t\t\t\ttrue,\n\t\t\t\t(s, { revision }) => {\n\t\t\t\t\t// Cleanup look-aside data for each evicted commit\n\t\t\t\t\tthis.trunkMetadata.delete(revision);\n\t\t\t\t\t// Delete all evicted commits from `sequenceMap` except for the latest one, which is the new `trunkBase`\n\t\t\t\t\tif (equalSequenceIds(s, sequenceId)) {\n\t\t\t\t\t\tassert(\n\t\t\t\t\t\t\trevision === newTrunkBase.revision,\n\t\t\t\t\t\t\t0x729 /* Expected last evicted commit to be new trunk base */,\n\t\t\t\t\t\t);\n\t\t\t\t\t} else {\n\t\t\t\t\t\treturn { delete: true };\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t);\n\n\t\t\tconst trunkSize = getPathFromBase(this.trunk.getHead(), this.trunkBase).length;\n\t\t\tassert(\n\t\t\t\tthis.sequenceMap.size === trunkSize + 1,\n\t\t\t\t0x744 /* The size of the sequenceMap must have one element more than the trunk */,\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tthis.trunkMetadata.size === trunkSize,\n\t\t\t\t0x745 /* The size of the trunkMetadata must be the same as the trunk */,\n\t\t\t);\n\t\t}\n\t}\n\n\tpublic isEmpty(): boolean {\n\t\treturn (\n\t\t\tthis.trunk.getHead() === this.trunkBase &&\n\t\t\tthis.peerLocalBranches.size === 0 &&\n\t\t\tthis.localBranch.getHead() === this.trunk.getHead() &&\n\t\t\tthis.minimumSequenceNumber === minimumPossibleSequenceNumber\n\t\t);\n\t}\n\n\tpublic getSummaryData(): SummaryData<TChangeset> {\n\t\t// The assert below is acceptable at present because summarization only ever occurs on a client with no\n\t\t// local/in-flight changes.\n\t\t// In the future we may wish to relax this constraint. For that to work, the current implementation of\n\t\t// `EditManager` would have to be amended in one of two ways:\n\t\t// A) Changes made by the local session should be represented by a branch in `EditManager.branches`.\n\t\t// B) The contents of such a branch should be computed on demand based on the trunk.\n\t\t// Note that option (A) would be a simple change to `addSequencedChange` whereas (B) would likely require\n\t\t// rebasing trunk changes over the inverse of trunk changes.\n\t\tassert(\n\t\t\tthis.localBranch.getHead() === this.trunk.getHead(),\n\t\t\t0x428 /* Clients with local changes cannot be used to generate summaries */,\n\t\t);\n\n\t\tconst trunk = getPathFromBase(this.trunk.getHead(), this.trunkBase).map((c) => {\n\t\t\tconst metadata =\n\t\t\t\tthis.trunkMetadata.get(c.revision) ?? fail(\"Expected metadata for trunk commit\");\n\t\t\tconst commit: SequencedCommit<TChangeset> = {\n\t\t\t\tchange: c.change,\n\t\t\t\trevision: c.revision,\n\t\t\t\tsequenceNumber: metadata.sequenceId.sequenceNumber,\n\t\t\t\tsessionId: metadata.sessionId,\n\t\t\t};\n\t\t\tif (metadata.sequenceId.indexInBatch !== undefined) {\n\t\t\t\tcommit.indexInBatch = metadata.sequenceId.indexInBatch;\n\t\t\t}\n\t\t\treturn commit;\n\t\t});\n\n\t\tconst branches = new Map<SessionId, SummarySessionBranch<TChangeset>>(\n\t\t\tmapIterable(this.peerLocalBranches.entries(), ([sessionId, branch]) => {\n\t\t\t\tconst branchPath: GraphCommit<TChangeset>[] = [];\n\t\t\t\tconst ancestor =\n\t\t\t\t\tfindCommonAncestor([branch.getHead(), branchPath], this.trunk.getHead()) ??\n\t\t\t\t\tfail(\"Expected branch to be based on trunk\");\n\n\t\t\t\treturn [\n\t\t\t\t\tsessionId,\n\t\t\t\t\t{\n\t\t\t\t\t\tbase: ancestor.revision,\n\t\t\t\t\t\tcommits: branchPath.map((c) => {\n\t\t\t\t\t\t\tconst commit: Commit<TChangeset> = {\n\t\t\t\t\t\t\t\tchange: c.change,\n\t\t\t\t\t\t\t\trevision: c.revision,\n\t\t\t\t\t\t\t\tsessionId,\n\t\t\t\t\t\t\t};\n\t\t\t\t\t\t\treturn commit;\n\t\t\t\t\t\t}),\n\t\t\t\t\t},\n\t\t\t\t];\n\t\t\t}),\n\t\t);\n\n\t\treturn { trunk, branches };\n\t}\n\n\tpublic loadSummaryData(data: SummaryData<TChangeset>): void {\n\t\tassert(\n\t\t\tthis.isEmpty(),\n\t\t\t0x68a /* Attempted to load from summary after edit manager was already mutated */,\n\t\t);\n\t\t// Record the tags of each trunk commit as we generate the trunk so they can be looked up quickly\n\t\t// when hydrating the peer branches below\n\t\tconst trunkRevisionCache = new Map<RevisionTag, GraphCommit<TChangeset>>();\n\t\ttrunkRevisionCache.set(this.trunkBase.revision, this.trunkBase);\n\t\tthis.trunk.setHead(\n\t\t\tdata.trunk.reduce((base, c) => {\n\t\t\t\tconst sequenceId: SequenceId =\n\t\t\t\t\tc.indexInBatch === undefined\n\t\t\t\t\t\t? {\n\t\t\t\t\t\t\t\tsequenceNumber: c.sequenceNumber,\n\t\t\t\t\t\t  }\n\t\t\t\t\t\t: {\n\t\t\t\t\t\t\t\tsequenceNumber: c.sequenceNumber,\n\t\t\t\t\t\t\t\tindexInBatch: c.indexInBatch,\n\t\t\t\t\t\t  };\n\t\t\t\tconst commit = mintCommit(base, c);\n\t\t\t\tthis.sequenceMap.set(sequenceId, commit);\n\t\t\t\tthis.trunkMetadata.set(c.revision, {\n\t\t\t\t\tsequenceId,\n\t\t\t\t\tsessionId: c.sessionId,\n\t\t\t\t});\n\t\t\t\ttrunkRevisionCache.set(c.revision, commit);\n\t\t\t\treturn commit;\n\t\t\t}, this.trunkBase),\n\t\t);\n\n\t\tthis.localBranch.setHead(this.trunk.getHead());\n\n\t\tfor (const [sessionId, branch] of data.branches) {\n\t\t\tconst commit =\n\t\t\t\ttrunkRevisionCache.get(branch.base) ??\n\t\t\t\tfail(\"Expected summary branch to be based off of a revision in the trunk\");\n\n\t\t\tthis.peerLocalBranches.set(\n\t\t\t\tsessionId,\n\t\t\t\tnew SharedTreeBranch(branch.commits.reduce(mintCommit, commit), this.changeFamily),\n\t\t\t);\n\t\t}\n\t}\n\n\tpublic getTrunkChanges(): readonly RecursiveReadonly<TChangeset>[] {\n\t\treturn getPathFromBase(this.trunk.getHead(), this.trunkBase).map((c) => c.change);\n\t}\n\n\tpublic getTrunkHead(): GraphCommit<TChangeset> {\n\t\treturn this.trunk.getHead();\n\t}\n\n\tpublic getLocalChanges(): readonly RecursiveReadonly<TChangeset>[] {\n\t\treturn getPathFromBase(this.localBranch.getHead(), this.trunk.getHead()).map(\n\t\t\t(c) => c.change,\n\t\t);\n\t}\n\n\t/**\n\t * @returns The length of the longest branch maintained by this EditManager.\n\t * This may be the length of a peer branch or the local branch.\n\t * The length is counted from the lowest common ancestor with the trunk such that a fully sequenced branch would\n\t * have length zero.\n\t */\n\tpublic getLongestBranchLength(): number {\n\t\tlet max = 0;\n\t\tconst trunkHead = this.trunk.getHead();\n\t\tfor (const branch of this.peerLocalBranches.values()) {\n\t\t\tconst branchPath = getPathFromBase(branch.getHead(), trunkHead);\n\t\t\tif (branchPath.length > max) {\n\t\t\t\tmax = branchPath.length;\n\t\t\t}\n\t\t}\n\t\tconst localPath = getPathFromBase(this.localBranch.getHead(), trunkHead);\n\t\treturn Math.max(max, localPath.length);\n\t}\n\n\tpublic addSequencedChange(\n\t\tnewCommit: Commit<TChangeset>,\n\t\tsequenceNumber: SeqNumber,\n\t\treferenceSequenceNumber: SeqNumber,\n\t): void {\n\t\tassert(\n\t\t\tsequenceNumber > this.minimumSequenceNumber,\n\t\t\t0x713 /* Expected change sequence number to exceed the last known minimum sequence number */,\n\t\t);\n\n\t\tconst commitsSequenceNumber = this.getBatch(sequenceNumber);\n\t\tconst sequenceId: SequenceId =\n\t\t\tcommitsSequenceNumber.length === 0\n\t\t\t\t? {\n\t\t\t\t\t\tsequenceNumber,\n\t\t\t\t  }\n\t\t\t\t: {\n\t\t\t\t\t\tsequenceNumber,\n\t\t\t\t\t\tindexInBatch: commitsSequenceNumber.length,\n\t\t\t\t  };\n\n\t\tif (newCommit.sessionId === this.localSessionId) {\n\t\t\tconst [firstLocalCommit] = getPathFromBase(\n\t\t\t\tthis.localBranch.getHead(),\n\t\t\t\tthis.trunk.getHead(),\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tfirstLocalCommit !== undefined,\n\t\t\t\t0x6b5 /* Received a sequenced change from the local session despite having no local changes */,\n\t\t\t);\n\n\t\t\t// The first local branch commit is already rebased over the trunk, so we can push it directly to the trunk.\n\t\t\tthis.pushToTrunk(\n\t\t\t\tsequenceId,\n\t\t\t\t{ ...firstLocalCommit, sessionId: this.localSessionId },\n\t\t\t\ttrue,\n\t\t\t);\n\t\t\tthis.localBranch.rebaseOnto(this.trunk);\n\t\t\treturn;\n\t\t}\n\n\t\t// Get the revision that the remote change is based on\n\t\tconst [, baseRevisionInTrunk] = this.getClosestTrunkCommit(referenceSequenceNumber);\n\t\t// Rebase that branch over the part of the trunk up to the base revision\n\t\t// This will be a no-op if the sending client has not advanced since the last time we received an edit from it\n\t\tconst peerLocalBranch = getOrCreate(\n\t\t\tthis.peerLocalBranches,\n\t\t\tnewCommit.sessionId,\n\t\t\t() => new SharedTreeBranch(baseRevisionInTrunk, this.changeFamily),\n\t\t);\n\t\tpeerLocalBranch.rebaseOnto(this.trunk, baseRevisionInTrunk);\n\n\t\tif (peerLocalBranch.getHead() === this.trunk.getHead()) {\n\t\t\t// If the branch is fully caught up and empty after being rebased, then push to the trunk directly\n\t\t\tthis.pushToTrunk(sequenceId, newCommit);\n\t\t\tpeerLocalBranch.setHead(this.trunk.getHead());\n\t\t} else {\n\t\t\t// Otherwise, rebase the change over the trunk and append it, and append the original change to the peer branch.\n\t\t\tconst newChangeFullyRebased = rebaseChange(\n\t\t\t\tthis.changeFamily.rebaser,\n\t\t\t\tnewCommit.change,\n\t\t\t\tpeerLocalBranch.getHead(),\n\t\t\t\tthis.trunk.getHead(),\n\t\t\t);\n\n\t\t\tpeerLocalBranch.apply(newCommit.change, newCommit.revision);\n\t\t\tthis.pushToTrunk(sequenceId, {\n\t\t\t\t...newCommit,\n\t\t\t\tchange: newChangeFullyRebased,\n\t\t\t});\n\t\t}\n\n\t\tthis.localBranch.rebaseOnto(this.trunk);\n\t}\n\n\tpublic findLocalCommit(\n\t\trevision: RevisionTag,\n\t): [commit: GraphCommit<TChangeset>, commitsAfter: GraphCommit<TChangeset>[]] {\n\t\tconst commits: GraphCommit<TChangeset>[] = [];\n\t\tconst commit = findAncestor(\n\t\t\t[this.localBranch.getHead(), commits],\n\t\t\t(c) => c.revision === revision,\n\t\t);\n\t\tassert(commit !== undefined, 0x599 /* Expected local branch to contain revision */);\n\t\treturn [commit, commits];\n\t}\n\n\tprivate pushToTrunk(sequenceId: SequenceId, commit: Commit<TChangeset>, local = false): void {\n\t\tconst mintedCommit = mintCommit(this.trunk.getHead(), commit);\n\t\tthis.trunk.setHead(mintedCommit);\n\t\tthis.localBranch.updateRevertibleCommit(mintedCommit);\n\t\tconst trunkHead = this.trunk.getHead();\n\t\tthis.sequenceMap.set(sequenceId, trunkHead);\n\t\tthis.trunkMetadata.set(trunkHead.revision, { sequenceId, sessionId: commit.sessionId });\n\t}\n\n\t/**\n\t * Finds the most recent trunk commit that was sequenced at or before the given point.\n\t * @param searchBy - the sequence number or the sequence id to search for\n\t * @remarks Fails if there is no eligible commit.\n\t * @returns the closest commit and its sequence id\n\t */\n\tprivate getClosestTrunkCommit(searchBy: SeqNumber): [SequenceId, GraphCommit<TChangeset>];\n\tprivate getClosestTrunkCommit(searchBy: SequenceId): [SequenceId, GraphCommit<TChangeset>];\n\tprivate getClosestTrunkCommit(\n\t\tsearchBy: SeqNumber | SequenceId,\n\t): [SequenceId, GraphCommit<TChangeset>] {\n\t\tconst sequenceId: SequenceId =\n\t\t\ttypeof searchBy === \"number\"\n\t\t\t\t? {\n\t\t\t\t\t\t// This is to make sure that the correct commit is selected in this 2 scenarios:\n\t\t\t\t\t\t// 1) The commit is unique for that sequence number\n\t\t\t\t\t\t// 2) There are more than one commit for the same sequence number, in this case we need to select the last one.\n\t\t\t\t\t\tsequenceNumber: searchBy,\n\t\t\t\t\t\tindexInBatch: Number.POSITIVE_INFINITY,\n\t\t\t\t  }\n\t\t\t\t: searchBy;\n\n\t\tconst commit = this.sequenceMap.getPairOrNextLower(sequenceId);\n\t\tassert(commit !== undefined, 0x746 /* sequence id has been evicted */);\n\t\treturn commit;\n\t}\n\n\tprivate getBatch(sequenceNumber: SeqNumber): [SequenceId, GraphCommit<TChangeset>][] {\n\t\tconst startSequenceId: SequenceId = {\n\t\t\tsequenceNumber,\n\t\t};\n\t\tconst endSequenceId: SequenceId = {\n\t\t\tsequenceNumber: brand((sequenceNumber as number) + 1),\n\t\t};\n\n\t\treturn this.sequenceMap.getRange(startSequenceId, endSequenceId, false);\n\t}\n}\n\n/**\n * The in-memory data that summaries contain\n */\nexport interface SummaryData<TChangeset> {\n\treadonly trunk: readonly SequencedCommit<TChangeset>[];\n\treadonly branches: ReadonlyMap<SessionId, SummarySessionBranch<TChangeset>>;\n}\n\n/**\n * @returns the path from the base of a branch to its head\n */\nfunction getPathFromBase<TCommit extends { parent?: TCommit }>(\n\tbranchHead: TCommit,\n\tbaseBranchHead: TCommit,\n): TCommit[] {\n\tconst path: TCommit[] = [];\n\tassert(\n\t\tfindCommonAncestor([branchHead, path], baseBranchHead) !== undefined,\n\t\t0x573 /* Expected branches to be related */,\n\t);\n\treturn path;\n}\n"]}

package/lib/shared-tree-core/editManagerCodecs.d.ts

@@ -0,0 +1,9 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ICodecOptions, IJsonCodec, IMultiFormatCodec } from "../codec";
+import { EncodedRevisionTag, RevisionTag } from "../core";
+import { SummaryData } from "./editManager";
+export declare function makeEditManagerCodec<TChangeset>(changeCodec: IMultiFormatCodec<TChangeset>, revisionTagCodec: IJsonCodec<RevisionTag, EncodedRevisionTag>, { jsonValidator: validator }: ICodecOptions): IJsonCodec<SummaryData<TChangeset>>;
+//# sourceMappingURL=editManagerCodecs.d.ts.map

package/lib/shared-tree-core/editManagerCodecs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"editManagerCodecs.d.ts","sourceRoot":"","sources":["../../src/shared-tree-core/editManagerCodecs.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,UAAU,CAAC;AACxE,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE1D,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAG5C,wBAAgB,oBAAoB,CAAC,UAAU,EAC9C,WAAW,EAAE,iBAAiB,CAAC,UAAU,CAAC,EAC1C,gBAAgB,EAAE,UAAU,CAAC,WAAW,EAAE,kBAAkB,CAAC,EAC7D,EAAE,aAAa,EAAE,SAAS,EAAE,EAAE,aAAa,GACzC,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CA8CrC"}

package/lib/shared-tree-core/editManagerCodecs.js

@@ -0,0 +1,48 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils";
+import { JsonCompatibleReadOnlySchema, mapIterable } from "../util";
+import { EncodedEditManager } from "./editManagerFormat";
+export function makeEditManagerCodec(changeCodec, revisionTagCodec, { jsonValidator: validator }) {
+    const format = validator.compile(EncodedEditManager(changeCodec.json.encodedSchema ?? JsonCompatibleReadOnlySchema));
+    const encodeCommit = (commit) => ({
+        ...commit,
+        revision: revisionTagCodec.encode(commit.revision),
+        change: changeCodec.json.encode(commit.change),
+    });
+    const decodeCommit = (commit) => ({
+        ...commit,
+        revision: revisionTagCodec.decode(commit.revision),
+        change: changeCodec.json.decode(commit.change),
+    });
+    return {
+        encode: (data) => {
+            const json = {
+                trunk: data.trunk.map(encodeCommit),
+                branches: Array.from(data.branches.entries(), ([sessionId, branch]) => [
+                    sessionId,
+                    { ...branch, commits: branch.commits.map(encodeCommit) },
+                ]),
+            };
+            assert(format.check(json), 0x6cc /* Encoded schema should validate */);
+            return json;
+        },
+        decode: (json) => {
+            assert(format.check(json), 0x6cd /* Encoded schema should validate */);
+            return {
+                trunk: json.trunk.map(decodeCommit),
+                branches: new Map(mapIterable(json.branches, ([sessionId, branch]) => [
+                    sessionId,
+                    {
+                        ...branch,
+                        base: revisionTagCodec.decode(branch.base),
+                        commits: branch.commits.map(decodeCommit),
+                    },
+                ])),
+            };
+        },
+    };
+}
+//# sourceMappingURL=editManagerCodecs.js.map

package/lib/shared-tree-core/editManagerCodecs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"editManagerCodecs.js","sourceRoot":"","sources":["../../src/shared-tree-core/editManagerCodecs.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAGpD,OAAO,EAA0B,4BAA4B,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAE5F,OAAO,EAAyB,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AAEhF,MAAM,UAAU,oBAAoB,CACnC,WAA0C,EAC1C,gBAA6D,EAC7D,EAAE,aAAa,EAAE,SAAS,EAAiB;IAE3C,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,CAC/B,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,IAAI,4BAA4B,CAAC,CAClF,CAAC;IAEF,MAAM,YAAY,GAAG,CAA+B,MAAS,EAAE,EAAE,CAAC,CAAC;QAClE,GAAG,MAAM;QACT,QAAQ,EAAE,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;QAClD,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;KAC9C,CAAC,CAAC;IAEH,MAAM,YAAY,GAAG,CAAkD,MAAS,EAAE,EAAE,CAAC,CAAC;QACrF,GAAG,MAAM;QACT,QAAQ,EAAE,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;QAClD,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;KAC9C,CAAC,CAAC;IAEH,OAAO;QACN,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;YAChB,MAAM,IAAI,GAAmC;gBAC5C,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;gBACnC,QAAQ,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;oBACtE,SAAS;oBACT,EAAE,GAAG,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE;iBACxD,CAAC;aACF,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;YACvE,OAAO,IAAyC,CAAC;QAClD,CAAC;QACD,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;YAChB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;YACvE,OAAO;gBACN,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC;gBACnC,QAAQ,EAAE,IAAI,GAAG,CAChB,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC;oBACnD,SAAS;oBACT;wBACC,GAAG,MAAM;wBACT,IAAI,EAAE,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;wBAC1C,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC;qBACzC;iBACD,CAAC,CACF;aACD,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { ICodecOptions, IJsonCodec, IMultiFormatCodec } from \"../codec\";\nimport { EncodedRevisionTag, RevisionTag } from \"../core\";\nimport { JsonCompatibleReadOnly, JsonCompatibleReadOnlySchema, mapIterable } from \"../util\";\nimport { SummaryData } from \"./editManager\";\nimport { Commit, EncodedCommit, EncodedEditManager } from \"./editManagerFormat\";\n\nexport function makeEditManagerCodec<TChangeset>(\n\tchangeCodec: IMultiFormatCodec<TChangeset>,\n\trevisionTagCodec: IJsonCodec<RevisionTag, EncodedRevisionTag>,\n\t{ jsonValidator: validator }: ICodecOptions,\n): IJsonCodec<SummaryData<TChangeset>> {\n\tconst format = validator.compile(\n\t\tEncodedEditManager(changeCodec.json.encodedSchema ?? JsonCompatibleReadOnlySchema),\n\t);\n\n\tconst encodeCommit = <T extends Commit<TChangeset>>(commit: T) => ({\n\t\t...commit,\n\t\trevision: revisionTagCodec.encode(commit.revision),\n\t\tchange: changeCodec.json.encode(commit.change),\n\t});\n\n\tconst decodeCommit = <T extends EncodedCommit<JsonCompatibleReadOnly>>(commit: T) => ({\n\t\t...commit,\n\t\trevision: revisionTagCodec.decode(commit.revision),\n\t\tchange: changeCodec.json.decode(commit.change),\n\t});\n\n\treturn {\n\t\tencode: (data) => {\n\t\t\tconst json: EncodedEditManager<TChangeset> = {\n\t\t\t\ttrunk: data.trunk.map(encodeCommit),\n\t\t\t\tbranches: Array.from(data.branches.entries(), ([sessionId, branch]) => [\n\t\t\t\t\tsessionId,\n\t\t\t\t\t{ ...branch, commits: branch.commits.map(encodeCommit) },\n\t\t\t\t]),\n\t\t\t};\n\t\t\tassert(format.check(json), 0x6cc /* Encoded schema should validate */);\n\t\t\treturn json as unknown as JsonCompatibleReadOnly;\n\t\t},\n\t\tdecode: (json) => {\n\t\t\tassert(format.check(json), 0x6cd /* Encoded schema should validate */);\n\t\t\treturn {\n\t\t\t\ttrunk: json.trunk.map(decodeCommit),\n\t\t\t\tbranches: new Map(\n\t\t\t\t\tmapIterable(json.branches, ([sessionId, branch]) => [\n\t\t\t\t\t\tsessionId,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t...branch,\n\t\t\t\t\t\t\tbase: revisionTagCodec.decode(branch.base),\n\t\t\t\t\t\t\tcommits: branch.commits.map(decodeCommit),\n\t\t\t\t\t\t},\n\t\t\t\t\t]),\n\t\t\t\t),\n\t\t\t};\n\t\t},\n\t};\n}\n"]}