@fluid-experimental/tree 0.58.2001 → 0.59.1000-61898

package/lib/test/SharedTree.perf.tests.js

@@ -0,0 +1,39 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
+import { assert } from '../Common';
+import { runSummaryLoadPerfTests } from './utilities/SummaryLoadPerfTests';
+import { createStableEdits, setUpTestSharedTree } from './utilities/TestUtilities';
+describe('SharedTree Perf', () => {
+    let tree;
+    let containerRuntimeFactory;
+    for (const count of [1, 1000]) {
+        benchmark({
+            type: BenchmarkType.Measurement,
+            title: `get currentView with ${count} sequenced edit(s)`,
+            before: () => {
+                ({ tree, containerRuntimeFactory } = setUpTestSharedTree({ localMode: false }));
+                const edits = createStableEdits(count, tree);
+                for (let i = 0; i < count; i++) {
+                    tree.applyEditInternal(edits[i].changes);
+                }
+                containerRuntimeFactory.processAllMessages();
+                const editLog = tree.edits;
+                assert(editLog.numberOfSequencedEdits === count);
+                assert(editLog.numberOfLocalEdits === 0);
+            },
+            benchmarkFn: () => {
+                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                tree.currentView;
+            },
+            after: () => {
+                tree = undefined;
+                containerRuntimeFactory = undefined;
+            },
+        });
+    }
+    runSummaryLoadPerfTests('Summary Load');
+});
+//# sourceMappingURL=SharedTree.perf.tests.js.map

package/lib/test/SharedTree.perf.tests.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SharedTree.perf.tests.js","sourceRoot":"","sources":["../../src/test/SharedTree.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAElE,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAGnC,OAAO,EAAE,uBAAuB,EAAE,MAAM,kCAAkC,CAAC;AAC3E,OAAO,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAEnF,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAChC,IAAI,IAA4B,CAAC;IACjC,IAAI,uBAAgE,CAAC;IACrE,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,EAAE,IAAK,CAAC,EAAE;QAC/B,SAAS,CAAC;YACT,IAAI,EAAE,aAAa,CAAC,WAAW;YAC/B,KAAK,EAAE,wBAAwB,KAAK,oBAAoB;YACxD,MAAM,EAAE,GAAG,EAAE;gBACZ,CAAC,EAAE,IAAI,EAAE,uBAAuB,EAAE,GAAG,mBAAmB,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;gBAEhF,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;oBAC/B,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;iBACzC;gBAED,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;gBAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAgB,CAAC;gBACtC,MAAM,CAAC,OAAO,CAAC,sBAAsB,KAAK,KAAK,CAAC,CAAC;gBACjD,MAAM,CAAC,OAAO,CAAC,kBAAkB,KAAK,CAAC,CAAC,CAAC;YAC1C,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,oEAAoE;gBACpE,IAAK,CAAC,WAAW,CAAC;YACnB,CAAC;YACD,KAAK,EAAE,GAAG,EAAE;gBACX,IAAI,GAAG,SAAS,CAAC;gBACjB,uBAAuB,GAAG,SAAS,CAAC;YACrC,CAAC;SACD,CAAC,CAAC;KACH;IAED,uBAAuB,CAAC,cAAc,CAAC,CAAC;AACzC,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { MockContainerRuntimeFactory } from '@fluidframework/test-runtime-utils';\nimport { assert } from '../Common';\nimport { EditLog } from '../EditLog';\nimport { SharedTree } from '../SharedTree';\nimport { runSummaryLoadPerfTests } from './utilities/SummaryLoadPerfTests';\nimport { createStableEdits, setUpTestSharedTree } from './utilities/TestUtilities';\n\ndescribe('SharedTree Perf', () => {\n\tlet tree: SharedTree | undefined;\n\tlet containerRuntimeFactory: MockContainerRuntimeFactory | undefined;\n\tfor (const count of [1, 1_000]) {\n\t\tbenchmark({\n\t\t\ttype: BenchmarkType.Measurement,\n\t\t\ttitle: `get currentView with ${count} sequenced edit(s)`,\n\t\t\tbefore: () => {\n\t\t\t\t({ tree, containerRuntimeFactory } = setUpTestSharedTree({ localMode: false }));\n\n\t\t\t\tconst edits = createStableEdits(count, tree);\n\t\t\t\tfor (let i = 0; i < count; i++) {\n\t\t\t\t\ttree.applyEditInternal(edits[i].changes);\n\t\t\t\t}\n\n\t\t\t\tcontainerRuntimeFactory.processAllMessages();\n\t\t\t\tconst editLog = tree.edits as EditLog;\n\t\t\t\tassert(editLog.numberOfSequencedEdits === count);\n\t\t\t\tassert(editLog.numberOfLocalEdits === 0);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\ttree!.currentView;\n\t\t\t},\n\t\t\tafter: () => {\n\t\t\t\ttree = undefined;\n\t\t\t\tcontainerRuntimeFactory = undefined;\n\t\t\t},\n\t\t});\n\t}\n\n\trunSummaryLoadPerfTests('Summary Load');\n});\n"]}

package/lib/test/SharedTree.tests.js

@@ -2,11 +2,23 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
+import { WriteFormat } from '../persisted-types';
 import { setUpTestSharedTree, setUpLocalServerTestSharedTree } from './utilities/TestUtilities';
 import { runSharedTreeOperationsTests } from './utilities/SharedTreeTests';
-import { runSummaryTests } from './utilities/SummaryFormatCompatibilityTests';
+import { runSummarySizeTests } from './utilities/SummarySizeTests';
+import { runPendingLocalStateTests } from './utilities/PendingLocalStateTests';
+import { runSharedTreeVersioningTests } from './utilities/SharedTreeVersioningTests';
+import { runSummaryTests } from './Summary.tests';
+import { runSharedTreeFuzzTests } from './fuzz/SharedTreeFuzzTests';
 describe('SharedTree', () => {
-    runSharedTreeOperationsTests('Operations', setUpTestSharedTree);
-    runSummaryTests('Summary', setUpTestSharedTree, setUpLocalServerTestSharedTree);
+    describe('Operations', () => {
+        runSharedTreeOperationsTests('using write format 0.0.2', WriteFormat.v0_0_2, setUpTestSharedTree);
+        runSharedTreeOperationsTests('using write format 0.1.1', WriteFormat.v0_1_1, setUpTestSharedTree);
+    });
+    runSummaryTests('Summaries');
+    runSummarySizeTests('Summary size', setUpLocalServerTestSharedTree);
+    runPendingLocalStateTests('Stashed ops', setUpLocalServerTestSharedTree);
+    runSharedTreeVersioningTests('Versioning', setUpTestSharedTree);
+    runSharedTreeFuzzTests('Fuzz tests with local server');
 });
 //# sourceMappingURL=SharedTree.tests.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"SharedTree.tests.js","sourceRoot":"","sources":["../../src/test/SharedTree.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,mBAAmB,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAChG,OAAO,EAAE,4BAA4B,EAAE,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,eAAe,EAAE,MAAM,6CAA6C,CAAC;AAE9E,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC3B,4BAA4B,CAAa,YAAY,EAAE,mBAAmB,CAAC,CAAC;IAC5E,eAAe,CAAa,SAAS,EAAE,mBAAmB,EAAE,8BAA8B,CAAC,CAAC;AAC7F,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { SharedTree } from '../default-edits';\nimport { setUpTestSharedTree, setUpLocalServerTestSharedTree } from './utilities/TestUtilities';\nimport { runSharedTreeOperationsTests } from './utilities/SharedTreeTests';\nimport { runSummaryTests } from './utilities/SummaryFormatCompatibilityTests';\n\ndescribe('SharedTree', () => {\n\trunSharedTreeOperationsTests<SharedTree>('Operations', setUpTestSharedTree);\n\trunSummaryTests<SharedTree>('Summary', setUpTestSharedTree, setUpLocalServerTestSharedTree);\n});\n"]}
+{"version":3,"file":"SharedTree.tests.js","sourceRoot":"","sources":["../../src/test/SharedTree.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,mBAAmB,EAAE,8BAA8B,EAAE,MAAM,2BAA2B,CAAC;AAChG,OAAO,EAAE,4BAA4B,EAAE,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,4BAA4B,EAAE,MAAM,uCAAuC,CAAC;AACrF,OAAO,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAClD,OAAO,EAAE,sBAAsB,EAAE,MAAM,4BAA4B,CAAC;AAEpE,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC3B,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,4BAA4B,CAAC,0BAA0B,EAAE,WAAW,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;QAClG,4BAA4B,CAAC,0BAA0B,EAAE,WAAW,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC;IACnG,CAAC,CAAC,CAAC;IACH,eAAe,CAAC,WAAW,CAAC,CAAC;IAC7B,mBAAmB,CAAC,cAAc,EAAE,8BAA8B,CAAC,CAAC;IACpE,yBAAyB,CAAC,aAAa,EAAE,8BAA8B,CAAC,CAAC;IACzE,4BAA4B,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;IAChE,sBAAsB,CAAC,8BAA8B,CAAC,CAAC;AACxD,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { WriteFormat } from '../persisted-types';\nimport { setUpTestSharedTree, setUpLocalServerTestSharedTree } from './utilities/TestUtilities';\nimport { runSharedTreeOperationsTests } from './utilities/SharedTreeTests';\nimport { runSummarySizeTests } from './utilities/SummarySizeTests';\nimport { runPendingLocalStateTests } from './utilities/PendingLocalStateTests';\nimport { runSharedTreeVersioningTests } from './utilities/SharedTreeVersioningTests';\nimport { runSummaryTests } from './Summary.tests';\nimport { runSharedTreeFuzzTests } from './fuzz/SharedTreeFuzzTests';\n\ndescribe('SharedTree', () => {\n\tdescribe('Operations', () => {\n\t\trunSharedTreeOperationsTests('using write format 0.0.2', WriteFormat.v0_0_2, setUpTestSharedTree);\n\t\trunSharedTreeOperationsTests('using write format 0.1.1', WriteFormat.v0_1_1, setUpTestSharedTree);\n\t});\n\trunSummaryTests('Summaries');\n\trunSummarySizeTests('Summary size', setUpLocalServerTestSharedTree);\n\trunPendingLocalStateTests('Stashed ops', setUpLocalServerTestSharedTree);\n\trunSharedTreeVersioningTests('Versioning', setUpTestSharedTree);\n\trunSharedTreeFuzzTests('Fuzz tests with local server');\n});\n"]}

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

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

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

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

package/lib/test/StringInterner.tests.js

@@ -0,0 +1,71 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { MutableStringInterner } from '../StringInterner';
+describe('MutableStringInterner', () => {
+    const inputStrings = ['test', 'test2', 'test3', 'test4'];
+    it('can associate a string with an intern ID', () => {
+        const interner = new MutableStringInterner();
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+    });
+    it('can handle empty strings', () => {
+        const interner = new MutableStringInterner();
+        expect(interner.getOrCreateInternedId('')).to.equal(0);
+    });
+    it('getInternedId returns undefined for un-created ids', () => {
+        const interner = new MutableStringInterner();
+        expect(interner.getInternedId(inputStrings[0])).to.equal(undefined);
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getInternedId(inputStrings[1])).to.equal(undefined);
+    });
+    it('can retrieve the intern ID associated with a string', () => {
+        const interner = new MutableStringInterner();
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getString(0)).to.equal(inputStrings[0]);
+        expect(interner.getString(1)).to.equal(inputStrings[1]);
+    });
+    it("throws an error when trying to retrieve a string that hasn't been encountered", () => {
+        const interner = new MutableStringInterner();
+        expect(() => interner.getString(0)).to.throw('No string associated with 0.');
+    });
+    it('can return a serializable representation of its state', () => {
+        const interner = new MutableStringInterner();
+        for (const value of inputStrings) {
+            interner.getOrCreateInternedId(value);
+        }
+        expect(interner.getSerializable()).to.deep.equal(inputStrings);
+    });
+    it('can be initialized with a list of input strings', () => {
+        const interner = new MutableStringInterner(inputStrings);
+        expect(interner.getOrCreateInternedId(inputStrings[3])).to.equal(3);
+        expect(interner.getOrCreateInternedId(inputStrings[2])).to.equal(2);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+    });
+    it('can be initialized with a list of input strings that include duplicate IDs', () => {
+        const interner = new MutableStringInterner([...inputStrings, ...inputStrings]);
+        expect(interner.getOrCreateInternedId(inputStrings[3])).to.equal(3);
+        expect(interner.getOrCreateInternedId(inputStrings[2])).to.equal(2);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+    });
+    it("doesn't change a string's intern ID when retrieving it multiple times", () => {
+        const interner = new MutableStringInterner();
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+        expect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);
+    });
+});
+//# sourceMappingURL=StringInterner.tests.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"StringInterner.tests.js","sourceRoot":"","sources":["../../src/test/StringInterner.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAE1D,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACtC,MAAM,YAAY,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IAEzD,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAE7C,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAE7C,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC7D,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAE7C,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC9D,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAE7C,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAE5D,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+EAA+E,EAAE,GAAG,EAAE;QACxF,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAE7C,MAAM,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAChE,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAE7C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE;YACjC,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;SACtC;QAED,MAAM,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC1D,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,YAAY,CAAC,CAAC;QAEzD,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4EAA4E,EAAE,GAAG,EAAE;QACrF,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC;QAE/E,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;QAChF,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAE7C,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrE,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 { MutableStringInterner } from '../StringInterner';\n\ndescribe('MutableStringInterner', () => {\n\tconst inputStrings = ['test', 'test2', 'test3', 'test4'];\n\n\tit('can associate a string with an intern ID', () => {\n\t\tconst interner = new MutableStringInterner();\n\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t});\n\n\tit('can handle empty strings', () => {\n\t\tconst interner = new MutableStringInterner();\n\n\t\texpect(interner.getOrCreateInternedId('')).to.equal(0);\n\t});\n\n\tit('getInternedId returns undefined for un-created ids', () => {\n\t\tconst interner = new MutableStringInterner();\n\n\t\texpect(interner.getInternedId(inputStrings[0])).to.equal(undefined);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getInternedId(inputStrings[1])).to.equal(undefined);\n\t});\n\n\tit('can retrieve the intern ID associated with a string', () => {\n\t\tconst interner = new MutableStringInterner();\n\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t\texpect(interner.getInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getInternedId(inputStrings[1])).to.equal(1);\n\n\t\texpect(interner.getString(0)).to.equal(inputStrings[0]);\n\t\texpect(interner.getString(1)).to.equal(inputStrings[1]);\n\t});\n\n\tit(\"throws an error when trying to retrieve a string that hasn't been encountered\", () => {\n\t\tconst interner = new MutableStringInterner();\n\n\t\texpect(() => interner.getString(0)).to.throw('No string associated with 0.');\n\t});\n\n\tit('can return a serializable representation of its state', () => {\n\t\tconst interner = new MutableStringInterner();\n\n\t\tfor (const value of inputStrings) {\n\t\t\tinterner.getOrCreateInternedId(value);\n\t\t}\n\n\t\texpect(interner.getSerializable()).to.deep.equal(inputStrings);\n\t});\n\n\tit('can be initialized with a list of input strings', () => {\n\t\tconst interner = new MutableStringInterner(inputStrings);\n\n\t\texpect(interner.getOrCreateInternedId(inputStrings[3])).to.equal(3);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[2])).to.equal(2);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t});\n\n\tit('can be initialized with a list of input strings that include duplicate IDs', () => {\n\t\tconst interner = new MutableStringInterner([...inputStrings, ...inputStrings]);\n\n\t\texpect(interner.getOrCreateInternedId(inputStrings[3])).to.equal(3);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[2])).to.equal(2);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t});\n\n\tit(\"doesn't change a string's intern ID when retrieving it multiple times\", () => {\n\t\tconst interner = new MutableStringInterner();\n\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[0])).to.equal(0);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t\texpect(interner.getOrCreateInternedId(inputStrings[1])).to.equal(1);\n\t});\n});\n"]}

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

@@ -0,0 +1,8 @@
+import { WriteFormat } from '../persisted-types';
+import { SharedTree } from '../SharedTree';
+/** Applies a smattering of interesting edits to the given shared tree in an attempt to cover a variety of use cases  */
+export declare function applyTestEdits(sharedTree: SharedTree): void;
+export declare function createSummaryTestTree(writeFormat: WriteFormat, summarizeHistory: boolean): Promise<SharedTree>;
+export declare function runSummaryTests(title: string): void;
+export declare function expectAssert(condition: unknown, message?: string): asserts condition;
+//# sourceMappingURL=Summary.tests.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Summary.tests.d.ts","sourceRoot":"","sources":["../../src/test/Summary.tests.ts"],"names":[],"mappings":"AAcA,OAAO,EAKN,WAAW,EACX,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAkB3C,wHAAwH;AACxH,wBAAgB,cAAc,CAAC,UAAU,EAAE,UAAU,GAAG,IAAI,CAsF3D;AAED,wBAAsB,qBAAqB,CAAC,WAAW,EAAE,WAAW,EAAE,gBAAgB,EAAE,OAAO,GAAG,OAAO,CAAC,UAAU,CAAC,CAmCpH;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAwOnD;AAED,wBAAgB,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAEpF"}

package/lib/test/Summary.tests.js

@@ -0,0 +1,407 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import * as fs from 'fs';
+import { join } from 'path';
+import { IsoBuffer } from '@fluidframework/common-utils';
+import { expect } from 'chai';
+import { v5 } from 'uuid';
+import { Change, StablePlace, StableRange } from '../ChangeTypes';
+import { assert } from '../Common';
+import { areRevisionViewsSemanticallyEqual } from '../EditUtilities';
+import { initialTree } from '../InitialTree';
+import { editsPerChunk, reservedIdCount, WriteFormat, } from '../persisted-types';
+import { getChangeNodeFromView } from '../SerializationUtilities';
+import { deserialize, getSummaryStatistics } from '../SummaryBackCompatibility';
+import { getUploadedEditChunkContents } from '../SummaryTestUtilities';
+import { IdCompressor } from '../id-compressor';
+import { convertEditIds } from '../IdConversion';
+import { MutableStringInterner } from '../StringInterner';
+import { sequencedIdNormalizer } from '../NodeIdUtilities';
+import { expectDefined } from './utilities/TestCommon';
+import { TestFluidSerializer } from './utilities/TestSerializer';
+import { getIdNormalizerFromSharedTree, makeNodeIdContext, setUpLocalServerTestSharedTree, testDocumentsPathBase, } from './utilities/TestUtilities';
+const directory = join(testDocumentsPathBase, 'summary-tests');
+/** Applies a smattering of interesting edits to the given shared tree in an attempt to cover a variety of use cases  */
+export function applyTestEdits(sharedTree) {
+    const uuid = new DeterministicIdGenerator(sharedTree.getWriteFormat(), sharedTree);
+    function applyEdit(changes) {
+        const internalChanges = changes.map((c) => sharedTree.internalizeChange(c));
+        sharedTree.applyEditInternal({ id: uuid.getNextEditId(), changes: internalChanges });
+    }
+    /**
+     * Build a tree that looks like the following:
+     *
+     *          ROOT
+     *            |   'root'
+     *         [root]
+     * 'left'  /    \  'right'
+     *       [A]    [B, C, D]
+     *                  | 'leaf'
+     *                 [E('payload')]
+     */
+    const cDetachedId = 0;
+    const rootDetachedId = 1;
+    const aId = uuid.getNextNodeId();
+    const cId = uuid.getNextNodeId();
+    const dId = uuid.getNextNodeId();
+    applyEdit([
+        Change.build([
+            {
+                definition: 'C',
+                identifier: cId,
+                traits: {
+                    leaf: [
+                        {
+                            definition: 'E',
+                            identifier: uuid.getNextNodeId(),
+                            payload: 'payload',
+                        },
+                    ],
+                },
+            },
+        ], cDetachedId),
+        Change.build([
+            {
+                definition: 'Root',
+                identifier: uuid.getNextNodeId(),
+                traits: {
+                    left: [{ definition: 'A', identifier: aId }],
+                    right: [
+                        { definition: 'B', identifier: uuid.getNextNodeId() },
+                        cDetachedId,
+                        { definition: 'D', identifier: dId },
+                    ],
+                },
+            },
+        ], rootDetachedId),
+        Change.insert(rootDetachedId, StablePlace.atStartOf({
+            label: 'root',
+            parent: sharedTree.convertToNodeId(initialTree.identifier),
+        })),
+    ]);
+    /**
+     * Edit the tree
+     *
+     * 1. Move C after A
+     * 2. Delete D
+     * 3.
+     * ...
+     * 102. Set the payload of A to _i_ for all _i_ in 0...100
+     */
+    applyEdit([...Change.move(StableRange.only(cId), StablePlace.after(aId))]);
+    applyEdit([Change.delete(StableRange.only(dId))]);
+    for (let i = 0; i < 100; i++) {
+        applyEdit([Change.setPayload(aId, i)]);
+    }
+}
+export async function createSummaryTestTree(writeFormat, summarizeHistory) {
+    const { tree, testObjectProvider } = await setUpLocalServerTestSharedTree({
+        writeFormat,
+        summarizeHistory,
+        uploadEditChunks: summarizeHistory,
+    });
+    if (writeFormat === WriteFormat.v0_1_1) {
+        const idCompressor = new IdCompressor('968bee41-bcf7-46d2-8035-6eb163b76c4c', reservedIdCount);
+        const interner = new MutableStringInterner([initialTree.definition]);
+        const context = makeNodeIdContext(idCompressor);
+        const normalizer = sequencedIdNormalizer(context);
+        const sharedTreeSummaryWithConstantSessionId = {
+            version: WriteFormat.v0_1_1,
+            currentTree: summarizeHistory
+                ? [
+                    interner.getOrCreateInternedId(initialTree.definition),
+                    normalizer.normalizeToOpSpace(context.convertToNodeId(initialTree.identifier)),
+                ]
+                : undefined,
+            editHistory: {
+                editIds: [],
+                editChunks: [],
+            },
+            idCompressor: idCompressor.serialize(true),
+            internedStrings: interner.getSerializable(),
+        };
+        tree.loadSummary(sharedTreeSummaryWithConstantSessionId);
+    }
+    applyTestEdits(tree);
+    await testObjectProvider.ensureSynchronized();
+    return tree;
+}
+export function runSummaryTests(title) {
+    describe(title, () => {
+        // Note: this test serializer doesn't handle blobs properly (it just uses JSON.stringify/JSON.parse).
+        const testSerializer = new TestFluidSerializer();
+        const { summaryFileWithHistory_0_0_2, summaryFileNoHistory_0_0_2, summaryFileEmptyTraits_0_0_2, summaryFileWithHistory_0_1_1, summaryFileNoHistory_0_1_1, summaryFileUpgrade_0_1_1, blobsFile, } = loadSummaryTestFiles();
+        // Note: Fluid setup gives stable `absolutePath`s for these blobs across sessions. If that were not the case,
+        // this test suite would need to build some kind of map from the blob info saved on disk to the `IFluidHandle`
+        // list returned by uploading these blobs.
+        const blobsParsed = JSON.parse(blobsFile);
+        const blobs = blobsParsed.map((blob) => IsoBuffer.from(JSON.stringify(blob.chunkContents), 'utf8'));
+        // Re-enable this test for an easy way to write the test summary files to disk
+        it.skip('save files to disk', async () => {
+            await makeSummaryTestFiles();
+        });
+        describe('0.0.2 write format', () => {
+            const setUp002Tree = async (options) => setUpLocalServerTestSharedTree(Object.assign({ writeFormat: WriteFormat.v0_0_2 }, options));
+            const setUp002SummaryTestTree = async (summarizeHistory) => createSummaryTestTree(WriteFormat.v0_0_2, summarizeHistory);
+            it('Normalizes a denormalized summary containing nodes with empty traits', async () => {
+                const { tree } = await setUp002Tree({});
+                tree.loadSerializedSummary(summaryFileEmptyTraits_0_0_2);
+                const { tree: expectedTree } = await setUp002Tree({});
+                expectedTree.loadSerializedSummary(summaryFileWithHistory_0_0_2);
+                expect(getChangeNodeFromView(tree.currentView)).deep.equals(getChangeNodeFromView(expectedTree.currentView));
+            });
+            it('writes 0.0.2 files without history', async () => {
+                const tree = await setUp002SummaryTestTree(false);
+                const summary = JSON.parse(tree.saveSerializedSummary());
+                const expectedSummary = JSON.parse(summaryFileNoHistory_0_0_2);
+                // The edit ID of the single "no history edit" is generated randomly. Replace it with the baseline edit for the sake of this test.
+                summary.sequencedEdits[0].id = expectedSummary.sequencedEdits[0].id;
+                expect(summary).to.deep.equal(expectedSummary);
+            });
+            it('writes 0.0.2 files with history', async () => {
+                const tree = await setUp002SummaryTestTree(true);
+                expect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(JSON.parse(summaryFileWithHistory_0_0_2));
+            });
+            describe('reading the same version', () => {
+                it('reads 0.0.2 files without history', async () => {
+                    const { tree } = await setUp002Tree({});
+                    tree.loadSerializedSummary(summaryFileNoHistory_0_0_2);
+                    // Tree should have exactly one edit, as all "no history" summaries do.
+                    expect(tree.edits.length).to.equal(1);
+                    // Load a baseline tree's own summary with no history to compare with
+                    const summaryNoHistory = (await setUp002SummaryTestTree(false)).saveSummary();
+                    const { tree: expectedTree } = await setUp002Tree({ summarizeHistory: false });
+                    expectedTree.loadSummary(summaryNoHistory);
+                    await expectSharedTreesEqual(tree, expectedTree, false);
+                });
+                it('reads 0.0.2 files with history', async () => {
+                    const { tree } = await setUp002Tree({});
+                    tree.loadSerializedSummary(summaryFileWithHistory_0_0_2);
+                    const expectedTree = await setUp002SummaryTestTree(true);
+                    await expectSharedTreesEqual(tree, expectedTree);
+                });
+            });
+            describe('reading next version', () => {
+                it('reads 0.1.1', async () => {
+                    const { tree } = await setUp002Tree({});
+                    tree.loadSerializedSummary(summaryFileWithHistory_0_1_1);
+                    // TODO: There may need to be a testObjectProvider synchronization here to upload
+                    // blobs from this summary.
+                    // We should also look at how this test asserts behavior w.r.t blobs.
+                    const newSummary = JSON.parse(tree.saveSerializedSummary());
+                    const expectedSummary = JSON.parse(summaryFileWithHistory_0_1_1);
+                    expect(newSummary).to.deep.equal(expectedSummary);
+                });
+            });
+            it('gives correct SummaryStatistics', async () => {
+                const { tree } = await setUp002Tree({});
+                tree.loadSerializedSummary(summaryFileWithHistory_0_0_2);
+                const editCount = tree.edits.length;
+                const summary = deserialize(summaryFileWithHistory_0_0_2, testSerializer);
+                const telemetryInfo = getSummaryStatistics(summary);
+                const expectedTelemetryInfo = {
+                    formatVersion: WriteFormat.v0_0_2,
+                    historySize: editCount,
+                };
+                expect(telemetryInfo).to.deep.equals(expectedTelemetryInfo);
+            });
+        });
+        describe('0.1.1 write format', () => {
+            const setUp011Tree = async (options) => setUpLocalServerTestSharedTree(Object.assign({ writeFormat: WriteFormat.v0_1_1 }, options));
+            const setUp011SummaryTestTree = async (summarizeHistory) => createSummaryTestTree(WriteFormat.v0_1_1, summarizeHistory);
+            it('writes 0.1.1 files without history', async () => {
+                var _a;
+                const tree = await setUp011SummaryTestTree(false);
+                const summary = JSON.parse(tree.saveSerializedSummary());
+                const expectedSummary = JSON.parse(summaryFileNoHistory_0_1_1);
+                // The edit ID of the single "no history edit" is generated randomly. Replace it with the baseline edit for the sake of this test.
+                expectDefined(summary.editHistory).editIds[0] = expectDefined((_a = expectedSummary.editHistory) === null || _a === void 0 ? void 0 : _a.editIds[0]);
+                expect(summary).to.deep.equal(expectedSummary);
+                expect(await getUploadedEditChunkContents(tree)).to.deep.equal([]);
+            });
+            it('writes 0.1.1 files with history', async () => {
+                const tree = await setUp011SummaryTestTree(true);
+                expect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(JSON.parse(summaryFileWithHistory_0_1_1));
+                expect(await getUploadedEditChunkContents(tree)).to.deep.equal(blobsParsed);
+            });
+            describe('reading the same version', () => {
+                it('reads 0.1.1 files without history', async () => {
+                    const { tree } = await setUp011Tree({ blobs });
+                    tree.loadSerializedSummary(summaryFileNoHistory_0_1_1);
+                    // Tree should have exactly one edit, as all "no history" summaries do.
+                    expect(tree.edits.length).to.equal(1);
+                    // Load a baseline tree's own summary with no history to compare with
+                    const summaryNoHistory = (await setUp011SummaryTestTree(false)).saveSummary();
+                    const { tree: expectedTree } = await setUp011Tree({ summarizeHistory: false });
+                    expectedTree.loadSummary(summaryNoHistory);
+                    await expectSharedTreesEqual(tree, expectedTree, false);
+                });
+                it('reads 0.1.1 files with history', async () => {
+                    const { tree } = await setUp011Tree({ blobs });
+                    tree.loadSerializedSummary(summaryFileWithHistory_0_1_1);
+                    const expectedTree = await setUp011SummaryTestTree(false);
+                    await expectSharedTreesEqual(tree, expectedTree);
+                });
+            });
+            describe('reading previous versions', () => {
+                it('reads 0.0.2', async () => {
+                    const expectedTree = await setUp011SummaryTestTree(true);
+                    const { tree } = await setUp011Tree({});
+                    tree.loadSerializedSummary(summaryFileWithHistory_0_0_2);
+                    await expectSharedTreesEqual(tree, expectedTree);
+                    expect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(JSON.parse(summaryFileWithHistory_0_0_2));
+                });
+                it('upgrades 0.0.2', async () => {
+                    const { tree, testObjectProvider } = await setUp011Tree({});
+                    tree.loadSerializedSummary(summaryFileWithHistory_0_0_2);
+                    // Synchronize to give a chance for the update op to be sequenced.
+                    await testObjectProvider.ensureSynchronized();
+                    const expectedTree = await setUp011SummaryTestTree(true);
+                    await expectSharedTreesEqual(tree, expectedTree);
+                    expect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(JSON.parse(summaryFileUpgrade_0_1_1));
+                });
+                it('upgrades 0.0.2 that has several stale ops that it resubmits', async () => {
+                    const { tree: resubmitTree, testObjectProvider } = await setUpLocalServerTestSharedTree({
+                        writeFormat: WriteFormat.v0_0_2,
+                    });
+                    applyTestEdits(resubmitTree);
+                    const { tree: tree } = await setUpLocalServerTestSharedTree({
+                        writeFormat: WriteFormat.v0_1_1,
+                        testObjectProvider,
+                    });
+                    await testObjectProvider.ensureSynchronized();
+                    await expectSharedTreesEqual(resubmitTree, tree);
+                    await expectSharedTreesEqual(tree, await createSummaryTestTree(WriteFormat.v0_1_1, true));
+                });
+                it('Normalizes a denormalized summary containing nodes with empty traits', async () => {
+                    const { tree } = await setUp011Tree({});
+                    tree.loadSerializedSummary(summaryFileEmptyTraits_0_0_2);
+                    const { tree: expectedTree } = await setUp011Tree({});
+                    expectedTree.loadSerializedSummary(summaryFileWithHistory_0_0_2);
+                    expect(areRevisionViewsSemanticallyEqual(tree.currentView, tree, expectedTree.currentView, expectedTree));
+                });
+            });
+            it('gives correct SummaryStatistics', async () => {
+                const { tree } = await setUp011Tree({});
+                tree.loadSerializedSummary(summaryFileWithHistory_0_1_1);
+                const editCount = tree.edits.length;
+                const summary = deserialize(summaryFileWithHistory_0_1_1, testSerializer);
+                const telemetryInfo = getSummaryStatistics(summary);
+                const totalChunks = Math.ceil(editCount / editsPerChunk);
+                const expectedTelemetryInfo = {
+                    formatVersion: WriteFormat.v0_1_1,
+                    historySize: editCount,
+                    totalNumberOfChunks: totalChunks,
+                    uploadedChunks: 
+                    // If the last chunk is bigger than the number of edits per chunk, it has also been uploaded
+                    editCount - Math.floor(editCount / editsPerChunk) * editsPerChunk < editsPerChunk &&
+                        totalChunks !== 0
+                        ? totalChunks - 1
+                        : totalChunks,
+                };
+                expect(telemetryInfo).to.deep.equals(expectedTelemetryInfo);
+            });
+        });
+    });
+}
+export function expectAssert(condition, message) {
+    expect(condition, message);
+}
+async function expectSharedTreesEqual(sharedTreeA, sharedTreeB, compareEditIds = true) {
+    if (!areRevisionViewsSemanticallyEqual(sharedTreeA.currentView, sharedTreeA, sharedTreeB.currentView, sharedTreeB)) {
+        expect.fail('trees have different current views');
+    }
+    if (sharedTreeA.edits.length !== sharedTreeB.edits.length) {
+        expect.fail('trees have different amounts of edits');
+    }
+    for (let i = 0; i < sharedTreeA.edits.length; i++) {
+        const roundTrip = (obj) => JSON.parse(JSON.stringify(obj));
+        const editA = roundTrip(convertEditIds(await sharedTreeA.editsInternal.getEditAtIndex(i), (id) => sharedTreeA.convertToStableNodeId(id)));
+        const editB = roundTrip(convertEditIds(await sharedTreeB.editsInternal.getEditAtIndex(i), (id) => sharedTreeB.convertToStableNodeId(id)));
+        if (compareEditIds) {
+            expect(editA).to.deep.equal(editB, `trees have different edits (index ${i})`);
+        }
+        else {
+            expect(editA.changes).to.deep.equal(editB.changes, `edits have different changes (index ${i})`);
+        }
+    }
+}
+function loadSummaryTestFiles() {
+    const summaryFileWithHistory_0_0_2 = fs.readFileSync(join(directory, 'summary-0-0-2.json'), 'utf8');
+    const summaryFileNoHistory_0_0_2 = fs.readFileSync(join(directory, 'summary-no-history-0-0-2.json'), 'utf8');
+    const summaryFileEmptyTraits_0_0_2 = fs.readFileSync(join(directory, 'summary-empty-traits-0-0-2.json'), 'utf8');
+    const summaryFileWithHistory_0_1_1 = fs.readFileSync(join(directory, 'summary-0-1-1.json'), 'utf8');
+    const summaryFileNoHistory_0_1_1 = fs.readFileSync(join(directory, 'summary-no-history-0-1-1.json'), 'utf8');
+    const summaryFileUpgrade_0_1_1 = fs.readFileSync(join(directory, 'summary-upgrade-0-1-1.json'), 'utf8');
+    const blobsFile = fs.readFileSync(join(directory, 'blobs-0-1-1.json'), 'utf8');
+    return {
+        summaryFileWithHistory_0_0_2,
+        summaryFileNoHistory_0_0_2,
+        summaryFileEmptyTraits_0_0_2,
+        summaryFileWithHistory_0_1_1,
+        summaryFileNoHistory_0_1_1,
+        summaryFileUpgrade_0_1_1,
+        blobsFile,
+    };
+}
+async function makeSummaryTestFiles() {
+    try {
+        fs.accessSync(directory);
+    }
+    catch (_a) {
+        fs.mkdirSync(directory);
+    }
+    const treeWithHistory_0_0_2 = await createSummaryTestTree(WriteFormat.v0_0_2, true);
+    const treeNoHistory_0_0_2 = await createSummaryTestTree(WriteFormat.v0_0_2, false);
+    const treeWithHistory_0_1_1 = await createSummaryTestTree(WriteFormat.v0_1_1, true);
+    const treeNoHistory_0_1_1 = await createSummaryTestTree(WriteFormat.v0_1_1, false);
+    fs.writeFileSync(join(directory, `summary-0-0-2.json`), treeWithHistory_0_0_2.saveSerializedSummary());
+    fs.writeFileSync(join(directory, `summary-no-history-0-0-2.json`), treeNoHistory_0_0_2.saveSerializedSummary());
+    fs.writeFileSync(join(directory, `summary-0-1-1.json`), treeWithHistory_0_1_1.saveSerializedSummary());
+    fs.writeFileSync(join(directory, `summary-no-history-0-1-1.json`), treeNoHistory_0_1_1.saveSerializedSummary());
+    const blobs = await getUploadedEditChunkContents(treeWithHistory_0_1_1);
+    assert(blobs.length > 0);
+    fs.writeFileSync(join(directory, `blobs-0-1-1.json`), JSON.stringify(blobs));
+    const { tree: upgradedTree, testObjectProvider } = await setUpLocalServerTestSharedTree({
+        writeFormat: WriteFormat.v0_1_1,
+        summarizeHistory: true,
+    });
+    upgradedTree.loadSummary(treeWithHistory_0_0_2.saveSummary());
+    await testObjectProvider.ensureSynchronized();
+    fs.writeFileSync(join(directory, `summary-upgrade-0-1-1.json`), upgradedTree.saveSerializedSummary());
+}
+/** Every instance of this class generates the same sequence of v5 UUIDs */
+class DeterministicIdGenerator {
+    constructor(writeFormat, sharedTree) {
+        this.writeFormat = writeFormat;
+        this.sharedTree = sharedTree;
+        this.editIdCount = 0;
+        if (this.writeFormat === WriteFormat.v0_1_1) {
+            assert(getIdNormalizerFromSharedTree(sharedTree).localSessionId === DeterministicIdGenerator.sessionId);
+        }
+        else {
+            assert(getIdNormalizerFromSharedTree(sharedTree).localSessionId !== DeterministicIdGenerator.sessionId);
+            this.constantIdCompressor = new IdCompressor(DeterministicIdGenerator.sessionId, reservedIdCount);
+        }
+    }
+    getNextEditId() {
+        return v5((this.editIdCount++).toString(), DeterministicIdGenerator.uuidNamespace);
+    }
+    getNextNodeId() {
+        if (this.writeFormat === WriteFormat.v0_0_2) {
+            return this.sharedTree.generateNodeId(this.getNextStableId());
+        }
+        else {
+            return this.sharedTree.generateNodeId();
+        }
+    }
+    getNextStableId() {
+        assert(this.constantIdCompressor !== undefined);
+        return this.constantIdCompressor.decompress(this.constantIdCompressor.generateCompressedId());
+    }
+}
+DeterministicIdGenerator.sessionId = '968bee41-bcf7-46d2-8035-6eb163b76c4c';
+DeterministicIdGenerator.uuidNamespace = '44864298-500e-4cf8-9f44-a249e5b3a286';
+//# sourceMappingURL=Summary.tests.js.map