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

package/lib/test/TreeView.tests.js

@@ -1,178 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from 'assert';
-import { expect } from 'chai';
-import { validateAssertionError } from '@fluidframework/test-runtime-utils';
-import { RevisionView } from '../RevisionView.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-import { expectDefined } from './utilities/TestCommon.js';
-describe('TreeView', () => {
-    const testTree = refreshTestTree();
-    describe('can compute deltas', () => {
-        it('that are the same object', () => {
-            const view = testTree.view;
-            expect(view.delta(view)).deep.equals({
-                changed: [],
-                added: [],
-                removed: [],
-            });
-        });
-        it('that have the same tree', () => {
-            const viewA = RevisionView.fromTree(testTree);
-            const viewB = RevisionView.fromTree(testTree);
-            expect(viewA.delta(viewB)).deep.equals({
-                changed: [],
-                added: [],
-                removed: [],
-            });
-        });
-        it('with different root ids', () => {
-            const viewA = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));
-            const viewB = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));
-            assert.throws(() => viewA.delta(viewB), (e) => validateAssertionError(e, 'Delta can only be calculated between views that share a root'));
-        });
-        it('with different subtrees', () => {
-            const rootId = testTree.generateNodeId();
-            const leafA = testTree.buildLeaf(testTree.generateNodeId());
-            const leafB = testTree.buildLeaf(testTree.generateNodeId());
-            const subtreeA = {
-                identifier: testTree.generateNodeId(),
-                definition: 'node',
-                traits: { children: [leafA] },
-            };
-            const subtreeB = {
-                identifier: testTree.generateNodeId(),
-                definition: 'node',
-                traits: { children: [leafB] },
-            };
-            const rootA = {
-                identifier: rootId,
-                definition: 'node',
-                traits: {
-                    children: [subtreeA],
-                },
-            };
-            const rootB = {
-                identifier: rootId,
-                definition: 'node',
-                traits: {
-                    children: [subtreeB],
-                },
-            };
-            const viewA = RevisionView.fromTree(rootA);
-            const viewB = RevisionView.fromTree(rootB);
-            const delta = viewA.delta(viewB);
-            expect(delta.changed).deep.equals([rootId]);
-            expect(delta.removed.length).equals(2);
-            expect(delta.added.length).equals(2);
-            expect(delta.removed).contains(subtreeA.identifier);
-            expect(delta.removed).contains(leafA.identifier);
-            expect(delta.added).contains(subtreeB.identifier);
-            expect(delta.added).contains(leafB.identifier);
-        });
-        it('with different payloads', () => {
-            const rootId = testTree.generateNodeId();
-            const nodeA = {
-                identifier: rootId,
-                definition: 'node',
-                payload: 'test1',
-                traits: {},
-            };
-            const nodeB = {
-                identifier: rootId,
-                definition: 'node',
-                payload: 'test2',
-                traits: {},
-            };
-            const viewA = RevisionView.fromTree(nodeA);
-            const viewB = RevisionView.fromTree(nodeB);
-            const delta = viewA.delta(viewB);
-            expect(delta.changed).deep.equals([rootId]);
-            expect(delta.removed).deep.equals([]);
-            expect(delta.added).deep.equals([]);
-        });
-        it('after an insert', () => {
-            const viewA = testTree.view;
-            const insertedNode = testTree.buildLeaf(testTree.generateNodeId());
-            const treeB = {
-                identifier: testTree.identifier,
-                definition: testTree.definition,
-                traits: { ...testTree.traits, left: [insertedNode, testTree.left] },
-            };
-            const viewB = RevisionView.fromTree(treeB);
-            const delta = viewA.delta(viewB);
-            expect(delta.changed).deep.equals([testTree.identifier]);
-            expect(delta.removed).deep.equals([]);
-            expect(delta.added).deep.equals([insertedNode.identifier]);
-        });
-        it('after a delete', () => {
-            const viewA = testTree.view;
-            const treeB = {
-                identifier: testTree.identifier,
-                definition: testTree.definition,
-                traits: { ...testTree.traits, left: [] },
-            };
-            const viewB = RevisionView.fromTree(treeB);
-            const delta = viewA.delta(viewB);
-            expect(delta.changed).deep.equals([testTree.identifier]);
-            expect(delta.removed).deep.equals([testTree.left.identifier]);
-            expect(delta.added).deep.equals([]);
-        });
-        it('after a move', () => {
-            const viewA = testTree.view;
-            const treeB = {
-                identifier: testTree.identifier,
-                definition: testTree.definition,
-                traits: { ...testTree.traits, left: [], right: [testTree.right, testTree.left] },
-            };
-            const viewB = RevisionView.fromTree(treeB);
-            const delta = viewA.delta(viewB);
-            expect(delta.changed).deep.equals([testTree.identifier]);
-            expect(delta.removed).deep.equals([]);
-            expect(delta.added).deep.equals([]);
-        });
-    });
-    it('correctly returns node parentage', () => {
-        const view = testTree.view;
-        for (const node of view) {
-            const parentNode = view.tryGetParentViewNode(node.identifier);
-            if (parentNode !== undefined) {
-                const parentage = expectDefined(node.parentage);
-                expect(parentage.label).to.equal(view.getTraitLabel(node.identifier));
-                expect(parentage.parent).to.equal(parentNode.identifier);
-            }
-        }
-    });
-    // Regression test for the issue fixed in #9824
-    it('can be iterated in a consistent order', () => {
-        const [id1, id2, id3] = Array.from({ length: 3 }).map(() => testTree.generateNodeId());
-        const label1 = 'traitLabelA';
-        const label2 = 'traitLabelB';
-        const { definition } = testTree;
-        const tree1 = {
-            identifier: id1,
-            definition,
-            traits: {
-                [label1]: [{ identifier: id2, definition, traits: {} }],
-                [label2]: [{ identifier: id3, definition, traits: {} }],
-            },
-        };
-        // Like tree1, but defined with the labels in the opposite order and with different node ids under each trait.
-        const tree2 = {
-            identifier: id1,
-            definition,
-            traits: {
-                [label2]: [{ identifier: id2, definition, traits: {} }],
-                [label1]: [{ identifier: id3, definition, traits: {} }],
-            },
-        };
-        const view1 = RevisionView.fromTree(tree1);
-        const view2 = RevisionView.fromTree(tree2);
-        expect(Array.from(view1).map((node) => node.identifier)).to.deep.equal([id1, id2, id3]);
-        // Child iteration should be sorted on trait labels.
-        expect(Array.from(view2).map((node) => node.identifier)).to.deep.equal([id1, id3, id2]);
-    });
-});
-//# sourceMappingURL=TreeView.tests.js.map

package/lib/test/TreeView.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TreeView.tests.js","sourceRoot":"","sources":["../../src/test/TreeView.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAE5E,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACzB,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QACnC,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACpC,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAW,QAAQ,CAAC,CAAC;YACxD,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAW,QAAQ,CAAC,CAAC;YACxD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACtC,OAAO,EAAE,EAAE;gBACX,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,EAAE;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YACnF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YACnF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EACxB,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,8DAA8D,CAAC,CACvG,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YAEzC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAE5D,MAAM,QAAQ,GAAG;gBAChB,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACrC,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE;aAC7B,CAAC;YACF,MAAM,QAAQ,GAAG;gBAChB,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACrC,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE;aAC7B,CAAC;YAEF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE;oBACP,QAAQ,EAAE,CAAC,QAAQ,CAAC;iBACpB;aACD,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,MAAM,EAAE;oBACP,QAAQ,EAAE,CAAC,QAAQ,CAAC;iBACpB;aACD,CAAC;YAEF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACpD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAClD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,OAAO,EAAE,OAAO;gBAChB,MAAM,EAAE,EAAE;aACV,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,MAAoB;gBAChC,OAAO,EAAE,OAAO;gBAChB,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YACnE,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE;aACnE,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE;aACxC,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC5B,MAAM,KAAK,GAAe;gBACzB,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;gBAC/B,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE;aAChF,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC9D,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAChD,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;aACzD;SACD;IACF,CAAC,CAAC,CAAC;IAEH,+CAA+C;IAC/C,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,aAA2B,CAAC;QAC3C,MAAM,MAAM,GAAG,aAA2B,CAAC;QAC3C,MAAM,EAAE,UAAU,EAAE,GAAG,QAAQ,CAAC;QAChC,MAAM,KAAK,GAAe;YACzB,UAAU,EAAE,GAAG;YACf,UAAU;YACV,MAAM,EAAE;gBACP,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;gBACvD,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;aACvD;SACD,CAAC;QACF,8GAA8G;QAC9G,MAAM,KAAK,GAAe;YACzB,UAAU,EAAE,GAAG;YACf,UAAU;YACV,MAAM,EAAE;gBACP,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;gBACvD,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;aACvD;SACD,CAAC;QACF,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxF,oDAAoD;QACpD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from 'assert';\nimport { expect } from 'chai';\nimport { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { Definition, TraitLabel } from '../Identifiers.js';\nimport { RevisionView } from '../RevisionView.js';\nimport { ChangeNode } from '../persisted-types/index.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\nimport { TestNode } from './utilities/TestNode.js';\nimport { expectDefined } from './utilities/TestCommon.js';\n\ndescribe('TreeView', () => {\n\tconst testTree = refreshTestTree();\n\n\tdescribe('can compute deltas', () => {\n\t\tit('that are the same object', () => {\n\t\t\tconst view = testTree.view;\n\t\t\texpect(view.delta(view)).deep.equals({\n\t\t\t\tchanged: [],\n\t\t\t\tadded: [],\n\t\t\t\tremoved: [],\n\t\t\t});\n\t\t});\n\n\t\tit('that have the same tree', () => {\n\t\t\tconst viewA = RevisionView.fromTree<TestNode>(testTree);\n\t\t\tconst viewB = RevisionView.fromTree<TestNode>(testTree);\n\t\t\texpect(viewA.delta(viewB)).deep.equals({\n\t\t\t\tchanged: [],\n\t\t\t\tadded: [],\n\t\t\t\tremoved: [],\n\t\t\t});\n\t\t});\n\n\t\tit('with different root ids', () => {\n\t\t\tconst viewA = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));\n\t\t\tconst viewB = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));\n\t\t\tassert.throws(\n\t\t\t\t() => viewA.delta(viewB),\n\t\t\t\t(e: Error) => validateAssertionError(e, 'Delta can only be calculated between views that share a root')\n\t\t\t);\n\t\t});\n\n\t\tit('with different subtrees', () => {\n\t\t\tconst rootId = testTree.generateNodeId();\n\n\t\t\tconst leafA = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\tconst leafB = testTree.buildLeaf(testTree.generateNodeId());\n\n\t\t\tconst subtreeA = {\n\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: { children: [leafA] },\n\t\t\t};\n\t\t\tconst subtreeB = {\n\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: { children: [leafB] },\n\t\t\t};\n\n\t\t\tconst rootA: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\tchildren: [subtreeA],\n\t\t\t\t},\n\t\t\t};\n\t\t\tconst rootB: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\tchildren: [subtreeB],\n\t\t\t\t},\n\t\t\t};\n\n\t\t\tconst viewA = RevisionView.fromTree(rootA);\n\t\t\tconst viewB = RevisionView.fromTree(rootB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([rootId]);\n\t\t\texpect(delta.removed.length).equals(2);\n\t\t\texpect(delta.added.length).equals(2);\n\t\t\texpect(delta.removed).contains(subtreeA.identifier);\n\t\t\texpect(delta.removed).contains(leafA.identifier);\n\t\t\texpect(delta.added).contains(subtreeB.identifier);\n\t\t\texpect(delta.added).contains(leafB.identifier);\n\t\t});\n\n\t\tit('with different payloads', () => {\n\t\t\tconst rootId = testTree.generateNodeId();\n\t\t\tconst nodeA: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\tpayload: 'test1',\n\t\t\t\ttraits: {},\n\t\t\t};\n\t\t\tconst nodeB: ChangeNode = {\n\t\t\t\tidentifier: rootId,\n\t\t\t\tdefinition: 'node' as Definition,\n\t\t\t\tpayload: 'test2',\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\tconst viewA = RevisionView.fromTree(nodeA);\n\t\t\tconst viewB = RevisionView.fromTree(nodeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([rootId]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\n\t\tit('after an insert', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst insertedNode = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [insertedNode, testTree.left] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([insertedNode.identifier]);\n\t\t});\n\n\t\tit('after a delete', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([testTree.left.identifier]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\n\t\tit('after a move', () => {\n\t\t\tconst viewA = testTree.view;\n\t\t\tconst treeB: ChangeNode = {\n\t\t\t\tidentifier: testTree.identifier,\n\t\t\t\tdefinition: testTree.definition,\n\t\t\t\ttraits: { ...testTree.traits, left: [], right: [testTree.right, testTree.left] },\n\t\t\t};\n\t\t\tconst viewB = RevisionView.fromTree(treeB);\n\t\t\tconst delta = viewA.delta(viewB);\n\t\t\texpect(delta.changed).deep.equals([testTree.identifier]);\n\t\t\texpect(delta.removed).deep.equals([]);\n\t\t\texpect(delta.added).deep.equals([]);\n\t\t});\n\t});\n\n\tit('correctly returns node parentage', () => {\n\t\tconst view = testTree.view;\n\t\tfor (const node of view) {\n\t\t\tconst parentNode = view.tryGetParentViewNode(node.identifier);\n\t\t\tif (parentNode !== undefined) {\n\t\t\t\tconst parentage = expectDefined(node.parentage);\n\t\t\t\texpect(parentage.label).to.equal(view.getTraitLabel(node.identifier));\n\t\t\t\texpect(parentage.parent).to.equal(parentNode.identifier);\n\t\t\t}\n\t\t}\n\t});\n\n\t// Regression test for the issue fixed in #9824\n\tit('can be iterated in a consistent order', () => {\n\t\tconst [id1, id2, id3] = Array.from({ length: 3 }).map(() => testTree.generateNodeId());\n\t\tconst label1 = 'traitLabelA' as TraitLabel;\n\t\tconst label2 = 'traitLabelB' as TraitLabel;\n\t\tconst { definition } = testTree;\n\t\tconst tree1: ChangeNode = {\n\t\t\tidentifier: id1,\n\t\t\tdefinition,\n\t\t\ttraits: {\n\t\t\t\t[label1]: [{ identifier: id2, definition, traits: {} }],\n\t\t\t\t[label2]: [{ identifier: id3, definition, traits: {} }],\n\t\t\t},\n\t\t};\n\t\t// Like tree1, but defined with the labels in the opposite order and with different node ids under each trait.\n\t\tconst tree2: ChangeNode = {\n\t\t\tidentifier: id1,\n\t\t\tdefinition,\n\t\t\ttraits: {\n\t\t\t\t[label2]: [{ identifier: id2, definition, traits: {} }],\n\t\t\t\t[label1]: [{ identifier: id3, definition, traits: {} }],\n\t\t\t},\n\t\t};\n\t\tconst view1 = RevisionView.fromTree(tree1);\n\t\tconst view2 = RevisionView.fromTree(tree2);\n\t\texpect(Array.from(view1).map((node) => node.identifier)).to.deep.equal([id1, id2, id3]);\n\t\t// Child iteration should be sorted on trait labels.\n\t\texpect(Array.from(view2).map((node) => node.identifier)).to.deep.equal([id1, id3, id2]);\n\t});\n});\n"]}

package/lib/test/UndoRedoHandler.tests.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=UndoRedoHandler.tests.d.ts.map

package/lib/test/UndoRedoHandler.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"UndoRedoHandler.tests.d.ts","sourceRoot":"","sources":["../../src/test/UndoRedoHandler.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/UndoRedoHandler.tests.js

@@ -1,37 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { UndoRedoStackManager } from '@fluidframework/undo-redo';
-import { SharedTreeUndoRedoHandler } from '../UndoRedoHandler.js';
-import { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests.js';
-describe('SharedTreeUndoRedoHandler', () => {
-    let undoRedoStack;
-    let handler;
-    const undoRedoOptions = {
-        beforeEach: (trees) => {
-            undoRedoStack = new UndoRedoStackManager();
-            handler = new SharedTreeUndoRedoHandler(undoRedoStack);
-            // Attach each tree to the handler
-            trees.forEach((tree) => handler.attachTree(tree));
-        },
-        undo: (tree, editId) => {
-            undoRedoStack.undoOperation();
-            // Returns a dummy edit id in order to satisfy the interface.
-            return 'aa26ef18-76a9-4238-9c29-9b796d21ef5a';
-        },
-        redo: (tree, editId) => {
-            undoRedoStack.redoOperation();
-            // Returns a dummy edit id in order to satisfy the interface.
-            return 'aa26ef18-76a9-4238-9c29-9b796d21ef5a';
-        },
-        afterEdit: () => {
-            undoRedoStack.closeCurrentOperation();
-        },
-        // The SharedTreeUndoRedoHandler does not support out of order revert.
-        testOutOfOrderRevert: false,
-    };
-    runSharedTreeUndoRedoTestSuite({ localMode: true, title: 'in local mode', ...undoRedoOptions });
-    runSharedTreeUndoRedoTestSuite({ localMode: false, title: 'in connected mode', ...undoRedoOptions });
-});
-//# sourceMappingURL=UndoRedoHandler.tests.js.map

package/lib/test/UndoRedoHandler.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"UndoRedoHandler.tests.js","sourceRoot":"","sources":["../../src/test/UndoRedoHandler.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAGjE,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAC;AAClE,OAAO,EAAE,8BAA8B,EAAE,MAAM,8BAA8B,CAAC;AAE9E,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IAC1C,IAAI,aAAmC,CAAC;IACxC,IAAI,OAAkC,CAAC;IAEvC,MAAM,eAAe,GAAG;QACvB,UAAU,EAAE,CAAC,KAAmB,EAAE,EAAE;YACnC,aAAa,GAAG,IAAI,oBAAoB,EAAE,CAAC;YAC3C,OAAO,GAAG,IAAI,yBAAyB,CAAC,aAAa,CAAC,CAAC;YAEvD,kCAAkC;YAClC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,EAAE,CAAC,IAAgB,EAAE,MAAc,EAAE,EAAE;YAC1C,aAAa,CAAC,aAAa,EAAE,CAAC;YAE9B,6DAA6D;YAC7D,OAAO,sCAAgD,CAAC;QACzD,CAAC;QACD,IAAI,EAAE,CAAC,IAAgB,EAAE,MAAc,EAAE,EAAE;YAC1C,aAAa,CAAC,aAAa,EAAE,CAAC;YAE9B,6DAA6D;YAC7D,OAAO,sCAAgD,CAAC;QACzD,CAAC;QACD,SAAS,EAAE,GAAG,EAAE;YACf,aAAa,CAAC,qBAAqB,EAAE,CAAC;QACvC,CAAC;QACD,sEAAsE;QACtE,oBAAoB,EAAE,KAAK;KAC3B,CAAC;IAEF,8BAA8B,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;IAChG,8BAA8B,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,GAAG,eAAe,EAAE,CAAC,CAAC;AACtG,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { UndoRedoStackManager } from '@fluidframework/undo-redo';\nimport { EditId } from '../Identifiers.js';\nimport { SharedTree } from '../SharedTree.js';\nimport { SharedTreeUndoRedoHandler } from '../UndoRedoHandler.js';\nimport { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests.js';\n\ndescribe('SharedTreeUndoRedoHandler', () => {\n\tlet undoRedoStack: UndoRedoStackManager;\n\tlet handler: SharedTreeUndoRedoHandler;\n\n\tconst undoRedoOptions = {\n\t\tbeforeEach: (trees: SharedTree[]) => {\n\t\t\tundoRedoStack = new UndoRedoStackManager();\n\t\t\thandler = new SharedTreeUndoRedoHandler(undoRedoStack);\n\n\t\t\t// Attach each tree to the handler\n\t\t\ttrees.forEach((tree) => handler.attachTree(tree));\n\t\t},\n\t\tundo: (tree: SharedTree, editId: EditId) => {\n\t\t\tundoRedoStack.undoOperation();\n\n\t\t\t// Returns a dummy edit id in order to satisfy the interface.\n\t\t\treturn 'aa26ef18-76a9-4238-9c29-9b796d21ef5a' as EditId;\n\t\t},\n\t\tredo: (tree: SharedTree, editId: EditId) => {\n\t\t\tundoRedoStack.redoOperation();\n\n\t\t\t// Returns a dummy edit id in order to satisfy the interface.\n\t\t\treturn 'aa26ef18-76a9-4238-9c29-9b796d21ef5a' as EditId;\n\t\t},\n\t\tafterEdit: () => {\n\t\t\tundoRedoStack.closeCurrentOperation();\n\t\t},\n\t\t// The SharedTreeUndoRedoHandler does not support out of order revert.\n\t\ttestOutOfOrderRevert: false,\n\t};\n\n\trunSharedTreeUndoRedoTestSuite({ localMode: true, title: 'in local mode', ...undoRedoOptions });\n\trunSharedTreeUndoRedoTestSuite({ localMode: false, title: 'in connected mode', ...undoRedoOptions });\n});\n"]}

package/lib/test/fuzz/Generators.d.ts

@@ -1,8 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { AsyncGenerator } from '@fluid-private/stochastic-test-utils';
-import { FuzzTestState, Operation, OperationGenerationConfig } from './Types.js';
-export declare function makeOpGenerator(passedConfig: OperationGenerationConfig): AsyncGenerator<Operation, FuzzTestState>;
-//# sourceMappingURL=Generators.d.ts.map

package/lib/test/fuzz/Generators.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Generators.d.ts","sourceRoot":"","sources":["../../../src/test/fuzz/Generators.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAEN,cAAc,EAMd,MAAM,sCAAsC,CAAC;AAO9C,OAAO,EAMN,aAAa,EAGb,SAAS,EACT,yBAAyB,EAGzB,MAAM,YAAY,CAAC;AAgXpB,wBAAgB,eAAe,CAAC,YAAY,EAAE,yBAAyB,GAAG,cAAc,CAAC,SAAS,EAAE,aAAa,CAAC,CA6BjH"}

package/lib/test/fuzz/Generators.js

@@ -1,345 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IsoBuffer } from '@fluid-internal/client-utils';
-import { createWeightedAsyncGenerator, done, makeRandom, } from '@fluid-private/stochastic-test-utils';
-import { Side, WriteFormat } from '../../persisted-types/index.js';
-import { ChangeType, StablePlace, StableRange } from '../../ChangeTypes.js';
-import { fail } from '../../Common.js';
-import { rangeFromStableRange } from '../../TreeViewUtilities.js';
-const defaultJoinConfig = {
-    maximumActiveCollaborators: 10,
-    maximumPassiveCollaborators: 10,
-    writeFormat: [WriteFormat.v0_0_2, WriteFormat.v0_1_1],
-    summarizeHistory: [false],
-};
-function makeJoinGenerator(passedConfig) {
-    const config = { ...defaultJoinConfig, ...passedConfig };
-    return async ({ random, activeCollaborators, passiveCollaborators }) => {
-        const activeAllowed = activeCollaborators.length < config.maximumActiveCollaborators;
-        const passiveAllowed = passiveCollaborators.length < config.maximumPassiveCollaborators;
-        const isObserver = activeAllowed && passiveAllowed
-            ? random.bool()
-            : activeAllowed
-                ? false
-                : passiveAllowed
-                    ? true
-                    : fail('Cannot generate join op when both active and passive collaborators are at the configured limit.');
-        return {
-            type: 'join',
-            summarizeHistory: random.pick(config.summarizeHistory),
-            writeFormat: random.pick(config.writeFormat),
-            isObserver,
-        };
-    };
-}
-async function leaveGenerator({ random, activeCollaborators, passiveCollaborators, }) {
-    const canUsePassive = passiveCollaborators.length > 0;
-    const canUseActive = activeCollaborators.length > 0;
-    const isObserver = canUsePassive && canUseActive
-        ? random.bool()
-        : canUsePassive
-            ? true
-            : canUseActive
-                ? false
-                : fail('Cannot generate a leave op when there are no clients.');
-    const index = random.integer(0, (isObserver ? passiveCollaborators : activeCollaborators).length - 1);
-    return { type: 'leave', isObserver, index };
-}
-const defaultInsertConfig = {
-    definitionPoolSize: 20,
-    maxTreeSequenceSize: 3,
-};
-const defaultEditConfig = {
-    maxTreeSize: Number.POSITIVE_INFINITY,
-    insertWeight: 3,
-    insertConfig: defaultInsertConfig,
-    deleteWeight: 1,
-    moveWeight: 1,
-    setPayloadWeight: 1,
-    traitLabelPoolSize: 20,
-};
-const makeEditGenerator = (passedConfig, passedJoinConfig, stashOps = false) => {
-    const config = { ...defaultEditConfig, ...passedConfig };
-    const insertConfig = { ...defaultInsertConfig, ...config.insertConfig };
-    const poolRand = makeRandom(0);
-    const traitLabelPool = Array.from({ length: config.traitLabelPoolSize }, () => poolRand.uuid4());
-    const traitLabelGenerator = ({ random }) => random.pick(traitLabelPool);
-    const definitionPool = Array.from({ length: insertConfig.definitionPoolSize }, () => poolRand.uuid4());
-    const definitionGenerator = ({ random }) => random.pick(definitionPool);
-    function traitGenerator(state) {
-        const { idList, random, view } = state;
-        const id = random.pick(idList);
-        return view.tryGetTraitLocation(id) ?? { parent: id, label: traitLabelGenerator(state) };
-    }
-    function placeGenerator(state) {
-        const { idList, random, view } = state;
-        // Note: this gives a 50% chance of adding to a new trait; we may want to tune this at some point
-        if (random.bool()) {
-            const parent = random.pick(idList);
-            return StablePlace.atStartOf({ parent, label: traitLabelGenerator(state) });
-        }
-        const traitLocation = traitGenerator(state);
-        const trait = view.getTrait(traitLocation);
-        // For a trait of length N, there are 2N + 2valid places: start, before index 1, after index 1, etc.
-        // index === trait.length is treated as either the start or end of the trait.
-        const makeDescriptor = () => ({
-            index: random.integer(0, trait.length),
-            side: random.bool() ? Side.Before : Side.After,
-        });
-        const descriptor = makeDescriptor();
-        const placeFromDescriptor = ({ index, side }) => index === trait.length ? { referenceTrait: traitLocation, side } : { referenceSibling: trait[index], side };
-        return placeFromDescriptor(descriptor);
-    }
-    function rangeGenerator(state) {
-        const { random, view } = state;
-        const traitLocation = traitGenerator(state);
-        const trait = view.getTrait(traitLocation);
-        // For a trait of length N, there are 2N + 2valid places: start, before index 1, after index 1, etc.
-        // index === trait.length is treated as either the start or end of the trait.
-        const makeDescriptor = () => ({
-            index: random.integer(0, trait.length),
-            side: random.bool() ? Side.Before : Side.After,
-        });
-        const descriptor1 = makeDescriptor();
-        let descriptor2;
-        do {
-            descriptor2 = makeDescriptor();
-        } while (descriptor1.index === descriptor2.index && descriptor1.side === descriptor2.side);
-        const sortedDescriptors = [descriptor1, descriptor2];
-        sortedDescriptors.sort((a, b) => {
-            if (a.index === b.index && a.side === b.side) {
-                return 0;
-            }
-            if (a.index === trait.length) {
-                if (a.side === Side.After) {
-                    return -1;
-                }
-                return 1;
-            }
-            if (b.index === trait.length) {
-                if (b.side === Side.After) {
-                    return 1;
-                }
-                return -1;
-            }
-            if (a.index < b.index) {
-                return -1;
-            }
-            return a.side === Side.Before ? -1 : 1;
-        });
-        const [startDescriptor, endDescriptor] = sortedDescriptors;
-        const placeFromDescriptor = ({ index, side }) => index === trait.length ? { referenceTrait: traitLocation, side } : { referenceSibling: trait[index], side };
-        const start = placeFromDescriptor(startDescriptor);
-        const end = placeFromDescriptor(endDescriptor);
-        return StableRange.from(start).to(end);
-    }
-    function treeGenerator(state) {
-        const { random, idGenerator } = state;
-        const treeType = random.pick(['leaf', 'stick', 'balanced']);
-        const makeNode = (traits) => ({
-            identifier: idGenerator.generateNodeId(),
-            definition: definitionGenerator(state),
-            traits: traits ?? {},
-        });
-        switch (treeType) {
-            case 'leaf':
-                return makeNode();
-            case 'stick':
-                return makeNode({
-                    [traitLabelGenerator(state)]: [makeNode({ [traitLabelGenerator(state)]: [makeNode()] })],
-                });
-            case 'balanced':
-                return makeNode({
-                    [traitLabelGenerator(state)]: [makeNode()],
-                    [traitLabelGenerator(state)]: [makeNode()],
-                });
-            default:
-                fail(`Unexpected treeType ${treeType}`);
-        }
-    }
-    async function insertGenerator(state) {
-        const { maxTreeSequenceSize } = insertConfig;
-        const id = 1;
-        const { view } = state;
-        const isValidInsertPlace = (destination) => {
-            // Disallow insertion adjacent to the root node.
-            if (destination.referenceSibling === view.root) {
-                return false;
-            }
-            return true;
-        };
-        let destination;
-        do {
-            destination = placeGenerator(state);
-        } while (!isValidInsertPlace(destination));
-        return {
-            fuzzType: 'insert',
-            build: {
-                type: ChangeType.Build,
-                destination: id,
-                source: Array.from({ length: state.random.integer(1, maxTreeSequenceSize) }, () => treeGenerator(state)),
-            },
-            insert: {
-                type: ChangeType.Insert,
-                destination,
-                source: id,
-            },
-        };
-    }
-    async function deleteGenerator(state) {
-        const { view } = state;
-        const isValidDeleteRange = (source) => {
-            // Disallow deletion of the root node.
-            if (source.start.referenceSibling === view.root || source.end.referenceSibling === view.root) {
-                return false;
-            }
-            return true;
-        };
-        let source;
-        do {
-            source = rangeGenerator(state);
-        } while (!isValidDeleteRange(source));
-        return {
-            fuzzType: 'delete',
-            type: ChangeType.Detach,
-            source,
-        };
-    }
-    async function moveGenerator(state) {
-        const id = 1;
-        const { view } = state;
-        const isValidMoveRange = ({ start, end }, destination) => {
-            // An ancestor cannot be moved to be a sibling of its descendant.
-            const forbiddenDescendantId = destination.referenceTrait?.parent ?? destination.referenceSibling ?? fail('Invalid place');
-            const startIndex = view.findIndexWithinTrait(start);
-            const endIndex = view.findIndexWithinTrait(end);
-            const idsInSource = new Set(view.getTrait(start.trait).slice(startIndex, endIndex));
-            for (let current = forbiddenDescendantId; current !== undefined; current = view.tryGetParentViewNode(current)?.identifier) {
-                if (idsInSource.has(current)) {
-                    return false;
-                }
-            }
-            return true;
-        };
-        let source;
-        let destination;
-        do {
-            source = rangeGenerator(state);
-            destination = placeGenerator(state);
-        } while (!isValidMoveRange(rangeFromStableRange(view, source), destination));
-        return {
-            fuzzType: 'move',
-            detach: {
-                type: ChangeType.Detach,
-                destination: id,
-                source,
-            },
-            insert: {
-                type: ChangeType.Insert,
-                destination,
-                source: id,
-            },
-        };
-    }
-    async function setPayloadGenerator({ dataStoreRuntime, idList, random, view }) {
-        const nodeToModify = random.pick(idList);
-        const getPayloadContents = async (random) => {
-            if (random.bool()) {
-                return random.string(4);
-            }
-            const handle = await dataStoreRuntime.uploadBlob(IsoBuffer.from(random.string(10)));
-            return { blob: handle };
-        };
-        const viewNode = view.getViewNode(nodeToModify);
-        const payload = viewNode.payload !== undefined ? (random.bool() ? await getPayloadContents(random) : undefined) : undefined;
-        return {
-            fuzzType: 'setPayload',
-            type: ChangeType.SetValue,
-            nodeToModify: random.pick(idList),
-            payload,
-        };
-    }
-    const baseEditGenerator = createWeightedAsyncGenerator([
-        [insertGenerator, config.insertWeight, ({ idList }) => idList.length < config.maxTreeSize],
-        [deleteGenerator, config.deleteWeight, ({ idList }) => idList.length > 1],
-        [moveGenerator, config.moveWeight, ({ idList }) => idList.length > 1],
-        [setPayloadGenerator, config.setPayloadWeight],
-    ]);
-    return async (state) => {
-        const { random, activeCollaborators } = state;
-        const index = random.integer(0, activeCollaborators.length - 1);
-        const { tree } = activeCollaborators[index];
-        const view = tree.currentView;
-        const idList = getIdList(view);
-        const contents = await baseEditGenerator({
-            ...state,
-            view,
-            idList,
-            dataStoreRuntime: tree.getRuntime(),
-            idGenerator: tree,
-        });
-        if (contents === done) {
-            return done;
-        }
-        if (stashOps) {
-            const joinConfig = { ...defaultJoinConfig, ...passedJoinConfig };
-            return {
-                type: 'stash',
-                contents,
-                index,
-                summarizeHistory: random.pick(joinConfig.summarizeHistory),
-                writeFormat: random.pick(joinConfig.writeFormat),
-            };
-        }
-        return { type: 'edit', contents, index };
-    };
-};
-const defaultOpConfig = {
-    editConfig: defaultEditConfig,
-    joinConfig: defaultJoinConfig,
-    editWeight: 100,
-    joinWeight: 10,
-    leaveWeight: 10,
-    stashWeight: 1,
-    synchronizeWeight: 10,
-};
-export function makeOpGenerator(passedConfig) {
-    const config = {
-        ...defaultOpConfig,
-        ...passedConfig,
-    };
-    const { maximumPassiveCollaborators, maximumActiveCollaborators } = { ...defaultJoinConfig, ...config.joinConfig };
-    const maximumCollaborators = maximumPassiveCollaborators + maximumActiveCollaborators;
-    const collaboratorsMatches = (criteria) => ({ activeCollaborators, passiveCollaborators }) => criteria(activeCollaborators.length + passiveCollaborators.length);
-    const atLeastOneClient = collaboratorsMatches((count) => count > 0);
-    const atLeastOneActiveClient = ({ activeCollaborators }) => activeCollaborators.length > 0;
-    const opWeights = [
-        [makeEditGenerator(config.editConfig, config.joinConfig), config.editWeight, atLeastOneActiveClient],
-        [
-            makeJoinGenerator(config.joinConfig),
-            config.joinWeight,
-            collaboratorsMatches((count) => count < maximumCollaborators),
-        ],
-        [leaveGenerator, config.leaveWeight, atLeastOneClient],
-        // TODO:#5357: Re-enable stashed ops tests
-        // [makeEditGenerator(config.editConfig, config.joinConfig, true), config.stashWeight, atLeastOneActiveClient],
-        [{ type: 'synchronize' }, config.synchronizeWeight, atLeastOneClient],
-    ];
-    return createWeightedAsyncGenerator(opWeights);
-}
-function getIdList(tree) {
-    const allIds = [];
-    const toVisit = [tree.root];
-    while (toVisit.length > 0) {
-        const id = toVisit.pop() ?? fail();
-        allIds.push(id);
-        const node = tree.getViewNode(id);
-        for (const [_, childIds] of node.traits) {
-            toVisit.push(...childIds);
-        }
-    }
-    return allIds;
-}
-//# sourceMappingURL=Generators.js.map