@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/core/rebase/verifyChangeRebaser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"verifyChangeRebaser.d.ts","sourceRoot":"","sources":["../../../src/core/rebase/verifyChangeRebaser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAkB,MAAM,iBAAiB,CAAC;AAGhE,MAAM,MAAM,OAAO,CAAC,KAAK,IAAI,SAAS,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;AAEjE,MAAM,WAAW,SAAS,CAAC,KAAK;IAC/B,IAAI,EAAE,WAAW,CAAC;IAClB,IAAI,EAAE,KAAK,CAAC;CACZ;AAED,MAAM,WAAW,SAAS,CAAC,KAAK;IAC/B,IAAI,EAAE,OAAO,CAAC;IACd,IAAI,EAAE,KAAK,CAAC;IACZ,KAAK,EAAE,OAAO,CAAC;CACf;AAED,MAAM,WAAW,UAAU,CAAC,OAAO;IAClC;;;OAGG;IACH,oBAAoB,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAC7D;;;OAGG;IACH,wBAAwB,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IACjE;;;OAGG;IACH,yBAAyB,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAClE;;;OAGG;IACH,0BAA0B,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAC1D;;;OAGG;IACH,4BAA4B,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC;IAC5D;;;OAGG;IACH,wBAAwB,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;IAC7C;;;OAGG;IACH,sBAAsB,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;IAC3C;;;OAGG;IACH,qBAAqB,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;IAC1C;;;OAGG;IACH,kBAAkB,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;IACvC;;;OAGG;IACH,mBAAmB,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;CACxC;AAED,eAAO,MAAM,SAAS,EAAE,UAAU,CAAC,OAAO,CAWzC,CAAC;AAEF;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,EAC1C,OAAO,EAAE,aAAa,CAAC,OAAO,CAAC,EAC/B,OAAO,EAAE,WAAW,CAAC,OAAO,CAAC,EAC7B,YAAY,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,KAAK,OAAO,GAC/C,UAAU,CAAC,OAAO,CAAC,CA+RrB"}

package/dist/core/rebase/verifyChangeRebaser.js

@@ -0,0 +1,291 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.verifyChangeRebaser = exports.noFailure = void 0;
+const changeRebaser_1 = require("./changeRebaser");
+const utils_1 = require("./utils");
+exports.noFailure = {
+    rebaseLeftDistributivity: [],
+    rebaseRightDistributivity: [],
+    composeAssociativity: [],
+    rebaseOverDoUndoPairIsNoOp: [],
+    rebaseOverUndoRedoPairIsNoOp: [],
+    composeWithInverseIsNoOp: [],
+    composeWithEmptyIsNoOp: [],
+    rebaseOverEmptyIsNoOp: [],
+    rebaseEmptyIsEmpty: [],
+    emptyInverseIsEmpty: [],
+};
+/**
+ * Verifies the axioms of `ChangeRebaser` are met by the given `rebaser`.
+ * @param rebaser - The rebaser to test.
+ * @param changes - The set of changes to use for testing the `rebaser`.
+ * @param isEquivalent - Used to compare whether two changes are equivalent for the purposes of this axioms.
+ */
+function verifyChangeRebaser(rebaser, changes, isEquivalent) {
+    const metadata = (0, utils_1.revisionMetadataSourceFromInfo)([]);
+    const rebase = (change, over) => rebaser.rebase(change, (0, changeRebaser_1.makeAnonChange)(over), metadata);
+    const compose = (changeToCompose) => rebaser.compose(changeToCompose.map(changeRebaser_1.makeAnonChange));
+    // TODO: test with isRollback = true
+    const invert = (change) => rebaser.invert((0, changeRebaser_1.makeAnonChange)(change), false);
+    const output = {
+        rebaseLeftDistributivity: [],
+        rebaseRightDistributivity: [],
+        composeAssociativity: [],
+        rebaseOverDoUndoPairIsNoOp: [],
+        rebaseOverUndoRedoPairIsNoOp: [],
+        composeWithInverseIsNoOp: [],
+        composeWithEmptyIsNoOp: [],
+        rebaseOverEmptyIsNoOp: [],
+        rebaseEmptyIsEmpty: [],
+        emptyInverseIsEmpty: [],
+    };
+    for (const changeA of changes) {
+        const requirement1 = isComposeWithInverseEqualsEmpty(changeA);
+        if (requirement1 !== true) {
+            output.composeWithInverseIsNoOp.push(requirement1);
+        }
+        const requirement2 = isComposeWithEmptyNoOp(changeA);
+        if (requirement2 !== true) {
+            output.composeWithEmptyIsNoOp.push(requirement2);
+        }
+        const requirement3 = isRebaseOverEmptyNoOp(changeA);
+        if (requirement3 !== true) {
+            output.rebaseOverEmptyIsNoOp.push(requirement3);
+        }
+        const requirement4 = isRebaseEmptyEmpty(changeA);
+        if (requirement4 !== true) {
+            output.rebaseEmptyIsEmpty.push(requirement4);
+        }
+        const requirement5 = isEmptyInverseEmpty(changeA);
+        if (requirement5 !== true) {
+            output.emptyInverseIsEmpty.push(requirement5);
+        }
+        for (const changeB of changes) {
+            const requirement6 = isRebaseOverDoUndoPairNoOp(changeA, changeB);
+            if (requirement6 !== true) {
+                output.rebaseOverDoUndoPairIsNoOp.push(requirement6);
+            }
+            const requirement7 = isRebaseOverUndoRedoPairNoOp(changeA, changeB);
+            if (requirement7 !== true) {
+                output.rebaseOverUndoRedoPairIsNoOp.push(requirement7);
+            }
+            for (const changeC of changes) {
+                const requirement8 = isRebaseLeftDistributive(changeA, changeB, changeC);
+                if (requirement8 !== true) {
+                    output.rebaseLeftDistributivity.push(requirement8);
+                }
+                const requirement9 = isComposeAssociative(changeA, changeB, changeC);
+                if (requirement9 !== true) {
+                    output.composeAssociativity.push(requirement9);
+                }
+                const requirement10 = isRebaseRightDistributive(changeA, changeB, changeC);
+                if (requirement10 !== true) {
+                    output.rebaseRightDistributivity.push(requirement10);
+                }
+            }
+        }
+    }
+    return output;
+    // Requirement testing the rebasing of composed changes and rebased changes.
+    function isRebaseLeftDistributive(changeA, changeB, changeC) {
+        try {
+            const rebaseChangeset1 = rebase(changeA, compose([changeB, changeC]));
+            const rebaseChangeset2 = rebase(rebase(changeA, changeB), changeC);
+            const equivalent = isEquivalent(rebaseChangeset1, rebaseChangeset2);
+            if (equivalent) {
+                return true;
+            }
+            return {
+                type: "Violation",
+                case: [changeA, changeB, changeC],
+            };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: [changeA, changeB, changeC],
+                error,
+            };
+        }
+    }
+    // Requirement checking different ordering of composed changes
+    function isComposeAssociative(changeA, changeB, changeC) {
+        try {
+            const changeset1 = compose([changeA, compose([changeB, changeC])]);
+            const changeset2 = compose([compose([changeA, changeB]), changeC]);
+            const changeset3 = compose([changeA, changeB, changeC]);
+            const equivalent = isEquivalent(changeset1, changeset2) && isEquivalent(changeset1, changeset3);
+            if (equivalent) {
+                return true;
+            }
+            return {
+                type: "Violation",
+                case: [changeA, changeB, changeC],
+            };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: [changeA, changeB, changeC],
+                error,
+            };
+        }
+    }
+    function isRebaseRightDistributive(changeA, changeB, changeC) {
+        try {
+            const changeset1 = rebase(compose([changeA, changeB]), changeC);
+            const changeset2 = compose([
+                rebase(changeA, changeC),
+                rebase(changeB, compose([invert(changeA), changeC, rebase(changeA, changeC)])),
+            ]);
+            const equivalent = isEquivalent(changeset1, changeset2);
+            if (equivalent) {
+                return true;
+            }
+            return {
+                type: "Violation",
+                case: [changeA, changeB, changeC],
+            };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: [changeA, changeB, changeC],
+                error,
+            };
+        }
+    }
+    // requirement for do-undo pair
+    function isRebaseOverDoUndoPairNoOp(changeA, changeB) {
+        try {
+            const inv = invert(changeB);
+            const r1 = rebase(changeA, changeB);
+            const r2 = rebase(r1, inv);
+            const equivalent = isEquivalent(r2, changeA);
+            if (equivalent) {
+                return true;
+            }
+            return {
+                type: "Violation",
+                case: [changeA, changeB],
+            };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: [changeA, changeB],
+                error,
+            };
+        }
+    }
+    // requirement for sandwich rebasing
+    function isRebaseOverUndoRedoPairNoOp(changeA, changeB) {
+        try {
+            const invB = invert(changeB);
+            const r1 = rebase(changeA, changeB);
+            const r2 = rebase(r1, invB);
+            const r3 = rebase(r2, changeB);
+            const equivalent = isEquivalent(r3, r1);
+            if (equivalent) {
+                return true;
+            }
+            return {
+                type: "Violation",
+                case: [changeA, changeB],
+            };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: [changeA, changeB],
+                error,
+            };
+        }
+    }
+    // requirement for compose of a change with it's inverse.
+    function isComposeWithInverseEqualsEmpty(changeA) {
+        try {
+            const changeset = compose([changeA, invert(changeA)]);
+            const equivalent = isEquivalent(changeset, compose([]));
+            return equivalent ? true : { type: "Violation", case: changeA };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: changeA,
+                error,
+            };
+        }
+    }
+    // compose([ε, A]) => A && compose([A, ε]) => A
+    function isComposeWithEmptyNoOp(changeA) {
+        try {
+            const noOp = compose([]);
+            const changeset1 = compose([changeA, noOp]);
+            const changeset2 = compose([noOp, changeA]);
+            const equivalent = isEquivalent(changeset1, changeset2) && isEquivalent(changeset1, changeA);
+            return equivalent ? true : { type: "Violation", case: changeA };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: changeA,
+                error,
+            };
+        }
+    }
+    // rebase(A, ε) => A
+    function isRebaseOverEmptyNoOp(changeA) {
+        try {
+            const noOp = compose([]);
+            const changeset = rebase(changeA, noOp);
+            const equivalent = isEquivalent(changeset, changeA);
+            return equivalent ? true : { type: "Violation", case: changeA };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: changeA,
+                error,
+            };
+        }
+    }
+    // rebase(ε, A) => ε
+    function isRebaseEmptyEmpty(changeA) {
+        try {
+            const noOp = compose([]);
+            const changeset = rebase(noOp, changeA);
+            const equivalent = isEquivalent(changeset, noOp);
+            return equivalent ? true : { type: "Violation", case: changeA };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: changeA,
+                error,
+            };
+        }
+    }
+    // invert(ε) => ε
+    function isEmptyInverseEmpty(changeA) {
+        try {
+            const noOp = compose([]);
+            const changeset = invert(noOp);
+            const equivalent = isEquivalent(changeset, noOp);
+            return equivalent ? true : { type: "Violation", case: changeA };
+        }
+        catch (error) {
+            return {
+                type: "Error",
+                case: changeA,
+                error,
+            };
+        }
+    }
+}
+exports.verifyChangeRebaser = verifyChangeRebaser;
+//# sourceMappingURL=verifyChangeRebaser.js.map

package/dist/core/rebase/verifyChangeRebaser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"verifyChangeRebaser.js","sourceRoot":"","sources":["../../../src/core/rebase/verifyChangeRebaser.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,mDAAgE;AAChE,mCAAyD;AAoE5C,QAAA,SAAS,GAAwB;IAC7C,wBAAwB,EAAE,EAAE;IAC5B,yBAAyB,EAAE,EAAE;IAC7B,oBAAoB,EAAE,EAAE;IACxB,0BAA0B,EAAE,EAAE;IAC9B,4BAA4B,EAAE,EAAE;IAChC,wBAAwB,EAAE,EAAE;IAC5B,sBAAsB,EAAE,EAAE;IAC1B,qBAAqB,EAAE,EAAE;IACzB,kBAAkB,EAAE,EAAE;IACtB,mBAAmB,EAAE,EAAE;CACvB,CAAC;AAEF;;;;;GAKG;AACH,SAAgB,mBAAmB,CAClC,OAA+B,EAC/B,OAA6B,EAC7B,YAAiD;IAEjD,MAAM,QAAQ,GAAG,IAAA,sCAA8B,EAAC,EAAE,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,CAAC,MAAe,EAAE,IAAa,EAAE,EAAE,CACjD,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,IAAA,8BAAc,EAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;IAExD,MAAM,OAAO,GAAG,CAAC,eAA0B,EAAE,EAAE,CAC9C,OAAO,CAAC,OAAO,CAAC,eAAe,CAAC,GAAG,CAAC,8BAAc,CAAC,CAAC,CAAC;IACtD,oCAAoC;IACpC,MAAM,MAAM,GAAG,CAAC,MAAe,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAA,8BAAc,EAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;IAElF,MAAM,MAAM,GAAwB;QACnC,wBAAwB,EAAE,EAAE;QAC5B,yBAAyB,EAAE,EAAE;QAC7B,oBAAoB,EAAE,EAAE;QACxB,0BAA0B,EAAE,EAAE;QAC9B,4BAA4B,EAAE,EAAE;QAChC,wBAAwB,EAAE,EAAE;QAC5B,sBAAsB,EAAE,EAAE;QAC1B,qBAAqB,EAAE,EAAE;QACzB,kBAAkB,EAAE,EAAE;QACtB,mBAAmB,EAAE,EAAE;KACvB,CAAC;IAEF,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE;QAC9B,MAAM,YAAY,GAAG,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,YAAY,KAAK,IAAI,EAAE;YAC1B,MAAM,CAAC,wBAAwB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACnD;QACD,MAAM,YAAY,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;QACrD,IAAI,YAAY,KAAK,IAAI,EAAE;YAC1B,MAAM,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACjD;QACD,MAAM,YAAY,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,YAAY,KAAK,IAAI,EAAE;YAC1B,MAAM,CAAC,qBAAqB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SAChD;QACD,MAAM,YAAY,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAC;QACjD,IAAI,YAAY,KAAK,IAAI,EAAE;YAC1B,MAAM,CAAC,kBAAkB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SAC7C;QACD,MAAM,YAAY,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,YAAY,KAAK,IAAI,EAAE;YAC1B,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SAC9C;QACD,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE;YAC9B,MAAM,YAAY,GAAG,0BAA0B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAClE,IAAI,YAAY,KAAK,IAAI,EAAE;gBAC1B,MAAM,CAAC,0BAA0B,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aACrD;YACD,MAAM,YAAY,GAAG,4BAA4B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACpE,IAAI,YAAY,KAAK,IAAI,EAAE;gBAC1B,MAAM,CAAC,4BAA4B,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aACvD;YACD,KAAK,MAAM,OAAO,IAAI,OAAO,EAAE;gBAC9B,MAAM,YAAY,GAAG,wBAAwB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBACzE,IAAI,YAAY,KAAK,IAAI,EAAE;oBAC1B,MAAM,CAAC,wBAAwB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;iBACnD;gBACD,MAAM,YAAY,GAAG,oBAAoB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBACrE,IAAI,YAAY,KAAK,IAAI,EAAE;oBAC1B,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;iBAC/C;gBACD,MAAM,aAAa,GAAG,yBAAyB,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC3E,IAAI,aAAa,KAAK,IAAI,EAAE;oBAC3B,MAAM,CAAC,yBAAyB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;iBACrD;aACD;SACD;KACD;IAED,OAAO,MAAM,CAAC;IAEd,4EAA4E;IAC5E,SAAS,wBAAwB,CAChC,OAAgB,EAChB,OAAgB,EAChB,OAAgB;QAEhB,IAAI;YACH,MAAM,gBAAgB,GAAG,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YACtE,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;YACnE,MAAM,UAAU,GAAG,YAAY,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;YACpE,IAAI,UAAU,EAAE;gBACf,OAAO,IAAI,CAAC;aACZ;YACD,OAAO;gBACN,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;aACjC,CAAC;SACF;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;gBACjC,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,8DAA8D;IAC9D,SAAS,oBAAoB,CAC5B,OAAgB,EAChB,OAAgB,EAChB,OAAgB;QAEhB,IAAI;YACH,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YACnE,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;YACxD,MAAM,UAAU,GACf,YAAY,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,YAAY,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC9E,IAAI,UAAU,EAAE;gBACf,OAAO,IAAI,CAAC;aACZ;YACD,OAAO;gBACN,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;aACjC,CAAC;SACF;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;gBACjC,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,SAAS,yBAAyB,CACjC,OAAgB,EAChB,OAAgB,EAChB,OAAgB;QAEhB,IAAI;YACH,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAChE,MAAM,UAAU,GAAG,OAAO,CAAC;gBAC1B,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC;gBACxB,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;aAC9E,CAAC,CAAC;YACH,MAAM,UAAU,GAAG,YAAY,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACxD,IAAI,UAAU,EAAE;gBACf,OAAO,IAAI,CAAC;aACZ;YACD,OAAO;gBACN,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;aACjC,CAAC;SACF;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC;gBACjC,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,+BAA+B;IAC/B,SAAS,0BAA0B,CAClC,OAAgB,EAChB,OAAgB;QAEhB,IAAI;YACH,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACpC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAC3B,MAAM,UAAU,GAAG,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;YAC7C,IAAI,UAAU,EAAE;gBACf,OAAO,IAAI,CAAC;aACZ;YACD,OAAO;gBACN,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;aACxB,CAAC;SACF;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;gBACxB,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,oCAAoC;IACpC,SAAS,4BAA4B,CACpC,OAAgB,EAChB,OAAgB;QAEhB,IAAI;YACH,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;YAC7B,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACpC,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC5B,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;YAC/B,MAAM,UAAU,GAAG,YAAY,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACxC,IAAI,UAAU,EAAE;gBACf,OAAO,IAAI,CAAC;aACZ;YACD,OAAO;gBACN,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;aACxB,CAAC;SACF;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;gBACxB,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,yDAAyD;IACzD,SAAS,+BAA+B,CAAC,OAAgB;QACxD,IAAI;YACH,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;YACxD,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;SAChE;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,OAAO;gBACb,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,+CAA+C;IAC/C,SAAS,sBAAsB,CAAC,OAAgB;QAC/C,IAAI;YACH,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;YAC5C,MAAM,UAAU,GACf,YAAY,CAAC,UAAU,EAAE,UAAU,CAAC,IAAI,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;YAC3E,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;SAChE;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,OAAO;gBACb,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,oBAAoB;IACpB,SAAS,qBAAqB,CAAC,OAAgB;QAC9C,IAAI;YACH,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,UAAU,GAAG,YAAY,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;YACpD,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;SAChE;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,OAAO;gBACb,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,oBAAoB;IACpB,SAAS,kBAAkB,CAAC,OAAgB;QAC3C,IAAI;YACH,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YACxC,MAAM,UAAU,GAAG,YAAY,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACjD,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;SAChE;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,OAAO;gBACb,KAAK;aACL,CAAC;SACF;IACF,CAAC;IAED,iBAAiB;IACjB,SAAS,mBAAmB,CAAC,OAAgB;QAC5C,IAAI;YACH,MAAM,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YACzB,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,UAAU,GAAG,YAAY,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACjD,OAAO,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;SAChE;QAAC,OAAO,KAAK,EAAE;YACf,OAAO;gBACN,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,OAAO;gBACb,KAAK;aACL,CAAC;SACF;IACF,CAAC;AACF,CAAC;AAnSD,kDAmSC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ChangeRebaser, makeAnonChange } from \"./changeRebaser\";\nimport { revisionMetadataSourceFromInfo } from \"./utils\";\n\nexport type Failure<TCase> = Violation<TCase> | Exception<TCase>;\n\nexport interface Violation<TCase> {\n\ttype: \"Violation\";\n\tcase: TCase;\n}\n\nexport interface Exception<TCase> {\n\ttype: \"Error\";\n\tcase: TCase;\n\terror: unknown;\n}\n\nexport interface OutputType<TChange> {\n\t/**\n\t * \"Passed\" iff `(A ○ B) ○ C = A (B ○ C) = A ○ B ○ C`,\n\t * otherwise a triple that violates the axiom.\n\t */\n\tcomposeAssociativity: Failure<[TChange, TChange, TChange]>[];\n\t/**\n\t * \"Passed\" iff `A ↷ (B ○ C) = (A ↷ B) ↷ C`,\n\t * otherwise a triple that violates the axiom.\n\t */\n\trebaseLeftDistributivity: Failure<[TChange, TChange, TChange]>[];\n\t/**\n\t * \"Passed\" iff `(A ○ B) ↷ C = (A ↷ C) ○ (B ↷ (A⁻¹ ○ C ○ (A ↷ C)) ↷ C)`,\n\t * otherwise a triple that violates the axiom.\n\t */\n\trebaseRightDistributivity: Failure<[TChange, TChange, TChange]>[];\n\t/**\n\t * \"Passed\" iff `(A ↷ B) ↷ B⁻¹ = A`,\n\t * otherwise a pair that violates the axiom.\n\t */\n\trebaseOverDoUndoPairIsNoOp: Failure<[TChange, TChange]>[];\n\t/**\n\t * \"Passed\" iff `((A ↷ B) ↷ B⁻¹) ↷ B = A ↷ B`,\n\t * otherwise a pair that violates the axiom.\n\t */\n\trebaseOverUndoRedoPairIsNoOp: Failure<[TChange, TChange]>[];\n\t/**\n\t * \"Passed\" iff `A ○ A⁻¹ = ε` where `ε` is the empty change,\n\t * otherwise a change that violates the axiom.\n\t */\n\tcomposeWithInverseIsNoOp: Failure<TChange>[];\n\t/**\n\t * \"Passed\" iff `A ○ ε` is equal to `ε ○ A` which equals to `A` where `ε` is the empty change,\n\t * otherwise a change that violates the axiom.\n\t */\n\tcomposeWithEmptyIsNoOp: Failure<TChange>[];\n\t/**\n\t * \"Passed\" iff `(A ↷ ε) = A`,\n\t * otherwise a change that violates the axiom.\n\t */\n\trebaseOverEmptyIsNoOp: Failure<TChange>[];\n\t/**\n\t * \"Passed\" iff `(ε ↷ A) = ε`,\n\t * otherwise a change that violates the axiom.\n\t */\n\trebaseEmptyIsEmpty: Failure<TChange>[];\n\t/**\n\t * \"Passed\" iff `ε⁻¹ = ε`,\n\t * otherwise a change that violates the axiom.\n\t */\n\temptyInverseIsEmpty: Failure<TChange>[];\n}\n\nexport const noFailure: OutputType<unknown> = {\n\trebaseLeftDistributivity: [],\n\trebaseRightDistributivity: [],\n\tcomposeAssociativity: [],\n\trebaseOverDoUndoPairIsNoOp: [],\n\trebaseOverUndoRedoPairIsNoOp: [],\n\tcomposeWithInverseIsNoOp: [],\n\tcomposeWithEmptyIsNoOp: [],\n\trebaseOverEmptyIsNoOp: [],\n\trebaseEmptyIsEmpty: [],\n\temptyInverseIsEmpty: [],\n};\n\n/**\n * Verifies the axioms of `ChangeRebaser` are met by the given `rebaser`.\n * @param rebaser - The rebaser to test.\n * @param changes - The set of changes to use for testing the `rebaser`.\n * @param isEquivalent - Used to compare whether two changes are equivalent for the purposes of this axioms.\n */\nexport function verifyChangeRebaser<TChange>(\n\trebaser: ChangeRebaser<TChange>,\n\tchanges: ReadonlySet<TChange>,\n\tisEquivalent: (a: TChange, b: TChange) => boolean,\n): OutputType<TChange> {\n\tconst metadata = revisionMetadataSourceFromInfo([]);\n\tconst rebase = (change: TChange, over: TChange) =>\n\t\trebaser.rebase(change, makeAnonChange(over), metadata);\n\n\tconst compose = (changeToCompose: TChange[]) =>\n\t\trebaser.compose(changeToCompose.map(makeAnonChange));\n\t// TODO: test with isRollback = true\n\tconst invert = (change: TChange) => rebaser.invert(makeAnonChange(change), false);\n\n\tconst output: OutputType<TChange> = {\n\t\trebaseLeftDistributivity: [],\n\t\trebaseRightDistributivity: [],\n\t\tcomposeAssociativity: [],\n\t\trebaseOverDoUndoPairIsNoOp: [],\n\t\trebaseOverUndoRedoPairIsNoOp: [],\n\t\tcomposeWithInverseIsNoOp: [],\n\t\tcomposeWithEmptyIsNoOp: [],\n\t\trebaseOverEmptyIsNoOp: [],\n\t\trebaseEmptyIsEmpty: [],\n\t\temptyInverseIsEmpty: [],\n\t};\n\n\tfor (const changeA of changes) {\n\t\tconst requirement1 = isComposeWithInverseEqualsEmpty(changeA);\n\t\tif (requirement1 !== true) {\n\t\t\toutput.composeWithInverseIsNoOp.push(requirement1);\n\t\t}\n\t\tconst requirement2 = isComposeWithEmptyNoOp(changeA);\n\t\tif (requirement2 !== true) {\n\t\t\toutput.composeWithEmptyIsNoOp.push(requirement2);\n\t\t}\n\t\tconst requirement3 = isRebaseOverEmptyNoOp(changeA);\n\t\tif (requirement3 !== true) {\n\t\t\toutput.rebaseOverEmptyIsNoOp.push(requirement3);\n\t\t}\n\t\tconst requirement4 = isRebaseEmptyEmpty(changeA);\n\t\tif (requirement4 !== true) {\n\t\t\toutput.rebaseEmptyIsEmpty.push(requirement4);\n\t\t}\n\t\tconst requirement5 = isEmptyInverseEmpty(changeA);\n\t\tif (requirement5 !== true) {\n\t\t\toutput.emptyInverseIsEmpty.push(requirement5);\n\t\t}\n\t\tfor (const changeB of changes) {\n\t\t\tconst requirement6 = isRebaseOverDoUndoPairNoOp(changeA, changeB);\n\t\t\tif (requirement6 !== true) {\n\t\t\t\toutput.rebaseOverDoUndoPairIsNoOp.push(requirement6);\n\t\t\t}\n\t\t\tconst requirement7 = isRebaseOverUndoRedoPairNoOp(changeA, changeB);\n\t\t\tif (requirement7 !== true) {\n\t\t\t\toutput.rebaseOverUndoRedoPairIsNoOp.push(requirement7);\n\t\t\t}\n\t\t\tfor (const changeC of changes) {\n\t\t\t\tconst requirement8 = isRebaseLeftDistributive(changeA, changeB, changeC);\n\t\t\t\tif (requirement8 !== true) {\n\t\t\t\t\toutput.rebaseLeftDistributivity.push(requirement8);\n\t\t\t\t}\n\t\t\t\tconst requirement9 = isComposeAssociative(changeA, changeB, changeC);\n\t\t\t\tif (requirement9 !== true) {\n\t\t\t\t\toutput.composeAssociativity.push(requirement9);\n\t\t\t\t}\n\t\t\t\tconst requirement10 = isRebaseRightDistributive(changeA, changeB, changeC);\n\t\t\t\tif (requirement10 !== true) {\n\t\t\t\t\toutput.rebaseRightDistributivity.push(requirement10);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn output;\n\n\t// Requirement testing the rebasing of composed changes and rebased changes.\n\tfunction isRebaseLeftDistributive(\n\t\tchangeA: TChange,\n\t\tchangeB: TChange,\n\t\tchangeC: TChange,\n\t): true | Failure<[TChange, TChange, TChange]> {\n\t\ttry {\n\t\t\tconst rebaseChangeset1 = rebase(changeA, compose([changeB, changeC]));\n\t\t\tconst rebaseChangeset2 = rebase(rebase(changeA, changeB), changeC);\n\t\t\tconst equivalent = isEquivalent(rebaseChangeset1, rebaseChangeset2);\n\t\t\tif (equivalent) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\ttype: \"Violation\",\n\t\t\t\tcase: [changeA, changeB, changeC],\n\t\t\t};\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: [changeA, changeB, changeC],\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// Requirement checking different ordering of composed changes\n\tfunction isComposeAssociative(\n\t\tchangeA: TChange,\n\t\tchangeB: TChange,\n\t\tchangeC: TChange,\n\t): true | Failure<[TChange, TChange, TChange]> {\n\t\ttry {\n\t\t\tconst changeset1 = compose([changeA, compose([changeB, changeC])]);\n\t\t\tconst changeset2 = compose([compose([changeA, changeB]), changeC]);\n\t\t\tconst changeset3 = compose([changeA, changeB, changeC]);\n\t\t\tconst equivalent =\n\t\t\t\tisEquivalent(changeset1, changeset2) && isEquivalent(changeset1, changeset3);\n\t\t\tif (equivalent) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\ttype: \"Violation\",\n\t\t\t\tcase: [changeA, changeB, changeC],\n\t\t\t};\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: [changeA, changeB, changeC],\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\tfunction isRebaseRightDistributive(\n\t\tchangeA: TChange,\n\t\tchangeB: TChange,\n\t\tchangeC: TChange,\n\t): true | Failure<[TChange, TChange, TChange]> {\n\t\ttry {\n\t\t\tconst changeset1 = rebase(compose([changeA, changeB]), changeC);\n\t\t\tconst changeset2 = compose([\n\t\t\t\trebase(changeA, changeC),\n\t\t\t\trebase(changeB, compose([invert(changeA), changeC, rebase(changeA, changeC)])),\n\t\t\t]);\n\t\t\tconst equivalent = isEquivalent(changeset1, changeset2);\n\t\t\tif (equivalent) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\ttype: \"Violation\",\n\t\t\t\tcase: [changeA, changeB, changeC],\n\t\t\t};\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: [changeA, changeB, changeC],\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// requirement for do-undo pair\n\tfunction isRebaseOverDoUndoPairNoOp(\n\t\tchangeA: TChange,\n\t\tchangeB: TChange,\n\t): true | Failure<[TChange, TChange]> {\n\t\ttry {\n\t\t\tconst inv = invert(changeB);\n\t\t\tconst r1 = rebase(changeA, changeB);\n\t\t\tconst r2 = rebase(r1, inv);\n\t\t\tconst equivalent = isEquivalent(r2, changeA);\n\t\t\tif (equivalent) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\ttype: \"Violation\",\n\t\t\t\tcase: [changeA, changeB],\n\t\t\t};\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: [changeA, changeB],\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// requirement for sandwich rebasing\n\tfunction isRebaseOverUndoRedoPairNoOp(\n\t\tchangeA: TChange,\n\t\tchangeB: TChange,\n\t): true | Failure<[TChange, TChange]> {\n\t\ttry {\n\t\t\tconst invB = invert(changeB);\n\t\t\tconst r1 = rebase(changeA, changeB);\n\t\t\tconst r2 = rebase(r1, invB);\n\t\t\tconst r3 = rebase(r2, changeB);\n\t\t\tconst equivalent = isEquivalent(r3, r1);\n\t\t\tif (equivalent) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn {\n\t\t\t\ttype: \"Violation\",\n\t\t\t\tcase: [changeA, changeB],\n\t\t\t};\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: [changeA, changeB],\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// requirement for compose of a change with it's inverse.\n\tfunction isComposeWithInverseEqualsEmpty(changeA: TChange): true | Failure<TChange> {\n\t\ttry {\n\t\t\tconst changeset = compose([changeA, invert(changeA)]);\n\t\t\tconst equivalent = isEquivalent(changeset, compose([]));\n\t\t\treturn equivalent ? true : { type: \"Violation\", case: changeA };\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: changeA,\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// compose([ε, A]) => A && compose([A, ε]) => A\n\tfunction isComposeWithEmptyNoOp(changeA: TChange): true | Failure<TChange> {\n\t\ttry {\n\t\t\tconst noOp = compose([]);\n\t\t\tconst changeset1 = compose([changeA, noOp]);\n\t\t\tconst changeset2 = compose([noOp, changeA]);\n\t\t\tconst equivalent =\n\t\t\t\tisEquivalent(changeset1, changeset2) && isEquivalent(changeset1, changeA);\n\t\t\treturn equivalent ? true : { type: \"Violation\", case: changeA };\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: changeA,\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// rebase(A, ε) => A\n\tfunction isRebaseOverEmptyNoOp(changeA: TChange): true | Failure<TChange> {\n\t\ttry {\n\t\t\tconst noOp = compose([]);\n\t\t\tconst changeset = rebase(changeA, noOp);\n\t\t\tconst equivalent = isEquivalent(changeset, changeA);\n\t\t\treturn equivalent ? true : { type: \"Violation\", case: changeA };\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: changeA,\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// rebase(ε, A) => ε\n\tfunction isRebaseEmptyEmpty(changeA: TChange): true | Failure<TChange> {\n\t\ttry {\n\t\t\tconst noOp = compose([]);\n\t\t\tconst changeset = rebase(noOp, changeA);\n\t\t\tconst equivalent = isEquivalent(changeset, noOp);\n\t\t\treturn equivalent ? true : { type: \"Violation\", case: changeA };\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: changeA,\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n\n\t// invert(ε) => ε\n\tfunction isEmptyInverseEmpty(changeA: TChange): true | Failure<TChange> {\n\t\ttry {\n\t\t\tconst noOp = compose([]);\n\t\t\tconst changeset = invert(noOp);\n\t\t\tconst equivalent = isEquivalent(changeset, noOp);\n\t\t\treturn equivalent ? true : { type: \"Violation\", case: changeA };\n\t\t} catch (error) {\n\t\t\treturn {\n\t\t\t\ttype: \"Error\",\n\t\t\t\tcase: changeA,\n\t\t\t\terror,\n\t\t\t};\n\t\t}\n\t}\n}\n"]}

package/dist/core/revertible/index.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { Revertible, RevertibleKind, RevertResult, DiscardResult } from "./revertible";
+//# sourceMappingURL=index.d.ts.map

package/dist/core/revertible/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/revertible/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC"}

package/dist/core/revertible/index.js

@@ -0,0 +1,12 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DiscardResult = exports.RevertResult = exports.RevertibleKind = void 0;
+var revertible_1 = require("./revertible");
+Object.defineProperty(exports, "RevertibleKind", { enumerable: true, get: function () { return revertible_1.RevertibleKind; } });
+Object.defineProperty(exports, "RevertResult", { enumerable: true, get: function () { return revertible_1.RevertResult; } });
+Object.defineProperty(exports, "DiscardResult", { enumerable: true, get: function () { return revertible_1.DiscardResult; } });
+//# sourceMappingURL=index.js.map

package/dist/core/revertible/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/revertible/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2CAAuF;AAAlE,4GAAA,cAAc,OAAA;AAAE,0GAAA,YAAY,OAAA;AAAE,2GAAA,aAAa,OAAA","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport { Revertible, RevertibleKind, RevertResult, DiscardResult } from \"./revertible\";\n"]}

package/dist/core/revertible/revertible.d.ts

@@ -0,0 +1,72 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * Allows reversion of a change made to SharedTree.
+ *
+ * Applications wanting to implement undo/redo support might typically maintain two stacks of Revertibles, with optional eviction policy to free up memory.
+ * @beta
+ */
+export interface Revertible {
+    /** Indicates the type of edit that produced this revertible. */
+    readonly kind: RevertibleKind;
+    /**
+     * Information about which client created the edit.
+     */
+    readonly origin: {
+        /**
+         * Indicates if the {@link Revertible} is from the local client (true) or a remote client (false).
+         */
+        readonly isLocal: boolean;
+    };
+    /**
+     * Can be called in order to revert a change. A successful revert will automatically discard resources.
+     */
+    revert(): RevertResult;
+    /**
+     * Should be called to garbage collect any resources associated with the revertible.
+     */
+    discard(): DiscardResult;
+}
+/**
+ * The type of revertible commit.
+ *
+ * @beta
+ */
+export declare enum RevertibleKind {
+    /** A typical local commit */
+    Default = 0,
+    /** A revertible that is the result of an undo. */
+    Undo = 1,
+    /** A revertible that is the result of a redo. */
+    Redo = 2,
+    /**
+     * A revertible that is the result of a rebase and should replace a previously generated revertible.
+     * todo: improve error reporting in this case
+     */
+    Rebase = 3
+}
+/**
+ * The result of a revert operation.
+ *
+ * @beta
+ */
+export declare enum RevertResult {
+    /** The revert was successful. */
+    Success = 0,
+    /** The revert failed. */
+    Failure = 1
+}
+/**
+ * The result of a discard operation.
+ *
+ * @beta
+ */
+export declare enum DiscardResult {
+    /** The discard was successful. */
+    Success = 0,
+    /** The discard failed. */
+    Failure = 1
+}
+//# sourceMappingURL=revertible.d.ts.map

package/dist/core/revertible/revertible.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"revertible.d.ts","sourceRoot":"","sources":["../../../src/core/revertible/revertible.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;GAKG;AACH,MAAM,WAAW,UAAU;IAC1B,gEAAgE;IAChE,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC;IAC9B;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE;QAChB;;WAEG;QACH,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;KAC1B,CAAC;IACF;;OAEG;IACH,MAAM,IAAI,YAAY,CAAC;IACvB;;OAEG;IACH,OAAO,IAAI,aAAa,CAAC;CACzB;AAED;;;;GAIG;AACH,oBAAY,cAAc;IACzB,6BAA6B;IAC7B,OAAO,IAAA;IACP,kDAAkD;IAClD,IAAI,IAAA;IACJ,iDAAiD;IACjD,IAAI,IAAA;IACJ;;;OAGG;IACH,MAAM,IAAA;CACN;AAED;;;;GAIG;AACH,oBAAY,YAAY;IACvB,iCAAiC;IACjC,OAAO,IAAA;IACP,yBAAyB;IACzB,OAAO,IAAA;CACP;AAED;;;;GAIG;AACH,oBAAY,aAAa;IACxB,kCAAkC;IAClC,OAAO,IAAA;IACP,0BAA0B;IAC1B,OAAO,IAAA;CACP"}

package/dist/core/revertible/revertible.js

@@ -0,0 +1,51 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DiscardResult = exports.RevertResult = exports.RevertibleKind = void 0;
+/**
+ * The type of revertible commit.
+ *
+ * @beta
+ */
+var RevertibleKind;
+(function (RevertibleKind) {
+    /** A typical local commit */
+    RevertibleKind[RevertibleKind["Default"] = 0] = "Default";
+    /** A revertible that is the result of an undo. */
+    RevertibleKind[RevertibleKind["Undo"] = 1] = "Undo";
+    /** A revertible that is the result of a redo. */
+    RevertibleKind[RevertibleKind["Redo"] = 2] = "Redo";
+    /**
+     * A revertible that is the result of a rebase and should replace a previously generated revertible.
+     * todo: improve error reporting in this case
+     */
+    RevertibleKind[RevertibleKind["Rebase"] = 3] = "Rebase";
+})(RevertibleKind || (exports.RevertibleKind = RevertibleKind = {}));
+/**
+ * The result of a revert operation.
+ *
+ * @beta
+ */
+var RevertResult;
+(function (RevertResult) {
+    /** The revert was successful. */
+    RevertResult[RevertResult["Success"] = 0] = "Success";
+    /** The revert failed. */
+    RevertResult[RevertResult["Failure"] = 1] = "Failure";
+})(RevertResult || (exports.RevertResult = RevertResult = {}));
+/**
+ * The result of a discard operation.
+ *
+ * @beta
+ */
+var DiscardResult;
+(function (DiscardResult) {
+    /** The discard was successful. */
+    DiscardResult[DiscardResult["Success"] = 0] = "Success";
+    /** The discard failed. */
+    DiscardResult[DiscardResult["Failure"] = 1] = "Failure";
+})(DiscardResult || (exports.DiscardResult = DiscardResult = {}));
+//# sourceMappingURL=revertible.js.map

package/dist/core/revertible/revertible.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"revertible.js","sourceRoot":"","sources":["../../../src/core/revertible/revertible.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AA8BH;;;;GAIG;AACH,IAAY,cAYX;AAZD,WAAY,cAAc;IACzB,6BAA6B;IAC7B,yDAAO,CAAA;IACP,kDAAkD;IAClD,mDAAI,CAAA;IACJ,iDAAiD;IACjD,mDAAI,CAAA;IACJ;;;OAGG;IACH,uDAAM,CAAA;AACP,CAAC,EAZW,cAAc,8BAAd,cAAc,QAYzB;AAED;;;;GAIG;AACH,IAAY,YAKX;AALD,WAAY,YAAY;IACvB,iCAAiC;IACjC,qDAAO,CAAA;IACP,yBAAyB;IACzB,qDAAO,CAAA;AACR,CAAC,EALW,YAAY,4BAAZ,YAAY,QAKvB;AAED;;;;GAIG;AACH,IAAY,aAKX;AALD,WAAY,aAAa;IACxB,kCAAkC;IAClC,uDAAO,CAAA;IACP,0BAA0B;IAC1B,uDAAO,CAAA;AACR,CAAC,EALW,aAAa,6BAAb,aAAa,QAKxB","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * Allows reversion of a change made to SharedTree.\n *\n * Applications wanting to implement undo/redo support might typically maintain two stacks of Revertibles, with optional eviction policy to free up memory.\n * @beta\n */\nexport interface Revertible {\n\t/** Indicates the type of edit that produced this revertible. */\n\treadonly kind: RevertibleKind;\n\t/**\n\t * Information about which client created the edit.\n\t */\n\treadonly origin: {\n\t\t/**\n\t\t * Indicates if the {@link Revertible} is from the local client (true) or a remote client (false).\n\t\t */\n\t\treadonly isLocal: boolean;\n\t};\n\t/**\n\t * Can be called in order to revert a change. A successful revert will automatically discard resources.\n\t */\n\trevert(): RevertResult;\n\t/**\n\t * Should be called to garbage collect any resources associated with the revertible.\n\t */\n\tdiscard(): DiscardResult;\n}\n\n/**\n * The type of revertible commit.\n *\n * @beta\n */\nexport enum RevertibleKind {\n\t/** A typical local commit */\n\tDefault,\n\t/** A revertible that is the result of an undo. */\n\tUndo,\n\t/** A revertible that is the result of a redo. */\n\tRedo,\n\t/**\n\t * A revertible that is the result of a rebase and should replace a previously generated revertible.\n\t * todo: improve error reporting in this case\n\t */\n\tRebase,\n}\n\n/**\n * The result of a revert operation.\n *\n * @beta\n */\nexport enum RevertResult {\n\t/** The revert was successful. */\n\tSuccess,\n\t/** The revert failed. */\n\tFailure,\n}\n\n/**\n * The result of a discard operation.\n *\n * @beta\n */\nexport enum DiscardResult {\n\t/** The discard was successful. */\n\tSuccess,\n\t/** The discard failed. */\n\tFailure,\n}\n"]}

package/dist/core/schema-stored/format.d.ts

@@ -0,0 +1,97 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { Static } from "@sinclair/typebox";
+import { Brand } from "../../util";
+export declare const version: 1;
+/**
+ * Key (aka Name or Label) for a field which is scoped to a specific TreeNodeStoredSchema.
+ *
+ * Stable identifier, used when persisting data.
+ * @internal
+ */
+export type FieldKey = Brand<string, "tree.FieldKey">;
+/**
+ * TypeBox Schema for encoding {@link FieldKey} in persisted data.
+ */
+export declare const FieldKeySchema: import("@sinclair/typebox").TUnsafe<FieldKey>;
+/**
+ * Identifier for a TreeNode schema.
+ * Also known as "Definition"
+ *
+ * Stable identifier, used when persisting data.
+ * @internal
+ */
+export type TreeNodeSchemaIdentifier<TName extends string = string> = Brand<TName, "tree.TreeNodeSchemaIdentifier">;
+/**
+ * Identifier for a FieldKind.
+ * Refers to an exact stable policy (ex: specific version of a policy),
+ * for how to handle (ex: edit and merge edits to) fields marked with this kind.
+ * Persisted in documents as part of stored schema.
+ * @internal
+ */
+export type FieldKindIdentifier = Brand<string, "tree.FieldKindIdentifier">;
+export declare const FieldKindIdentifierSchema: import("@sinclair/typebox").TUnsafe<FieldKindIdentifier>;
+/**
+ * TypeBox Schema for encoding {@link TreeNodeSchemaIdentifiers} in persisted data.
+ */
+export declare const TreeNodeSchemaIdentifierSchema: import("@sinclair/typebox").TUnsafe<TreeNodeSchemaIdentifier<string>>;
+export declare const FieldSchemaFormat: import("@sinclair/typebox").TObject<{
+    kind: import("@sinclair/typebox").TUnsafe<FieldKindIdentifier>;
+    types: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnsafe<TreeNodeSchemaIdentifier<string>>>>;
+}>;
+declare const NamedFieldSchemaFormat: import("@sinclair/typebox").TObject<{
+    name: import("@sinclair/typebox").TUnsafe<FieldKey>;
+    kind: import("@sinclair/typebox").TUnsafe<FieldKindIdentifier>;
+    types: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnsafe<TreeNodeSchemaIdentifier<string>>>>;
+}>;
+/**
+ * Persisted version of {@link ValueSchema}.
+ * @internal
+ */
+export declare enum PersistedValueSchema {
+    Number = 0,
+    String = 1,
+    Boolean = 2,
+    FluidHandle = 3,
+    Null = 4
+}
+/**
+ * Discriminated union content of tree node schema.
+ *
+ * See {@link DiscriminatedUnionDispatcher} for more information on this pattern.
+ * @internal
+ */
+export declare const TreeNodeSchemaDataFormat: import("@sinclair/typebox").TObject<{
+    /**
+     * Object node union member.
+     */
+    object: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TObject<{
+        name: import("@sinclair/typebox").TUnsafe<FieldKey>;
+        kind: import("@sinclair/typebox").TUnsafe<FieldKindIdentifier>;
+        types: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnsafe<TreeNodeSchemaIdentifier<string>>>>;
+    }>>>;
+    /**
+     * Map node union member.
+     */
+    map: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TObject<{
+        kind: import("@sinclair/typebox").TUnsafe<FieldKindIdentifier>;
+        types: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TArray<import("@sinclair/typebox").TUnsafe<TreeNodeSchemaIdentifier<string>>>>;
+    }>>;
+    /**
+     * Leaf node union member.
+     */
+    leaf: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TEnum<typeof PersistedValueSchema>>;
+}>;
+export type TreeNodeSchemaDataFormat = Static<typeof TreeNodeSchemaDataFormat>;
+/**
+ * @internal
+ */
+export type FieldSchemaFormat = Static<typeof FieldSchemaFormat>;
+/**
+ * @internal
+ */
+export type NamedFieldSchemaFormat = Static<typeof NamedFieldSchemaFormat>;
+export {};
+//# sourceMappingURL=format.d.ts.map

package/dist/core/schema-stored/format.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../../../src/core/schema-stored/format.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAiB,MAAM,EAAQ,MAAM,mBAAmB,CAAC;AAEhE,OAAO,EAAE,KAAK,EAAqB,MAAM,YAAY,CAAC;AAEtD,eAAO,MAAM,OAAO,GAAa,CAAC;AAElC;;;;;GAKG;AACH,MAAM,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;AAEtD;;GAEG;AACH,eAAO,MAAM,cAAc,+CAAgC,CAAC;AAE5D;;;;;;GAMG;AACH,MAAM,MAAM,wBAAwB,CAAC,KAAK,SAAS,MAAM,GAAG,MAAM,IAAI,KAAK,CAC1E,KAAK,EACL,+BAA+B,CAC/B,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,KAAK,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;AAC5E,eAAO,MAAM,yBAAyB,0DAA2C,CAAC;AAElF;;GAEG;AACH,eAAO,MAAM,8BAA8B,uEAAgD,CAAC;AAS5F,eAAO,MAAM,iBAAiB;;;EAA6D,CAAC;AAE5F,QAAA,MAAM,sBAAsB;;;;EAQ3B,CAAC;AAEF;;;GAGG;AACH,oBAAY,oBAAoB;IAC/B,MAAM,IAAA;IACN,MAAM,IAAA;IACN,OAAO,IAAA;IACP,WAAW,IAAA;IACX,IAAI,IAAA;CACJ;AAED;;;;;GAKG;AACH,eAAO,MAAM,wBAAwB;IAEnC;;OAEG;;;;;;IAEH;;OAEG;;;;;IAEH;;OAEG;;EAIJ,CAAC;AAEF,MAAM,MAAM,wBAAwB,GAAG,MAAM,CAAC,OAAO,wBAAwB,CAAC,CAAC;AAC/E;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,MAAM,CAAC,OAAO,iBAAiB,CAAC,CAAC;AACjE;;GAEG;AACH,MAAM,MAAM,sBAAsB,GAAG,MAAM,CAAC,OAAO,sBAAsB,CAAC,CAAC"}