@fluid-experimental/tree 0.58.2001 → 0.59.1000-61898

package/lib/test/TreeView.tests.js

@@ -0,0 +1,176 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { RevisionView } from '../RevisionView';
+import { refreshTestTree } from './utilities/TestUtilities';
+import { expectDefined } from './utilities/TestCommon';
+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()));
+            expect(() => viewA.delta(viewB)).to.throw('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: Object.assign(Object.assign({}, 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: Object.assign(Object.assign({}, 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: Object.assign(Object.assign({}, 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

@@ -0,0 +1 @@
+{"version":3,"file":"TreeView.tests.js","sourceRoot":"","sources":["../../src/test/TreeView.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,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,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,8DAA8D,CAAC,CAAC;QAC3G,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,kCAAO,QAAQ,CAAC,MAAM,KAAE,IAAI,EAAE,CAAC,YAAY,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAE;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,kCAAO,QAAQ,CAAC,MAAM,KAAE,IAAI,EAAE,EAAE,GAAE;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,kCAAO,QAAQ,CAAC,MAAM,KAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAE;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 { expect } from 'chai';\nimport { Definition, TraitLabel } from '../Identifiers';\nimport { RevisionView } from '../RevisionView';\nimport { ChangeNode } from '../persisted-types';\nimport { refreshTestTree } from './utilities/TestUtilities';\nimport { TestNode } from './utilities/TestNode';\nimport { expectDefined } from './utilities/TestCommon';\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\texpect(() => viewA.delta(viewB)).to.throw('Delta can only be calculated between views that share a root');\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.js

@@ -2,9 +2,9 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { SharedTreeUndoRedoHandler } from '../default-edits';
+import { UndoRedoStackManager } from '@fluidframework/undo-redo';
+import { SharedTreeUndoRedoHandler } from '../UndoRedoHandler';
 import { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests';
-import { UndoRedoStackManager } from './undoRedoStackManager';
 describe('SharedTreeUndoRedoHandler', () => {
     let undoRedoStack;
     let handler;

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

@@ -1 +1 @@
-{"version":3,"file":"UndoRedoHandler.tests.js","sourceRoot":"","sources":["../../src/test/UndoRedoHandler.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAc,yBAAyB,EAAE,MAAM,kBAAkB,CAAC;AACzE,OAAO,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAC3E,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAE9D,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,iBAAG,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,IAAK,eAAe,EAAG,CAAC;IAChG,8BAA8B,iBAAG,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,IAAK,eAAe,EAAG,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 { EditId } from '../Identifiers';\nimport { SharedTree, SharedTreeUndoRedoHandler } from '../default-edits';\nimport { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests';\nimport { UndoRedoStackManager } from './undoRedoStackManager';\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"]}
+{"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,oBAAoB,CAAC;AAC/D,OAAO,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAE3E,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,iBAAG,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,eAAe,IAAK,eAAe,EAAG,CAAC;IAChG,8BAA8B,iBAAG,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,mBAAmB,IAAK,eAAe,EAAG,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';\nimport { SharedTree } from '../SharedTree';\nimport { SharedTreeUndoRedoHandler } from '../UndoRedoHandler';\nimport { runSharedTreeUndoRedoTestSuite } from './utilities/UndoRedoTests';\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/Virtualization.tests.js

@@ -3,53 +3,98 @@
  * Licensed under the MIT License.
  */
 import { expect } from 'chai';
-import { newEdit, fullHistorySummarizer_0_1_0 } from '../generic';
-import { setTrait } from '../default-edits';
+import { EditLog } from '../EditLog';
 import { assertNotUndefined } from '../Common';
 import { initialTree } from '../InitialTree';
-import { SharedTreeDiagnosticEvent } from '../generic/GenericSharedTree';
-import { createStableEdits, makeTestNode, setUpLocalServerTestSharedTree, testTrait } from './utilities/TestUtilities';
+import { reservedIdCount, WriteFormat, editsPerChunk, } from '../persisted-types';
+import { SharedTreeDiagnosticEvent } from '../EventTypes';
+import { IdCompressor } from '../id-compressor';
+import { createSessionId } from '../id-compressor/NumericUuid';
+import { SharedTreeEncoder_0_1_1 } from '../SharedTreeEncoder';
+import { CachingLogViewer } from '../LogViewer';
+import { GenericTransaction, TransactionInternal } from '../TransactionInternal';
+import { RevisionView } from '../RevisionView';
+import { MutableStringInterner } from '../StringInterner';
+import { applyNoop, createStableEdits, makeNodeIdContext, setUpLocalServerTestSharedTree, } from './utilities/TestUtilities';
+import { SimpleTestTree } from './utilities/TestNode';
 describe('SharedTree history virtualization', () => {
     let sharedTree;
     let testObjectProvider;
+    let editChunksUploaded = 0;
+    const editCount = 250;
+    const expectedFullChunkCount = Math.floor(editCount / editsPerChunk);
     // Create a summary used to test catchup blobbing
-    const summaryToCatchUp = {
-        currentTree: initialTree,
-        version: '0.0.2',
-        sequencedEdits: createStableEdits(250),
-    };
+    function createCatchUpSummary(numberOfEdits, payload) {
+        const idCompressor = new IdCompressor(createSessionId(), reservedIdCount);
+        const context = makeNodeIdContext(idCompressor);
+        const edits = createStableEdits(numberOfEdits, context, payload);
+        idCompressor.finalizeCreationRange(idCompressor.takeNextCreationRange());
+        const editLog = new EditLog();
+        for (let i = 0; i < edits.length; i++) {
+            editLog.addSequencedEdit(edits[i], { sequenceNumber: i + 1, referenceSequenceNumber: i });
+        }
+        const logViewer = new CachingLogViewer(editLog, RevisionView.fromTree(initialTree, context, true), undefined, true, undefined, undefined, (view) => new GenericTransaction(view, new TransactionInternal.Policy()));
+        const internedStrings = [
+            SimpleTestTree.definition,
+            SimpleTestTree.traitLabel,
+            SimpleTestTree.leftTraitLabel,
+            SimpleTestTree.rightTraitLabel,
+        ];
+        const interner = new MutableStringInterner(internedStrings);
+        const encoder = new SharedTreeEncoder_0_1_1(true);
+        return encoder.encodeSummary(editLog, logViewer.getRevisionViewInSession(Number.POSITIVE_INFINITY), context, context, interner, idCompressor.serialize(false));
+    }
     beforeEach(async () => {
         const testingComponents = await setUpLocalServerTestSharedTree({
             summarizeHistory: true,
+            writeFormat: WriteFormat.v0_1_1,
         });
         sharedTree = testingComponents.tree;
         testObjectProvider = testingComponents.testObjectProvider;
+        sharedTree.on(SharedTreeDiagnosticEvent.EditChunkUploaded, () => {
+            editChunksUploaded++;
+        });
     });
-    afterEach(async () => {
-        testObjectProvider.reset();
+    afterEach(() => {
+        editChunksUploaded = 0;
     });
+    // Replace sharedTree with one that writes summary format 0.0.2
+    const useSharedTreeSummaryv0_0_2 = async () => {
+        const testingComponents = await setUpLocalServerTestSharedTree({
+            summarizeHistory: true,
+            writeFormat: WriteFormat.v0_0_2,
+        });
+        sharedTree = testingComponents.tree;
+        testObjectProvider = testingComponents.testObjectProvider;
+        sharedTree.on(SharedTreeDiagnosticEvent.EditChunkUploaded, () => {
+            editChunksUploaded++;
+        });
+    };
     // Adds edits to sharedTree1 to make up the specified number of chunks.
-    const processNewEditChunks = async (numberOfChunks = 1) => {
+    const addNewEditChunks = async (numberOfChunks = 1, additionalEdits = 0) => {
         const expectedEdits = [];
         // Add some edits to create a chunk with.
-        while (expectedEdits.length < sharedTree.edits.editsPerChunk * numberOfChunks) {
-            const edit = newEdit(setTrait(testTrait, [makeTestNode()]));
-            expectedEdits.push(edit);
-            sharedTree.processLocalEdit(edit);
+        while (expectedEdits.length < sharedTree.edits.editsPerChunk * numberOfChunks + additionalEdits) {
+            expectedEdits.push(applyNoop(sharedTree));
         }
+        // `ensureSynchronized` does not guarantee blob upload
+        await new Promise((resolve) => setImmediate(resolve));
         // Wait for the ops to to be submitted and processed across the containers.
         await testObjectProvider.ensureSynchronized();
         return expectedEdits;
     };
     it('can upload edit chunks and load chunks from handles', async () => {
-        const expectedEdits = await processNewEditChunks();
-        const summary = fullHistorySummarizer_0_1_0(sharedTree.edits, sharedTree.currentView);
+        const expectedEdits = await addNewEditChunks();
+        const summary = sharedTree.saveSummary();
         const { editHistory } = summary;
         const { editChunks } = assertNotUndefined(editHistory);
         expect(editChunks.length).to.equal(1);
         expect(typeof editChunks[0].chunk.get).to.equal('function');
         // Load a second tree using the summary
-        const { tree: sharedTree2 } = await setUpLocalServerTestSharedTree({ testObjectProvider });
+        const { tree: sharedTree2 } = await setUpLocalServerTestSharedTree({
+            testObjectProvider,
+            writeFormat: WriteFormat.v0_1_1,
+        });
         sharedTree2.loadSummary(summary);
         // Ensure chunked edit can be retrieved
         expect((await sharedTree2.edits.getEditAtIndex(2)).id).to.equal(expectedEdits[2].id);
@@ -61,12 +106,12 @@ describe('SharedTree history virtualization', () => {
         });
         // Wait for the op to to be submitted and processed across the containers.
         await testObjectProvider.ensureSynchronized();
-        sharedTree.loadSummary(summaryToCatchUp);
+        sharedTree.loadSummary(createCatchUpSummary(250));
         await testObjectProvider.ensureSynchronized();
-        expect(catchUpBlobsUploaded).to.equal(1);
-        const { editHistory } = fullHistorySummarizer_0_1_0(sharedTree.edits, sharedTree.currentView);
+        expect(catchUpBlobsUploaded).to.equal(expectedFullChunkCount);
+        const { editHistory } = sharedTree.saveSummary();
         const { editChunks } = assertNotUndefined(editHistory);
-        expect(editChunks.length).to.equal(1);
+        expect(editChunks.length).to.equal(expectedFullChunkCount + 1);
         expect(typeof editChunks[0].chunk.get).to.equal('function');
     });
     it('only uploads catchup blobs from one client', async () => {
@@ -74,10 +119,12 @@ describe('SharedTree history virtualization', () => {
         const { tree: sharedTree2 } = await setUpLocalServerTestSharedTree({
             testObjectProvider,
             summarizeHistory: true,
+            writeFormat: WriteFormat.v0_1_1,
         });
         const { tree: sharedTree3 } = await setUpLocalServerTestSharedTree({
             testObjectProvider,
             summarizeHistory: true,
+            writeFormat: WriteFormat.v0_1_1,
         });
         let catchUpBlobsUploaded = 0;
         sharedTree.on(SharedTreeDiagnosticEvent.CatchUpBlobUploaded, () => {
@@ -92,51 +139,31 @@ describe('SharedTree history virtualization', () => {
         // Wait for processing again in case there are more no ops
         await testObjectProvider.ensureSynchronized();
         // Try to load summaries on all the trees
-        sharedTree.loadSummary(summaryToCatchUp);
-        sharedTree2.loadSummary(summaryToCatchUp);
-        sharedTree3.loadSummary(summaryToCatchUp);
+        const summary = createCatchUpSummary(250);
+        sharedTree.loadSummary(summary);
+        sharedTree2.loadSummary(summary);
+        sharedTree3.loadSummary(summary);
         // `ensureSynchronized` does not guarantee blob upload
         await new Promise((resolve) => setImmediate(resolve));
         await testObjectProvider.ensureSynchronized();
-        expect(catchUpBlobsUploaded).to.equal(1);
+        expect(catchUpBlobsUploaded).to.equal(expectedFullChunkCount);
         // Make sure the trees are still the same
         expect(sharedTree.equals(sharedTree2)).to.be.true;
         expect(sharedTree.equals(sharedTree3)).to.be.true;
     });
     it("doesn't upload incomplete chunks", async () => {
-        const edit = newEdit(setTrait(testTrait, [makeTestNode()]));
-        sharedTree.processLocalEdit(edit);
-        // Wait for the op to to be submitted and processed across the containers.
-        await testObjectProvider.ensureSynchronized();
-        const { editHistory } = fullHistorySummarizer_0_1_0(sharedTree.edits, sharedTree.currentView);
-        const { editChunks } = assertNotUndefined(editHistory);
-        expect(editChunks.length).to.equal(1);
-        // The chunk given by the summary should be an array of length 1.
-        const { chunk } = editChunks[0];
-        expect(Array.isArray(chunk)).to.be.true;
-        expect(chunk.length).to.equal(1);
+        await addNewEditChunks(0, 50);
+        expect(editChunksUploaded).to.equal(0);
     });
     it('can upload full chunks with incomplete chunks in the edit log', async () => {
-        const expectedEdits = [];
-        // Add some edits to create a chunk with.
-        while (expectedEdits.length < sharedTree.edits.editsPerChunk + 10) {
-            const edit = newEdit(setTrait(testTrait, [makeTestNode()]));
-            expectedEdits.push(edit);
-            sharedTree.processLocalEdit(edit);
-        }
-        // Wait for the ops to to be submitted and processed across the containers.
-        await testObjectProvider.ensureSynchronized();
-        const { editHistory } = fullHistorySummarizer_0_1_0(sharedTree.edits, sharedTree.currentView);
-        const { editChunks } = assertNotUndefined(editHistory);
-        expect(editChunks.length).to.equal(2);
-        expect(typeof editChunks[0].chunk.get).to.equal('function');
-        expect(Array.isArray(editChunks[1].chunk)).to.be.true;
-        expect(editChunks[1].chunk.length).to.equal(10);
+        testObjectProvider.logger.registerExpectedEvent({ eventName: 'fluid:telemetry:Batching:LengthTooBig' }, { eventName: 'fluid:telemetry:Batching:LengthTooBig' });
+        await addNewEditChunks(1, 50);
+        expect(editChunksUploaded).to.equal(1);
     });
     it('correctly saves handles and their corresponding starting revisions to the summary', async () => {
         testObjectProvider.logger.registerExpectedEvent({ eventName: 'fluid:telemetry:Batching:LengthTooBig' }, { eventName: 'fluid:telemetry:Batching:LengthTooBig' });
-        await processNewEditChunks(4);
-        const { editHistory } = fullHistorySummarizer_0_1_0(sharedTree.edits, sharedTree.currentView);
+        await addNewEditChunks(4);
+        const { editHistory } = sharedTree.saveSummary();
         const { editChunks } = assertNotUndefined(editHistory);
         expect(editChunks.length).to.equal(4);
         // Make sure each starting revision is correct and each chunk in the summary is a handle
@@ -150,20 +177,22 @@ describe('SharedTree history virtualization', () => {
         const { tree: sharedTree2 } = await setUpLocalServerTestSharedTree({
             testObjectProvider,
             summarizeHistory: true,
+            writeFormat: WriteFormat.v0_1_1,
         });
         const { tree: sharedTree3 } = await setUpLocalServerTestSharedTree({
             testObjectProvider,
             summarizeHistory: true,
+            writeFormat: WriteFormat.v0_1_1,
         });
         // All shared trees should have no edits or chunks
-        expect((_a = fullHistorySummarizer_0_1_0(sharedTree.edits, sharedTree.currentView).editHistory) === null || _a === void 0 ? void 0 : _a.editChunks.length).to.equal(0);
-        expect((_b = fullHistorySummarizer_0_1_0(sharedTree2.edits, sharedTree2.currentView).editHistory) === null || _b === void 0 ? void 0 : _b.editChunks.length).to.equal(0);
-        expect((_c = fullHistorySummarizer_0_1_0(sharedTree3.edits, sharedTree3.currentView).editHistory) === null || _c === void 0 ? void 0 : _c.editChunks.length).to.equal(0);
-        await processNewEditChunks();
+        expect((_a = sharedTree.saveSummary().editHistory) === null || _a === void 0 ? void 0 : _a.editChunks.length).to.equal(0);
+        expect((_b = sharedTree2.saveSummary().editHistory) === null || _b === void 0 ? void 0 : _b.editChunks.length).to.equal(0);
+        expect((_c = sharedTree3.saveSummary().editHistory) === null || _c === void 0 ? void 0 : _c.editChunks.length).to.equal(0);
+        await addNewEditChunks();
         // All shared trees should have the new handle
-        const sharedTreeSummary = fullHistorySummarizer_0_1_0(sharedTree.edits, sharedTree.currentView);
-        const sharedTree2Summary = fullHistorySummarizer_0_1_0(sharedTree2.edits, sharedTree2.currentView);
-        const sharedTree3Summary = fullHistorySummarizer_0_1_0(sharedTree3.edits, sharedTree3.currentView);
+        const sharedTreeSummary = sharedTree.saveSummary();
+        const sharedTree2Summary = sharedTree2.saveSummary();
+        const sharedTree3Summary = sharedTree3.saveSummary();
         const sharedTreeChunk = assertNotUndefined(sharedTreeSummary.editHistory).editChunks[0].chunk;
         const sharedTree2Chunk = assertNotUndefined(sharedTree2Summary.editHistory).editChunks[0].chunk;
         const sharedTree3Chunk = assertNotUndefined(sharedTree3Summary.editHistory).editChunks[0].chunk;
@@ -177,5 +206,61 @@ describe('SharedTree history virtualization', () => {
         expect(sharedTreeHandleRoute).to.equal(sharedTree2HandleRoute);
         expect(sharedTree2HandleRoute).to.equal(sharedTree3HandleRoute);
     });
+    it('does not cause misaligned chunks', async () => {
+        testObjectProvider.logger.registerExpectedEvent({ eventName: 'fluid:telemetry:Batching:LengthTooBig' }, { eventName: 'fluid:telemetry:Batching:LengthTooBig' }, { eventName: 'fluid:telemetry:Batching:LengthTooBig' });
+        await addNewEditChunks(1, 50);
+        const summary = sharedTree.saveSummary();
+        // Connect another client
+        const { tree: sharedTree2 } = await setUpLocalServerTestSharedTree({
+            testObjectProvider,
+            summarizeHistory: true,
+            writeFormat: WriteFormat.v0_1_1,
+        });
+        let unexpectedHistoryChunk = false;
+        sharedTree2.on(SharedTreeDiagnosticEvent.UnexpectedHistoryChunk, () => {
+            unexpectedHistoryChunk = true;
+        });
+        sharedTree2.loadSummary(summary);
+        // Finish off the incomplete chunk
+        await addNewEditChunks();
+        expect(unexpectedHistoryChunk).to.be.false;
+    });
+    it('does not cause misaligned chunks for format version 0.0.2', async () => {
+        await useSharedTreeSummaryv0_0_2();
+        testObjectProvider.logger.registerExpectedEvent({ eventName: 'fluid:telemetry:Batching:LengthTooBig' }, { eventName: 'fluid:telemetry:Batching:LengthTooBig' }, { eventName: 'fluid:telemetry:Batching:LengthTooBig' });
+        // Add enough edits for a chunk and a half
+        await addNewEditChunks(1, 50);
+        // Connect another client
+        const { tree: sharedTree2 } = await setUpLocalServerTestSharedTree({
+            testObjectProvider,
+            summarizeHistory: true,
+            writeFormat: WriteFormat.v0_0_2,
+        });
+        let unexpectedHistoryChunk = false;
+        sharedTree2.on(SharedTreeDiagnosticEvent.UnexpectedHistoryChunk, () => {
+            unexpectedHistoryChunk = true;
+        });
+        sharedTree2.loadSummary(sharedTree.saveSummary());
+        // Finish off the incomplete chunk
+        await addNewEditChunks();
+        expect(unexpectedHistoryChunk).to.be.false;
+    });
+    it('does not upload blobs larger than 4MB', async () => {
+        testObjectProvider.logger.registerExpectedEvent({
+            eventName: 'fluid:telemetry:FluidDataStoreRuntime:SharedTree:EditChunkUploadFailure',
+        });
+        const numberOfEdits = editsPerChunk;
+        const fourMegas = 2 ** 22;
+        // Without the 1.1, we would generate 100 edits of size roughly 40kb here, but not all of them end up in the first edit chunk
+        // due to some setup edits.
+        // So we'd barely land within the 4MB limit. Bumping each payload size by 10% is enough to account for this.
+        const bigPayload = 'a'.repeat(Math.ceil((1.1 * fourMegas) / numberOfEdits));
+        const fakeSummary = createCatchUpSummary(numberOfEdits, () => bigPayload);
+        sharedTree.loadSummary(fakeSummary);
+        // `ensureSynchronized` does not guarantee blob upload
+        await new Promise((resolve) => setImmediate(resolve));
+        await testObjectProvider.ensureSynchronized();
+        expect(editChunksUploaded).to.equal(0);
+    });
 });
 //# sourceMappingURL=Virtualization.tests.js.map