@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/lib/test/shared-tree/sharedTree.bench.js

@@ -1,349 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { benchmark, BenchmarkType, isInPerformanceTestingMode, } from "@fluid-tools/benchmark";
-import { jsonableTreeFromCursor, cursorForTypedData, cursorForTypedTreeData, TreeCompressionStrategy, } from "../../feature-libraries/index.js";
-import { singleJsonCursor } from "../../domains/index.js";
-import { insert, TestTreeProviderLite, toJsonableTree, flexTreeViewWithContent, checkoutWithContent, } from "../utils.js";
-import { SharedTreeFactory } from "../../shared-tree/index.js";
-import { rootFieldKey } from "../../core/index.js";
-import { deepPath, deepSchema, localFieldKey, makeDeepContent, makeJsDeepTree, makeWideContentWithEndValue, makeJsWideTreeWithEndValue, readDeepCursorTree, readDeepEditableTree, readDeepTreeAsJSObject, readWideCursorTree, readWideEditableTree, readWideTreeAsJSObject, wideRootSchema, wideSchema, } from "../scalableTestTrees.js";
-// eslint-disable-next-line import/no-internal-modules
-import { typeboxValidator } from "../../external-utilities/typeboxValidator.js";
-// number of nodes in test for wide trees
-const nodesCountWide = [
-    [1, BenchmarkType.Measurement],
-    [100, BenchmarkType.Perspective],
-    [500, BenchmarkType.Measurement],
-];
-// number of nodes in test for deep trees
-const nodesCountDeep = [
-    [1, BenchmarkType.Measurement],
-    [10, BenchmarkType.Perspective],
-    [100, BenchmarkType.Measurement],
-];
-// TODO: ADO#7111 Schema should be fixed to enable schema based encoding.
-const factory = new SharedTreeFactory({
-    jsonValidator: typeboxValidator,
-    treeEncodeType: TreeCompressionStrategy.Uncompressed,
-});
-// TODO: Once the "BatchTooLarge" error is no longer an issue, extend tests for larger trees.
-describe("SharedTree benchmarks", () => {
-    describe("Direct JS Object", () => {
-        for (const [numberOfNodes, benchmarkType] of nodesCountDeep) {
-            let tree;
-            benchmark({
-                type: benchmarkType,
-                title: `Deep Tree as JS Object: reads with ${numberOfNodes} nodes`,
-                before: () => {
-                    tree = makeJsDeepTree(numberOfNodes, 1);
-                },
-                benchmarkFn: () => {
-                    const { depth, value } = readDeepTreeAsJSObject(tree);
-                    assert.equal(depth, numberOfNodes);
-                    assert.equal(value, 1);
-                },
-            });
-        }
-        for (const [numberOfNodes, benchmarkType] of nodesCountWide) {
-            let tree;
-            let expected = 0;
-            benchmark({
-                type: benchmarkType,
-                title: `Wide Tree as JS Object: reads with ${numberOfNodes} nodes`,
-                before: () => {
-                    tree = makeJsWideTreeWithEndValue(numberOfNodes, numberOfNodes - 1);
-                    for (let i = 0; i < numberOfNodes; i++) {
-                        expected += i;
-                    }
-                },
-                benchmarkFn: () => {
-                    const { nodesCount, sum } = readWideTreeAsJSObject(tree);
-                    assert.equal(nodesCount, numberOfNodes);
-                    assert.equal(sum, expected);
-                },
-            });
-        }
-        describe(`Edit JS Object`, () => {
-            for (const [numberOfNodes, benchmarkType] of nodesCountDeep) {
-                let tree;
-                let currentNode;
-                benchmark({
-                    type: benchmarkType,
-                    title: `Update value at leaf of ${numberOfNodes} deep tree`,
-                    before: () => {
-                        tree = makeJsDeepTree(numberOfNodes, 1);
-                        currentNode = tree;
-                        while (typeof currentNode !== "number") {
-                            if (typeof currentNode.foo === "number") {
-                                break;
-                            }
-                            currentNode = currentNode.foo;
-                        }
-                    },
-                    benchmarkFn: () => {
-                        currentNode.foo = -1;
-                    },
-                    after: () => {
-                        const expected = makeJsDeepTree(numberOfNodes, -1);
-                        assert.deepEqual(tree, expected);
-                    },
-                });
-            }
-            for (const [numberOfNodes, benchmarkType] of nodesCountWide) {
-                let tree;
-                benchmark({
-                    type: benchmarkType,
-                    title: `Update value at leaf of ${numberOfNodes} Wide tree`,
-                    before: () => {
-                        tree = makeJsWideTreeWithEndValue(numberOfNodes, numberOfNodes - 1);
-                    },
-                    benchmarkFn: () => {
-                        tree.foo[numberOfNodes - 1] = -1;
-                    },
-                    after: () => {
-                        const expected = makeJsWideTreeWithEndValue(numberOfNodes, -1);
-                        assert.deepEqual(tree, expected);
-                    },
-                });
-            }
-        });
-    });
-    describe("Cursors", () => {
-        for (const [numberOfNodes, benchmarkType] of nodesCountDeep) {
-            let tree;
-            benchmark({
-                type: benchmarkType,
-                title: `Deep Tree with cursor: reads with ${numberOfNodes} nodes`,
-                before: () => {
-                    tree = flexTreeViewWithContent(makeDeepContent(numberOfNodes));
-                },
-                benchmarkFn: () => {
-                    const { depth, value } = readDeepCursorTree(tree);
-                    assert.equal(value, 1);
-                    assert.equal(depth, numberOfNodes);
-                },
-            });
-        }
-        for (const [numberOfNodes, benchmarkType] of nodesCountWide) {
-            let tree;
-            let expected = 0;
-            benchmark({
-                type: benchmarkType,
-                title: `Wide Tree with cursor: reads with ${numberOfNodes} nodes`,
-                before: () => {
-                    const numbers = [];
-                    for (let index = 0; index < numberOfNodes; index++) {
-                        numbers.push(index);
-                        expected += index;
-                    }
-                    tree = flexTreeViewWithContent(makeWideContentWithEndValue(numberOfNodes, numberOfNodes - 1));
-                },
-                benchmarkFn: () => {
-                    const { nodesCount, sum } = readWideCursorTree(tree);
-                    assert.equal(sum, expected);
-                    assert.equal(nodesCount, numberOfNodes);
-                },
-            });
-        }
-    });
-    describe("EditableTree bench", () => {
-        for (const [numberOfNodes, benchmarkType] of nodesCountDeep) {
-            let tree;
-            benchmark({
-                type: benchmarkType,
-                title: `Deep Tree with Editable Tree: reads with ${numberOfNodes} nodes`,
-                before: () => {
-                    tree = flexTreeViewWithContent(makeDeepContent(numberOfNodes));
-                },
-                benchmarkFn: () => {
-                    const { depth, value } = readDeepEditableTree(tree);
-                    assert.equal(depth, numberOfNodes);
-                    assert.equal(value, 1);
-                },
-            });
-        }
-        for (const [numberOfNodes, benchmarkType] of nodesCountWide) {
-            let tree;
-            let expected = 0;
-            benchmark({
-                type: benchmarkType,
-                title: `Wide Tree with Editable Tree: reads with ${numberOfNodes} nodes`,
-                before: () => {
-                    const numbers = [];
-                    for (let index = 0; index < numberOfNodes; index++) {
-                        numbers.push(index);
-                        expected += index;
-                    }
-                    tree = flexTreeViewWithContent({
-                        initialTree: { foo: numbers },
-                        schema: wideSchema,
-                    });
-                },
-                benchmarkFn: () => {
-                    const { nodesCount, sum } = readWideEditableTree(tree);
-                    assert.equal(sum, expected);
-                    assert.equal(nodesCount, numberOfNodes);
-                    readWideCursorTree(tree);
-                },
-            });
-        }
-    });
-    describe("Edit with editor", () => {
-        const setCount = 100;
-        for (const [numberOfNodes, benchmarkType] of nodesCountDeep) {
-            benchmark({
-                type: benchmarkType,
-                title: `Update value at leaf of ${numberOfNodes} deep tree ${setCount} times`,
-                benchmarkFnCustom: async (state) => {
-                    let duration;
-                    do {
-                        // Since this setup one collects data from one iteration, assert that this is what is expected.
-                        assert.equal(state.iterationsPerBatch, 1);
-                        // Setup
-                        const tree = checkoutWithContent(makeDeepContent(numberOfNodes));
-                        const path = deepPath(numberOfNodes);
-                        // Measure
-                        const before = state.timer.now();
-                        for (let value = 1; value <= setCount; value++) {
-                            tree.editor
-                                .valueField({ parent: path, field: localFieldKey })
-                                .set(singleJsonCursor(value));
-                        }
-                        const after = state.timer.now();
-                        duration = state.timer.toSeconds(before, after);
-                        // Cleanup + validation
-                        const expected = jsonableTreeFromCursor(cursorForTypedData({ schema: deepSchema }, deepSchema.rootFieldSchema.allowedTypes, makeJsDeepTree(numberOfNodes, setCount)));
-                        const actual = toJsonableTree(tree);
-                        assert.deepEqual(actual, [expected]);
-                        // Collect data
-                    } while (state.recordBatch(duration));
-                },
-                // Force batch size of 1
-                minBatchDurationSeconds: 0,
-            });
-        }
-        for (const [numberOfNodes, benchmarkType] of nodesCountWide) {
-            benchmark({
-                type: benchmarkType,
-                title: `Update value at leaf of ${numberOfNodes} wide tree ${setCount} times`,
-                benchmarkFnCustom: async (state) => {
-                    let duration;
-                    do {
-                        // Since this setup one collects data from one iteration, assert that this is what is expected.
-                        assert.equal(state.iterationsPerBatch, 1);
-                        // Setup
-                        const numbers = [];
-                        for (let index = 0; index < numberOfNodes; index++) {
-                            numbers.push(index);
-                        }
-                        const tree = checkoutWithContent({
-                            initialTree: { foo: numbers },
-                            schema: wideSchema,
-                        });
-                        const rootPath = {
-                            parent: undefined,
-                            parentField: rootFieldKey,
-                            parentIndex: 0,
-                        };
-                        const nodeIndex = numberOfNodes - 1;
-                        const editor = tree.editor.sequenceField({
-                            parent: rootPath,
-                            field: localFieldKey,
-                        });
-                        // Measure
-                        const before = state.timer.now();
-                        for (let value = 1; value <= setCount; value++) {
-                            editor.remove(nodeIndex, 1);
-                            editor.insert(nodeIndex, singleJsonCursor(value));
-                        }
-                        const after = state.timer.now();
-                        duration = state.timer.toSeconds(before, after);
-                        // Cleanup + validation
-                        const expected = jsonableTreeFromCursor(cursorForTypedTreeData({
-                            schema: wideSchema,
-                        }, wideRootSchema, makeJsWideTreeWithEndValue(numberOfNodes, setCount)));
-                        const actual = toJsonableTree(tree);
-                        assert.deepEqual(actual, [expected]);
-                        // Collect data
-                    } while (state.recordBatch(duration));
-                },
-                // Force batch size of 1
-                minBatchDurationSeconds: 0,
-            });
-        }
-    });
-    describe("acking local commits", () => {
-        const localCommitSize = [1, 25, 100, 500, 1000];
-        for (const size of localCommitSize) {
-            benchmark({
-                type: BenchmarkType.Measurement,
-                title: `for ${size} local commit${size === 1 ? "" : "s"}`,
-                benchmarkFnCustom: async (state) => {
-                    let duration;
-                    do {
-                        // Since this setup one collects data from one iteration, assert that this is what is expected.
-                        assert.equal(state.iterationsPerBatch, 1);
-                        // Setup
-                        const provider = new TestTreeProviderLite(1, factory);
-                        // TODO: specify a schema for these trees.
-                        const [tree] = provider.trees;
-                        for (let i = 0; i < size; i++) {
-                            insert(tree.checkout, i, "test");
-                        }
-                        // Measure
-                        const before = state.timer.now();
-                        provider.processMessages();
-                        const after = state.timer.now();
-                        duration = state.timer.toSeconds(before, after);
-                        // Collect data
-                    } while (state.recordBatch(duration));
-                },
-                // Force batch size of 1
-                minBatchDurationSeconds: 0,
-            });
-        }
-    });
-    // Note that this runs the computation for several peers.
-    // In practice, this computation is distributed across peers, so the actual time reported is
-    // divided by the number of peers.
-    describe("rebasing commits", () => {
-        const commitCounts = [1, 10, 20];
-        const nbPeers = 5;
-        for (const nbCommits of commitCounts) {
-            const test = benchmark({
-                type: BenchmarkType.Measurement,
-                title: `for ${nbCommits} commits per peer for ${nbPeers} peers`,
-                benchmarkFnCustom: async (state) => {
-                    let duration;
-                    do {
-                        // Since this setup one collects data from one iteration, assert that this is what is expected.
-                        assert.equal(state.iterationsPerBatch, 1);
-                        // Setup
-                        const provider = new TestTreeProviderLite(nbPeers, factory);
-                        for (let iCommit = 0; iCommit < nbCommits; iCommit++) {
-                            for (let iPeer = 0; iPeer < nbPeers; iPeer++) {
-                                const peer = provider.trees[iPeer];
-                                insert(peer.checkout, 0, `p${iPeer}c${iCommit}`);
-                            }
-                        }
-                        // Measure
-                        const before = state.timer.now();
-                        provider.processMessages();
-                        const after = state.timer.now();
-                        // Divide the duration by the number of peers so we get the average time per peer.
-                        duration = state.timer.toSeconds(before, after) / nbPeers;
-                    } while (state.recordBatch(duration));
-                },
-                // Force batch size of 1
-                minBatchDurationSeconds: 0,
-            });
-            if (!isInPerformanceTestingMode) {
-                test.timeout(5000);
-            }
-        }
-    });
-});
-//# sourceMappingURL=sharedTree.bench.js.map

package/lib/test/shared-tree/sharedTree.bench.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sharedTree.bench.js","sourceRoot":"","sources":["../../../src/test/shared-tree/sharedTree.bench.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EACN,SAAS,EAET,aAAa,EACb,0BAA0B,GAC1B,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACN,sBAAsB,EACtB,kBAAkB,EAClB,sBAAsB,EACtB,uBAAuB,GACvB,MAAM,kCAAkC,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EACN,MAAM,EACN,oBAAoB,EACpB,cAAc,EACd,uBAAuB,EACvB,mBAAmB,GACnB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAgB,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACnD,OAAO,EACN,QAAQ,EACR,UAAU,EAGV,aAAa,EACb,eAAe,EACf,cAAc,EACd,2BAA2B,EAC3B,0BAA0B,EAC1B,kBAAkB,EAClB,oBAAoB,EACpB,sBAAsB,EACtB,kBAAkB,EAClB,oBAAoB,EACpB,sBAAsB,EACtB,cAAc,EACd,UAAU,GACV,MAAM,yBAAyB,CAAC;AACjC,sDAAsD;AACtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8CAA8C,CAAC;AAEhF,yCAAyC;AACzC,MAAM,cAAc,GAAG;IACtB,CAAC,CAAC,EAAE,aAAa,CAAC,WAAW,CAAC;IAC9B,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC;IAChC,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC;CAChC,CAAC;AACF,yCAAyC;AACzC,MAAM,cAAc,GAAG;IACtB,CAAC,CAAC,EAAE,aAAa,CAAC,WAAW,CAAC;IAC9B,CAAC,EAAE,EAAE,aAAa,CAAC,WAAW,CAAC;IAC/B,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC;CAChC,CAAC;AAEF,yEAAyE;AACzE,MAAM,OAAO,GAAG,IAAI,iBAAiB,CAAC;IACrC,aAAa,EAAE,gBAAgB;IAC/B,cAAc,EAAE,uBAAuB,CAAC,YAAY;CACpD,CAAC,CAAC;AAEH,6FAA6F;AAC7F,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACtC,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QACjC,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,IAAI,IAAgB,CAAC;YACrB,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,sCAAsC,aAAa,QAAQ;gBAClE,MAAM,EAAE,GAAG,EAAE;oBACZ,IAAI,GAAG,cAAc,CAAC,aAAa,EAAE,CAAC,CAAe,CAAC;gBACvD,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;oBACtD,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;oBACnC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACxB,CAAC;aACD,CAAC,CAAC;SACH;QACD,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,IAAI,IAAgB,CAAC;YACrB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,sCAAsC,aAAa,QAAQ;gBAClE,MAAM,EAAE,GAAG,EAAE;oBACZ,IAAI,GAAG,0BAA0B,CAAC,aAAa,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;oBACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;wBACvC,QAAQ,IAAI,CAAC,CAAC;qBACd;gBACF,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,sBAAsB,CAAC,IAAI,CAAC,CAAC;oBACzD,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;oBACxC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBAC7B,CAAC;aACD,CAAC,CAAC;SACH;QACD,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;YAC/B,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;gBAC5D,IAAI,IAAgB,CAAC;gBACrB,IAAI,WAAuB,CAAC;gBAC5B,SAAS,CAAC;oBACT,IAAI,EAAE,aAAa;oBACnB,KAAK,EAAE,2BAA2B,aAAa,YAAY;oBAC3D,MAAM,EAAE,GAAG,EAAE;wBACZ,IAAI,GAAG,cAAc,CAAC,aAAa,EAAE,CAAC,CAAe,CAAC;wBACtD,WAAW,GAAG,IAAI,CAAC;wBACnB,OAAO,OAAO,WAAW,KAAK,QAAQ,EAAE;4BACvC,IAAI,OAAO,WAAW,CAAC,GAAG,KAAK,QAAQ,EAAE;gCACxC,MAAM;6BACN;4BACD,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC;yBAC9B;oBACF,CAAC;oBACD,WAAW,EAAE,GAAG,EAAE;wBACjB,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;oBACtB,CAAC;oBACD,KAAK,EAAE,GAAG,EAAE;wBACX,MAAM,QAAQ,GAAG,cAAc,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;wBACnD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;oBAClC,CAAC;iBACD,CAAC,CAAC;aACH;YACD,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;gBAC5D,IAAI,IAAgB,CAAC;gBACrB,SAAS,CAAC;oBACT,IAAI,EAAE,aAAa;oBACnB,KAAK,EAAE,2BAA2B,aAAa,YAAY;oBAC3D,MAAM,EAAE,GAAG,EAAE;wBACZ,IAAI,GAAG,0BAA0B,CAAC,aAAa,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC;oBACrE,CAAC;oBACD,WAAW,EAAE,GAAG,EAAE;wBACjB,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAClC,CAAC;oBACD,KAAK,EAAE,GAAG,EAAE;wBACX,MAAM,QAAQ,GAAG,0BAA0B,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;wBAC/D,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;oBAClC,CAAC;iBACD,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACxB,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,IAAI,IAAqD,CAAC;YAC1D,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,qCAAqC,aAAa,QAAQ;gBACjE,MAAM,EAAE,GAAG,EAAE;oBACZ,IAAI,GAAG,uBAAuB,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC;gBAChE,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;oBAClD,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;oBACvB,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;gBACpC,CAAC;aACD,CAAC,CAAC;SACH;QACD,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,IAAI,IAAqD,CAAC;YAC1D,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,qCAAqC,aAAa,QAAQ;gBACjE,MAAM,EAAE,GAAG,EAAE;oBACZ,MAAM,OAAO,GAAG,EAAE,CAAC;oBACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,aAAa,EAAE,KAAK,EAAE,EAAE;wBACnD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACpB,QAAQ,IAAI,KAAK,CAAC;qBAClB;oBACD,IAAI,GAAG,uBAAuB,CAC7B,2BAA2B,CAAC,aAAa,EAAE,aAAa,GAAG,CAAC,CAAC,CAC7D,CAAC;gBACH,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;oBACrD,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;oBAC5B,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;gBACzC,CAAC;aACD,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QACnC,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,IAAI,IAAqD,CAAC;YAC1D,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,4CAA4C,aAAa,QAAQ;gBACxE,MAAM,EAAE,GAAG,EAAE;oBACZ,IAAI,GAAG,uBAAuB,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC;gBAChE,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;oBACpD,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;oBACnC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACxB,CAAC;aACD,CAAC,CAAC;SACH;QACD,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,IAAI,IAAqD,CAAC;YAC1D,IAAI,QAAQ,GAAW,CAAC,CAAC;YACzB,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,4CAA4C,aAAa,QAAQ;gBACxE,MAAM,EAAE,GAAG,EAAE;oBACZ,MAAM,OAAO,GAAG,EAAE,CAAC;oBACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,aAAa,EAAE,KAAK,EAAE,EAAE;wBACnD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACpB,QAAQ,IAAI,KAAK,CAAC;qBAClB;oBACD,IAAI,GAAG,uBAAuB,CAAC;wBAC9B,WAAW,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE;wBAC7B,MAAM,EAAE,UAAU;qBAClB,CAAC,CAAC;gBACJ,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,MAAM,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;oBACvD,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;oBAC5B,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC;oBACxC,kBAAkB,CAAC,IAAI,CAAC,CAAC;gBAC1B,CAAC;aACD,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QACjC,MAAM,QAAQ,GAAG,GAAG,CAAC;QACrB,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,2BAA2B,aAAa,cAAc,QAAQ,QAAQ;gBAC7E,iBAAiB,EAAE,KAAK,EAAK,KAAwB,EAAE,EAAE;oBACxD,IAAI,QAAgB,CAAC;oBACrB,GAAG;wBACF,+FAA+F;wBAC/F,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;wBAE1C,QAAQ;wBACR,MAAM,IAAI,GAAG,mBAAmB,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC;wBACjE,MAAM,IAAI,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;wBAErC,UAAU;wBACV,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE;4BAC/C,IAAI,CAAC,MAAM;iCACT,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC;iCAClD,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;yBAC/B;wBACD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBAChC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;wBAEhD,uBAAuB;wBACvB,MAAM,QAAQ,GAAG,sBAAsB,CACtC,kBAAkB,CACjB,EAAE,MAAM,EAAE,UAAU,EAAE,EACtB,UAAU,CAAC,eAAe,CAAC,YAAY,EACvC,cAAc,CAAC,aAAa,EAAE,QAAQ,CAAC,CACvC,CACD,CAAC;wBACF,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;wBACpC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;wBAErC,eAAe;qBACf,QAAQ,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE;gBACvC,CAAC;gBACD,wBAAwB;gBACxB,uBAAuB,EAAE,CAAC;aAC1B,CAAC,CAAC;SACH;QACD,KAAK,MAAM,CAAC,aAAa,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE;YAC5D,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa;gBACnB,KAAK,EAAE,2BAA2B,aAAa,cAAc,QAAQ,QAAQ;gBAC7E,iBAAiB,EAAE,KAAK,EAAK,KAAwB,EAAE,EAAE;oBACxD,IAAI,QAAgB,CAAC;oBACrB,GAAG;wBACF,+FAA+F;wBAC/F,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;wBAE1C,QAAQ;wBACR,MAAM,OAAO,GAAG,EAAE,CAAC;wBACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,aAAa,EAAE,KAAK,EAAE,EAAE;4BACnD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;yBACpB;wBACD,MAAM,IAAI,GAAG,mBAAmB,CAAC;4BAChC,WAAW,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE;4BAC7B,MAAM,EAAE,UAAU;yBAClB,CAAC,CAAC;wBAEH,MAAM,QAAQ,GAAG;4BAChB,MAAM,EAAE,SAAS;4BACjB,WAAW,EAAE,YAAY;4BACzB,WAAW,EAAE,CAAC;yBACd,CAAC;wBACF,MAAM,SAAS,GAAG,aAAa,GAAG,CAAC,CAAC;wBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC;4BACxC,MAAM,EAAE,QAAQ;4BAChB,KAAK,EAAE,aAAa;yBACpB,CAAC,CAAC;wBAEH,UAAU;wBACV,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBACjC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE;4BAC/C,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;4BAC5B,MAAM,CAAC,MAAM,CAAC,SAAS,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;yBAClD;wBACD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBAChC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;wBAEhD,uBAAuB;wBACvB,MAAM,QAAQ,GAAG,sBAAsB,CACtC,sBAAsB,CACrB;4BACC,MAAM,EAAE,UAAU;yBAClB,EACD,cAAc,EACd,0BAA0B,CAAC,aAAa,EAAE,QAAQ,CAAC,CACnD,CACD,CAAC;wBACF,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;wBACpC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;wBAErC,eAAe;qBACf,QAAQ,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE;gBACvC,CAAC;gBACD,wBAAwB;gBACxB,uBAAuB,EAAE,CAAC;aAC1B,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACrC,MAAM,eAAe,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE;YACnC,SAAS,CAAC;gBACT,IAAI,EAAE,aAAa,CAAC,WAAW;gBAC/B,KAAK,EAAE,OAAO,IAAI,gBAAgB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE;gBACzD,iBAAiB,EAAE,KAAK,EAAK,KAAwB,EAAE,EAAE;oBACxD,IAAI,QAAgB,CAAC;oBACrB,GAAG;wBACF,+FAA+F;wBAC/F,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;wBAE1C,QAAQ;wBACR,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;wBACtD,0CAA0C;wBAC1C,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC;wBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;4BAC9B,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;yBACjC;wBAED,UAAU;wBACV,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBACjC,QAAQ,CAAC,eAAe,EAAE,CAAC;wBAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBAChC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;wBAChD,eAAe;qBACf,QAAQ,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE;gBACvC,CAAC;gBACD,wBAAwB;gBACxB,uBAAuB,EAAE,CAAC;aAC1B,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,yDAAyD;IACzD,4FAA4F;IAC5F,kCAAkC;IAClC,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QACjC,MAAM,YAAY,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,SAAS,IAAI,YAAY,EAAE;YACrC,MAAM,IAAI,GAAG,SAAS,CAAC;gBACtB,IAAI,EAAE,aAAa,CAAC,WAAW;gBAC/B,KAAK,EAAE,OAAO,SAAS,yBAAyB,OAAO,QAAQ;gBAC/D,iBAAiB,EAAE,KAAK,EAAK,KAAwB,EAAE,EAAE;oBACxD,IAAI,QAAgB,CAAC;oBACrB,GAAG;wBACF,+FAA+F;wBAC/F,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;wBAE1C,QAAQ;wBACR,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;wBAC5D,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,SAAS,EAAE,OAAO,EAAE,EAAE;4BACrD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,OAAO,EAAE,KAAK,EAAE,EAAE;gCAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gCACnC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,KAAK,IAAI,OAAO,EAAE,CAAC,CAAC;6BACjD;yBACD;wBAED,UAAU;wBACV,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBACjC,QAAQ,CAAC,eAAe,EAAE,CAAC;wBAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;wBAChC,kFAAkF;wBAClF,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC;qBAC1D,QAAQ,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE;gBACvC,CAAC;gBACD,wBAAwB;gBACxB,uBAAuB,EAAE,CAAC;aAC1B,CAAC,CAAC;YAEH,IAAI,CAAC,0BAA0B,EAAE;gBAChC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;aACnB;SACD;IACF,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 */\nimport { strict as assert } from \"assert\";\nimport {\n\tbenchmark,\n\tBenchmarkTimer,\n\tBenchmarkType,\n\tisInPerformanceTestingMode,\n} from \"@fluid-tools/benchmark\";\nimport {\n\tjsonableTreeFromCursor,\n\tcursorForTypedData,\n\tcursorForTypedTreeData,\n\tTreeCompressionStrategy,\n} from \"../../feature-libraries/index.js\";\nimport { singleJsonCursor } from \"../../domains/index.js\";\nimport {\n\tinsert,\n\tTestTreeProviderLite,\n\ttoJsonableTree,\n\tflexTreeViewWithContent,\n\tcheckoutWithContent,\n} from \"../utils.js\";\nimport { FlexTreeView, SharedTreeFactory } from \"../../shared-tree/index.js\";\nimport { rootFieldKey } from \"../../core/index.js\";\nimport {\n\tdeepPath,\n\tdeepSchema,\n\tJSDeepTree,\n\tJSWideTree,\n\tlocalFieldKey,\n\tmakeDeepContent,\n\tmakeJsDeepTree,\n\tmakeWideContentWithEndValue,\n\tmakeJsWideTreeWithEndValue,\n\treadDeepCursorTree,\n\treadDeepEditableTree,\n\treadDeepTreeAsJSObject,\n\treadWideCursorTree,\n\treadWideEditableTree,\n\treadWideTreeAsJSObject,\n\twideRootSchema,\n\twideSchema,\n} from \"../scalableTestTrees.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { typeboxValidator } from \"../../external-utilities/typeboxValidator.js\";\n\n// number of nodes in test for wide trees\nconst nodesCountWide = [\n\t[1, BenchmarkType.Measurement],\n\t[100, BenchmarkType.Perspective],\n\t[500, BenchmarkType.Measurement],\n];\n// number of nodes in test for deep trees\nconst nodesCountDeep = [\n\t[1, BenchmarkType.Measurement],\n\t[10, BenchmarkType.Perspective],\n\t[100, BenchmarkType.Measurement],\n];\n\n// TODO: ADO#7111 Schema should be fixed to enable schema based encoding.\nconst factory = new SharedTreeFactory({\n\tjsonValidator: typeboxValidator,\n\ttreeEncodeType: TreeCompressionStrategy.Uncompressed,\n});\n\n// TODO: Once the \"BatchTooLarge\" error is no longer an issue, extend tests for larger trees.\ndescribe(\"SharedTree benchmarks\", () => {\n\tdescribe(\"Direct JS Object\", () => {\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountDeep) {\n\t\t\tlet tree: JSDeepTree;\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Deep Tree as JS Object: reads with ${numberOfNodes} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\ttree = makeJsDeepTree(numberOfNodes, 1) as JSDeepTree;\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tconst { depth, value } = readDeepTreeAsJSObject(tree);\n\t\t\t\t\tassert.equal(depth, numberOfNodes);\n\t\t\t\t\tassert.equal(value, 1);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountWide) {\n\t\t\tlet tree: JSWideTree;\n\t\t\tlet expected = 0;\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Wide Tree as JS Object: reads with ${numberOfNodes} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\ttree = makeJsWideTreeWithEndValue(numberOfNodes, numberOfNodes - 1);\n\t\t\t\t\tfor (let i = 0; i < numberOfNodes; i++) {\n\t\t\t\t\t\texpected += i;\n\t\t\t\t\t}\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tconst { nodesCount, sum } = readWideTreeAsJSObject(tree);\n\t\t\t\t\tassert.equal(nodesCount, numberOfNodes);\n\t\t\t\t\tassert.equal(sum, expected);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t\tdescribe(`Edit JS Object`, () => {\n\t\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountDeep) {\n\t\t\t\tlet tree: JSDeepTree;\n\t\t\t\tlet currentNode: JSDeepTree;\n\t\t\t\tbenchmark({\n\t\t\t\t\ttype: benchmarkType,\n\t\t\t\t\ttitle: `Update value at leaf of ${numberOfNodes} deep tree`,\n\t\t\t\t\tbefore: () => {\n\t\t\t\t\t\ttree = makeJsDeepTree(numberOfNodes, 1) as JSDeepTree;\n\t\t\t\t\t\tcurrentNode = tree;\n\t\t\t\t\t\twhile (typeof currentNode !== \"number\") {\n\t\t\t\t\t\t\tif (typeof currentNode.foo === \"number\") {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tcurrentNode = currentNode.foo;\n\t\t\t\t\t\t}\n\t\t\t\t\t},\n\t\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\t\tcurrentNode.foo = -1;\n\t\t\t\t\t},\n\t\t\t\t\tafter: () => {\n\t\t\t\t\t\tconst expected = makeJsDeepTree(numberOfNodes, -1);\n\t\t\t\t\t\tassert.deepEqual(tree, expected);\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\t\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountWide) {\n\t\t\t\tlet tree: JSWideTree;\n\t\t\t\tbenchmark({\n\t\t\t\t\ttype: benchmarkType,\n\t\t\t\t\ttitle: `Update value at leaf of ${numberOfNodes} Wide tree`,\n\t\t\t\t\tbefore: () => {\n\t\t\t\t\t\ttree = makeJsWideTreeWithEndValue(numberOfNodes, numberOfNodes - 1);\n\t\t\t\t\t},\n\t\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\t\ttree.foo[numberOfNodes - 1] = -1;\n\t\t\t\t\t},\n\t\t\t\t\tafter: () => {\n\t\t\t\t\t\tconst expected = makeJsWideTreeWithEndValue(numberOfNodes, -1);\n\t\t\t\t\t\tassert.deepEqual(tree, expected);\n\t\t\t\t\t},\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\t});\n\tdescribe(\"Cursors\", () => {\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountDeep) {\n\t\t\tlet tree: FlexTreeView<typeof deepSchema.rootFieldSchema>;\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Deep Tree with cursor: reads with ${numberOfNodes} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\ttree = flexTreeViewWithContent(makeDeepContent(numberOfNodes));\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tconst { depth, value } = readDeepCursorTree(tree);\n\t\t\t\t\tassert.equal(value, 1);\n\t\t\t\t\tassert.equal(depth, numberOfNodes);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountWide) {\n\t\t\tlet tree: FlexTreeView<typeof wideSchema.rootFieldSchema>;\n\t\t\tlet expected = 0;\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Wide Tree with cursor: reads with ${numberOfNodes} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\tconst numbers = [];\n\t\t\t\t\tfor (let index = 0; index < numberOfNodes; index++) {\n\t\t\t\t\t\tnumbers.push(index);\n\t\t\t\t\t\texpected += index;\n\t\t\t\t\t}\n\t\t\t\t\ttree = flexTreeViewWithContent(\n\t\t\t\t\t\tmakeWideContentWithEndValue(numberOfNodes, numberOfNodes - 1),\n\t\t\t\t\t);\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tconst { nodesCount, sum } = readWideCursorTree(tree);\n\t\t\t\t\tassert.equal(sum, expected);\n\t\t\t\t\tassert.equal(nodesCount, numberOfNodes);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t});\n\tdescribe(\"EditableTree bench\", () => {\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountDeep) {\n\t\t\tlet tree: FlexTreeView<typeof deepSchema.rootFieldSchema>;\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Deep Tree with Editable Tree: reads with ${numberOfNodes} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\ttree = flexTreeViewWithContent(makeDeepContent(numberOfNodes));\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tconst { depth, value } = readDeepEditableTree(tree);\n\t\t\t\t\tassert.equal(depth, numberOfNodes);\n\t\t\t\t\tassert.equal(value, 1);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountWide) {\n\t\t\tlet tree: FlexTreeView<typeof wideSchema.rootFieldSchema>;\n\t\t\tlet expected: number = 0;\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Wide Tree with Editable Tree: reads with ${numberOfNodes} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\tconst numbers = [];\n\t\t\t\t\tfor (let index = 0; index < numberOfNodes; index++) {\n\t\t\t\t\t\tnumbers.push(index);\n\t\t\t\t\t\texpected += index;\n\t\t\t\t\t}\n\t\t\t\t\ttree = flexTreeViewWithContent({\n\t\t\t\t\t\tinitialTree: { foo: numbers },\n\t\t\t\t\t\tschema: wideSchema,\n\t\t\t\t\t});\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\tconst { nodesCount, sum } = readWideEditableTree(tree);\n\t\t\t\t\tassert.equal(sum, expected);\n\t\t\t\t\tassert.equal(nodesCount, numberOfNodes);\n\t\t\t\t\treadWideCursorTree(tree);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t});\n\tdescribe(\"Edit with editor\", () => {\n\t\tconst setCount = 100;\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountDeep) {\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Update value at leaf of ${numberOfNodes} deep tree ${setCount} times`,\n\t\t\t\tbenchmarkFnCustom: async <T>(state: BenchmarkTimer<T>) => {\n\t\t\t\t\tlet duration: number;\n\t\t\t\t\tdo {\n\t\t\t\t\t\t// Since this setup one collects data from one iteration, assert that this is what is expected.\n\t\t\t\t\t\tassert.equal(state.iterationsPerBatch, 1);\n\n\t\t\t\t\t\t// Setup\n\t\t\t\t\t\tconst tree = checkoutWithContent(makeDeepContent(numberOfNodes));\n\t\t\t\t\t\tconst path = deepPath(numberOfNodes);\n\n\t\t\t\t\t\t// Measure\n\t\t\t\t\t\tconst before = state.timer.now();\n\t\t\t\t\t\tfor (let value = 1; value <= setCount; value++) {\n\t\t\t\t\t\t\ttree.editor\n\t\t\t\t\t\t\t\t.valueField({ parent: path, field: localFieldKey })\n\t\t\t\t\t\t\t\t.set(singleJsonCursor(value));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tconst after = state.timer.now();\n\t\t\t\t\t\tduration = state.timer.toSeconds(before, after);\n\n\t\t\t\t\t\t// Cleanup + validation\n\t\t\t\t\t\tconst expected = jsonableTreeFromCursor(\n\t\t\t\t\t\t\tcursorForTypedData(\n\t\t\t\t\t\t\t\t{ schema: deepSchema },\n\t\t\t\t\t\t\t\tdeepSchema.rootFieldSchema.allowedTypes,\n\t\t\t\t\t\t\t\tmakeJsDeepTree(numberOfNodes, setCount),\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t);\n\t\t\t\t\t\tconst actual = toJsonableTree(tree);\n\t\t\t\t\t\tassert.deepEqual(actual, [expected]);\n\n\t\t\t\t\t\t// Collect data\n\t\t\t\t\t} while (state.recordBatch(duration));\n\t\t\t\t},\n\t\t\t\t// Force batch size of 1\n\t\t\t\tminBatchDurationSeconds: 0,\n\t\t\t});\n\t\t}\n\t\tfor (const [numberOfNodes, benchmarkType] of nodesCountWide) {\n\t\t\tbenchmark({\n\t\t\t\ttype: benchmarkType,\n\t\t\t\ttitle: `Update value at leaf of ${numberOfNodes} wide tree ${setCount} times`,\n\t\t\t\tbenchmarkFnCustom: async <T>(state: BenchmarkTimer<T>) => {\n\t\t\t\t\tlet duration: number;\n\t\t\t\t\tdo {\n\t\t\t\t\t\t// Since this setup one collects data from one iteration, assert that this is what is expected.\n\t\t\t\t\t\tassert.equal(state.iterationsPerBatch, 1);\n\n\t\t\t\t\t\t// Setup\n\t\t\t\t\t\tconst numbers = [];\n\t\t\t\t\t\tfor (let index = 0; index < numberOfNodes; index++) {\n\t\t\t\t\t\t\tnumbers.push(index);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tconst tree = checkoutWithContent({\n\t\t\t\t\t\t\tinitialTree: { foo: numbers },\n\t\t\t\t\t\t\tschema: wideSchema,\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\tconst rootPath = {\n\t\t\t\t\t\t\tparent: undefined,\n\t\t\t\t\t\t\tparentField: rootFieldKey,\n\t\t\t\t\t\t\tparentIndex: 0,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tconst nodeIndex = numberOfNodes - 1;\n\t\t\t\t\t\tconst editor = tree.editor.sequenceField({\n\t\t\t\t\t\t\tparent: rootPath,\n\t\t\t\t\t\t\tfield: localFieldKey,\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\t// Measure\n\t\t\t\t\t\tconst before = state.timer.now();\n\t\t\t\t\t\tfor (let value = 1; value <= setCount; value++) {\n\t\t\t\t\t\t\teditor.remove(nodeIndex, 1);\n\t\t\t\t\t\t\teditor.insert(nodeIndex, singleJsonCursor(value));\n\t\t\t\t\t\t}\n\t\t\t\t\t\tconst after = state.timer.now();\n\t\t\t\t\t\tduration = state.timer.toSeconds(before, after);\n\n\t\t\t\t\t\t// Cleanup + validation\n\t\t\t\t\t\tconst expected = jsonableTreeFromCursor(\n\t\t\t\t\t\t\tcursorForTypedTreeData(\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tschema: wideSchema,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\twideRootSchema,\n\t\t\t\t\t\t\t\tmakeJsWideTreeWithEndValue(numberOfNodes, setCount),\n\t\t\t\t\t\t\t),\n\t\t\t\t\t\t);\n\t\t\t\t\t\tconst actual = toJsonableTree(tree);\n\t\t\t\t\t\tassert.deepEqual(actual, [expected]);\n\n\t\t\t\t\t\t// Collect data\n\t\t\t\t\t} while (state.recordBatch(duration));\n\t\t\t\t},\n\t\t\t\t// Force batch size of 1\n\t\t\t\tminBatchDurationSeconds: 0,\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"acking local commits\", () => {\n\t\tconst localCommitSize = [1, 25, 100, 500, 1000];\n\t\tfor (const size of localCommitSize) {\n\t\t\tbenchmark({\n\t\t\t\ttype: BenchmarkType.Measurement,\n\t\t\t\ttitle: `for ${size} local commit${size === 1 ? \"\" : \"s\"}`,\n\t\t\t\tbenchmarkFnCustom: async <T>(state: BenchmarkTimer<T>) => {\n\t\t\t\t\tlet duration: number;\n\t\t\t\t\tdo {\n\t\t\t\t\t\t// Since this setup one collects data from one iteration, assert that this is what is expected.\n\t\t\t\t\t\tassert.equal(state.iterationsPerBatch, 1);\n\n\t\t\t\t\t\t// Setup\n\t\t\t\t\t\tconst provider = new TestTreeProviderLite(1, factory);\n\t\t\t\t\t\t// TODO: specify a schema for these trees.\n\t\t\t\t\t\tconst [tree] = provider.trees;\n\t\t\t\t\t\tfor (let i = 0; i < size; i++) {\n\t\t\t\t\t\t\tinsert(tree.checkout, i, \"test\");\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Measure\n\t\t\t\t\t\tconst before = state.timer.now();\n\t\t\t\t\t\tprovider.processMessages();\n\t\t\t\t\t\tconst after = state.timer.now();\n\t\t\t\t\t\tduration = state.timer.toSeconds(before, after);\n\t\t\t\t\t\t// Collect data\n\t\t\t\t\t} while (state.recordBatch(duration));\n\t\t\t\t},\n\t\t\t\t// Force batch size of 1\n\t\t\t\tminBatchDurationSeconds: 0,\n\t\t\t});\n\t\t}\n\t});\n\n\t// Note that this runs the computation for several peers.\n\t// In practice, this computation is distributed across peers, so the actual time reported is\n\t// divided by the number of peers.\n\tdescribe(\"rebasing commits\", () => {\n\t\tconst commitCounts = [1, 10, 20];\n\t\tconst nbPeers = 5;\n\t\tfor (const nbCommits of commitCounts) {\n\t\t\tconst test = benchmark({\n\t\t\t\ttype: BenchmarkType.Measurement,\n\t\t\t\ttitle: `for ${nbCommits} commits per peer for ${nbPeers} peers`,\n\t\t\t\tbenchmarkFnCustom: async <T>(state: BenchmarkTimer<T>) => {\n\t\t\t\t\tlet duration: number;\n\t\t\t\t\tdo {\n\t\t\t\t\t\t// Since this setup one collects data from one iteration, assert that this is what is expected.\n\t\t\t\t\t\tassert.equal(state.iterationsPerBatch, 1);\n\n\t\t\t\t\t\t// Setup\n\t\t\t\t\t\tconst provider = new TestTreeProviderLite(nbPeers, factory);\n\t\t\t\t\t\tfor (let iCommit = 0; iCommit < nbCommits; iCommit++) {\n\t\t\t\t\t\t\tfor (let iPeer = 0; iPeer < nbPeers; iPeer++) {\n\t\t\t\t\t\t\t\tconst peer = provider.trees[iPeer];\n\t\t\t\t\t\t\t\tinsert(peer.checkout, 0, `p${iPeer}c${iCommit}`);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Measure\n\t\t\t\t\t\tconst before = state.timer.now();\n\t\t\t\t\t\tprovider.processMessages();\n\t\t\t\t\t\tconst after = state.timer.now();\n\t\t\t\t\t\t// Divide the duration by the number of peers so we get the average time per peer.\n\t\t\t\t\t\tduration = state.timer.toSeconds(before, after) / nbPeers;\n\t\t\t\t\t} while (state.recordBatch(duration));\n\t\t\t\t},\n\t\t\t\t// Force batch size of 1\n\t\t\t\tminBatchDurationSeconds: 0,\n\t\t\t});\n\n\t\t\tif (!isInPerformanceTestingMode) {\n\t\t\t\ttest.timeout(5000);\n\t\t\t}\n\t\t}\n\t});\n});\n"]}

package/lib/test/shared-tree/sharedTree.spec.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=sharedTree.spec.d.ts.map

package/lib/test/shared-tree/sharedTree.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sharedTree.spec.d.ts","sourceRoot":"","sources":["../../../src/test/shared-tree/sharedTree.spec.ts"],"names":[],"mappings":""}