@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

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

@@ -0,0 +1,407 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils";
+import { findAncestor, mintCommit, mintRevisionTag, tagChange, rebaseBranch, findCommonAncestor, makeAnonChange, RevertibleKind, RevertResult, DiscardResult, rebaseChangeOverChanges, tagRollbackInverse, } from "../core";
+import { EventEmitter } from "../events";
+import { fail } from "../util";
+import { TransactionStack } from "./transactionStack";
+/**
+ * Returns the operation that caused the given {@link SharedTreeBranchChange}.
+ */
+export function getChangeReplaceType(change) {
+    // The "replace" variant of the change event is emitted by two operations: committing a transaction and doing a rebase.
+    // Committing a transaction will always remove one or more commits (the commits that were squashed),
+    // and will add exactly one new commit (the squash commit).
+    if (change.removedCommits.length === 0 || change.newCommits.length !== 1) {
+        return "rebase";
+    }
+    // There is only one case in which a rebase both removes commits and adds exactly one new commit.
+    // This occurs when there is exactly one divergent, but equivalent, commit on each branch:
+    //
+    // A ─ B (branch X)	  -- rebase Y onto X -->   A ─ B (branch X)
+    // └─ B' (branch Y)                                └─ (branch Y)
+    //
+    // B' is removed and replaced by B because both have the same revision.
+    if (change.removedCommits.length === 1 &&
+        change.removedCommits[0].revision === change.newCommits[0].revision) {
+        return "rebase";
+    }
+    return "transactionCommit";
+}
+/**
+ * A branch of changes that can be applied to a SharedTree.
+ */
+export class SharedTreeBranch extends EventEmitter {
+    /**
+     * Construct a new branch.
+     * @param head - the head of the branch
+     * @param changeFamily - determines the set of changes that this branch can commit
+     */
+    constructor(head, changeFamily) {
+        super();
+        this.head = head;
+        this.changeFamily = changeFamily;
+        // set of revertibles maintained for automatic disposal
+        this.revertibles = new Set();
+        this._revertibleCommits = new Map();
+        this.transactions = new TransactionStack();
+        this.disposed = false;
+        this.editor = this.changeFamily.buildEditor((change) => this.apply(change, mintRevisionTag()));
+    }
+    /**
+     * Sets the head of this branch. Emits no change events.
+     */
+    setHead(head) {
+        this.assertNotDisposed();
+        assert(!this.isTransacting(), 0x685 /* Cannot set head during a transaction */);
+        this.head = head;
+    }
+    /**
+     * Apply a change to this branch.
+     * @param change - the change to apply
+     * @param revision - the revision of the new head commit of the branch that contains `change`
+     * @returns the change that was applied and the new head commit of the branch
+     */
+    apply(change, revision) {
+        return this.applyChange(change, revision, RevertibleKind.Default);
+    }
+    applyChange(change, revision, revertibleKind) {
+        this.assertNotDisposed();
+        const newHead = mintCommit(this.head, {
+            revision,
+            change,
+        });
+        const changeEvent = {
+            type: "append",
+            change: tagChange(change, revision),
+            newCommits: [newHead],
+        };
+        this.emit("beforeChange", changeEvent);
+        this.head = newHead;
+        // If this is not part of a transaction, emit a revertible event
+        if (!this.isTransacting()) {
+            this.emit("revertible", this.makeSharedTreeRevertible(newHead, revertibleKind));
+        }
+        this.emit("afterChange", changeEvent);
+        return [change, newHead];
+    }
+    /**
+     * @returns the commit at the head of this branch.
+     */
+    getHead() {
+        return this.head;
+    }
+    /**
+     * Begin a transaction on this branch. If the transaction is committed via {@link commitTransaction},
+     * all commits made since this call will be squashed into a single head commit.
+     * @param repairStore - the repair store associated with this transaction
+     */
+    startTransaction() {
+        this.assertNotDisposed();
+        const forks = new Set();
+        const onDisposeUnSubscribes = [];
+        const onForkUnSubscribe = onForkTransitive(this, (fork) => {
+            forks.add(fork);
+            onDisposeUnSubscribes.push(fork.on("dispose", () => forks.delete(fork)));
+        });
+        this.transactions.push(this.head.revision, () => {
+            forks.forEach((fork) => fork.dispose());
+            onDisposeUnSubscribes.forEach((unsubscribe) => unsubscribe());
+            onForkUnSubscribe();
+        });
+        this.editor.enterTransaction();
+    }
+    /**
+     * Commit the current transaction. There must be a transaction in progress that was begun via {@link startTransaction}.
+     * If there are commits in the current transaction, they will be squashed into a new single head commit.
+     * @returns the commits that were squashed and the new squash commit if a squash occurred, otherwise `undefined`.
+     * @remarks If the transaction had no changes applied during its lifetime, then no squash occurs (i.e. this method is a no-op).
+     * Even if the transaction contained only one change, it will still be replaced with an (equivalent) squash change.
+     */
+    commitTransaction() {
+        this.assertNotDisposed();
+        const [startCommit, commits] = this.popTransaction();
+        this.editor.exitTransaction();
+        if (commits.length === 0) {
+            return undefined;
+        }
+        // Anonymize the commits from this transaction by stripping their revision tags.
+        // Otherwise, the change rebaser will record their tags and those tags no longer exist.
+        const anonymousCommits = commits.map(({ change }) => ({ change, revision: undefined }));
+        // Squash the changes and make the squash commit the new head of this branch
+        const squashedChange = this.changeFamily.rebaser.compose(anonymousCommits);
+        const revision = mintRevisionTag();
+        const newHead = mintCommit(startCommit, {
+            revision,
+            change: squashedChange,
+        });
+        const changeEvent = {
+            type: "replace",
+            change: undefined,
+            removedCommits: commits,
+            newCommits: [newHead],
+        };
+        this.emit("beforeChange", changeEvent);
+        this.head = newHead;
+        // If this transaction is not nested, emit a revertible event
+        if (!this.isTransacting()) {
+            this.emit("revertible", this.makeSharedTreeRevertible(newHead, RevertibleKind.Default));
+        }
+        this.emit("afterChange", changeEvent);
+        return [commits, newHead];
+    }
+    /**
+     * Cancel the current transaction. There must be a transaction in progress that was begun via
+     * {@link startTransaction}. All commits made during the transaction will be removed.
+     * @returns the change to this branch resulting in the removal of the commits, and a list of the
+     * commits that were removed.
+     */
+    abortTransaction() {
+        this.assertNotDisposed();
+        const [startCommit, commits] = this.popTransaction();
+        this.editor.exitTransaction();
+        if (commits.length === 0) {
+            return [undefined, []];
+        }
+        const inverses = [];
+        for (let i = commits.length - 1; i >= 0; i--) {
+            const inverse = this.changeFamily.rebaser.invert(commits[i], false);
+            inverses.push(tagRollbackInverse(inverse, mintRevisionTag(), commits[i].revision));
+        }
+        const change = inverses.length > 0 ? this.changeFamily.rebaser.compose(inverses) : undefined;
+        const changeEvent = {
+            type: "remove",
+            change: change === undefined ? undefined : makeAnonChange(change),
+            removedCommits: commits,
+        };
+        this.emit("beforeChange", changeEvent);
+        this.head = startCommit;
+        this.emit("afterChange", changeEvent);
+        return [change, commits];
+    }
+    /**
+     * True iff this branch is in the middle of a transaction that was begin via {@link startTransaction}
+     */
+    isTransacting() {
+        return this.transactions.size !== 0;
+    }
+    popTransaction() {
+        const { startRevision } = this.transactions.pop();
+        const commits = [];
+        const startCommit = findAncestor([this.head, commits], (c) => c.revision === startRevision);
+        assert(startCommit !== undefined, 0x593 /* Expected branch to be ahead of transaction start revision */);
+        return [startCommit, commits];
+    }
+    revertibleCommits() {
+        return this._revertibleCommits.keys();
+    }
+    /**
+     * Associate a revertible with a new commit of the same revision.
+     * This is applicable when a commit is replaced by a rebase or a local commit is sequenced.
+     */
+    updateRevertibleCommit(commit) {
+        if (this._revertibleCommits.get(commit.revision) !== undefined) {
+            this._revertibleCommits.set(commit.revision, commit);
+        }
+    }
+    makeSharedTreeRevertible(commit, kind) {
+        this._revertibleCommits.set(commit.revision, commit);
+        let discarded = false;
+        const revertible = {
+            kind,
+            origin: {
+                // This is currently always the case, but we may want to support reverting remote ops
+                isLocal: true,
+            },
+            revert: () => {
+                if (discarded) {
+                    fail("revertible has already been discarded");
+                }
+                const revertCommit = this.revert(commit.revision, kind);
+                if (revertCommit !== undefined) {
+                    revertible.discard();
+                    return RevertResult.Success;
+                }
+                return RevertResult.Failure;
+            },
+            discard: () => {
+                if (discarded) {
+                    fail("revertible has already been discarded");
+                }
+                // TODO: delete the repair data from the forest
+                this._revertibleCommits.delete(commit.revision);
+                this.revertibles.delete(revertible);
+                discarded = true;
+                this.emit("revertibleDispose", commit.revision);
+                return DiscardResult.Success;
+            },
+        };
+        this.revertibles.add(revertible);
+        return revertible;
+    }
+    revert(revision, revertibleKind) {
+        assert(!this.isTransacting(), 0x7cb /* Undo is not yet supported during transactions */);
+        const commit = this._revertibleCommits.get(revision);
+        assert(commit !== undefined, 0x7cc /* expected to find a revertible commit */);
+        let change = this.changeFamily.rebaser.invert(tagChange(commit.change, revision), false);
+        const headCommit = this.getHead();
+        // Rebase the inverted change onto any commits that occurred after the undoable commits.
+        if (revision !== headCommit.revision) {
+            const pathAfterUndoable = [];
+            const ancestor = findCommonAncestor([commit], [headCommit, pathAfterUndoable]);
+            assert(ancestor === commit, 0x677 /* The head commit should be based off the undoable commit. */);
+            change = rebaseChangeOverChanges(this.changeFamily.rebaser, change, pathAfterUndoable);
+        }
+        return this.applyChange(change, mintRevisionTag(), revertibleKind === RevertibleKind.Default || revertibleKind === RevertibleKind.Redo
+            ? RevertibleKind.Undo
+            : RevertibleKind.Redo);
+    }
+    /**
+     * Spawn a new branch that is based off of the current state of this branch.
+     * Changes made to the new branch will not be applied to this branch until the new branch is merged back in.
+     *
+     * @remarks Forks created during a transaction will be disposed when the transaction ends.
+     */
+    fork() {
+        this.assertNotDisposed();
+        const fork = new SharedTreeBranch(this.head, this.changeFamily);
+        this.emit("fork", fork);
+        return fork;
+    }
+    /**
+     * Rebase the changes that have been applied to this branch over divergent changes in the given branch.
+     * After this operation completes, this branch will be based off of `branch`.
+     *
+     * @remarks
+     * This operation can change the relative ordering between revertible commits therefore, the revertible event
+     * is not emitted during this operation.
+     *
+     * @param branch - the branch to rebase onto
+     * @param upTo - the furthest commit on `branch` over which to rebase (inclusive). Defaults to the head commit of `branch`.
+     * @returns the result of the rebase or undefined if nothing changed
+     */
+    rebaseOnto(branch, upTo = branch.getHead()) {
+        this.assertNotDisposed();
+        // Rebase this branch onto the given branch
+        const rebaseResult = this.rebaseBranch(this, branch, upTo);
+        if (rebaseResult === undefined) {
+            return undefined;
+        }
+        // The net change to this branch is provided by the `rebaseBranch` API
+        const { newSourceHead, commits } = rebaseResult;
+        const { deletedSourceCommits, targetCommits, sourceCommits } = commits;
+        // It's possible that the target branch already contained some of the commits that
+        // were on this branch. When that's the case, we adopt the commit objects from the target branch.
+        // Because of that, we need to make sure that any revertibles that were based on the old commit objects
+        // now point to the new object that were adopted from the target branch.
+        for (const targetCommit of targetCommits) {
+            this.updateRevertibleCommit(targetCommit);
+        }
+        const newCommits = targetCommits.concat(sourceCommits);
+        const changeEvent = {
+            type: "replace",
+            get change() {
+                const change = rebaseResult.sourceChange;
+                return change === undefined ? undefined : makeAnonChange(change);
+            },
+            removedCommits: deletedSourceCommits,
+            newCommits,
+        };
+        this.emit("beforeChange", changeEvent);
+        this.head = newSourceHead;
+        // update revertible commits that have been rebased
+        sourceCommits.forEach((commit) => {
+            this.updateRevertibleCommit(commit);
+        });
+        this.emit("afterChange", changeEvent);
+        return rebaseResult;
+    }
+    /**
+     * Apply all the divergent changes on the given branch to this branch.
+     *
+     * @remarks
+     * Revertible events are emitted for new local commits merged into this branch.
+     *
+     * @param branch - the branch to merge into this branch
+     * @returns the net change to this branch and the commits that were added to this branch by the merge,
+     * or undefined if nothing changed
+     */
+    merge(branch) {
+        this.assertNotDisposed();
+        branch.assertNotDisposed();
+        assert(!branch.isTransacting(), 0x597 /* Branch may not be merged while transaction is in progress */);
+        // Rebase the given branch onto this branch
+        const rebaseResult = this.rebaseBranch(branch, this);
+        if (rebaseResult === undefined) {
+            return undefined;
+        }
+        // Compute the net change to this branch
+        const sourceCommits = rebaseResult.commits.sourceCommits;
+        const change = this.changeFamily.rebaser.compose(sourceCommits);
+        const taggedChange = makeAnonChange(change);
+        const changeEvent = {
+            type: "append",
+            get change() {
+                return taggedChange;
+            },
+            newCommits: sourceCommits,
+        };
+        this.emit("beforeChange", changeEvent);
+        this.head = rebaseResult.newSourceHead;
+        this.emit("afterChange", changeEvent);
+        return [change, sourceCommits];
+    }
+    /** Rebase `branchHead` onto `onto`, but return undefined if nothing changed */
+    rebaseBranch(branch, onto, upTo = onto.getHead()) {
+        const { head } = branch;
+        if (head === upTo) {
+            return undefined;
+        }
+        const rebaseResult = rebaseBranch(this.changeFamily.rebaser, head, upTo, onto.getHead());
+        if (this.head === rebaseResult.newSourceHead) {
+            return undefined;
+        }
+        return rebaseResult;
+    }
+    /**
+     * Dispose this branch, freezing its state.
+     *
+     * @remarks
+     * Attempts to further mutate the branch will error.
+     * Any transactions in progress will be aborted.
+     * Calling dispose more than once has no effect.
+     */
+    dispose() {
+        if (this.disposed) {
+            return;
+        }
+        while (this.isTransacting()) {
+            this.abortTransaction();
+        }
+        this.revertibles.forEach((revertible) => revertible.discard());
+        this.disposed = true;
+        this.emit("dispose");
+    }
+    assertNotDisposed() {
+        assert(!this.disposed, 0x66e /* Branch is disposed */);
+    }
+}
+/**
+ * Registers an event listener that fires when the given forkable object forks.
+ * The listener will also fire when any of those forks fork, and when those forks of forks fork, and so on.
+ * @param forkable - an object that emits an event when it is forked
+ * @param onFork - the fork event listener
+ * @returns a function which when called will deregister all registrations (including transitive) created by this function.
+ * The deregister function has undefined behavior if called more than once.
+ */
+export function onForkTransitive(forkable, onFork) {
+    const offs = [];
+    offs.push(forkable.on("fork", (fork) => {
+        offs.push(onForkTransitive(fork, onFork));
+        onFork(fork);
+    }));
+    return () => offs.forEach((off) => off());
+}
+//# sourceMappingURL=branch.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"branch.js","sourceRoot":"","sources":["../../src/shared-tree-core/branch.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AACpD,OAAO,EAGN,YAAY,EAEZ,UAAU,EACV,eAAe,EACf,SAAS,EAET,YAAY,EAEZ,kBAAkB,EAClB,cAAc,EAEd,cAAc,EACd,YAAY,EACZ,aAAa,EAEb,uBAAuB,EACvB,kBAAkB,GAClB,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,YAAY,EAAiB,MAAM,WAAW,CAAC;AACxD,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAmCtD;;GAEG;AACH,MAAM,UAAU,oBAAoB,CACnC,MAA6D;IAE7D,uHAAuH;IACvH,oGAAoG;IACpG,2DAA2D;IAC3D,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;QACzE,OAAO,QAAQ,CAAC;KAChB;IAED,iGAAiG;IACjG,0FAA0F;IAC1F,EAAE;IACF,+DAA+D;IAC/D,gEAAgE;IAChE,EAAE;IACF,uEAAuE;IACvE,IACC,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;QAClC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,EAClE;QACD,OAAO,QAAQ,CAAC;KAChB;IAED,OAAO,mBAAmB,CAAC;AAC5B,CAAC;AAwCD;;GAEG;AACH,MAAM,OAAO,gBAA8D,SAAQ,YAElF;IAOA;;;;OAIG;IACH,YACS,IAA0B,EAClB,YAA4C;QAE5D,KAAK,EAAE,CAAC;QAHA,SAAI,GAAJ,IAAI,CAAsB;QAClB,iBAAY,GAAZ,YAAY,CAAgC;QAZ7D,uDAAuD;QACtC,gBAAW,GAAG,IAAI,GAAG,EAAc,CAAC;QACpC,uBAAkB,GAAG,IAAI,GAAG,EAAqC,CAAC;QAClE,iBAAY,GAAG,IAAI,gBAAgB,EAAE,CAAC;QAC/C,aAAQ,GAAG,KAAK,CAAC;QAWxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,EAAE,CACtD,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,eAAe,EAAE,CAAC,CACrC,CAAC;IACH,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,IAA0B;QACxC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAChF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACI,KAAK,CACX,MAAe,EACf,QAAqB;QAErB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC;IACnE,CAAC;IAEO,WAAW,CAClB,MAAe,EACf,QAAqB,EACrB,cAA8B;QAE9B,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE;YACrC,QAAQ;YACR,MAAM;SACN,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC;YACnC,UAAU,EAAE,CAAC,OAAO,CAAC;SACZ,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAEpB,gEAAgE;QAChE,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC;SAChF;QAED,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,OAAO;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACI,gBAAgB;QACtB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsC,CAAC;QAC5D,MAAM,qBAAqB,GAAmB,EAAE,CAAC;QACjD,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;YACzD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;YAC/C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YACxC,qBAAqB,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;YAC9D,iBAAiB,EAAE,CAAC;QACrB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB;QAGvB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;QAE9B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YACzB,OAAO,SAAS,CAAC;SACjB;QAED,gFAAgF;QAChF,uFAAuF;QACvF,MAAM,gBAAgB,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QACxF,4EAA4E;QAC5E,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAC3E,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;QAEnC,MAAM,OAAO,GAAG,UAAU,CAAC,WAAW,EAAE;YACvC,QAAQ;YACR,MAAM,EAAE,cAAc;SACtB,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,SAAS;YACjB,cAAc,EAAE,OAAO;YACvB,UAAU,EAAE,CAAC,OAAO,CAAC;SACZ,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAEpB,6DAA6D;QAC7D,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;SACxF;QAED,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACI,gBAAgB;QAItB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;QAE9B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YACzB,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;SACvB;QAED,MAAM,QAAQ,GAA4B,EAAE,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACpE,QAAQ,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,eAAe,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;SACnF;QACD,MAAM,MAAM,GACX,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAE/E,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC;YACjE,cAAc,EAAE,OAAO;SACd,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,CAAC;IACrC,CAAC;IAEO,cAAc;QACrB,MAAM,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC;QAClD,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,aAAa,CAAC,CAAC;QAC5F,MAAM,CACL,WAAW,KAAK,SAAS,EACzB,KAAK,CAAC,+DAA+D,CACrE,CAAC;QACF,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAC/B,CAAC;IAEM,iBAAiB;QACvB,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC;IACvC,CAAC;IAED;;;OAGG;IACI,sBAAsB,CAAC,MAA4B;QACzD,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE;YAC/D,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;SACrD;IACF,CAAC;IAEO,wBAAwB,CAC/B,MAA4B,EAC5B,IAAoB;QAEpB,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACrD,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,UAAU,GAAG;YAClB,IAAI;YACJ,MAAM,EAAE;gBACP,qFAAqF;gBACrF,OAAO,EAAE,IAAI;aACb;YACD,MAAM,EAAE,GAAG,EAAE;gBACZ,IAAI,SAAS,EAAE;oBACd,IAAI,CAAC,uCAAuC,CAAC,CAAC;iBAC9C;gBACD,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACxD,IAAI,YAAY,KAAK,SAAS,EAAE;oBAC/B,UAAU,CAAC,OAAO,EAAE,CAAC;oBACrB,OAAO,YAAY,CAAC,OAAO,CAAC;iBAC5B;gBACD,OAAO,YAAY,CAAC,OAAO,CAAC;YAC7B,CAAC;YACD,OAAO,EAAE,GAAG,EAAE;gBACb,IAAI,SAAS,EAAE;oBACd,IAAI,CAAC,uCAAuC,CAAC,CAAC;iBAC9C;gBACD,+CAA+C;gBAC/C,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAChD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBACpC,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAChD,OAAO,aAAa,CAAC,OAAO,CAAC;YAC9B,CAAC;SACD,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACjC,OAAO,UAAU,CAAC;IACnB,CAAC;IAEO,MAAM,CACb,QAAqB,EACrB,cAA8B;QAE9B,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAEzF,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrD,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAE/E,IAAI,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QAEzF,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAClC,wFAAwF;QACxF,IAAI,QAAQ,KAAK,UAAU,CAAC,QAAQ,EAAE;YACrC,MAAM,iBAAiB,GAA2B,EAAE,CAAC;YACrD,MAAM,QAAQ,GAAG,kBAAkB,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC,CAAC;YAC/E,MAAM,CACL,QAAQ,KAAK,MAAM,EACnB,KAAK,CAAC,8DAA8D,CACpE,CAAC;YACF,MAAM,GAAG,uBAAuB,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC;SACvF;QAED,OAAO,IAAI,CAAC,WAAW,CACtB,MAAM,EACN,eAAe,EAAE,EACjB,cAAc,KAAK,cAAc,CAAC,OAAO,IAAI,cAAc,KAAK,cAAc,CAAC,IAAI;YAClF,CAAC,CAAC,cAAc,CAAC,IAAI;YACrB,CAAC,CAAC,cAAc,CAAC,IAAI,CACtB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,IAAI;QACV,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAChE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxB,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;;;;OAWG;IACI,UAAU,CAChB,MAA0C,EAC1C,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE;QAEvB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,2CAA2C;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC3D,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,SAAS,CAAC;SACjB;QAED,sEAAsE;QACtE,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC;QAChD,MAAM,EAAE,oBAAoB,EAAE,aAAa,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC;QAEvE,kFAAkF;QAClF,iGAAiG;QACjG,uGAAuG;QACvG,wEAAwE;QACxE,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;YACzC,IAAI,CAAC,sBAAsB,CAAC,YAAY,CAAC,CAAC;SAC1C;QAED,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACvD,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,SAAS;YACf,IAAI,MAAM;gBACT,MAAM,MAAM,GAAG,YAAY,CAAC,YAAY,CAAC;gBACzC,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YAClE,CAAC;YACD,cAAc,EAAE,oBAAoB;YACpC,UAAU;SACD,CAAC;QACX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;QAE1B,mDAAmD;QACnD,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YAChC,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;;;;;;OASG;IACI,KAAK,CACX,MAA0C;QAE1C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAC3B,MAAM,CACL,CAAC,MAAM,CAAC,aAAa,EAAE,EACvB,KAAK,CAAC,+DAA+D,CACrE,CAAC;QAEF,2CAA2C;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACrD,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,SAAS,CAAC;SACjB;QAED,wCAAwC;QACxC,MAAM,aAAa,GAAG,YAAY,CAAC,OAAO,CAAC,aAAa,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;QAChE,MAAM,YAAY,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,QAAQ;YACd,IAAI,MAAM;gBACT,OAAO,YAAY,CAAC;YACrB,CAAC;YACD,UAAU,EAAE,aAAa;SAChB,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,aAAa,CAAC;QACvC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAChC,CAAC;IAED,+EAA+E;IACvE,YAAY,CACnB,MAA0C,EAC1C,IAAwC,EACxC,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE;QAErB,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC;QACxB,IAAI,IAAI,KAAK,IAAI,EAAE;YAClB,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACzF,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,CAAC,aAAa,EAAE;YAC7C,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;;;;OAOG;IACI,OAAO;QACb,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClB,OAAO;SACP;QAED,OAAO,IAAI,CAAC,aAAa,EAAE,EAAE;YAC5B,IAAI,CAAC,gBAAgB,EAAE,CAAC;SACxB;QAED,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QAE/D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtB,CAAC;IAEO,iBAAiB;QACxB,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACxD,CAAC;CACD;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC/B,QAAW,EACX,MAAyB;IAEzB,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,CAAC,IAAI,CACR,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QAC5B,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,CAAC;IACd,CAAC,CAAC,CACF,CAAC;IACF,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAC3C,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 {\n\tChangeFamily,\n\tChangeFamilyEditor,\n\tfindAncestor,\n\tGraphCommit,\n\tmintCommit,\n\tmintRevisionTag,\n\ttagChange,\n\tTaggedChange,\n\trebaseBranch,\n\tRevisionTag,\n\tfindCommonAncestor,\n\tmakeAnonChange,\n\tRevertible,\n\tRevertibleKind,\n\tRevertResult,\n\tDiscardResult,\n\tBranchRebaseResult,\n\trebaseChangeOverChanges,\n\ttagRollbackInverse,\n} from \"../core\";\nimport { EventEmitter, ISubscribable } from \"../events\";\nimport { fail } from \"../util\";\nimport { TransactionStack } from \"./transactionStack\";\n\n/**\n * Describes a change to a `SharedTreeBranch`. Various operations can mutate the head of the branch;\n * this change format describes each in terms of the \"removed commits\" (all commits which were present\n * on the branch before the operation but are no longer present after) and the \"new commits\" (all\n * commits which are present on the branch after the operation that were not present before). Each of\n * the following event types also provides a `change` which contains the net change to the branch\n * (or is undefined if there was no net change):\n * * Append - when one or more commits are appended to the head of the branch, for example via\n * a change applied by the branch's editor, or as a result of merging another branch into this one\n * * Remove - when one or more commits are removed from the head of the branch. This occurs\n * when a transaction is aborted and all commits pending in that transaction are removed.\n * * Replace - when an operation simultaneously removes and appends commits. For example, when this\n * branch is rebased and some commits are removed and replaced with rebased versions, or when a\n * transaction completes and all pending commits are replaced with a single squash commit.\n */\nexport type SharedTreeBranchChange<TChange> =\n\t| {\n\t\t\ttype: \"append\";\n\t\t\tchange: TaggedChange<TChange>;\n\t\t\tnewCommits: readonly GraphCommit<TChange>[];\n\t  }\n\t| {\n\t\t\ttype: \"remove\";\n\t\t\tchange: TaggedChange<TChange> | undefined;\n\t\t\tremovedCommits: readonly GraphCommit<TChange>[];\n\t  }\n\t| {\n\t\t\ttype: \"replace\";\n\t\t\tchange: TaggedChange<TChange> | undefined;\n\t\t\tremovedCommits: readonly GraphCommit<TChange>[];\n\t\t\tnewCommits: readonly GraphCommit<TChange>[];\n\t  };\n\n/**\n * Returns the operation that caused the given {@link SharedTreeBranchChange}.\n */\nexport function getChangeReplaceType(\n\tchange: SharedTreeBranchChange<unknown> & { type: \"replace\" },\n): \"transactionCommit\" | \"rebase\" {\n\t// The \"replace\" variant of the change event is emitted by two operations: committing a transaction and doing a rebase.\n\t// Committing a transaction will always remove one or more commits (the commits that were squashed),\n\t// and will add exactly one new commit (the squash commit).\n\tif (change.removedCommits.length === 0 || change.newCommits.length !== 1) {\n\t\treturn \"rebase\";\n\t}\n\n\t// There is only one case in which a rebase both removes commits and adds exactly one new commit.\n\t// This occurs when there is exactly one divergent, but equivalent, commit on each branch:\n\t//\n\t// A ─ B (branch X)\t  -- rebase Y onto X -->   A ─ B (branch X)\n\t// └─ B' (branch Y)                                └─ (branch Y)\n\t//\n\t// B' is removed and replaced by B because both have the same revision.\n\tif (\n\t\tchange.removedCommits.length === 1 &&\n\t\tchange.removedCommits[0].revision === change.newCommits[0].revision\n\t) {\n\t\treturn \"rebase\";\n\t}\n\n\treturn \"transactionCommit\";\n}\n\n/**\n * The events emitted by a `SharedTreeBranch`\n */\nexport interface SharedTreeBranchEvents<TEditor extends ChangeFamilyEditor, TChange> {\n\t/**\n\t * Fired just before the head of this branch changes.\n\t * @param change - the change to this branch's state and commits\n\t */\n\tbeforeChange(change: SharedTreeBranchChange<TChange>): void;\n\n\t/**\n\t * Fired just after the head of this branch changes.\n\t * @param change - the change to this branch's state and commits\n\t */\n\tafterChange(change: SharedTreeBranchChange<TChange>): void;\n\n\t/**\n\t * Fired when a revertible change is made to this branch.\n\t */\n\trevertible(type: Revertible): void;\n\n\t/**\n\t * Fired when a revertible made on this branch is disposed.\n\t */\n\trevertibleDispose(revision: RevisionTag): void;\n\n\t/**\n\t * Fired when this branch forks\n\t * @param fork - the new branch that forked off of this branch\n\t */\n\tfork(fork: SharedTreeBranch<TEditor, TChange>): void;\n\n\t/**\n\t * Fired after this branch is disposed\n\t */\n\tdispose(): void;\n}\n\n/**\n * A branch of changes that can be applied to a SharedTree.\n */\nexport class SharedTreeBranch<TEditor extends ChangeFamilyEditor, TChange> extends EventEmitter<\n\tSharedTreeBranchEvents<TEditor, TChange>\n> {\n\tpublic readonly editor: TEditor;\n\t// set of revertibles maintained for automatic disposal\n\tprivate readonly revertibles = new Set<Revertible>();\n\tprivate readonly _revertibleCommits = new Map<RevisionTag, GraphCommit<TChange>>();\n\tprivate readonly transactions = new TransactionStack();\n\tprivate disposed = false;\n\t/**\n\t * Construct a new branch.\n\t * @param head - the head of the branch\n\t * @param changeFamily - determines the set of changes that this branch can commit\n\t */\n\tpublic constructor(\n\t\tprivate head: GraphCommit<TChange>,\n\t\tpublic readonly changeFamily: ChangeFamily<TEditor, TChange>,\n\t) {\n\t\tsuper();\n\t\tthis.editor = this.changeFamily.buildEditor((change) =>\n\t\t\tthis.apply(change, mintRevisionTag()),\n\t\t);\n\t}\n\n\t/**\n\t * Sets the head of this branch. Emits no change events.\n\t */\n\tpublic setHead(head: GraphCommit<TChange>): void {\n\t\tthis.assertNotDisposed();\n\t\tassert(!this.isTransacting(), 0x685 /* Cannot set head during a transaction */);\n\t\tthis.head = head;\n\t}\n\n\t/**\n\t * Apply a change to this branch.\n\t * @param change - the change to apply\n\t * @param revision - the revision of the new head commit of the branch that contains `change`\n\t * @returns the change that was applied and the new head commit of the branch\n\t */\n\tpublic apply(\n\t\tchange: TChange,\n\t\trevision: RevisionTag,\n\t): [change: TChange, newCommit: GraphCommit<TChange>] {\n\t\treturn this.applyChange(change, revision, RevertibleKind.Default);\n\t}\n\n\tprivate applyChange(\n\t\tchange: TChange,\n\t\trevision: RevisionTag,\n\t\trevertibleKind: RevertibleKind,\n\t): [change: TChange, newCommit: GraphCommit<TChange>] {\n\t\tthis.assertNotDisposed();\n\n\t\tconst newHead = mintCommit(this.head, {\n\t\t\trevision,\n\t\t\tchange,\n\t\t});\n\n\t\tconst changeEvent = {\n\t\t\ttype: \"append\",\n\t\t\tchange: tagChange(change, revision),\n\t\t\tnewCommits: [newHead],\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = newHead;\n\n\t\t// If this is not part of a transaction, emit a revertible event\n\t\tif (!this.isTransacting()) {\n\t\t\tthis.emit(\"revertible\", this.makeSharedTreeRevertible(newHead, revertibleKind));\n\t\t}\n\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [change, newHead];\n\t}\n\n\t/**\n\t * @returns the commit at the head of this branch.\n\t */\n\tpublic getHead(): GraphCommit<TChange> {\n\t\treturn this.head;\n\t}\n\n\t/**\n\t * Begin a transaction on this branch. If the transaction is committed via {@link commitTransaction},\n\t * all commits made since this call will be squashed into a single head commit.\n\t * @param repairStore - the repair store associated with this transaction\n\t */\n\tpublic startTransaction(): void {\n\t\tthis.assertNotDisposed();\n\t\tconst forks = new Set<SharedTreeBranch<TEditor, TChange>>();\n\t\tconst onDisposeUnSubscribes: (() => void)[] = [];\n\t\tconst onForkUnSubscribe = onForkTransitive(this, (fork) => {\n\t\t\tforks.add(fork);\n\t\t\tonDisposeUnSubscribes.push(fork.on(\"dispose\", () => forks.delete(fork)));\n\t\t});\n\t\tthis.transactions.push(this.head.revision, () => {\n\t\t\tforks.forEach((fork) => fork.dispose());\n\t\t\tonDisposeUnSubscribes.forEach((unsubscribe) => unsubscribe());\n\t\t\tonForkUnSubscribe();\n\t\t});\n\t\tthis.editor.enterTransaction();\n\t}\n\n\t/**\n\t * Commit the current transaction. There must be a transaction in progress that was begun via {@link startTransaction}.\n\t * If there are commits in the current transaction, they will be squashed into a new single head commit.\n\t * @returns the commits that were squashed and the new squash commit if a squash occurred, otherwise `undefined`.\n\t * @remarks If the transaction had no changes applied during its lifetime, then no squash occurs (i.e. this method is a no-op).\n\t * Even if the transaction contained only one change, it will still be replaced with an (equivalent) squash change.\n\t */\n\tpublic commitTransaction():\n\t\t| [squashedCommits: GraphCommit<TChange>[], newCommit: GraphCommit<TChange>]\n\t\t| undefined {\n\t\tthis.assertNotDisposed();\n\t\tconst [startCommit, commits] = this.popTransaction();\n\t\tthis.editor.exitTransaction();\n\n\t\tif (commits.length === 0) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// Anonymize the commits from this transaction by stripping their revision tags.\n\t\t// Otherwise, the change rebaser will record their tags and those tags no longer exist.\n\t\tconst anonymousCommits = commits.map(({ change }) => ({ change, revision: undefined }));\n\t\t// Squash the changes and make the squash commit the new head of this branch\n\t\tconst squashedChange = this.changeFamily.rebaser.compose(anonymousCommits);\n\t\tconst revision = mintRevisionTag();\n\n\t\tconst newHead = mintCommit(startCommit, {\n\t\t\trevision,\n\t\t\tchange: squashedChange,\n\t\t});\n\n\t\tconst changeEvent = {\n\t\t\ttype: \"replace\",\n\t\t\tchange: undefined,\n\t\t\tremovedCommits: commits,\n\t\t\tnewCommits: [newHead],\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = newHead;\n\n\t\t// If this transaction is not nested, emit a revertible event\n\t\tif (!this.isTransacting()) {\n\t\t\tthis.emit(\"revertible\", this.makeSharedTreeRevertible(newHead, RevertibleKind.Default));\n\t\t}\n\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [commits, newHead];\n\t}\n\n\t/**\n\t * Cancel the current transaction. There must be a transaction in progress that was begun via\n\t * {@link startTransaction}. All commits made during the transaction will be removed.\n\t * @returns the change to this branch resulting in the removal of the commits, and a list of the\n\t * commits that were removed.\n\t */\n\tpublic abortTransaction(): [\n\t\tchange: TChange | undefined,\n\t\tabortedCommits: GraphCommit<TChange>[],\n\t] {\n\t\tthis.assertNotDisposed();\n\t\tconst [startCommit, commits] = this.popTransaction();\n\t\tthis.editor.exitTransaction();\n\n\t\tif (commits.length === 0) {\n\t\t\treturn [undefined, []];\n\t\t}\n\n\t\tconst inverses: TaggedChange<TChange>[] = [];\n\t\tfor (let i = commits.length - 1; i >= 0; i--) {\n\t\t\tconst inverse = this.changeFamily.rebaser.invert(commits[i], false);\n\t\t\tinverses.push(tagRollbackInverse(inverse, mintRevisionTag(), commits[i].revision));\n\t\t}\n\t\tconst change =\n\t\t\tinverses.length > 0 ? this.changeFamily.rebaser.compose(inverses) : undefined;\n\n\t\tconst changeEvent = {\n\t\t\ttype: \"remove\",\n\t\t\tchange: change === undefined ? undefined : makeAnonChange(change),\n\t\t\tremovedCommits: commits,\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = startCommit;\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [change, commits];\n\t}\n\n\t/**\n\t * True iff this branch is in the middle of a transaction that was begin via {@link startTransaction}\n\t */\n\tpublic isTransacting(): boolean {\n\t\treturn this.transactions.size !== 0;\n\t}\n\n\tprivate popTransaction(): [GraphCommit<TChange>, GraphCommit<TChange>[]] {\n\t\tconst { startRevision } = this.transactions.pop();\n\t\tconst commits: GraphCommit<TChange>[] = [];\n\t\tconst startCommit = findAncestor([this.head, commits], (c) => c.revision === startRevision);\n\t\tassert(\n\t\t\tstartCommit !== undefined,\n\t\t\t0x593 /* Expected branch to be ahead of transaction start revision */,\n\t\t);\n\t\treturn [startCommit, commits];\n\t}\n\n\tpublic revertibleCommits(): IterableIterator<RevisionTag> {\n\t\treturn this._revertibleCommits.keys();\n\t}\n\n\t/**\n\t * Associate a revertible with a new commit of the same revision.\n\t * This is applicable when a commit is replaced by a rebase or a local commit is sequenced.\n\t */\n\tpublic updateRevertibleCommit(commit: GraphCommit<TChange>) {\n\t\tif (this._revertibleCommits.get(commit.revision) !== undefined) {\n\t\t\tthis._revertibleCommits.set(commit.revision, commit);\n\t\t}\n\t}\n\n\tprivate makeSharedTreeRevertible(\n\t\tcommit: GraphCommit<TChange>,\n\t\tkind: RevertibleKind,\n\t): Revertible {\n\t\tthis._revertibleCommits.set(commit.revision, commit);\n\t\tlet discarded = false;\n\t\tconst revertible = {\n\t\t\tkind,\n\t\t\torigin: {\n\t\t\t\t// This is currently always the case, but we may want to support reverting remote ops\n\t\t\t\tisLocal: true,\n\t\t\t},\n\t\t\trevert: () => {\n\t\t\t\tif (discarded) {\n\t\t\t\t\tfail(\"revertible has already been discarded\");\n\t\t\t\t}\n\t\t\t\tconst revertCommit = this.revert(commit.revision, kind);\n\t\t\t\tif (revertCommit !== undefined) {\n\t\t\t\t\trevertible.discard();\n\t\t\t\t\treturn RevertResult.Success;\n\t\t\t\t}\n\t\t\t\treturn RevertResult.Failure;\n\t\t\t},\n\t\t\tdiscard: () => {\n\t\t\t\tif (discarded) {\n\t\t\t\t\tfail(\"revertible has already been discarded\");\n\t\t\t\t}\n\t\t\t\t// TODO: delete the repair data from the forest\n\t\t\t\tthis._revertibleCommits.delete(commit.revision);\n\t\t\t\tthis.revertibles.delete(revertible);\n\t\t\t\tdiscarded = true;\n\t\t\t\tthis.emit(\"revertibleDispose\", commit.revision);\n\t\t\t\treturn DiscardResult.Success;\n\t\t\t},\n\t\t};\n\t\tthis.revertibles.add(revertible);\n\t\treturn revertible;\n\t}\n\n\tprivate revert(\n\t\trevision: RevisionTag,\n\t\trevertibleKind: RevertibleKind,\n\t): [change: TChange, newCommit: GraphCommit<TChange>] | undefined {\n\t\tassert(!this.isTransacting(), 0x7cb /* Undo is not yet supported during transactions */);\n\n\t\tconst commit = this._revertibleCommits.get(revision);\n\t\tassert(commit !== undefined, 0x7cc /* expected to find a revertible commit */);\n\n\t\tlet change = this.changeFamily.rebaser.invert(tagChange(commit.change, revision), false);\n\n\t\tconst headCommit = this.getHead();\n\t\t// Rebase the inverted change onto any commits that occurred after the undoable commits.\n\t\tif (revision !== headCommit.revision) {\n\t\t\tconst pathAfterUndoable: GraphCommit<TChange>[] = [];\n\t\t\tconst ancestor = findCommonAncestor([commit], [headCommit, pathAfterUndoable]);\n\t\t\tassert(\n\t\t\t\tancestor === commit,\n\t\t\t\t0x677 /* The head commit should be based off the undoable commit. */,\n\t\t\t);\n\t\t\tchange = rebaseChangeOverChanges(this.changeFamily.rebaser, change, pathAfterUndoable);\n\t\t}\n\n\t\treturn this.applyChange(\n\t\t\tchange,\n\t\t\tmintRevisionTag(),\n\t\t\trevertibleKind === RevertibleKind.Default || revertibleKind === RevertibleKind.Redo\n\t\t\t\t? RevertibleKind.Undo\n\t\t\t\t: RevertibleKind.Redo,\n\t\t);\n\t}\n\n\t/**\n\t * Spawn a new branch that is based off of the current state of this branch.\n\t * Changes made to the new branch will not be applied to this branch until the new branch is merged back in.\n\t *\n\t * @remarks Forks created during a transaction will be disposed when the transaction ends.\n\t */\n\tpublic fork(): SharedTreeBranch<TEditor, TChange> {\n\t\tthis.assertNotDisposed();\n\t\tconst fork = new SharedTreeBranch(this.head, this.changeFamily);\n\t\tthis.emit(\"fork\", fork);\n\t\treturn fork;\n\t}\n\n\t/**\n\t * Rebase the changes that have been applied to this branch over divergent changes in the given branch.\n\t * After this operation completes, this branch will be based off of `branch`.\n\t *\n\t * @remarks\n\t * This operation can change the relative ordering between revertible commits therefore, the revertible event\n\t * is not emitted during this operation.\n\t *\n\t * @param branch - the branch to rebase onto\n\t * @param upTo - the furthest commit on `branch` over which to rebase (inclusive). Defaults to the head commit of `branch`.\n\t * @returns the result of the rebase or undefined if nothing changed\n\t */\n\tpublic rebaseOnto(\n\t\tbranch: SharedTreeBranch<TEditor, TChange>,\n\t\tupTo = branch.getHead(),\n\t): BranchRebaseResult<TChange> | undefined {\n\t\tthis.assertNotDisposed();\n\n\t\t// Rebase this branch onto the given branch\n\t\tconst rebaseResult = this.rebaseBranch(this, branch, upTo);\n\t\tif (rebaseResult === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// The net change to this branch is provided by the `rebaseBranch` API\n\t\tconst { newSourceHead, commits } = rebaseResult;\n\t\tconst { deletedSourceCommits, targetCommits, sourceCommits } = commits;\n\n\t\t// It's possible that the target branch already contained some of the commits that\n\t\t// were on this branch. When that's the case, we adopt the commit objects from the target branch.\n\t\t// Because of that, we need to make sure that any revertibles that were based on the old commit objects\n\t\t// now point to the new object that were adopted from the target branch.\n\t\tfor (const targetCommit of targetCommits) {\n\t\t\tthis.updateRevertibleCommit(targetCommit);\n\t\t}\n\n\t\tconst newCommits = targetCommits.concat(sourceCommits);\n\t\tconst changeEvent = {\n\t\t\ttype: \"replace\",\n\t\t\tget change() {\n\t\t\t\tconst change = rebaseResult.sourceChange;\n\t\t\t\treturn change === undefined ? undefined : makeAnonChange(change);\n\t\t\t},\n\t\t\tremovedCommits: deletedSourceCommits,\n\t\t\tnewCommits,\n\t\t} as const;\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = newSourceHead;\n\n\t\t// update revertible commits that have been rebased\n\t\tsourceCommits.forEach((commit) => {\n\t\t\tthis.updateRevertibleCommit(commit);\n\t\t});\n\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn rebaseResult;\n\t}\n\n\t/**\n\t * Apply all the divergent changes on the given branch to this branch.\n\t *\n\t * @remarks\n\t * Revertible events are emitted for new local commits merged into this branch.\n\t *\n\t * @param branch - the branch to merge into this branch\n\t * @returns the net change to this branch and the commits that were added to this branch by the merge,\n\t * or undefined if nothing changed\n\t */\n\tpublic merge(\n\t\tbranch: SharedTreeBranch<TEditor, TChange>,\n\t): [change: TChange, newCommits: GraphCommit<TChange>[]] | undefined {\n\t\tthis.assertNotDisposed();\n\t\tbranch.assertNotDisposed();\n\t\tassert(\n\t\t\t!branch.isTransacting(),\n\t\t\t0x597 /* Branch may not be merged while transaction is in progress */,\n\t\t);\n\n\t\t// Rebase the given branch onto this branch\n\t\tconst rebaseResult = this.rebaseBranch(branch, this);\n\t\tif (rebaseResult === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// Compute the net change to this branch\n\t\tconst sourceCommits = rebaseResult.commits.sourceCommits;\n\t\tconst change = this.changeFamily.rebaser.compose(sourceCommits);\n\t\tconst taggedChange = makeAnonChange(change);\n\t\tconst changeEvent = {\n\t\t\ttype: \"append\",\n\t\t\tget change(): TaggedChange<TChange> {\n\t\t\t\treturn taggedChange;\n\t\t\t},\n\t\t\tnewCommits: sourceCommits,\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = rebaseResult.newSourceHead;\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [change, sourceCommits];\n\t}\n\n\t/** Rebase `branchHead` onto `onto`, but return undefined if nothing changed */\n\tprivate rebaseBranch(\n\t\tbranch: SharedTreeBranch<TEditor, TChange>,\n\t\tonto: SharedTreeBranch<TEditor, TChange>,\n\t\tupTo = onto.getHead(),\n\t) {\n\t\tconst { head } = branch;\n\t\tif (head === upTo) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst rebaseResult = rebaseBranch(this.changeFamily.rebaser, head, upTo, onto.getHead());\n\t\tif (this.head === rebaseResult.newSourceHead) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn rebaseResult;\n\t}\n\n\t/**\n\t * Dispose this branch, freezing its state.\n\t *\n\t * @remarks\n\t * Attempts to further mutate the branch will error.\n\t * Any transactions in progress will be aborted.\n\t * Calling dispose more than once has no effect.\n\t */\n\tpublic dispose(): void {\n\t\tif (this.disposed) {\n\t\t\treturn;\n\t\t}\n\n\t\twhile (this.isTransacting()) {\n\t\t\tthis.abortTransaction();\n\t\t}\n\n\t\tthis.revertibles.forEach((revertible) => revertible.discard());\n\n\t\tthis.disposed = true;\n\t\tthis.emit(\"dispose\");\n\t}\n\n\tprivate assertNotDisposed(): void {\n\t\tassert(!this.disposed, 0x66e /* Branch is disposed */);\n\t}\n}\n\n/**\n * Registers an event listener that fires when the given forkable object forks.\n * The listener will also fire when any of those forks fork, and when those forks of forks fork, and so on.\n * @param forkable - an object that emits an event when it is forked\n * @param onFork - the fork event listener\n * @returns a function which when called will deregister all registrations (including transitive) created by this function.\n * The deregister function has undefined behavior if called more than once.\n */\nexport function onForkTransitive<T extends ISubscribable<{ fork: (t: T) => void }>>(\n\tforkable: T,\n\tonFork: (fork: T) => void,\n): () => void {\n\tconst offs: (() => void)[] = [];\n\toffs.push(\n\t\tforkable.on(\"fork\", (fork) => {\n\t\t\toffs.push(onForkTransitive(fork, onFork));\n\t\t\tonFork(fork);\n\t\t}),\n\t);\n\treturn () => offs.forEach((off) => off());\n}\n"]}

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

@@ -0,0 +1,126 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { RecursiveReadonly } from "../util";
+import { ChangeFamily, ChangeFamilyEditor, GraphCommit, RevisionTag, SessionId } from "../core";
+import { SharedTreeBranch } from "./branch";
+import { Commit, SeqNumber, SequencedCommit, SummarySessionBranch } from "./editManagerFormat";
+export declare const minimumPossibleSequenceNumber: SeqNumber;
+/**
+ * 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
+ */
+export declare class EditManager<TEditor extends ChangeFamilyEditor, TChangeset, TChangeFamily extends ChangeFamily<TEditor, TChangeset>> {
+    readonly changeFamily: TChangeFamily;
+    readonly localSessionId: SessionId;
+    /** The "trunk" branch. The trunk represents the list of received sequenced changes. */
+    private readonly trunk;
+    /**
+     * Records extra data associated with commits in the {@link trunk}.
+     * This does not include an entry for the {@link trunkBase}.
+     */
+    private readonly trunkMetadata;
+    /**
+     * 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.
+     */
+    private readonly sequenceMap;
+    /**
+     * 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.
+     */
+    private readonly peerLocalBranches;
+    /**
+     * This branch holds the changes made by this client which have not yet been confirmed as sequenced changes.
+     */
+    readonly localBranch: SharedTreeBranch<TEditor, TChangeset>;
+    /**
+     * 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.
+     */
+    private readonly trunkBranches;
+    /**
+     * 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.
+     */
+    private minimumSequenceNumber;
+    /**
+     * The sequence ID corresponding to the oldest revertible commit owned by the local branch. This is used
+     * to prevent the trunk from trimming this commit or commits after it as they're needed for undo.
+     */
+    private _oldestRevertibleSequenceId?;
+    /**
+     * A special commit that is a "base" (tail) of the trunk, though not part of the trunk itself.
+     * This makes it possible to model the trunk in the same way as any other branch (it branches off of a base commit)
+     * which allows it to use branching APIs to interact with the other branches.
+     * Each time trunk eviction occurs, the most recent evicted commit becomes the new `trunkBase`.
+     */
+    private trunkBase;
+    /**
+     * @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: TChangeFamily, localSessionId: SessionId);
+    /**
+     * 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.
+     */
+    private registerBranch;
+    /**
+     * 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
+     */
+    private getOldestRevertibleSequenceId;
+    private onRevertibleDisposed;
+    /**
+     * 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: SeqNumber): void;
+    /**
+     * 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
+     */
+    private trimTrunk;
+    isEmpty(): boolean;
+    getSummaryData(): SummaryData<TChangeset>;
+    loadSummaryData(data: SummaryData<TChangeset>): void;
+    getTrunkChanges(): readonly RecursiveReadonly<TChangeset>[];
+    getTrunkHead(): GraphCommit<TChangeset>;
+    getLocalChanges(): readonly RecursiveReadonly<TChangeset>[];
+    /**
+     * @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(): number;
+    addSequencedChange(newCommit: Commit<TChangeset>, sequenceNumber: SeqNumber, referenceSequenceNumber: SeqNumber): void;
+    findLocalCommit(revision: RevisionTag): [commit: GraphCommit<TChangeset>, commitsAfter: GraphCommit<TChangeset>[]];
+    private pushToTrunk;
+    /**
+     * Finds the most recent trunk commit that was sequenced at or before the given point.
+     * @param searchBy - the sequence number or the sequence id to search for
+     * @remarks Fails if there is no eligible commit.
+     * @returns the closest commit and its sequence id
+     */
+    private getClosestTrunkCommit;
+    private getBatch;
+}
+/**
+ * The in-memory data that summaries contain
+ */
+export interface SummaryData<TChangeset> {
+    readonly trunk: readonly SequencedCommit<TChangeset>[];
+    readonly branches: ReadonlyMap<SessionId, SummarySessionBranch<TChangeset>>;
+}
+//# sourceMappingURL=editManager.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"editManager.d.ts","sourceRoot":"","sources":["../../src/shared-tree-core/editManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAkD,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAC5F,OAAO,EAEN,YAAY,EACZ,kBAAkB,EAGlB,WAAW,EAGX,WAAW,EACX,SAAS,EACT,MAAM,SAAS,CAAC;AACjB,OAAO,EAA0C,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACpF,OAAO,EACN,MAAM,EACN,SAAS,EAKT,eAAe,EACf,oBAAoB,EAGpB,MAAM,qBAAqB,CAAC;AAE7B,eAAO,MAAM,6BAA6B,EAAE,SAA0C,CAAC;AAKvF;;;GAGG;AAEH,qBAAa,WAAW,CACvB,OAAO,SAAS,kBAAkB,EAClC,UAAU,EACV,aAAa,SAAS,YAAY,CAAC,OAAO,EAAE,UAAU,CAAC;aAwEtC,YAAY,EAAE,aAAa;aAE3B,cAAc,EAAE,SAAS;IAxE1C,uFAAuF;IACvF,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwC;IAE9D;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAG1B;IACJ;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAG1B;IAEF;;;;OAIG;IAEH,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CACvB;IAEX;;OAEG;IACH,SAAgB,WAAW,EAAE,gBAAgB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAEnE;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAGK;IAEnC;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB,CAAiC;IAE9D;;;OAGG;IACH,OAAO,CAAC,2BAA2B,CAAC,CAAa;IAEjD;;;;;OAKG;IACH,OAAO,CAAC,SAAS,CAA0B;IAE3C;;;OAGG;gBAEc,YAAY,EAAE,aAAa,EAE3B,cAAc,EAAE,SAAS;IAkB1C;;;OAGG;IACH,OAAO,CAAC,cAAc;IA+CtB;;;;;OAKG;IACH,OAAO,CAAC,6BAA6B;IAmBrC,OAAO,CAAC,oBAAoB;IAe5B;;;;;OAKG;IACI,4BAA4B,CAAC,qBAAqB,EAAE,SAAS,GAAG,IAAI;IAc3E;;;;OAIG;IACH,OAAO,CAAC,SAAS;IAoGV,OAAO,IAAI,OAAO;IASlB,cAAc,IAAI,WAAW,CAAC,UAAU,CAAC;IAwDzC,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,UAAU,CAAC,GAAG,IAAI;IA6CpD,eAAe,IAAI,SAAS,iBAAiB,CAAC,UAAU,CAAC,EAAE;IAI3D,YAAY,IAAI,WAAW,CAAC,UAAU,CAAC;IAIvC,eAAe,IAAI,SAAS,iBAAiB,CAAC,UAAU,CAAC,EAAE;IAMlE;;;;;OAKG;IACI,sBAAsB,IAAI,MAAM;IAahC,kBAAkB,CACxB,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC,EAC7B,cAAc,EAAE,SAAS,EACzB,uBAAuB,EAAE,SAAS,GAChC,IAAI;IAuEA,eAAe,CACrB,QAAQ,EAAE,WAAW,GACnB,CAAC,MAAM,EAAE,WAAW,CAAC,UAAU,CAAC,EAAE,YAAY,EAAE,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;IAU7E,OAAO,CAAC,WAAW;IASnB;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAqB7B,OAAO,CAAC,QAAQ;CAUhB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,UAAU;IACtC,QAAQ,CAAC,KAAK,EAAE,SAAS,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC;IACvD,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,SAAS,EAAE,oBAAoB,CAAC,UAAU,CAAC,CAAC,CAAC;CAC5E"}