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

package/lib/test/utilities/SummaryLoadPerfTests.js

@@ -1,105 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { join } from 'path';
-import * as fs from 'fs';
-import { takeAsync } from '@fluid-private/stochastic-test-utils';
-import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
-import { WriteFormat } from '../../persisted-types/index.js';
-import { performFuzzActions } from '../fuzz/SharedTreeFuzzTests.js';
-import { makeOpGenerator } from '../fuzz/Generators.js';
-import { areRevisionViewsSemanticallyEqual } from '../../EditUtilities.js';
-import { setUpLocalServerTestSharedTree, setUpTestSharedTree, testDocumentsPathBase } from './TestUtilities.js';
-import { expectAssert } from './TestCommon.js';
-const directory = join(testDocumentsPathBase, 'summary-load-perf-tests');
-/**
- * Runs a test suite for summary load perf on `SharedTree`.
- * This suite can be used to test other implementations that aim to fulfill `SharedTree`'s contract.
- */
-export function runSummaryLoadPerfTests(title) {
-    describe(title, () => {
-        // Re-enable this test for an easy way to write the test summary files to disk
-        it.skip('save files to disk', async () => {
-            await writeSummaryTestTrees();
-        });
-        const { summaryFileWithHistory_0_0_2, summaryFileNoHistory_0_0_2, summaryFileWithHistory_0_1_1, summaryFileNoHistory_0_1_1,
-        // blobsFile: string;
-         } = loadSummaryTestFiles();
-        const tests = [
-            { title: 'load 0.0.2 format without history', file: summaryFileNoHistory_0_0_2 },
-            { title: 'load 0.0.2 format with history', file: summaryFileWithHistory_0_0_2 },
-            { title: 'load 0.1.1 format without history', file: summaryFileNoHistory_0_1_1 },
-            { title: 'load 0.1.1 format with history', file: summaryFileWithHistory_0_1_1 },
-        ];
-        for (const { title, file } of tests) {
-            benchmark({
-                type: BenchmarkType.Measurement,
-                title,
-                benchmarkFn: () => {
-                    const { tree } = setUpTestSharedTree({ writeFormat: WriteFormat.v0_0_2 });
-                    tree.loadSerializedSummary(file);
-                },
-            });
-        }
-    });
-}
-async function generateRandomTree(seed, maxTreeSize, writeFormat, summarizeHistory) {
-    const generator = takeAsync(1000, makeOpGenerator({
-        editConfig: { maxTreeSize },
-        joinConfig: {
-            writeFormat: [writeFormat],
-            summarizeHistory: [summarizeHistory],
-            maximumActiveCollaborators: 2,
-            maximumPassiveCollaborators: 0,
-        },
-    }));
-    const { testObjectProvider } = await performFuzzActions(generator, seed, true);
-    const { tree: finalTree } = await setUpLocalServerTestSharedTree({
-        testObjectProvider,
-        summarizeHistory,
-        writeFormat,
-    });
-    await testObjectProvider.ensureSynchronized();
-    return finalTree;
-}
-async function writeSummaryTestTrees() {
-    if (!fs.existsSync(directory)) {
-        fs.mkdirSync(directory);
-    }
-    const seed = 24601;
-    const tree002 = await generateRandomTree(seed, 1000, WriteFormat.v0_0_2, true);
-    const tree011 = await generateRandomTree(seed, 1000, WriteFormat.v0_1_1, true);
-    const tree002NoHistory = await generateRandomTree(seed, 1000, WriteFormat.v0_0_2, false);
-    const tree011NoHistory = await generateRandomTree(seed, 1000, WriteFormat.v0_1_1, false);
-    expectAssert(areRevisionViewsSemanticallyEqual(tree002.currentView, tree002, tree011.currentView, tree011));
-    expectAssert(areRevisionViewsSemanticallyEqual(tree002.currentView, tree002, tree002NoHistory.currentView, tree002NoHistory));
-    expectAssert(areRevisionViewsSemanticallyEqual(tree011.currentView, tree011, tree011NoHistory.currentView, tree011NoHistory));
-    const { promises: fsP } = fs;
-    await fsP.writeFile(join(directory, 'summary-0-0-2.json'), tree002.saveSerializedSummary());
-    await fsP.writeFile(join(directory, 'summary-0-1-1.json'), tree011.saveSerializedSummary());
-    await fsP.writeFile(join(directory, 'summary-no-history-0-0-2.json'), tree002NoHistory.saveSerializedSummary());
-    await fsP.writeFile(join(directory, 'summary-no-history-0-1-1.json'), tree011NoHistory.saveSerializedSummary());
-}
-function loadSummaryTestFiles() {
-    const readFile = (name) => {
-        const contents = fs.readFileSync(join(directory, name), 'utf-8');
-        // Round-trip the file so that performance testing summary doesn't require parsing unnecessary/unrealistic whitespace
-        return JSON.stringify(JSON.parse(contents));
-    };
-    const summaryFileWithHistory_0_0_2 = readFile('summary-0-0-2.json');
-    const summaryFileNoHistory_0_0_2 = readFile('summary-no-history-0-0-2.json');
-    const summaryFileWithHistory_0_1_1 = readFile('summary-0-1-1.json');
-    const summaryFileNoHistory_0_1_1 = readFile('summary-no-history-0-1-1.json');
-    // Note: We don't bother writing/reading a "blobs" file for this test suite because loading a serialized summary
-    // with history should never involve attempting to get any of those blobs.
-    // This *is* a fair comparison from a perf perspective b/c the whole point of chunking edit history is to decrease
-    // summary size for potentially unused edit information.
-    return {
-        summaryFileWithHistory_0_0_2,
-        summaryFileNoHistory_0_0_2,
-        summaryFileWithHistory_0_1_1,
-        summaryFileNoHistory_0_1_1,
-    };
-}
-//# sourceMappingURL=SummaryLoadPerfTests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"SummaryLoadPerfTests.js","sourceRoot":"","sources":["../../../src/test/utilities/SummaryLoadPerfTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,EAAE,SAAS,EAAE,MAAM,sCAAsC,CAAC;AACjE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAElE,OAAO,EAAE,WAAW,EAAE,MAAM,gCAAgC,CAAC;AAC7D,OAAO,EAAE,kBAAkB,EAAE,MAAM,gCAAgC,CAAC;AACpE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,iCAAiC,EAAE,MAAM,wBAAwB,CAAC;AAC3E,OAAO,EAAE,8BAA8B,EAAE,mBAAmB,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAChH,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,EAAE,yBAAyB,CAAC,CAAC;AAEzE;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAa;IACpD,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACpB,8EAA8E;QAC9E,EAAE,CAAC,IAAI,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE;YACxC,MAAM,qBAAqB,EAAE,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,EACL,4BAA4B,EAC5B,0BAA0B,EAC1B,4BAA4B,EAC5B,0BAA0B;QAC1B,qBAAqB;UACrB,GAAG,oBAAoB,EAAE,CAAC;QAE3B,MAAM,KAAK,GAAG;YACb,EAAE,KAAK,EAAE,mCAAmC,EAAE,IAAI,EAAE,0BAA0B,EAAE;YAChF,EAAE,KAAK,EAAE,gCAAgC,EAAE,IAAI,EAAE,4BAA4B,EAAE;YAC/E,EAAE,KAAK,EAAE,mCAAmC,EAAE,IAAI,EAAE,0BAA0B,EAAE;YAChF,EAAE,KAAK,EAAE,gCAAgC,EAAE,IAAI,EAAE,4BAA4B,EAAE;SAC/E,CAAC;QAEF,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE;YACpC,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa,CAAC,WAAW;gBAC/B,KAAK;gBACL,WAAW,EAAE,GAAG,EAAE;oBACjB,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,CAAC,EAAE,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;oBAC1E,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;aACD,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,KAAK,UAAU,kBAAkB,CAChC,IAAY,EACZ,WAAmB,EACnB,WAAwB,EACxB,gBAAyB;IAEzB,MAAM,SAAS,GAAG,SAAS,CAC1B,IAAI,EACJ,eAAe,CAAC;QACf,UAAU,EAAE,EAAE,WAAW,EAAE;QAC3B,UAAU,EAAE;YACX,WAAW,EAAE,CAAC,WAAW,CAAC;YAC1B,gBAAgB,EAAE,CAAC,gBAAgB,CAAC;YACpC,0BAA0B,EAAE,CAAC;YAC7B,2BAA2B,EAAE,CAAC;SAC9B;KACD,CAAC,CACF,CAAC;IACF,MAAM,EAAE,kBAAkB,EAAE,GAAG,MAAM,kBAAkB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC/E,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,MAAM,8BAA8B,CAAC;QAChE,kBAAkB;QAClB,gBAAgB;QAChB,WAAW;KACX,CAAC,CAAC;IACH,MAAM,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;IAC9C,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,KAAK,UAAU,qBAAqB;IACnC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE;QAC9B,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;KACxB;IAED,MAAM,IAAI,GAAG,KAAK,CAAC;IACnB,MAAM,OAAO,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/E,MAAM,OAAO,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC/E,MAAM,gBAAgB,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACzF,MAAM,gBAAgB,GAAG,MAAM,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEzF,YAAY,CAAC,iCAAiC,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,EAAE,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC;IAC5G,YAAY,CACX,iCAAiC,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,EAAE,gBAAgB,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAC/G,CAAC;IACF,YAAY,CACX,iCAAiC,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,EAAE,gBAAgB,CAAC,WAAW,EAAE,gBAAgB,CAAC,CAC/G,CAAC;IACF,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAC7B,MAAM,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,EAAE,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAC5F,MAAM,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,EAAE,OAAO,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAC5F,MAAM,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,EAAE,gBAAgB,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAChH,MAAM,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,EAAE,gBAAgB,CAAC,qBAAqB,EAAE,CAAC,CAAC;AACjH,CAAC;AAED,SAAS,oBAAoB;IAM5B,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAU,EAAE;QACzC,MAAM,QAAQ,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,OAAO,CAAC,CAAC;QACjE,qHAAqH;QACrH,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC;IACF,MAAM,4BAA4B,GAAG,QAAQ,CAAC,oBAAoB,CAAC,CAAC;IACpE,MAAM,0BAA0B,GAAG,QAAQ,CAAC,+BAA+B,CAAC,CAAC;IAC7E,MAAM,4BAA4B,GAAG,QAAQ,CAAC,oBAAoB,CAAC,CAAC;IACpE,MAAM,0BAA0B,GAAG,QAAQ,CAAC,+BAA+B,CAAC,CAAC;IAE7E,gHAAgH;IAChH,0EAA0E;IAC1E,kHAAkH;IAClH,wDAAwD;IAExD,OAAO;QACN,4BAA4B;QAC5B,0BAA0B;QAC1B,4BAA4B;QAC5B,0BAA0B;KAC1B,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { join } from 'path';\nimport * as fs from 'fs';\nimport { takeAsync } from '@fluid-private/stochastic-test-utils';\nimport { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { SharedTree } from '../../SharedTree.js';\nimport { WriteFormat } from '../../persisted-types/index.js';\nimport { performFuzzActions } from '../fuzz/SharedTreeFuzzTests.js';\nimport { makeOpGenerator } from '../fuzz/Generators.js';\nimport { areRevisionViewsSemanticallyEqual } from '../../EditUtilities.js';\nimport { setUpLocalServerTestSharedTree, setUpTestSharedTree, testDocumentsPathBase } from './TestUtilities.js';\nimport { expectAssert } from './TestCommon.js';\n\nconst directory = join(testDocumentsPathBase, 'summary-load-perf-tests');\n\n/**\n * Runs a test suite for summary load perf on `SharedTree`.\n * This suite can be used to test other implementations that aim to fulfill `SharedTree`'s contract.\n */\nexport function runSummaryLoadPerfTests(title: string): void {\n\tdescribe(title, () => {\n\t\t// Re-enable this test for an easy way to write the test summary files to disk\n\t\tit.skip('save files to disk', async () => {\n\t\t\tawait writeSummaryTestTrees();\n\t\t});\n\n\t\tconst {\n\t\t\tsummaryFileWithHistory_0_0_2,\n\t\t\tsummaryFileNoHistory_0_0_2,\n\t\t\tsummaryFileWithHistory_0_1_1,\n\t\t\tsummaryFileNoHistory_0_1_1,\n\t\t\t// blobsFile: string;\n\t\t} = loadSummaryTestFiles();\n\n\t\tconst tests = [\n\t\t\t{ title: 'load 0.0.2 format without history', file: summaryFileNoHistory_0_0_2 },\n\t\t\t{ title: 'load 0.0.2 format with history', file: summaryFileWithHistory_0_0_2 },\n\t\t\t{ title: 'load 0.1.1 format without history', file: summaryFileNoHistory_0_1_1 },\n\t\t\t{ title: 'load 0.1.1 format with history', file: summaryFileWithHistory_0_1_1 },\n\t\t];\n\n\t\tfor (const { title, file } of tests) {\n\t\t\tbenchmark({\n\t\t\t\ttype: BenchmarkType.Measurement,\n\t\t\t\ttitle,\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tconst { tree } = setUpTestSharedTree({ writeFormat: WriteFormat.v0_0_2 });\n\t\t\t\t\ttree.loadSerializedSummary(file);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t});\n}\n\nasync function generateRandomTree(\n\tseed: number,\n\tmaxTreeSize: number,\n\twriteFormat: WriteFormat,\n\tsummarizeHistory: boolean\n): Promise<SharedTree> {\n\tconst generator = takeAsync(\n\t\t1000,\n\t\tmakeOpGenerator({\n\t\t\teditConfig: { maxTreeSize },\n\t\t\tjoinConfig: {\n\t\t\t\twriteFormat: [writeFormat],\n\t\t\t\tsummarizeHistory: [summarizeHistory],\n\t\t\t\tmaximumActiveCollaborators: 2,\n\t\t\t\tmaximumPassiveCollaborators: 0,\n\t\t\t},\n\t\t})\n\t);\n\tconst { testObjectProvider } = await performFuzzActions(generator, seed, true);\n\tconst { tree: finalTree } = await setUpLocalServerTestSharedTree({\n\t\ttestObjectProvider,\n\t\tsummarizeHistory,\n\t\twriteFormat,\n\t});\n\tawait testObjectProvider.ensureSynchronized();\n\treturn finalTree;\n}\n\nasync function writeSummaryTestTrees(): Promise<void> {\n\tif (!fs.existsSync(directory)) {\n\t\tfs.mkdirSync(directory);\n\t}\n\n\tconst seed = 24601;\n\tconst tree002 = await generateRandomTree(seed, 1000, WriteFormat.v0_0_2, true);\n\tconst tree011 = await generateRandomTree(seed, 1000, WriteFormat.v0_1_1, true);\n\tconst tree002NoHistory = await generateRandomTree(seed, 1000, WriteFormat.v0_0_2, false);\n\tconst tree011NoHistory = await generateRandomTree(seed, 1000, WriteFormat.v0_1_1, false);\n\n\texpectAssert(areRevisionViewsSemanticallyEqual(tree002.currentView, tree002, tree011.currentView, tree011));\n\texpectAssert(\n\t\tareRevisionViewsSemanticallyEqual(tree002.currentView, tree002, tree002NoHistory.currentView, tree002NoHistory)\n\t);\n\texpectAssert(\n\t\tareRevisionViewsSemanticallyEqual(tree011.currentView, tree011, tree011NoHistory.currentView, tree011NoHistory)\n\t);\n\tconst { promises: fsP } = fs;\n\tawait fsP.writeFile(join(directory, 'summary-0-0-2.json'), tree002.saveSerializedSummary());\n\tawait fsP.writeFile(join(directory, 'summary-0-1-1.json'), tree011.saveSerializedSummary());\n\tawait fsP.writeFile(join(directory, 'summary-no-history-0-0-2.json'), tree002NoHistory.saveSerializedSummary());\n\tawait fsP.writeFile(join(directory, 'summary-no-history-0-1-1.json'), tree011NoHistory.saveSerializedSummary());\n}\n\nfunction loadSummaryTestFiles(): {\n\tsummaryFileWithHistory_0_0_2: string;\n\tsummaryFileNoHistory_0_0_2: string;\n\tsummaryFileWithHistory_0_1_1: string;\n\tsummaryFileNoHistory_0_1_1: string;\n} {\n\tconst readFile = (name: string): string => {\n\t\tconst contents = fs.readFileSync(join(directory, name), 'utf-8');\n\t\t// Round-trip the file so that performance testing summary doesn't require parsing unnecessary/unrealistic whitespace\n\t\treturn JSON.stringify(JSON.parse(contents));\n\t};\n\tconst summaryFileWithHistory_0_0_2 = readFile('summary-0-0-2.json');\n\tconst summaryFileNoHistory_0_0_2 = readFile('summary-no-history-0-0-2.json');\n\tconst summaryFileWithHistory_0_1_1 = readFile('summary-0-1-1.json');\n\tconst summaryFileNoHistory_0_1_1 = readFile('summary-no-history-0-1-1.json');\n\n\t// Note: We don't bother writing/reading a \"blobs\" file for this test suite because loading a serialized summary\n\t// with history should never involve attempting to get any of those blobs.\n\t// This *is* a fair comparison from a perf perspective b/c the whole point of chunking edit history is to decrease\n\t// summary size for potentially unused edit information.\n\n\treturn {\n\t\tsummaryFileWithHistory_0_0_2,\n\t\tsummaryFileNoHistory_0_0_2,\n\t\tsummaryFileWithHistory_0_1_1,\n\t\tsummaryFileNoHistory_0_1_1,\n\t};\n}\n"]}

package/lib/test/utilities/SummarySizeTests.d.ts

@@ -1,11 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { LocalServerSharedTreeTestingComponents, LocalServerSharedTreeTestingOptions } from './TestUtilities.js';
-/**
- * Runs a test suite for summaries on `SharedTree` that verifies their sizes do not exceed the defined limits.
- * This suite can be used to test other implementations that aim to fulfill `SharedTree`'s contract.
- */
-export declare function runSummarySizeTests(title: string, setUpLocalServerTestSharedTree: (options: LocalServerSharedTreeTestingOptions) => Promise<LocalServerSharedTreeTestingComponents>): void;
-//# sourceMappingURL=SummarySizeTests.d.ts.map

package/lib/test/utilities/SummarySizeTests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SummarySizeTests.d.ts","sourceRoot":"","sources":["../../../src/test/utilities/SummarySizeTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAaH,OAAO,EACN,sCAAsC,EACtC,mCAAmC,EAEnC,MAAM,oBAAoB,CAAC;AAwF5B;;;GAGG;AACH,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,MAAM,EACb,8BAA8B,EAAE,CAC/B,OAAO,EAAE,mCAAmC,KACxC,OAAO,CAAC,sCAAsC,CAAC,QAuDpD"}

package/lib/test/utilities/SummarySizeTests.js

@@ -1,160 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IsoBuffer } from '@fluid-internal/client-utils';
-import { expect } from 'chai';
-import { fail } from '../../Common.js';
-import { Change, StablePlace, StableRange } from '../../ChangeTypes.js';
-import { revert } from '../../HistoryEditFactory.js';
-import { IdCompressor } from '../../id-compressor/index.js';
-import { setUpTestTree, } from './TestUtilities.js';
-/**
- * Summary size tests where `edits` are applied and checked against the `expectedSize`.
- */
-const summarySizeTests = [
-    {
-        edits: (testTree) => [
-            Change.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)),
-        ],
-        expectedSize: 1163,
-        description: 'when inserting a node',
-    },
-    {
-        edits: (testTree) => {
-            const edits = [];
-            for (let i = 0; i < 50; i++) {
-                edits.push(Change.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)));
-            }
-            return edits;
-        },
-        expectedSize: 12924,
-        description: 'with 50 inserts',
-    },
-    {
-        edits: (testTree) => {
-            const node = testTree.buildLeaf(testTree.generateNodeId());
-            return [
-                Change.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)),
-                [Change.setPayload(node.identifier, 10)],
-            ];
-        },
-        expectedSize: 1302,
-        description: 'when inserting and setting a node',
-    },
-    {
-        edits: (testTree) => {
-            const node = testTree.buildLeaf(testTree.generateNodeId());
-            return [
-                Change.insertTree(node, StablePlace.atEndOf(testTree.right.traitLocation)),
-                [Change.delete(StableRange.only(node))],
-            ];
-        },
-        expectedSize: 1355,
-        description: 'when inserting and deleting a node',
-    },
-    {
-        edits: (testTree) => [
-            Change.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)),
-        ],
-        expectedSize: 1355,
-        description: 'when inserting and reverting a node',
-        revertEdits: true,
-    },
-    {
-        edits: (testTree) => [
-            Change.insertTree(makeLargeTestTree(testTree), StablePlace.atStartOf(testTree.right.traitLocation)),
-        ],
-        expectedSize: 77067,
-        description: 'when inserting a large tree',
-    },
-    {
-        edits: (testTree) => {
-            const largeTree = makeLargeTestTree(testTree);
-            return [
-                Change.insertTree(largeTree, StablePlace.atStartOf(testTree.right.traitLocation)),
-                Change.move(StableRange.only(largeTree), StablePlace.atEndOf(testTree.left.traitLocation)),
-            ];
-        },
-        expectedSize: 77375,
-        description: 'when inserting and moving a large tree',
-    },
-];
-/**
- * Runs a test suite for summaries on `SharedTree` that verifies their sizes do not exceed the defined limits.
- * This suite can be used to test other implementations that aim to fulfill `SharedTree`'s contract.
- */
-export function runSummarySizeTests(title, setUpLocalServerTestSharedTree) {
-    describe(title, () => {
-        const setupEditId = '9406d301-7449-48a5-b2ea-9be637b0c6e4';
-        let tree;
-        let testTree;
-        let testObjectProvider;
-        // Resets the tree before each test
-        beforeEach(async () => {
-            const testingComponents = await setUpLocalServerTestSharedTree({
-                setupEditId,
-            });
-            tree = testingComponents.tree;
-            testTree = setUpTestTree(tree);
-            testObjectProvider = testingComponents.testObjectProvider;
-        });
-        async function checkSummarySize(changes, expectedSummarySize, revertEdits = false) {
-            const edits = changes.map((e) => tree.applyEdit(...e));
-            if (revertEdits) {
-                for (let i = changes.length - 1; i >= 0; i--) {
-                    const editIndex = tree.edits.getIndexOfId(edits[i].id);
-                    const edit = tree.edits.tryGetEditAtIndex(editIndex) ??
-                        fail('edit not found');
-                    const reverted = revert(edit.changes, tree.logViewer.getRevisionViewInMemory(editIndex));
-                    if (reverted !== undefined) {
-                        tree.applyEditInternal(reverted);
-                    }
-                }
-            }
-            // Wait for the ops to to be submitted and processed across the containers.
-            await testObjectProvider.ensureSynchronized();
-            const summary = tree.saveSerializedSummary();
-            const summarySize = IsoBuffer.from(summary).byteLength;
-            // TODO: make lte when 0.1.1 is settled
-            expect(summarySize).to.equal(expectedSummarySize);
-        }
-        for (const { edits, expectedSize, description, revertEdits } of summarySizeTests) {
-            it(`does not exceed ${expectedSize} ${description}`, async () => {
-                await checkSummarySize(edits(testTree), expectedSize, revertEdits);
-            });
-        }
-    });
-}
-function makeLargeTestTree(testTree, nodesPerTrait = 10, traitsPerLevel = 2, levels = 2) {
-    const specialSession = '9f858704-89f6-4923-abf3-14fc986e717f';
-    // ensure uuids for traits and definitions are stable
-    const compressor = new IdCompressor(specialSession, 0);
-    const uuidv4 = () => compressor.decompress(compressor.generateCompressedId());
-    const definition = uuidv4();
-    const traitLabels = [];
-    for (let i = 0; i < traitsPerLevel; i++) {
-        traitLabels.push(uuidv4());
-    }
-    return {
-        definition,
-        identifier: testTree.generateNodeId(),
-        traits: generateTraits(testTree, definition, traitLabels, nodesPerTrait, levels),
-    };
-}
-function generateTraits(testTree, definition, traitLabels, nodesPerTrait, totalLevels, level = 0) {
-    const traits = {};
-    traitLabels.forEach((label) => {
-        traits[label] = Array.from(Array(nodesPerTrait).keys()).map(() => {
-            return {
-                definition,
-                identifier: testTree.generateNodeId(),
-                traits: level < totalLevels
-                    ? generateTraits(testTree, definition, traitLabels, nodesPerTrait, totalLevels, level + 1)
-                    : {},
-            };
-        });
-    });
-    return traits;
-}
-//# sourceMappingURL=SummarySizeTests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"SummarySizeTests.js","sourceRoot":"","sources":["../../../src/test/utilities/SummarySizeTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAEzD,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAC;AAEvC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAGxE,OAAO,EAAE,MAAM,EAAE,MAAM,6BAA6B,CAAC;AACrD,OAAO,EAAE,YAAY,EAAE,MAAM,8BAA8B,CAAC;AAE5D,OAAO,EAGN,aAAa,GACb,MAAM,oBAAoB,CAAC;AAgB5B;;GAEG;AACH,MAAM,gBAAgB,GAA2B;IAChD;QACC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC;YACpB,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;SAC1F;QACD,YAAY,EAAE,IAAI;QAClB,WAAW,EAAE,uBAAuB;KACpC;IACD;QACC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE;YACnB,MAAM,KAAK,GAAe,EAAE,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;gBAC5B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;aACvG;YACD,OAAO,KAAK,CAAC;QACd,CAAC;QACD,YAAY,EAAE,KAAK;QACnB,WAAW,EAAE,iBAAiB;KAC9B;IACD;QACC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE;YACnB,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC3D,OAAO;gBACN,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;gBAC1F,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;aACxC,CAAC;QACH,CAAC;QACD,YAAY,EAAE,IAAI;QAClB,WAAW,EAAE,mCAAmC;KAChD;IACD;QACC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE;YACnB,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC3D,OAAO;gBACN,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;gBAC1E,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;aACvC,CAAC;QACH,CAAC;QACD,YAAY,EAAE,IAAI;QAClB,WAAW,EAAE,oCAAoC;KACjD;IACD;QACC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC;YACpB,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;SAC1F;QACD,YAAY,EAAE,IAAI;QAClB,WAAW,EAAE,qCAAqC;QAClD,WAAW,EAAE,IAAI;KACjB;IACD;QACC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC;YACpB,MAAM,CAAC,UAAU,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;SACnG;QACD,YAAY,EAAE,KAAK;QACnB,WAAW,EAAE,6BAA6B;KAC1C;IACD;QACC,KAAK,EAAE,CAAC,QAAQ,EAAE,EAAE;YACnB,MAAM,SAAS,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YAC9C,OAAO;gBACN,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;gBACjF,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;aAC1F,CAAC;QACH,CAAC;QACD,YAAY,EAAE,KAAK;QACnB,WAAW,EAAE,wCAAwC;KACrD;CACD,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAClC,KAAa,EACb,8BAEoD;IAEpD,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACpB,MAAM,WAAW,GAAG,sCAAgD,CAAC;QAErE,IAAI,IAAgB,CAAC;QACrB,IAAI,QAAkB,CAAC;QACvB,IAAI,kBAAsC,CAAC;QAE3C,mCAAmC;QACnC,UAAU,CAAC,KAAK,IAAI,EAAE;YACrB,MAAM,iBAAiB,GAAG,MAAM,8BAA8B,CAAC;gBAC9D,WAAW;aACX,CAAC,CAAC;YACH,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC;YAC9B,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAC/B,kBAAkB,GAAG,iBAAiB,CAAC,kBAAkB,CAAC;QAC3D,CAAC,CAAC,CAAC;QAEH,KAAK,UAAU,gBAAgB,CAC9B,OAAmB,EACnB,mBAA2B,EAC3B,WAAW,GAAG,KAAK;YAEnB,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAEvD,IAAI,WAAW,EAAE;gBAChB,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBACvD,MAAM,IAAI,GACR,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,CAAqC;wBAC5E,IAAI,CAAC,gBAAgB,CAAC,CAAC;oBACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC,CAAC;oBACzF,IAAI,QAAQ,KAAK,SAAS,EAAE;wBAC3B,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;qBACjC;iBACD;aACD;YAED,2EAA2E;YAC3E,MAAM,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;YAE9C,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC7C,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,UAAU,CAAC;YAEvD,uCAAuC;YACvC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QACnD,CAAC;QAED,KAAK,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,IAAI,gBAAgB,EAAE;YACjF,EAAE,CAAC,mBAAmB,YAAY,IAAI,WAAW,EAAE,EAAE,KAAK,IAAI,EAAE;gBAC/D,MAAM,gBAAgB,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CAAC,QAAkB,EAAE,aAAa,GAAG,EAAE,EAAE,cAAc,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC;IAChG,MAAM,cAAc,GAAG,sCAAmD,CAAC;IAC3E,qDAAqD;IACrD,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,GAAW,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,UAAU,CAAC,oBAAoB,EAAE,CAAC,CAAC;IACtF,MAAM,UAAU,GAAG,MAAM,EAAgB,CAAC;IAE1C,MAAM,WAAW,GAAiB,EAAE,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE;QACxC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAgB,CAAC,CAAC;KACzC;IAED,OAAO;QACN,UAAU;QACV,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;QACrC,MAAM,EAAE,cAAc,CAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,CAAC;KAChF,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACtB,QAAkB,EAClB,UAAsB,EACtB,WAAyB,EACzB,aAAqB,EACrB,WAAmB,EACnB,KAAK,GAAG,CAAC;IAET,MAAM,MAAM,GAAG,EAAE,CAAC;IAElB,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC7B,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE;YAChE,OAAO;gBACN,UAAU;gBACV,UAAU,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACrC,MAAM,EACL,KAAK,GAAG,WAAW;oBAClB,CAAC,CAAC,cAAc,CAAC,QAAQ,EAAE,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,WAAW,EAAE,KAAK,GAAG,CAAC,CAAC;oBAC1F,CAAC,CAAC,EAAE;aACN,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC;AACf,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { IsoBuffer } from '@fluid-internal/client-utils';\nimport { TestObjectProvider } from '@fluidframework/test-utils';\nimport { expect } from 'chai';\nimport { fail } from '../../Common.js';\nimport { Definition, EditId, SessionId, TraitLabel } from '../../Identifiers.js';\nimport { Change, StablePlace, StableRange } from '../../ChangeTypes.js';\nimport { SharedTree } from '../../SharedTree.js';\nimport { ChangeInternal, ChangeNode, Edit, TraitMap } from '../../persisted-types/index.js';\nimport { revert } from '../../HistoryEditFactory.js';\nimport { IdCompressor } from '../../id-compressor/index.js';\nimport { TestTree } from './TestNode.js';\nimport {\n\tLocalServerSharedTreeTestingComponents,\n\tLocalServerSharedTreeTestingOptions,\n\tsetUpTestTree,\n} from './TestUtilities.js';\n\n/**\n * An entry into the summarySizeTests list.\n */\ninterface SummarySizeTestEntry {\n\t/** Helper to obtain the list of edits to apply to the SharedTree. */\n\tedits: (testTree: TestTree) => Change[][];\n\t/** Expected size of the summary of the SharedTree after applying the `edits`. */\n\texpectedSize: number;\n\t/** Description for the test and the edits applied. */\n\tdescription: string;\n\t/** Flag to determine whether to revert the applied edits or not. */\n\trevertEdits?: boolean;\n}\n\n/**\n * Summary size tests where `edits` are applied and checked against the `expectedSize`.\n */\nconst summarySizeTests: SummarySizeTestEntry[] = [\n\t{\n\t\tedits: (testTree) => [\n\t\t\tChange.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)),\n\t\t],\n\t\texpectedSize: 1163,\n\t\tdescription: 'when inserting a node',\n\t},\n\t{\n\t\tedits: (testTree) => {\n\t\t\tconst edits: Change[][] = [];\n\t\t\tfor (let i = 0; i < 50; i++) {\n\t\t\t\tedits.push(Change.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)));\n\t\t\t}\n\t\t\treturn edits;\n\t\t},\n\t\texpectedSize: 12924,\n\t\tdescription: 'with 50 inserts',\n\t},\n\t{\n\t\tedits: (testTree) => {\n\t\t\tconst node = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\treturn [\n\t\t\t\tChange.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)),\n\t\t\t\t[Change.setPayload(node.identifier, 10)],\n\t\t\t];\n\t\t},\n\t\texpectedSize: 1302,\n\t\tdescription: 'when inserting and setting a node',\n\t},\n\t{\n\t\tedits: (testTree) => {\n\t\t\tconst node = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\treturn [\n\t\t\t\tChange.insertTree(node, StablePlace.atEndOf(testTree.right.traitLocation)),\n\t\t\t\t[Change.delete(StableRange.only(node))],\n\t\t\t];\n\t\t},\n\t\texpectedSize: 1355,\n\t\tdescription: 'when inserting and deleting a node',\n\t},\n\t{\n\t\tedits: (testTree) => [\n\t\t\tChange.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.right.traitLocation)),\n\t\t],\n\t\texpectedSize: 1355,\n\t\tdescription: 'when inserting and reverting a node',\n\t\trevertEdits: true,\n\t},\n\t{\n\t\tedits: (testTree) => [\n\t\t\tChange.insertTree(makeLargeTestTree(testTree), StablePlace.atStartOf(testTree.right.traitLocation)),\n\t\t],\n\t\texpectedSize: 77067,\n\t\tdescription: 'when inserting a large tree',\n\t},\n\t{\n\t\tedits: (testTree) => {\n\t\t\tconst largeTree = makeLargeTestTree(testTree);\n\t\t\treturn [\n\t\t\t\tChange.insertTree(largeTree, StablePlace.atStartOf(testTree.right.traitLocation)),\n\t\t\t\tChange.move(StableRange.only(largeTree), StablePlace.atEndOf(testTree.left.traitLocation)),\n\t\t\t];\n\t\t},\n\t\texpectedSize: 77375,\n\t\tdescription: 'when inserting and moving a large tree',\n\t},\n];\n\n/**\n * Runs a test suite for summaries on `SharedTree` that verifies their sizes do not exceed the defined limits.\n * This suite can be used to test other implementations that aim to fulfill `SharedTree`'s contract.\n */\nexport function runSummarySizeTests(\n\ttitle: string,\n\tsetUpLocalServerTestSharedTree: (\n\t\toptions: LocalServerSharedTreeTestingOptions\n\t) => Promise<LocalServerSharedTreeTestingComponents>\n) {\n\tdescribe(title, () => {\n\t\tconst setupEditId = '9406d301-7449-48a5-b2ea-9be637b0c6e4' as EditId;\n\n\t\tlet tree: SharedTree;\n\t\tlet testTree: TestTree;\n\t\tlet testObjectProvider: TestObjectProvider;\n\n\t\t// Resets the tree before each test\n\t\tbeforeEach(async () => {\n\t\t\tconst testingComponents = await setUpLocalServerTestSharedTree({\n\t\t\t\tsetupEditId,\n\t\t\t});\n\t\t\ttree = testingComponents.tree;\n\t\t\ttestTree = setUpTestTree(tree);\n\t\t\ttestObjectProvider = testingComponents.testObjectProvider;\n\t\t});\n\n\t\tasync function checkSummarySize(\n\t\t\tchanges: Change[][],\n\t\t\texpectedSummarySize: number,\n\t\t\trevertEdits = false\n\t\t): Promise<void> {\n\t\t\tconst edits = changes.map((e) => tree.applyEdit(...e));\n\n\t\t\tif (revertEdits) {\n\t\t\t\tfor (let i = changes.length - 1; i >= 0; i--) {\n\t\t\t\t\tconst editIndex = tree.edits.getIndexOfId(edits[i].id);\n\t\t\t\t\tconst edit =\n\t\t\t\t\t\t(tree.edits.tryGetEditAtIndex(editIndex) as unknown as Edit<ChangeInternal>) ??\n\t\t\t\t\t\tfail('edit not found');\n\t\t\t\t\tconst reverted = revert(edit.changes, tree.logViewer.getRevisionViewInMemory(editIndex));\n\t\t\t\t\tif (reverted !== undefined) {\n\t\t\t\t\t\ttree.applyEditInternal(reverted);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Wait for the ops to to be submitted and processed across the containers.\n\t\t\tawait testObjectProvider.ensureSynchronized();\n\n\t\t\tconst summary = tree.saveSerializedSummary();\n\t\t\tconst summarySize = IsoBuffer.from(summary).byteLength;\n\n\t\t\t// TODO: make lte when 0.1.1 is settled\n\t\t\texpect(summarySize).to.equal(expectedSummarySize);\n\t\t}\n\n\t\tfor (const { edits, expectedSize, description, revertEdits } of summarySizeTests) {\n\t\t\tit(`does not exceed ${expectedSize} ${description}`, async () => {\n\t\t\t\tawait checkSummarySize(edits(testTree), expectedSize, revertEdits);\n\t\t\t});\n\t\t}\n\t});\n}\n\nfunction makeLargeTestTree(testTree: TestTree, nodesPerTrait = 10, traitsPerLevel = 2, levels = 2): ChangeNode {\n\tconst specialSession = '9f858704-89f6-4923-abf3-14fc986e717f' as SessionId;\n\t// ensure uuids for traits and definitions are stable\n\tconst compressor = new IdCompressor(specialSession, 0);\n\tconst uuidv4 = (): string => compressor.decompress(compressor.generateCompressedId());\n\tconst definition = uuidv4() as Definition;\n\n\tconst traitLabels: TraitLabel[] = [];\n\tfor (let i = 0; i < traitsPerLevel; i++) {\n\t\ttraitLabels.push(uuidv4() as TraitLabel);\n\t}\n\n\treturn {\n\t\tdefinition,\n\t\tidentifier: testTree.generateNodeId(),\n\t\ttraits: generateTraits(testTree, definition, traitLabels, nodesPerTrait, levels),\n\t};\n}\n\nfunction generateTraits(\n\ttestTree: TestTree,\n\tdefinition: Definition,\n\ttraitLabels: TraitLabel[],\n\tnodesPerTrait: number,\n\ttotalLevels: number,\n\tlevel = 0\n): TraitMap<ChangeNode> {\n\tconst traits = {};\n\n\ttraitLabels.forEach((label) => {\n\t\ttraits[label] = Array.from(Array(nodesPerTrait).keys()).map(() => {\n\t\t\treturn {\n\t\t\t\tdefinition,\n\t\t\t\tidentifier: testTree.generateNodeId(),\n\t\t\t\ttraits:\n\t\t\t\t\tlevel < totalLevels\n\t\t\t\t\t\t? generateTraits(testTree, definition, traitLabels, nodesPerTrait, totalLevels, level + 1)\n\t\t\t\t\t\t: {},\n\t\t\t};\n\t\t});\n\t});\n\n\treturn traits;\n}\n"]}

package/lib/test/utilities/TestCommon.d.ts

@@ -1,13 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/**
- * Check if the given value is defined using mocha's `expect`. Return the defined value;
- */
-export declare function expectDefined<T>(value: T | undefined): T;
-/**
- * Expects `condition` and applies a type assertion.
- */
-export declare function expectAssert(condition: unknown, message?: string): asserts condition;
-//# sourceMappingURL=TestCommon.d.ts.map

package/lib/test/utilities/TestCommon.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TestCommon.d.ts","sourceRoot":"","sources":["../../../src/test/utilities/TestCommon.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,GAAG,CAAC,CAGxD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAEpF"}

package/lib/test/utilities/TestCommon.js

@@ -1,19 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-/**
- * Check if the given value is defined using mocha's `expect`. Return the defined value;
- */
-export function expectDefined(value) {
-    expect(value).to.be.not.undefined;
-    return value;
-}
-/**
- * Expects `condition` and applies a type assertion.
- */
-export function expectAssert(condition, message) {
-    expect(condition, message);
-}
-//# sourceMappingURL=TestCommon.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"TestCommon.js","sourceRoot":"","sources":["../../../src/test/utilities/TestCommon.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B;;GAEG;AACH,MAAM,UAAU,aAAa,CAAI,KAAoB;IACpD,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC;IAClC,OAAO,KAAU,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,SAAkB,EAAE,OAAgB;IAChE,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAC5B,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\n\n/**\n * Check if the given value is defined using mocha's `expect`. Return the defined value;\n */\nexport function expectDefined<T>(value: T | undefined): T {\n\texpect(value).to.be.not.undefined;\n\treturn value as T;\n}\n\n/**\n * Expects `condition` and applies a type assertion.\n */\nexport function expectAssert(condition: unknown, message?: string): asserts condition {\n\texpect(condition, message);\n}\n"]}

package/lib/test/utilities/TestNode.d.ts

@@ -1,140 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { BuildTreeNode } from '../../ChangeTypes.js';
-import { Definition, NodeId, OpSpaceNodeId, SessionId, StableNodeId, TraitLabel } from '../../Identifiers.js';
-import { NodeIdContext, NodeIdConverter, NodeIdNormalizer } from '../../NodeIdUtilities.js';
-import { BuildNodeInternal, ChangeNode, Payload, TraitLocationInternal_0_0_2, TraitMap, TreeNode } from '../../persisted-types/index.js';
-import { RevisionView } from '../../RevisionView.js';
-import { TraitLocation } from '../../TreeView.js';
-/** A legacy format of a `TestNode` */
-export type TestNode_0_0_2 = TreeNode<TestNode_0_0_2, StableNodeId>;
-/**
- * A node with no children
- */
-export type LeafNode<T> = Omit<T, 'traits'> & {
-    traits: Record<string, never>;
-};
-/**
- * Test extension of {@link TraitLocation} which can be converted to stable or legacy formats
- */
-export interface TestTraitLocation extends TraitLocation {
-    stable: TraitLocationInternal_0_0_2;
-    /** Translate this location into the equivalent location in another ID context */
-    translate(idConverter: NodeIdConverter): TestTraitLocation;
-}
-/**
- * An object containing useful properties for analyzing a node within a test context.
- */
-export interface TestNode extends TreeNode<TestNode, NodeId> {
-    /** The label of the trait under which this node resides */
-    traitLabel: TraitLabel;
-    /** The trait location at which this node resides */
-    traitLocation: TestTraitLocation;
-    /** A revision view of this node */
-    view: RevisionView;
-    /** A version of this tree with stable IDs */
-    stable: TestNode_0_0_2;
-    /** Translate this node's ID into the equivalent ID in another ID context */
-    translateId(idConverter: NodeIdConverter): NodeId;
-    /** Express this tree as a ChangeNode */
-    toChangeNode(): ChangeNode;
-}
-/**
- * A small tree of `TestNode`s consisting of a root/parent node, a "left" child and a "right" child. This is a useful tree for initializing
- * tests as it makes it ergonomic to retrieve various properties of the tree. Note that it only represents the initial state of the tree,
- * it does not update even if the SharedTree that it was the initial state for is mutated.
- */
-export interface TestTree extends TestNode, NodeIdContext, NodeIdNormalizer<OpSpaceNodeId> {
-    /** The left child node */
-    left: TestNode;
-    /** The right child node */
-    right: TestNode;
-    /** Create an arbitrary unparented node with the given payload, if specified */
-    buildLeaf(id?: undefined, payload?: Payload): LeafNode<BuildTreeNode>;
-    /** Create an arbitrary unparented node with the given identifier and payload, if specified */
-    buildLeaf(id: NodeId, payload?: Payload): LeafNode<ChangeNode>;
-    /**
-     * Generates a leaf node for use in internal build changes.
-     * If no `id` is explicitly provided, one will be generated.
-     * @param id - Explicit ID to use as the new node's identifier. If not provided, one will be generated.
-     */
-    buildLeafInternal(id?: NodeId, payload?: Payload): LeafNode<TreeNode<BuildNodeInternal, NodeId>>;
-}
-/**
- * A TestTree for general use within the shared-tree package. The nodes in every `SimpleTestTree` will have unique identifiers - i.e. two
- * different instances of `SimpleTestTree` are never equivalent.
- */
-export declare class SimpleTestTree implements TestTree {
-    private readonly nodeIdContext;
-    private readonly nodeIdNormalizer;
-    static readonly definition: Definition;
-    static readonly traitLabel: TraitLabel;
-    static readonly leftTraitLabel: TraitLabel;
-    static readonly rightTraitLabel: TraitLabel;
-    private readonly root;
-    readonly left: TestNode;
-    readonly right: TestNode;
-    readonly expensiveValidation: any;
-    constructor(nodeIdContext: NodeIdContext, nodeIdNormalizer: NodeIdNormalizer<OpSpaceNodeId>, expensiveValidation?: boolean);
-    get definition(): Definition;
-    get identifier(): NodeId;
-    get traits(): TraitMap<TestNode>;
-    get traitLabel(): TraitLabel;
-    get traitLocation(): TestTraitLocation;
-    get view(): RevisionView;
-    get stable(): TestNode_0_0_2;
-    translateId(idConverter: NodeIdConverter): NodeId;
-    toChangeNode(): ChangeNode;
-    buildLeaf(id?: undefined, payload?: Payload): LeafNode<BuildTreeNode>;
-    buildLeaf(id: NodeId, payload?: Payload): LeafNode<ChangeNode>;
-    buildLeafInternal(id?: NodeId, payload?: Payload): LeafNode<TreeNode<BuildNodeInternal, NodeId>>;
-    generateNodeId(override?: string): NodeId;
-    convertToStableNodeId(id: NodeId): StableNodeId;
-    tryConvertToStableNodeId(id: NodeId): StableNodeId | undefined;
-    convertToNodeId(id: StableNodeId): NodeId;
-    tryConvertToNodeId(id: StableNodeId): NodeId | undefined;
-    get localSessionId(): SessionId;
-    normalizeToOpSpace(id: NodeId): OpSpaceNodeId;
-    normalizeToSessionSpace(id: OpSpaceNodeId, sessionId: SessionId): NodeId;
-}
-/** A TestTree which resets before each test */
-export declare class RefreshingTestTree<T extends TestTree> implements TestTree {
-    private _testTree?;
-    constructor(createTestTree: () => T, fn?: (testTree: T) => void);
-    private get testTree();
-    get left(): TestNode;
-    get right(): TestNode;
-    get definition(): Definition;
-    get identifier(): NodeId;
-    get traits(): TraitMap<TestNode>;
-    get traitLabel(): TraitLabel;
-    get traitLocation(): TestTraitLocation;
-    get view(): RevisionView;
-    get stable(): TestNode_0_0_2;
-    translateId(idConverter: NodeIdConverter): NodeId;
-    toChangeNode(): ChangeNode;
-    buildLeaf(id?: undefined, payload?: Payload): LeafNode<BuildTreeNode>;
-    buildLeaf(id: NodeId, payload?: Payload): LeafNode<ChangeNode>;
-    buildLeafInternal(id?: NodeId, payload?: Payload): LeafNode<TreeNode<BuildNodeInternal, NodeId>>;
-    generateNodeId(override?: string): NodeId;
-    convertToStableNodeId(id: NodeId): StableNodeId;
-    tryConvertToStableNodeId(id: NodeId): StableNodeId | undefined;
-    convertToNodeId(id: StableNodeId): NodeId;
-    tryConvertToNodeId(id: StableNodeId): NodeId | undefined;
-    get localSessionId(): SessionId;
-    normalizeToOpSpace(id: NodeId): OpSpaceNodeId;
-    normalizeToSessionSpace(id: OpSpaceNodeId, sessionId: SessionId): NodeId;
-}
-/** Create a new node with an automatically generated ID and the given payload */
-export declare function buildLeaf(id?: undefined, payload?: Payload): LeafNode<BuildTreeNode>;
-/** Create a new node with the given ID and payload */
-export declare function buildLeaf(id: NodeId, payload?: Payload): LeafNode<ChangeNode>;
-/**
- * Generates a leaf {@link ChangeNode}.
- * If no `id` is explicitly provided, one will be generated.
- * @param id - Explicit ID to use as the new node's identifier. If not provided, one will be generated.
- */
-export declare function buildLeafInternal(nodeIdContext: NodeIdContext, id?: NodeId, payload?: Payload): LeafNode<TreeNode<BuildNodeInternal, NodeId>>;
-//# sourceMappingURL=TestNode.d.ts.map

package/lib/test/utilities/TestNode.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TestNode.d.ts","sourceRoot":"","sources":["../../../src/test/utilities/TestNode.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAIrD,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AAE9G,OAAO,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5F,OAAO,EACN,iBAAiB,EACjB,UAAU,EACV,OAAO,EAEP,2BAA2B,EAC3B,QAAQ,EACR,QAAQ,EACR,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAElD,sCAAsC;AACtC,MAAM,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;AAEpE;;GAEG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG;IAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;CAAE,CAAC;AAEhF;;GAEG;AACH,MAAM,WAAW,iBAAkB,SAAQ,aAAa;IACvD,MAAM,EAAE,2BAA2B,CAAC;IACpC,iFAAiF;IACjF,SAAS,CAAC,WAAW,EAAE,eAAe,GAAG,iBAAiB,CAAC;CAC3D;AAED;;GAEG;AACH,MAAM,WAAW,QAAS,SAAQ,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC3D,2DAA2D;IAC3D,UAAU,EAAE,UAAU,CAAC;IACvB,oDAAoD;IACpD,aAAa,EAAE,iBAAiB,CAAC;IACjC,mCAAmC;IACnC,IAAI,EAAE,YAAY,CAAC;IACnB,6CAA6C;IAC7C,MAAM,EAAE,cAAc,CAAC;IACvB,4EAA4E;IAC5E,WAAW,CAAC,WAAW,EAAE,eAAe,GAAG,MAAM,CAAC;IAClD,wCAAwC;IACxC,YAAY,IAAI,UAAU,CAAC;CAC3B;AAED;;;;GAIG;AACH,MAAM,WAAW,QAAS,SAAQ,QAAQ,EAAE,aAAa,EAAE,gBAAgB,CAAC,aAAa,CAAC;IACzF,0BAA0B;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,2BAA2B;IAC3B,KAAK,EAAE,QAAQ,CAAC;IAChB,+EAA+E;IAC/E,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;IACtE,8FAA8F;IAC9F,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;IAC/D;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC,CAAC;CACjG;AAED;;;GAGG;AACH,qBAAa,cAAe,YAAW,QAAQ;IAY7C,OAAO,CAAC,QAAQ,CAAC,aAAa;IAC9B,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IAZlC,gBAAuB,UAAU,aAAwB;IACzD,gBAAuB,UAAU,aAAwD;IACzF,gBAAuB,cAAc,aAAwB;IAC7D,gBAAuB,eAAe,aAAyB;IAE/D,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAW;IAChC,SAAgB,IAAI,EAAE,QAAQ,CAAC;IAC/B,SAAgB,KAAK,EAAE,QAAQ,CAAC;IAChC,SAAgB,mBAAmB,MAAC;gBAGlB,aAAa,EAAE,aAAa,EAC5B,gBAAgB,EAAE,gBAAgB,CAAC,aAAa,CAAC,EAClE,mBAAmB,UAAO;IAoF3B,IAAW,UAAU,IAAI,UAAU,CAElC;IAED,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED,IAAW,MAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAEtC;IAED,IAAW,UAAU,IAAI,UAAU,CAElC;IAED,IAAW,aAAa,IAAI,iBAAiB,CAE5C;IAED,IAAW,IAAI,IAAI,YAAY,CAE9B;IAED,IAAW,MAAM,mBAEhB;IAEM,WAAW,CAAC,WAAW,EAAE,eAAe,GAAG,MAAM;IAIjD,YAAY,IAAI,UAAU;IAI1B,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC;IAErE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC;IAM9D,iBAAiB,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;IAIhG,cAAc,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM;IAIzC,qBAAqB,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY;IAI/C,wBAAwB,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAI9D,eAAe,CAAC,EAAE,EAAE,YAAY,GAAG,MAAM;IAIzC,kBAAkB,CAAC,EAAE,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS;IAI/D,IAAI,cAAc,IAAI,SAAS,CAE9B;IAED,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa;IAG7C,uBAAuB,CAAC,EAAE,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,GAAG,MAAM;CAGxE;AAED,+CAA+C;AAC/C,qBAAa,kBAAkB,CAAC,CAAC,SAAS,QAAQ,CAAE,YAAW,QAAQ;IACtE,OAAO,CAAC,SAAS,CAAC,CAAI;gBAEH,cAAc,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,KAAK,IAAI;IAUtE,OAAO,KAAK,QAAQ,GAOnB;IAED,IAAW,IAAI,IAAI,QAAQ,CAE1B;IAED,IAAW,KAAK,IAAI,QAAQ,CAE3B;IAED,IAAW,UAAU,IAAI,UAAU,CAElC;IAED,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED,IAAW,MAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAEtC;IAED,IAAW,UAAU,IAAI,UAAU,CAElC;IAED,IAAW,aAAa,IAAI,iBAAiB,CAE5C;IAED,IAAW,IAAI,IAAI,YAAY,CAE9B;IAED,IAAW,MAAM,IAAI,cAAc,CAElC;IAEM,WAAW,CAAC,WAAW,EAAE,eAAe,GAAG,MAAM;IAIjD,YAAY,IAAI,UAAU;IAI1B,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC;IACrE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC;IAK9D,iBAAiB,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC;IAIhG,cAAc,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,MAAM;IAIhD,qBAAqB,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY;IAI/C,wBAAwB,CAAC,EAAE,EAAE,MAAM,GAAG,YAAY,GAAG,SAAS;IAI9D,eAAe,CAAC,EAAE,EAAE,YAAY,GAAG,MAAM;IAIzC,kBAAkB,CAAC,EAAE,EAAE,YAAY,GAAG,MAAM,GAAG,SAAS;IAIxD,IAAI,cAAc,IAAI,SAAS,CAE9B;IAED,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,aAAa;IAI7C,uBAAuB,CAAC,EAAE,EAAE,aAAa,EAAE,SAAS,EAAE,SAAS,GAAG,MAAM;CAGxE;AAED,iFAAiF;AACjF,wBAAgB,SAAS,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;AACtF,sDAAsD;AACtD,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;AAY/E;;;;GAIG;AACH,wBAAgB,iBAAiB,CAChC,aAAa,EAAE,aAAa,EAC5B,EAAE,CAAC,EAAE,MAAM,EACX,OAAO,CAAC,EAAE,OAAO,GACf,QAAQ,CAAC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC,CAAC,CAO/C"}