@fluid-experimental/tree 2.0.0-rc.2.0.1 → 2.0.0-rc.3.0.0

package/lib/test/utilities/UndoRedoTests.js

@@ -1,317 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { noop } from '../../Common.js';
-import { TreeNodeHandle } from '../../TreeNodeHandle.js';
-import { Change, StablePlace, StableRange } from '../../ChangeTypes.js';
-import { deepCompareNodes } from '../../EditUtilities.js';
-import { expectDefined } from './TestCommon.js';
-import { buildLeaf } from './TestNode.js';
-import { setUpTestSharedTree, setUpTestTree, translateId } from './TestUtilities.js';
-/**
- * Runs undo/redo tests for SharedTree
- */
-export function runSharedTreeUndoRedoTestSuite(options) {
-    const { localMode, title, undo, redo, beforeEach: additionalSetup } = options;
-    const afterEdit = options.afterEdit ?? noop;
-    const testOutOfOrderRevert = options.testOutOfOrderRevert ?? true;
-    const treeOptions = {
-        localMode,
-        allowInvalid: true,
-        allowMalformed: true,
-    };
-    const secondTreeOptions = {
-        localMode,
-        id: 'secondTestTree',
-        allowInvalid: true,
-    };
-    describe(title, () => {
-        let testTree;
-        let sharedTree;
-        let undoSharedTree;
-        let containerRuntimeFactory;
-        function getTreeHandle() {
-            return new TreeNodeHandle(sharedTree.currentView, testTree.identifier);
-        }
-        beforeEach(() => {
-            const setupResult = setUpTestSharedTree(treeOptions);
-            sharedTree = setupResult.tree;
-            testTree = setUpTestTree(sharedTree);
-            containerRuntimeFactory = setupResult.containerRuntimeFactory;
-            const secondTree = localMode
-                ? undefined
-                : setUpTestSharedTree({ containerRuntimeFactory, ...secondTreeOptions }).tree;
-            undoSharedTree = secondTree ?? sharedTree;
-            if (additionalSetup !== undefined) {
-                if (secondTree !== undefined) {
-                    additionalSetup([sharedTree, undoSharedTree]);
-                }
-                else {
-                    additionalSetup([sharedTree]);
-                }
-            }
-        });
-        it('can detach and re-insert the same node', () => {
-            const detachedId = 0;
-            const { id } = sharedTree.applyEdit(Change.detach(StableRange.only(testTree.left), detachedId), Change.insert(detachedId, StablePlace.atStartOf(testTree.left.traitLocation)));
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            expect(deepCompareNodes(getTreeHandle(), testTree)).to.be.true;
-            const undoId = expectDefined(undo(sharedTree, id));
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            expect(deepCompareNodes(getTreeHandle(), testTree)).to.be.true;
-            redo(sharedTree, undoId);
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            expect(deepCompareNodes(getTreeHandle(), testTree)).to.be.true;
-        });
-        it('works for Insert', () => {
-            const newNode = testTree.buildLeaf();
-            const { id } = sharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));
-            afterEdit();
-            expect(sharedTree.edits.length).to.equal(2);
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            // Undo testing
-            const undoId = expectDefined(undo(undoSharedTree, id));
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            expect(sharedTree.edits.length).to.equal(3);
-            // Check the inserted node was deleted
-            const leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-            expect(leftTraitAfterUndo.length).to.equal(1);
-            // Redo testing
-            redo(undoSharedTree, undoId);
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            expect(sharedTree.edits.length).to.equal(4);
-            // Check the inserted node was reinserted
-            const leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-            expect(leftTraitAfterRedo.length).to.equal(2);
-        });
-        // Scope of detach code and fixtures
-        {
-            for (let startIndex = 0; startIndex < 8; ++startIndex) {
-                for (let endIndex = startIndex; endIndex < 8; ++endIndex) {
-                    it(`works for Detach [${startIndex} -> ${endIndex}]`, () => {
-                        const leftTraitNodes = [
-                            testTree.buildLeaf(testTree.generateNodeId()),
-                            testTree.left,
-                            testTree.buildLeaf(testTree.generateNodeId()),
-                        ];
-                        const places = leftTraitPlaces(testTree, leftTraitNodes);
-                        sharedTree.applyEdit(...Change.insertTree(leftTraitNodes[0], StablePlace.before(testTree.left)));
-                        afterEdit();
-                        sharedTree.applyEdit(...Change.insertTree(leftTraitNodes[2], StablePlace.after(testTree.left)));
-                        afterEdit();
-                        expect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(3);
-                        const range = {
-                            start: places[startIndex].place,
-                            end: places[endIndex].place,
-                        };
-                        const countDetached = places[endIndex].index - places[startIndex].index;
-                        const { id } = sharedTree.applyEdit(Change.delete(range));
-                        afterEdit();
-                        expect(sharedTree.edits.length).to.equal(4);
-                        expect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(3 - countDetached);
-                        if (!localMode) {
-                            containerRuntimeFactory.processAllMessages();
-                        }
-                        // Undo testing
-                        const undoId = expectDefined(undo(undoSharedTree, id));
-                        if (!localMode) {
-                            containerRuntimeFactory.processAllMessages();
-                        }
-                        expect(sharedTree.edits.length).to.equal(5);
-                        expect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(3);
-                        // Redo testing
-                        redo(undoSharedTree, undoId);
-                        if (!localMode) {
-                            containerRuntimeFactory.processAllMessages();
-                        }
-                        expect(sharedTree.edits.length).to.equal(6);
-                        expect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(3 - countDetached);
-                    });
-                }
-            }
-        }
-        it('works for SetValue', () => {
-            const newNode = testTree.buildLeaf(testTree.generateNodeId());
-            sharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));
-            afterEdit();
-            const testPayload = 5;
-            const { id } = sharedTree.applyEdit(Change.setPayload(newNode.identifier, testPayload));
-            afterEdit();
-            expect(sharedTree.edits.length).to.equal(3);
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            // Undo testing
-            const undoId = expectDefined(undo(undoSharedTree, id));
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            expect(sharedTree.edits.length).to.equal(4);
-            // Check the node whose value was set now has an empty payload
-            const leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-            const nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);
-            expect(nodeAfterUndo.payload).to.be.undefined;
-            // Redo testing
-            redo(undoSharedTree, undoId);
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            expect(sharedTree.edits.length).to.equal(5);
-            // Check the inserted node was reinserted
-            const leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-            const nodeAfterRedo = sharedTree.currentView.getViewNode(leftTraitAfterRedo[1]);
-            expect(nodeAfterRedo.payload).equal(testPayload);
-        });
-        it('works for conflicting edits', () => {
-            const newNodeId = sharedTree.generateNodeId();
-            const newNode = buildLeaf(newNodeId);
-            sharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.atStartOf(testTree.left.traitLocation)));
-            containerRuntimeFactory.processAllMessages();
-            // First tree deletes the new node under left trait
-            sharedTree.applyEdit(Change.detach(StableRange.only(newNode)));
-            afterEdit();
-            // Second tree also deletes new left node
-            const translatedNodeId = translateId(newNodeId, sharedTree, undoSharedTree);
-            const { id } = undoSharedTree.applyEdit(Change.detach(StableRange.only(translatedNodeId)));
-            afterEdit();
-            // Synchronize; the first tree's edit will apply but the second tree's will be invalid
-            if (!localMode) {
-                containerRuntimeFactory.processAllMessages();
-            }
-            // The undo should succeed but do nothing
-            undo(undoSharedTree, id);
-            // Check that the undo had no effect
-            const traitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-            expect(traitAfterUndo.length).equals(1);
-        });
-        if (testOutOfOrderRevert === true) {
-            it('works for out-of-order Insert', () => {
-                const firstNode = testTree.buildLeaf();
-                const secondNode = testTree.buildLeaf(testTree.generateNodeId());
-                const { id } = sharedTree.applyEdit(...Change.insertTree(firstNode, StablePlace.after(testTree.left)));
-                afterEdit();
-                sharedTree.applyEdit(...Change.insertTree(secondNode, StablePlace.after(testTree.left)));
-                afterEdit();
-                expect(sharedTree.edits.length).to.equal(3);
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                // Undo testing
-                const undoId = expectDefined(undo(undoSharedTree, id));
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                const editsAfterUndo = sharedTree.edits;
-                expect(editsAfterUndo.length).to.equal(4);
-                const leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-                expect(leftTraitAfterUndo.length).to.equal(2);
-                // Check that the node under the left trait is the second node
-                const nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);
-                expect(nodeAfterUndo.identifier).to.equal(secondNode.identifier);
-                // Redo testing
-                redo(undoSharedTree, undoId);
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                expect(sharedTree.edits.length).to.equal(5);
-                const leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-                expect(leftTraitAfterRedo.length).to.equal(3);
-            });
-            it('works for out-of-order Detach', () => {
-                const firstNode = testTree.buildLeaf(testTree.generateNodeId());
-                const secondNode = testTree.buildLeaf();
-                sharedTree.applyEdit(...Change.insertTree(firstNode, StablePlace.after(testTree.left)));
-                afterEdit();
-                const { id } = sharedTree.applyEdit(Change.delete(StableRange.only(firstNode)));
-                afterEdit();
-                sharedTree.applyEdit(...Change.insertTree(secondNode, StablePlace.after(testTree.left)));
-                afterEdit();
-                expect(sharedTree.edits.length).to.equal(4);
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                // Undo testing
-                const undoId = expectDefined(undo(undoSharedTree, id));
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                expect(sharedTree.edits.length).to.equal(5);
-                const leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-                expect(leftTraitAfterUndo.length).to.equal(3);
-                // Check the first node is the second one under the left trait
-                const nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);
-                expect(nodeAfterUndo.identifier).to.equal(firstNode.identifier);
-                // Redo testing
-                redo(undoSharedTree, undoId);
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                expect(sharedTree.edits.length).to.equal(6);
-                const leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-                expect(leftTraitAfterRedo.length).to.equal(2);
-            });
-            it('works for out-of-order SetValue', () => {
-                const newNode = testTree.buildLeaf(testTree.generateNodeId());
-                sharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));
-                afterEdit();
-                const testPayload = 10;
-                const { id } = sharedTree.applyEdit(Change.setPayload(newNode.identifier, testPayload));
-                afterEdit();
-                sharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));
-                afterEdit();
-                expect(sharedTree.edits.length).to.equal(4);
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                // Undo testing
-                const undoId = expectDefined(undo(undoSharedTree, id));
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                expect(sharedTree.edits.length).to.equal(5);
-                // Check the node whose value was set now has an empty payload
-                const leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-                const nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);
-                expect(nodeAfterUndo.payload).to.be.undefined;
-                // Redo testing
-                redo(undoSharedTree, undoId);
-                if (!localMode) {
-                    containerRuntimeFactory.processAllMessages();
-                }
-                expect(sharedTree.edits.length).to.equal(6);
-                // Check the inserted node was reinserted
-                const leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);
-                const nodeAfterRedo = sharedTree.currentView.getViewNode(leftTraitAfterRedo[1]);
-                expect(nodeAfterRedo.payload).equal(testPayload);
-            });
-        }
-    });
-}
-/**
- * Generate all possible places in the given trait
- */
-function leftTraitPlaces(testTree, trait) {
-    const places = [];
-    places.push({ index: 0, place: StablePlace.atStartOf(testTree.left.traitLocation) });
-    for (let i = 0; i < trait.length; i++) {
-        places.push({ index: i, place: StablePlace.before(trait[i]) });
-        places.push({ index: i + 1, place: StablePlace.after(trait[i]) });
-    }
-    places.push({ index: 3, place: StablePlace.atEndOf(testTree.left.traitLocation) });
-    return places;
-}
-//# sourceMappingURL=UndoRedoTests.js.map

package/lib/test/utilities/UndoRedoTests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"UndoRedoTests.js","sourceRoot":"","sources":["../../../src/test/utilities/UndoRedoTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAEvC,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEzD,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACxE,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE1D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAY,MAAM,eAAe,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAuBrF;;GAEG;AACH,MAAM,UAAU,8BAA8B,CAAC,OAAkC;IAChF,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,eAAe,EAAE,GAAG,OAAO,CAAC;IAC9E,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC;IAC5C,MAAM,oBAAoB,GAAG,OAAO,CAAC,oBAAoB,IAAI,IAAI,CAAC;IAElE,MAAM,WAAW,GAAG;QACnB,SAAS;QACT,YAAY,EAAE,IAAI;QAClB,cAAc,EAAE,IAAI;KACpB,CAAC;IAEF,MAAM,iBAAiB,GAAG;QACzB,SAAS;QACT,EAAE,EAAE,gBAAgB;QACpB,YAAY,EAAE,IAAI;KAClB,CAAC;IAEF,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACpB,IAAI,QAAkB,CAAC;QACvB,IAAI,UAAsB,CAAC;QAC3B,IAAI,cAA0B,CAAC;QAC/B,IAAI,uBAAoD,CAAC;QAEzD,SAAS,aAAa;YACrB,OAAO,IAAI,cAAc,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;QACxE,CAAC;QAED,UAAU,CAAC,GAAG,EAAE;YACf,MAAM,WAAW,GAAG,mBAAmB,CAAC,WAAW,CAAC,CAAC;YACrD,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC;YAC9B,QAAQ,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;YACrC,uBAAuB,GAAG,WAAW,CAAC,uBAAuB,CAAC;YAC9D,MAAM,UAAU,GAAG,SAAS;gBAC3B,CAAC,CAAC,SAAS;gBACX,CAAC,CAAC,mBAAmB,CAAC,EAAE,uBAAuB,EAAE,GAAG,iBAAiB,EAAE,CAAC,CAAC,IAAI,CAAC;YAC/E,cAAc,GAAG,UAAU,IAAI,UAAU,CAAC;YAE1C,IAAI,eAAe,KAAK,SAAS,EAAE;gBAClC,IAAI,UAAU,KAAK,SAAS,EAAE;oBAC7B,eAAe,CAAC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC,CAAC;iBAC9C;qBAAM;oBACN,eAAe,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;iBAC9B;aACD;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YACjD,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAClC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,EAC1D,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAC7E,CAAC;YAEF,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,MAAM,CAAC,gBAAgB,CAAC,aAAa,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAE/D,MAAM,MAAM,GAAW,aAAa,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,MAAM,CAAC,gBAAgB,CAAC,aAAa,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAE/D,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YACzB,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,MAAM,CAAC,gBAAgB,CAAC,aAAa,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAChE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;YAErC,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrG,SAAS,EAAE,CAAC;YACZ,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE5C,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,eAAe;YACf,MAAM,MAAM,GAAW,aAAa,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;YAE/D,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE5C,sCAAsC;YACtC,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE9C,eAAe;YACf,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;YAE7B,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE5C,yCAAyC;YACzC,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,oCAAoC;QACpC;YACC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,EAAE,EAAE,UAAU,EAAE;gBACtD,KAAK,IAAI,QAAQ,GAAG,UAAU,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE;oBACzD,EAAE,CAAC,qBAAqB,UAAU,OAAO,QAAQ,GAAG,EAAE,GAAG,EAAE;wBAC1D,MAAM,cAAc,GAAG;4BACtB,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;4BAC7C,QAAQ,CAAC,IAAI;4BACb,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;yBAC7C,CAAC;wBACF,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,EAAE,cAAc,CAAC,CAAC;wBAEzD,UAAU,CAAC,SAAS,CACnB,GAAG,MAAM,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAC1E,CAAC;wBACF,SAAS,EAAE,CAAC;wBACZ,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBAChG,SAAS,EAAE,CAAC;wBACZ,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAExF,MAAM,KAAK,GAAG;4BACb,KAAK,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,KAAK;4BAC/B,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK;yBAC3B,CAAC;wBACF,MAAM,aAAa,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC;wBACxE,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;wBAC1D,SAAS,EAAE,CAAC;wBAEZ,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC5C,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CACnF,CAAC,GAAG,aAAa,CACjB,CAAC;wBAEF,IAAI,CAAC,SAAS,EAAE;4BACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;yBAC7C;wBAED,eAAe;wBACf,MAAM,MAAM,GAAW,aAAa,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;wBAE/D,IAAI,CAAC,SAAS,EAAE;4BACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;yBAC7C;wBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC5C,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAExF,eAAe;wBACf,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;wBAE7B,IAAI,CAAC,SAAS,EAAE;4BACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;yBAC7C;wBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC5C,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CACnF,CAAC,GAAG,aAAa,CACjB,CAAC;oBACH,CAAC,CAAC,CAAC;iBACH;aACD;SACD;QAED,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAE9D,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtF,SAAS,EAAE,CAAC;YACZ,MAAM,WAAW,GAAG,CAAC,CAAC;YACtB,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;YACxF,SAAS,EAAE,CAAC;YACZ,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE5C,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,eAAe;YACf,MAAM,MAAM,GAAW,aAAa,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;YAE/D,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE5C,8DAA8D;YAC9D,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAE9C,eAAe;YACf,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;YAE7B,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE5C,yCAAyC;YACzC,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACtC,MAAM,SAAS,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,OAAO,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;YACrC,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YACxG,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;YAE7C,mDAAmD;YACnD,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/D,SAAS,EAAE,CAAC;YAEZ,yCAAyC;YACzC,MAAM,gBAAgB,GAAG,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;YAC5E,MAAM,EAAE,EAAE,EAAE,GAAG,cAAc,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3F,SAAS,EAAE,CAAC;YAEZ,sFAAsF;YACtF,IAAI,CAAC,SAAS,EAAE;gBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;aAC7C;YAED,yCAAyC;YACzC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;YAEzB,oCAAoC;YACpC,MAAM,cAAc,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACpF,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,IAAI,oBAAoB,KAAK,IAAI,EAAE;YAClC,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;gBACxC,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;gBACvC,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAEjE,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACvG,SAAS,EAAE,CAAC;gBACZ,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzF,SAAS,EAAE,CAAC;gBACZ,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,eAAe;gBACf,MAAM,MAAM,GAAW,aAAa,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;gBAE/D,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,MAAM,cAAc,GAAG,UAAU,CAAC,KAAK,CAAC;gBACxC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE1C,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxF,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE9C,8DAA8D;gBAC9D,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBAEjE,eAAe;gBACf,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBAE7B,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxF,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;gBACxC,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAChE,MAAM,UAAU,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;gBAExC,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxF,SAAS,EAAE,CAAC;gBACZ,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAChF,SAAS,EAAE,CAAC;gBACZ,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzF,SAAS,EAAE,CAAC;gBACZ,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,eAAe;gBACf,MAAM,MAAM,GAAW,aAAa,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;gBAE/D,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxF,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE9C,8DAA8D;gBAC9D,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBAEhE,eAAe;gBACf,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBAE7B,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxF,MAAM,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;gBAC1C,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;gBAE9D,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtF,SAAS,EAAE,CAAC;gBACZ,MAAM,WAAW,GAAG,EAAE,CAAC;gBACvB,MAAM,EAAE,EAAE,EAAE,GAAG,UAAU,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC,CAAC;gBACxF,SAAS,EAAE,CAAC;gBACZ,UAAU,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtF,SAAS,EAAE,CAAC;gBACZ,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,eAAe;gBACf,MAAM,MAAM,GAAW,aAAa,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;gBAE/D,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,8DAA8D;gBAC9D,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxF,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAE9C,eAAe;gBACf,IAAI,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;gBAE7B,IAAI,CAAC,SAAS,EAAE;oBACf,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;iBAC7C;gBAED,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAE5C,yCAAyC;gBACzC,MAAM,kBAAkB,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBACxF,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,QAAkB,EAAE,KAAyB;IACrE,MAAM,MAAM,GAA4C,EAAE,CAAC;IAC3D,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/D,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KAClE;IACD,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IACnF,OAAO,MAAM,CAAC;AACf,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { MockContainerRuntimeFactory } from '@fluidframework/test-runtime-utils';\nimport { expect } from 'chai';\nimport { noop } from '../../Common.js';\nimport { DetachedSequenceId, EditId, NodeId } from '../../Identifiers.js';\nimport { TreeNodeHandle } from '../../TreeNodeHandle.js';\nimport { SharedTree } from '../../SharedTree.js';\nimport { Change, StablePlace, StableRange } from '../../ChangeTypes.js';\nimport { deepCompareNodes } from '../../EditUtilities.js';\nimport { NodeData } from '../../persisted-types/index.js';\nimport { expectDefined } from './TestCommon.js';\nimport { buildLeaf, TestTree } from './TestNode.js';\nimport { setUpTestSharedTree, setUpTestTree, translateId } from './TestUtilities.js';\n\n/** Options used to generate a SharedTree undo/redo test suite. */\ninterface SharedTreeUndoRedoOptions {\n\t/** Determines if the tests should be run in local state or connected state with a remote SharedTree */\n\tlocalMode: boolean;\n\t/** Title used for the test suite describe block. */\n\ttitle: string;\n\t/** Function for undoing an edit on a given tree. */\n\tundo: (tree: SharedTree, editId: EditId) => EditId | undefined;\n\t/** Function for redoing an edit on a given tree. */\n\tredo: (tree: SharedTree, editId: EditId) => EditId | undefined;\n\t/** Optional additional setup to run in a beforeEach block that takes the SharedTrees used in the tests. */\n\tbeforeEach?: (trees: SharedTree[]) => void;\n\t/**\n\t * Function to run after edits. Used for testing the SharedTreeUndoRedoHandler in order to close stack\n\t * operations between edits.\n\t */\n\tafterEdit?: () => void;\n\t/** If true, runs tests for out-of-order undo/redo. True by default. */\n\ttestOutOfOrderRevert?: boolean;\n}\n\n/**\n * Runs undo/redo tests for SharedTree\n */\nexport function runSharedTreeUndoRedoTestSuite(options: SharedTreeUndoRedoOptions): void {\n\tconst { localMode, title, undo, redo, beforeEach: additionalSetup } = options;\n\tconst afterEdit = options.afterEdit ?? noop;\n\tconst testOutOfOrderRevert = options.testOutOfOrderRevert ?? true;\n\n\tconst treeOptions = {\n\t\tlocalMode,\n\t\tallowInvalid: true,\n\t\tallowMalformed: true,\n\t};\n\n\tconst secondTreeOptions = {\n\t\tlocalMode,\n\t\tid: 'secondTestTree',\n\t\tallowInvalid: true,\n\t};\n\n\tdescribe(title, () => {\n\t\tlet testTree: TestTree;\n\t\tlet sharedTree: SharedTree;\n\t\tlet undoSharedTree: SharedTree;\n\t\tlet containerRuntimeFactory: MockContainerRuntimeFactory;\n\n\t\tfunction getTreeHandle() {\n\t\t\treturn new TreeNodeHandle(sharedTree.currentView, testTree.identifier);\n\t\t}\n\n\t\tbeforeEach(() => {\n\t\t\tconst setupResult = setUpTestSharedTree(treeOptions);\n\t\t\tsharedTree = setupResult.tree;\n\t\t\ttestTree = setUpTestTree(sharedTree);\n\t\t\tcontainerRuntimeFactory = setupResult.containerRuntimeFactory;\n\t\t\tconst secondTree = localMode\n\t\t\t\t? undefined\n\t\t\t\t: setUpTestSharedTree({ containerRuntimeFactory, ...secondTreeOptions }).tree;\n\t\t\tundoSharedTree = secondTree ?? sharedTree;\n\n\t\t\tif (additionalSetup !== undefined) {\n\t\t\t\tif (secondTree !== undefined) {\n\t\t\t\t\tadditionalSetup([sharedTree, undoSharedTree]);\n\t\t\t\t} else {\n\t\t\t\t\tadditionalSetup([sharedTree]);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tit('can detach and re-insert the same node', () => {\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\tconst { id } = sharedTree.applyEdit(\n\t\t\t\tChange.detach(StableRange.only(testTree.left), detachedId),\n\t\t\t\tChange.insert(detachedId, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\texpect(deepCompareNodes(getTreeHandle(), testTree)).to.be.true;\n\n\t\t\tconst undoId: EditId = expectDefined(undo(sharedTree, id));\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\texpect(deepCompareNodes(getTreeHandle(), testTree)).to.be.true;\n\n\t\t\tredo(sharedTree, undoId);\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\texpect(deepCompareNodes(getTreeHandle(), testTree)).to.be.true;\n\t\t});\n\n\t\tit('works for Insert', () => {\n\t\t\tconst newNode = testTree.buildLeaf();\n\n\t\t\tconst { id } = sharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));\n\t\t\tafterEdit();\n\t\t\texpect(sharedTree.edits.length).to.equal(2);\n\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\t// Undo testing\n\t\t\tconst undoId: EditId = expectDefined(undo(undoSharedTree, id));\n\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\texpect(sharedTree.edits.length).to.equal(3);\n\n\t\t\t// Check the inserted node was deleted\n\t\t\tconst leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\texpect(leftTraitAfterUndo.length).to.equal(1);\n\n\t\t\t// Redo testing\n\t\t\tredo(undoSharedTree, undoId);\n\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\texpect(sharedTree.edits.length).to.equal(4);\n\n\t\t\t// Check the inserted node was reinserted\n\t\t\tconst leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\texpect(leftTraitAfterRedo.length).to.equal(2);\n\t\t});\n\n\t\t// Scope of detach code and fixtures\n\t\t{\n\t\t\tfor (let startIndex = 0; startIndex < 8; ++startIndex) {\n\t\t\t\tfor (let endIndex = startIndex; endIndex < 8; ++endIndex) {\n\t\t\t\t\tit(`works for Detach [${startIndex} -> ${endIndex}]`, () => {\n\t\t\t\t\t\tconst leftTraitNodes = [\n\t\t\t\t\t\t\ttestTree.buildLeaf(testTree.generateNodeId()),\n\t\t\t\t\t\t\ttestTree.left,\n\t\t\t\t\t\t\ttestTree.buildLeaf(testTree.generateNodeId()),\n\t\t\t\t\t\t];\n\t\t\t\t\t\tconst places = leftTraitPlaces(testTree, leftTraitNodes);\n\n\t\t\t\t\t\tsharedTree.applyEdit(\n\t\t\t\t\t\t\t...Change.insertTree(leftTraitNodes[0], StablePlace.before(testTree.left))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tafterEdit();\n\t\t\t\t\t\tsharedTree.applyEdit(...Change.insertTree(leftTraitNodes[2], StablePlace.after(testTree.left)));\n\t\t\t\t\t\tafterEdit();\n\t\t\t\t\t\texpect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(3);\n\n\t\t\t\t\t\tconst range = {\n\t\t\t\t\t\t\tstart: places[startIndex].place,\n\t\t\t\t\t\t\tend: places[endIndex].place,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tconst countDetached = places[endIndex].index - places[startIndex].index;\n\t\t\t\t\t\tconst { id } = sharedTree.applyEdit(Change.delete(range));\n\t\t\t\t\t\tafterEdit();\n\n\t\t\t\t\t\texpect(sharedTree.edits.length).to.equal(4);\n\t\t\t\t\t\texpect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(\n\t\t\t\t\t\t\t3 - countDetached\n\t\t\t\t\t\t);\n\n\t\t\t\t\t\tif (!localMode) {\n\t\t\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Undo testing\n\t\t\t\t\t\tconst undoId: EditId = expectDefined(undo(undoSharedTree, id));\n\n\t\t\t\t\t\tif (!localMode) {\n\t\t\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\texpect(sharedTree.edits.length).to.equal(5);\n\t\t\t\t\t\texpect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(3);\n\n\t\t\t\t\t\t// Redo testing\n\t\t\t\t\t\tredo(undoSharedTree, undoId);\n\n\t\t\t\t\t\tif (!localMode) {\n\t\t\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\texpect(sharedTree.edits.length).to.equal(6);\n\t\t\t\t\t\texpect(sharedTree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(\n\t\t\t\t\t\t\t3 - countDetached\n\t\t\t\t\t\t);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tit('works for SetValue', () => {\n\t\t\tconst newNode = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\tsharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));\n\t\t\tafterEdit();\n\t\t\tconst testPayload = 5;\n\t\t\tconst { id } = sharedTree.applyEdit(Change.setPayload(newNode.identifier, testPayload));\n\t\t\tafterEdit();\n\t\t\texpect(sharedTree.edits.length).to.equal(3);\n\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\t// Undo testing\n\t\t\tconst undoId: EditId = expectDefined(undo(undoSharedTree, id));\n\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\texpect(sharedTree.edits.length).to.equal(4);\n\n\t\t\t// Check the node whose value was set now has an empty payload\n\t\t\tconst leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\tconst nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);\n\t\t\texpect(nodeAfterUndo.payload).to.be.undefined;\n\n\t\t\t// Redo testing\n\t\t\tredo(undoSharedTree, undoId);\n\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\texpect(sharedTree.edits.length).to.equal(5);\n\n\t\t\t// Check the inserted node was reinserted\n\t\t\tconst leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\tconst nodeAfterRedo = sharedTree.currentView.getViewNode(leftTraitAfterRedo[1]);\n\t\t\texpect(nodeAfterRedo.payload).equal(testPayload);\n\t\t});\n\n\t\tit('works for conflicting edits', () => {\n\t\t\tconst newNodeId = sharedTree.generateNodeId();\n\t\t\tconst newNode = buildLeaf(newNodeId);\n\t\t\tsharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.atStartOf(testTree.left.traitLocation)));\n\t\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t\t// First tree deletes the new node under left trait\n\t\t\tsharedTree.applyEdit(Change.detach(StableRange.only(newNode)));\n\t\t\tafterEdit();\n\n\t\t\t// Second tree also deletes new left node\n\t\t\tconst translatedNodeId = translateId(newNodeId, sharedTree, undoSharedTree);\n\t\t\tconst { id } = undoSharedTree.applyEdit(Change.detach(StableRange.only(translatedNodeId)));\n\t\t\tafterEdit();\n\n\t\t\t// Synchronize; the first tree's edit will apply but the second tree's will be invalid\n\t\t\tif (!localMode) {\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t}\n\n\t\t\t// The undo should succeed but do nothing\n\t\t\tundo(undoSharedTree, id);\n\n\t\t\t// Check that the undo had no effect\n\t\t\tconst traitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\texpect(traitAfterUndo.length).equals(1);\n\t\t});\n\n\t\tif (testOutOfOrderRevert === true) {\n\t\t\tit('works for out-of-order Insert', () => {\n\t\t\t\tconst firstNode = testTree.buildLeaf();\n\t\t\t\tconst secondNode = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\t\tconst { id } = sharedTree.applyEdit(...Change.insertTree(firstNode, StablePlace.after(testTree.left)));\n\t\t\t\tafterEdit();\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(secondNode, StablePlace.after(testTree.left)));\n\t\t\t\tafterEdit();\n\t\t\t\texpect(sharedTree.edits.length).to.equal(3);\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\t// Undo testing\n\t\t\t\tconst undoId: EditId = expectDefined(undo(undoSharedTree, id));\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\tconst editsAfterUndo = sharedTree.edits;\n\t\t\t\texpect(editsAfterUndo.length).to.equal(4);\n\n\t\t\t\tconst leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTraitAfterUndo.length).to.equal(2);\n\n\t\t\t\t// Check that the node under the left trait is the second node\n\t\t\t\tconst nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);\n\t\t\t\texpect(nodeAfterUndo.identifier).to.equal(secondNode.identifier);\n\n\t\t\t\t// Redo testing\n\t\t\t\tredo(undoSharedTree, undoId);\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\texpect(sharedTree.edits.length).to.equal(5);\n\n\t\t\t\tconst leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTraitAfterRedo.length).to.equal(3);\n\t\t\t});\n\n\t\t\tit('works for out-of-order Detach', () => {\n\t\t\t\tconst firstNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\t\tconst secondNode = testTree.buildLeaf();\n\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(firstNode, StablePlace.after(testTree.left)));\n\t\t\t\tafterEdit();\n\t\t\t\tconst { id } = sharedTree.applyEdit(Change.delete(StableRange.only(firstNode)));\n\t\t\t\tafterEdit();\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(secondNode, StablePlace.after(testTree.left)));\n\t\t\t\tafterEdit();\n\t\t\t\texpect(sharedTree.edits.length).to.equal(4);\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\t// Undo testing\n\t\t\t\tconst undoId: EditId = expectDefined(undo(undoSharedTree, id));\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\texpect(sharedTree.edits.length).to.equal(5);\n\n\t\t\t\tconst leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTraitAfterUndo.length).to.equal(3);\n\n\t\t\t\t// Check the first node is the second one under the left trait\n\t\t\t\tconst nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);\n\t\t\t\texpect(nodeAfterUndo.identifier).to.equal(firstNode.identifier);\n\n\t\t\t\t// Redo testing\n\t\t\t\tredo(undoSharedTree, undoId);\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\texpect(sharedTree.edits.length).to.equal(6);\n\n\t\t\t\tconst leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\texpect(leftTraitAfterRedo.length).to.equal(2);\n\t\t\t});\n\n\t\t\tit('works for out-of-order SetValue', () => {\n\t\t\t\tconst newNode = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));\n\t\t\t\tafterEdit();\n\t\t\t\tconst testPayload = 10;\n\t\t\t\tconst { id } = sharedTree.applyEdit(Change.setPayload(newNode.identifier, testPayload));\n\t\t\t\tafterEdit();\n\t\t\t\tsharedTree.applyEdit(...Change.insertTree(newNode, StablePlace.after(testTree.left)));\n\t\t\t\tafterEdit();\n\t\t\t\texpect(sharedTree.edits.length).to.equal(4);\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\t// Undo testing\n\t\t\t\tconst undoId: EditId = expectDefined(undo(undoSharedTree, id));\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\texpect(sharedTree.edits.length).to.equal(5);\n\n\t\t\t\t// Check the node whose value was set now has an empty payload\n\t\t\t\tconst leftTraitAfterUndo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\tconst nodeAfterUndo = sharedTree.currentView.getViewNode(leftTraitAfterUndo[1]);\n\t\t\t\texpect(nodeAfterUndo.payload).to.be.undefined;\n\n\t\t\t\t// Redo testing\n\t\t\t\tredo(undoSharedTree, undoId);\n\n\t\t\t\tif (!localMode) {\n\t\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\t}\n\n\t\t\t\texpect(sharedTree.edits.length).to.equal(6);\n\n\t\t\t\t// Check the inserted node was reinserted\n\t\t\t\tconst leftTraitAfterRedo = sharedTree.currentView.getTrait(testTree.left.traitLocation);\n\t\t\t\tconst nodeAfterRedo = sharedTree.currentView.getViewNode(leftTraitAfterRedo[1]);\n\t\t\t\texpect(nodeAfterRedo.payload).equal(testPayload);\n\t\t\t});\n\t\t}\n\t});\n}\n\n/**\n * Generate all possible places in the given trait\n */\nfunction leftTraitPlaces(testTree: TestTree, trait: NodeData<NodeId>[]): { index: number; place: StablePlace }[] {\n\tconst places: { index: number; place: StablePlace }[] = [];\n\tplaces.push({ index: 0, place: StablePlace.atStartOf(testTree.left.traitLocation) });\n\tfor (let i = 0; i < trait.length; i++) {\n\t\tplaces.push({ index: i, place: StablePlace.before(trait[i]) });\n\t\tplaces.push({ index: i + 1, place: StablePlace.after(trait[i]) });\n\t}\n\tplaces.push({ index: 3, place: StablePlace.atEndOf(testTree.left.traitLocation) });\n\treturn places;\n}\n"]}