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

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

@@ -1,559 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert, fail } from "assert";
-import Table from "easy-table";
-import { isInPerformanceTestingMode } from "@fluid-tools/benchmark";
-import { MockContainerRuntimeFactory, MockFluidDataStoreRuntime, MockStorage, } from "@fluidframework/test-runtime-utils";
-import { createIdCompressor } from "@fluidframework/id-compressor";
-import { TreeCompressionStrategy, cursorForJsonableTreeNode, } from "../../feature-libraries/index.js";
-import { brand, getOrAddEmptyToMap } from "../../util/index.js";
-import { AllowedUpdateType, forEachNode, moveToDetachedField, rootFieldKey, } from "../../core/index.js";
-import { SchemaBuilder, leaf } from "../../domains/index.js";
-import { schematizeFlexTree, treeTestFactory } from "../utils.js";
-import { typeboxValidator } from "../../external-utilities/index.js";
-// Notes:
-// 1. Within this file "percentile" is commonly used, and seems to refer to a portion (0 to 1) or some maximum size.
-// While it would be useful and interesting to have some distribution of op sizes and measure some percentile from that distribution,
-// that does not appear to be what these tests are doing.
-// 2. Data from these tests are just printed: no other data collection is done. If a comparison is desired, manually run the tests before and after.
-// 3. Major changes in these sizes (regressions, optimizations or the tests not collecting what they should) do not make these tests fail.
-// 4. These tests are currently implemented as integration tests, meaning they use lots of dependencies and high level APIs.
-// They could be reimplemented targeted the lower level APIs if desired.
-// 5. "large" node just get a long repeated string value, not a complex tree, so tree encoding is not really covered here.
-// TODO: fix above issues.
-const builder = new SchemaBuilder({ scope: "opSize" });
-const childSchema = builder.object("Test:Opsize-Bench-Child", {
-    data: leaf.string,
-});
-const parentSchema = builder.object("Test:Opsize-Bench-Root", {
-    children: builder.sequence(childSchema),
-});
-const fullSchemaData = builder.intoSchema(parentSchema);
-const initialTestJsonTree = {
-    type: parentSchema.name,
-};
-const childrenFieldKey = brand("children");
-/**
- * Create a default attached tree for op submission
- */
-function createConnectedTree() {
-    const containerRuntimeFactory = new MockContainerRuntimeFactory();
-    const dataStoreRuntime = new MockFluidDataStoreRuntime({
-        idCompressor: createIdCompressor(),
-    });
-    containerRuntimeFactory.createContainerRuntime(dataStoreRuntime);
-    const tree = treeTestFactory({
-        runtime: dataStoreRuntime,
-        options: {
-            jsonValidator: typeboxValidator,
-            treeEncodeType: TreeCompressionStrategy.Uncompressed,
-        },
-    });
-    tree.connect({
-        deltaConnection: dataStoreRuntime.createDeltaConnection(),
-        objectStorage: new MockStorage(),
-    });
-    return tree;
-}
-/*
- * Updates the given `tree` to the given `schema` and inserts `state` as its root.
- */
-function initializeTestTree(tree, state = initialTestJsonTree) {
-    const writeCursor = cursorForJsonableTreeNode(state);
-    return schematizeFlexTree(tree, {
-        allowedSchemaModifications: AllowedUpdateType.Initialize,
-        initialTree: [writeCursor],
-        schema: fullSchemaData,
-    }).checkout;
-}
-function utf8Length(data) {
-    return new TextEncoder().encode(JSON.stringify(data)).length;
-}
-/**
- * Creates a {@link JsonableTree} that matches the `parentSchema` and when run through `JSON.stringify` has the requested length in bytes when encoded as utf8.
- */
-function createTreeWithSize(desiredByteSize) {
-    const node = {
-        type: childSchema.name,
-        fields: {
-            data: [{ value: "", type: leaf.string.name }],
-        },
-    };
-    const initialNodeByteSize = utf8Length(node);
-    node.fields.data[0].value = createStringFromLength(desiredByteSize - initialNodeByteSize);
-    assert(utf8Length(node) === desiredByteSize);
-    return node;
-}
-function getChildrenLength(tree) {
-    const cursor = tree.forest.allocateCursor();
-    moveToDetachedField(tree.forest, cursor);
-    cursor.enterNode(0);
-    cursor.enterField(childrenFieldKey);
-    const length = cursor.getFieldLength();
-    cursor.free();
-    return length;
-}
-function assertChildNodeCount(tree, nodeCount) {
-    const cursor = tree.forest.allocateCursor();
-    moveToDetachedField(tree.forest, cursor);
-    cursor.enterNode(0);
-    cursor.enterField(childrenFieldKey);
-    assert.equal(cursor.getFieldLength(), nodeCount);
-    cursor.free();
-}
-/**
- * Checks that the first `childCount` values under "children" have the provided value.
- */
-function expectChildrenValues(tree, expected, childCount) {
-    const cursor = tree.forest.allocateCursor();
-    moveToDetachedField(tree.forest, cursor);
-    cursor.enterNode(0);
-    cursor.enterField(childrenFieldKey);
-    assert(cursor.getFieldLength() >= childCount);
-    forEachNode(cursor, () => {
-        if (cursor.fieldIndex < childCount) {
-            assert.equal(cursor.value, expected);
-        }
-    });
-    cursor.free();
-}
-/**
- * Creates a jsonable tree with the desired number of children and the size of each child in bytes.
- */
-function createInitialTree(childNodes, childNodeByteSize) {
-    const childNode = createTreeWithSize(childNodeByteSize);
-    const jsonTree = {
-        type: parentSchema.name,
-        fields: {
-            children: new Array(childNodes).fill(childNode),
-        },
-    };
-    return jsonTree;
-}
-function insertNodesWithIndividualTransactions(tree, jsonNode, count) {
-    for (let i = 0; i < count; i++) {
-        tree.transaction.start();
-        const path = {
-            parent: undefined,
-            parentField: rootFieldKey,
-            parentIndex: 0,
-        };
-        const writeCursor = cursorForJsonableTreeNode(jsonNode);
-        const field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });
-        field.insert(0, writeCursor);
-        tree.transaction.commit();
-    }
-}
-function insertNodesWithSingleTransaction(tree, jsonNode, count) {
-    tree.transaction.start();
-    const path = {
-        parent: undefined,
-        parentField: rootFieldKey,
-        parentIndex: 0,
-    };
-    const field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });
-    for (let i = 0; i < count; i++) {
-        field.insert(0, cursorForJsonableTreeNode(jsonNode));
-    }
-    tree.transaction.commit();
-}
-function removeNodesWithIndividualTransactions(tree, numRemovals, removalsPerTransaction) {
-    for (let i = 0; i < numRemovals; i++) {
-        tree.transaction.start();
-        const path = {
-            parent: undefined,
-            parentField: rootFieldKey,
-            parentIndex: 0,
-        };
-        const field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });
-        field.remove(getChildrenLength(tree) - 1, removalsPerTransaction);
-        tree.transaction.commit();
-    }
-}
-function removeNodesWithSingleTransaction(tree, numRemoved) {
-    tree.transaction.start();
-    const path = {
-        parent: undefined,
-        parentField: rootFieldKey,
-        parentIndex: 0,
-    };
-    const field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });
-    field.remove(0, numRemoved);
-    tree.transaction.commit();
-}
-function createStringFromLength(numberOfBytes) {
-    return "a".repeat(numberOfBytes);
-}
-function editNodesWithIndividualTransactions(tree, numChildrenToEdit, editPayload) {
-    const rootPath = {
-        parent: undefined,
-        parentField: rootFieldKey,
-        parentIndex: 0,
-    };
-    const editor = tree.editor.sequenceField({ parent: rootPath, field: childrenFieldKey });
-    for (let i = 0; i < numChildrenToEdit; i++) {
-        tree.transaction.start();
-        editor.remove(i, 1);
-        editor.insert(i, cursorForJsonableTreeNode({
-            type: childSchema.name,
-            value: editPayload,
-            fields: {
-                data: [{ value: "", type: leaf.string.name }],
-            },
-        }));
-        tree.transaction.commit();
-    }
-}
-function editNodesWithSingleTransaction(tree, numChildrenToEdit, editPayload) {
-    const rootPath = {
-        parent: undefined,
-        parentField: rootFieldKey,
-        parentIndex: 0,
-    };
-    const editor = tree.editor.sequenceField({ parent: rootPath, field: childrenFieldKey });
-    tree.transaction.start();
-    for (let i = 0; i < numChildrenToEdit; i++) {
-        editor.remove(i, 1);
-        editor.insert(i, cursorForJsonableTreeNode({
-            type: childSchema.name,
-            value: editPayload,
-            fields: {
-                data: [{ value: "", type: leaf.string.name }],
-            },
-        }));
-    }
-    tree.transaction.commit();
-}
-var Operation;
-(function (Operation) {
-    Operation["Insert"] = "Insert";
-    Operation["Remove"] = "Remove";
-    Operation["Edit"] = "Edit";
-})(Operation || (Operation = {}));
-var TransactionStyle;
-(function (TransactionStyle) {
-    TransactionStyle[TransactionStyle["Individual"] = 0] = "Individual";
-    TransactionStyle[TransactionStyle["Single"] = 1] = "Single";
-})(TransactionStyle || (TransactionStyle = {}));
-/**
- * The following byte sizes in utf-8 encoded bytes of JsonableTree were found to be the maximum size that could be successfully
- * inserted/removed/edited using the following node counts and either individual of singular (bulk) transactions.
- *
- * Using any larger of a byte size of JsonableTree children causes the "BatchToLarge" error; this would require either:
- * Adding artificial wait, for e.x. by using a for-loop to segment our transactions into batches of less than the given node count.
- * OR
- * Making the size in bytes of the children smaller.
- */
-const MAX_SUCCESSFUL_OP_BYTE_SIZES = {
-    Insert: {
-        [TransactionStyle.Individual]: {
-            nodeCounts: {
-                "100": 8900,
-            },
-        },
-        [TransactionStyle.Single]: {
-            nodeCounts: {
-                "100": 9600,
-            },
-        },
-    },
-    Remove: {
-        [TransactionStyle.Individual]: {
-            nodeCounts: {
-                "100": 9700,
-            },
-        },
-        [TransactionStyle.Single]: {
-            nodeCounts: {
-                "100": 9700,
-            },
-        },
-    },
-    Edit: {
-        [TransactionStyle.Individual]: {
-            nodeCounts: {
-                // Edit benchmarks use 1/10 of the actual max sizes outside of perf mode because it takes so long to execute.
-                "100": isInPerformanceTestingMode ? 800000 : 80000,
-            },
-        },
-        [TransactionStyle.Single]: {
-            nodeCounts: {
-                "100": 8600,
-            },
-        },
-    },
-};
-const getSuccessfulOpByteSize = (operation, transactionStyle, percentile) => {
-    return Math.floor(MAX_SUCCESSFUL_OP_BYTE_SIZES[operation][transactionStyle].nodeCounts["100"] * percentile);
-};
-const BENCHMARK_NODE_COUNT = 100;
-const sizes = [
-    { percentile: 0.1, word: "small" },
-    { percentile: 0.5, word: "medium" },
-    { percentile: 1.0, word: "large" },
-];
-const styles = [
-    {
-        description: "Many Transactions",
-        style: TransactionStyle.Individual,
-        extraDescription: `${BENCHMARK_NODE_COUNT} transactions`,
-    },
-    {
-        description: "Single Transaction",
-        style: TransactionStyle.Single,
-        extraDescription: `1 transaction`,
-    },
-];
-describe("Op Size", () => {
-    const opsByBenchmarkName = new Map();
-    let currentBenchmarkName = "";
-    const currentTestOps = [];
-    function registerOpListener(tree, resultArray) {
-        // TODO: better way to hook this up. Needs to detect local ops exactly once.
-        const oldSubmitLocalMessage = tree.submitLocalMessage.bind(tree);
-        function submitLocalMessage(content, localOpMetadata = undefined) {
-            resultArray.push(content);
-            oldSubmitLocalMessage(content, localOpMetadata);
-        }
-        tree.submitLocalMessage = submitLocalMessage;
-    }
-    const getOperationsStats = (operations) => {
-        const lengths = operations.map((operation) => utf8Length(operation));
-        const totalOpBytes = lengths.reduce((a, b) => a + b, 0);
-        const maxOpSizeBytes = Math.max(...lengths);
-        return {
-            "Total Op Size (Bytes)": totalOpBytes,
-            "Max Op Size (Bytes)": maxOpSizeBytes,
-            "Total Ops:": operations.length,
-        };
-    };
-    const initializeOpDataCollection = (tree) => {
-        currentTestOps.length = 0;
-        registerOpListener(tree, currentTestOps);
-    };
-    const saveAndResetCurrentOps = () => {
-        currentTestOps.forEach((op) => getOrAddEmptyToMap(opsByBenchmarkName, currentBenchmarkName).push(op));
-        currentTestOps.length = 0;
-    };
-    const deleteCurrentOps = () => {
-        currentTestOps.length = 0;
-    };
-    beforeEach(function () {
-        currentBenchmarkName = this.currentTest?.fullTitle() ?? fail();
-        currentTestOps.length = 0;
-    });
-    afterEach(() => {
-        // Currently tests can pass when no data is collected, so throw here in that case to ensure tests don't break and start collecting no data.
-        assert(currentTestOps.length !== 0);
-        currentTestOps.forEach((op) => getOrAddEmptyToMap(opsByBenchmarkName, currentBenchmarkName).push(op));
-        currentTestOps.length = 0;
-    });
-    after(() => {
-        const allBenchmarkOpStats = [];
-        for (const [benchmarkName, ops] of opsByBenchmarkName) {
-            allBenchmarkOpStats.push({
-                "Test name": benchmarkName,
-                ...getOperationsStats(ops),
-            });
-        }
-        const table = new Table();
-        allBenchmarkOpStats.forEach((data) => {
-            Object.keys(data).forEach((key) => table.cell(key, data[key]));
-            table.newRow();
-        });
-        table.sort(["Avg. Op Size (Bytes)|des"]);
-        console.log("-- Op Size Benchmark Statistics -- ");
-        console.log(table.toString());
-    });
-    describe("Insert Nodes", () => {
-        function benchmarkOps(transactionStyle, percentile) {
-            const tree = createConnectedTree();
-            initializeOpDataCollection(tree);
-            const view = initializeTestTree(tree);
-            deleteCurrentOps(); // We don't want to record any ops from initializing the tree.
-            const jsonNode = createTreeWithSize(getSuccessfulOpByteSize(Operation.Insert, transactionStyle, percentile));
-            const apply = transactionStyle === TransactionStyle.Individual
-                ? insertNodesWithIndividualTransactions
-                : insertNodesWithSingleTransaction;
-            apply(view, jsonNode, BENCHMARK_NODE_COUNT);
-            assertChildNodeCount(view, BENCHMARK_NODE_COUNT);
-        }
-        for (const { description, style, extraDescription } of styles) {
-            describe(description, () => {
-                for (const { percentile, word } of sizes) {
-                    it(`${BENCHMARK_NODE_COUNT} ${word} nodes in ${extraDescription}`, () => {
-                        benchmarkOps(style, percentile);
-                    });
-                }
-            });
-        }
-    });
-    describe("Remove Nodes", () => {
-        function benchmarkOps(transactionStyle, percentile) {
-            const tree = createConnectedTree();
-            initializeOpDataCollection(tree);
-            const childByteSize = getSuccessfulOpByteSize(Operation.Remove, transactionStyle, percentile);
-            const view = initializeTestTree(tree, createInitialTree(100, childByteSize));
-            deleteCurrentOps(); // We don't want to record any ops from initializing the tree.
-            if (transactionStyle === TransactionStyle.Individual) {
-                removeNodesWithIndividualTransactions(view, 100, 1);
-            }
-            else {
-                removeNodesWithSingleTransaction(view, 100);
-            }
-            assertChildNodeCount(view, 0);
-        }
-        for (const { description, style, extraDescription } of styles) {
-            describe(description, () => {
-                for (const { percentile, word } of sizes) {
-                    it(`${BENCHMARK_NODE_COUNT} ${word} nodes in ${style === TransactionStyle.Individual
-                        ? extraDescription
-                        : `1 transactions containing 1 removal of ${BENCHMARK_NODE_COUNT} nodes`}`, () => {
-                        benchmarkOps(style, percentile);
-                    });
-                }
-            });
-        }
-    });
-    describe("Edit Nodes", () => {
-        function benchmarkOps(transactionStyle, percentile) {
-            const tree = createConnectedTree();
-            initializeOpDataCollection(tree);
-            // Note that the child node byte size for the initial tree here should be arbitrary.
-            const view = initializeTestTree(tree, createInitialTree(BENCHMARK_NODE_COUNT, 1000));
-            deleteCurrentOps(); // We don't want to record any ops from initializing the tree.
-            const editPayload = createStringFromLength(getSuccessfulOpByteSize(Operation.Edit, transactionStyle, percentile));
-            if (transactionStyle === TransactionStyle.Individual) {
-                editNodesWithIndividualTransactions(view, BENCHMARK_NODE_COUNT, editPayload);
-            }
-            else {
-                editNodesWithSingleTransaction(view, BENCHMARK_NODE_COUNT, editPayload);
-            }
-            expectChildrenValues(view, editPayload, BENCHMARK_NODE_COUNT);
-        }
-        for (const { description, style, extraDescription } of styles) {
-            describe(description, () => {
-                for (const { percentile, word } of sizes) {
-                    it(`${BENCHMARK_NODE_COUNT} ${word} changes in ${extraDescription} containing ${style === TransactionStyle.Individual
-                        ? "1 edit"
-                        : `${BENCHMARK_NODE_COUNT} edits`}`, () => {
-                        benchmarkOps(style, percentile);
-                    });
-                }
-            });
-        }
-    });
-    describe("Insert, Remove & Edit Nodes", () => {
-        const oneThirdNodeCount = Math.floor(BENCHMARK_NODE_COUNT * (1 / 3));
-        const seventyPercentCount = Math.floor(BENCHMARK_NODE_COUNT * 0.7);
-        const fifteenPercentCount = Math.floor(BENCHMARK_NODE_COUNT * 0.15);
-        const distributions = [
-            {
-                [Operation.Insert]: oneThirdNodeCount,
-                [Operation.Edit]: oneThirdNodeCount,
-                [Operation.Remove]: oneThirdNodeCount,
-            },
-            {
-                [Operation.Insert]: seventyPercentCount,
-                [Operation.Edit]: fifteenPercentCount,
-                [Operation.Remove]: fifteenPercentCount,
-            },
-            {
-                [Operation.Insert]: fifteenPercentCount,
-                [Operation.Edit]: seventyPercentCount,
-                [Operation.Remove]: fifteenPercentCount,
-            },
-            {
-                [Operation.Insert]: fifteenPercentCount,
-                [Operation.Edit]: fifteenPercentCount,
-                [Operation.Remove]: seventyPercentCount,
-            },
-        ];
-        describe("Individual Transactions", () => {
-            const benchmarkInsertRemoveEditNodesWithInvidiualTxs = (percentile, distribution) => {
-                const { Remove: removeNodeCount, Insert: insertNodeCount, Edit: editNodeCount, } = distribution;
-                const tree = createConnectedTree();
-                initializeOpDataCollection(tree);
-                // remove
-                const childByteSize = getSuccessfulOpByteSize(Operation.Remove, TransactionStyle.Individual, percentile);
-                const view = initializeTestTree(tree, createInitialTree(removeNodeCount, childByteSize));
-                deleteCurrentOps(); // We don't want to record the ops from initializing the tree.
-                removeNodesWithIndividualTransactions(view, removeNodeCount, 1);
-                assertChildNodeCount(view, 0);
-                // insert
-                const insertChildNode = createTreeWithSize(getSuccessfulOpByteSize(Operation.Insert, TransactionStyle.Individual, percentile));
-                insertNodesWithIndividualTransactions(view, insertChildNode, insertNodeCount);
-                assertChildNodeCount(view, insertNodeCount);
-                // edit
-                // The editing function iterates over each child node and performs an edit so we have to make sure we have enough children to avoid going out of bounds.
-                if (insertNodeCount < editNodeCount) {
-                    const remainder = editNodeCount - insertNodeCount;
-                    saveAndResetCurrentOps();
-                    insertNodesWithIndividualTransactions(view, createTreeWithSize(childByteSize), remainder);
-                    deleteCurrentOps(); // We don't want to record the ops from re-initializing the tree.
-                }
-                const editPayload = createStringFromLength(getSuccessfulOpByteSize(Operation.Edit, TransactionStyle.Individual, percentile));
-                editNodesWithIndividualTransactions(view, editNodeCount, editPayload);
-                expectChildrenValues(view, editPayload, editNodeCount);
-            };
-            for (const distribution of distributions) {
-                const suiteDescription = `Distribution: ${distribution.Insert}% insert, ${distribution.Edit}% edit, ${distribution.Remove}% remove`;
-                describe(suiteDescription, () => {
-                    for (const { percentile } of sizes) {
-                        it(`Percentile: ${percentile}`, () => {
-                            benchmarkInsertRemoveEditNodesWithInvidiualTxs(percentile, distribution);
-                        });
-                    }
-                });
-            }
-        });
-        // TODO:
-        // These tests don't actually do a single transaction (they do one per edit type).
-        // Therefor they are failing to test the size of transactions mixing inserts, removals and edits.
-        // These tests also fail to clarify if the nodes being removed are ones which were inserted or edited earlier,
-        // so it can't be used to test compaction of transient data within a transaction even if it was a single transaction.
-        // Instead correctness tests should cover that, and maybe this suite should simply be removed?
-        describe("Single Transactions", () => {
-            const benchmarkInsertRemoveEditNodesWithSingleTxs = (percentile, distribution) => {
-                const { Remove: removedNodeCount, Insert: insertNodeCount, Edit: editNodeCount, } = distribution;
-                const tree = createConnectedTree();
-                initializeOpDataCollection(tree);
-                // remove
-                const childByteSize = getSuccessfulOpByteSize(Operation.Remove, TransactionStyle.Single, percentile);
-                const view = initializeTestTree(tree, createInitialTree(removedNodeCount, childByteSize));
-                deleteCurrentOps(); // We don't want to record the ops from initializing the tree.
-                removeNodesWithSingleTransaction(view, removedNodeCount);
-                assertChildNodeCount(view, 0);
-                // insert
-                const insertChildNode = createTreeWithSize(getSuccessfulOpByteSize(Operation.Insert, TransactionStyle.Single, percentile));
-                insertNodesWithSingleTransaction(view, insertChildNode, insertNodeCount);
-                assertChildNodeCount(view, insertNodeCount);
-                // edit
-                // The editing function iterates over each child node and performs an edit so we have to make sure we have enough children to avoid going out of bounds.
-                // TODO: if actually making this do a single transaction like its supposed to, this would be an issue as it would get included in that transaction.
-                if (insertNodeCount < editNodeCount) {
-                    const remainder = editNodeCount - insertNodeCount;
-                    saveAndResetCurrentOps();
-                    insertNodesWithIndividualTransactions(view, createTreeWithSize(childByteSize), remainder);
-                    deleteCurrentOps(); // We don't want to record the ops from re-initializing the tree.
-                }
-                const editPayload = createStringFromLength(getSuccessfulOpByteSize(Operation.Edit, TransactionStyle.Single, percentile));
-                editNodesWithSingleTransaction(view, editNodeCount, editPayload);
-                expectChildrenValues(view, editPayload, editNodeCount);
-            };
-            for (const distribution of distributions) {
-                const suiteDescription = `Distribution: ${distribution.Insert}% insert, ${distribution.Edit}% edit, ${distribution.Remove}% remove`;
-                describe(suiteDescription, () => {
-                    for (const { percentile } of sizes) {
-                        it(`Percentile: ${percentile}`, () => {
-                            benchmarkInsertRemoveEditNodesWithSingleTxs(percentile, distribution);
-                        });
-                    }
-                });
-            }
-        });
-    });
-});
-//# sourceMappingURL=opSize.bench.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"opSize.bench.js","sourceRoot":"","sources":["../../../src/test/shared-tree/opSize.bench.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,KAAK,MAAM,YAAY,CAAC;AAC/B,OAAO,EAAE,0BAA0B,EAAE,MAAM,wBAAwB,CAAC;AAEpE,OAAO,EACN,2BAA2B,EAC3B,yBAAyB,EACzB,WAAW,GACX,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AACnE,OAAO,EACN,uBAAuB,EACvB,yBAAyB,GACzB,MAAM,kCAAkC,CAAC;AAE1C,OAAO,EAA0B,KAAK,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACxF,OAAO,EACN,iBAAiB,EAEjB,WAAW,EAEX,mBAAmB,EACnB,YAAY,GAEZ,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,kBAAkB,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAClE,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AAErE,SAAS;AACT,oHAAoH;AACpH,qIAAqI;AACrI,yDAAyD;AACzD,oJAAoJ;AACpJ,0IAA0I;AAC1I,4HAA4H;AAC5H,wEAAwE;AACxE,0HAA0H;AAC1H,0BAA0B;AAE1B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;AAEvD,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,yBAAyB,EAAE;IAC7D,IAAI,EAAE,IAAI,CAAC,MAAM;CACjB,CAAC,CAAC;AACH,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,wBAAwB,EAAE;IAC7D,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC;CACvC,CAAC,CAAC;AAEH,MAAM,cAAc,GAAG,OAAO,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;AAExD,MAAM,mBAAmB,GAAG;IAC3B,IAAI,EAAE,YAAY,CAAC,IAAI;CACvB,CAAC;AAEF,MAAM,gBAAgB,GAAa,KAAK,CAAC,UAAU,CAAC,CAAC;AAErD;;GAEG;AACH,SAAS,mBAAmB;IAC3B,MAAM,uBAAuB,GAAG,IAAI,2BAA2B,EAAE,CAAC;IAClE,MAAM,gBAAgB,GAAG,IAAI,yBAAyB,CAAC;QACtD,YAAY,EAAE,kBAAkB,EAAE;KAClC,CAAC,CAAC;IACH,uBAAuB,CAAC,sBAAsB,CAAC,gBAAgB,CAAC,CAAC;IACjE,MAAM,IAAI,GAAG,eAAe,CAAC;QAC5B,OAAO,EAAE,gBAAgB;QACzB,OAAO,EAAE;YACR,aAAa,EAAE,gBAAgB;YAC/B,cAAc,EAAE,uBAAuB,CAAC,YAAY;SACpD;KACD,CAAC,CAAC;IACH,IAAI,CAAC,OAAO,CAAC;QACZ,eAAe,EAAE,gBAAgB,CAAC,qBAAqB,EAAE;QACzD,aAAa,EAAE,IAAI,WAAW,EAAE;KAChC,CAAC,CAAC;IACH,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAC1B,IAAgB,EAChB,QAAsB,mBAAmB;IAEzC,MAAM,WAAW,GAAG,yBAAyB,CAAC,KAAK,CAAC,CAAC;IACrD,OAAO,kBAAkB,CAAC,IAAI,EAAE;QAC/B,0BAA0B,EAAE,iBAAiB,CAAC,UAAU;QACxD,WAAW,EAAE,CAAC,WAAW,CAAC;QAC1B,MAAM,EAAE,cAAc;KACtB,CAAC,CAAC,QAAQ,CAAC;AACb,CAAC;AAED,SAAS,UAAU,CAAC,IAA4B;IAC/C,OAAO,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,eAAuB;IAClD,MAAM,IAAI,GAAG;QACZ,IAAI,EAAE,WAAW,CAAC,IAAI;QACtB,MAAM,EAAE;YACP,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;SAC7C;KACD,CAAC;IAEF,MAAM,mBAAmB,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC7C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,sBAAsB,CAAC,eAAe,GAAG,mBAAmB,CAAC,CAAC;IAC1F,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,eAAe,CAAC,CAAC;IAC7C,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAmB;IAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAC5C,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,MAAM,CAAC,cAAc,EAAE,CAAC;IACvC,MAAM,CAAC,IAAI,EAAE,CAAC;IACd,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAmB,EAAE,SAAiB;IACnE,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAC5C,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;IACpC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,EAAE,SAAS,CAAC,CAAC;IACjD,MAAM,CAAC,IAAI,EAAE,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,IAAmB,EAAE,QAAe,EAAE,UAAkB;IACrF,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAC5C,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;IACpC,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,IAAI,UAAU,CAAC,CAAC;IAC9C,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE;QACxB,IAAI,MAAM,CAAC,UAAU,GAAG,UAAU,EAAE;YACnC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;SACrC;IACF,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,IAAI,EAAE,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,UAAkB,EAAE,iBAAyB;IACvE,MAAM,SAAS,GAAG,kBAAkB,CAAC,iBAAiB,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAiB;QAC9B,IAAI,EAAE,YAAY,CAAC,IAAI;QACvB,MAAM,EAAE;YACP,QAAQ,EAAE,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;SAC/C;KACD,CAAC;IACF,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,qCAAqC,CAC7C,IAAmB,EACnB,QAAsB,EACtB,KAAa;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;QAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG;YACZ,MAAM,EAAE,SAAS;YACjB,WAAW,EAAE,YAAY;YACzB,WAAW,EAAE,CAAC;SACd,CAAC;QACF,MAAM,WAAW,GAAG,yBAAyB,CAAC,QAAQ,CAAC,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACnF,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;QAC7B,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;KAC1B;AACF,CAAC;AAED,SAAS,gCAAgC,CACxC,IAAmB,EACnB,QAAsB,EACtB,KAAa;IAEb,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG;QACZ,MAAM,EAAE,SAAS;QACjB,WAAW,EAAE,YAAY;QACzB,WAAW,EAAE,CAAC;KACd,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;IACnF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;QAC/B,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,yBAAyB,CAAC,QAAQ,CAAC,CAAC,CAAC;KACrD;IACD,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;AAC3B,CAAC;AAED,SAAS,qCAAqC,CAC7C,IAAmB,EACnB,WAAmB,EACnB,sBAA8B;IAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;QACrC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG;YACZ,MAAM,EAAE,SAAS;YACjB,WAAW,EAAE,YAAY;YACzB,WAAW,EAAE,CAAC;SACd,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;QACnF,KAAK,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,sBAAsB,CAAC,CAAC;QAClE,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;KAC1B;AACF,CAAC;AAED,SAAS,gCAAgC,CAAC,IAAmB,EAAE,UAAkB;IAChF,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG;QACZ,MAAM,EAAE,SAAS;QACjB,WAAW,EAAE,YAAY;QACzB,WAAW,EAAE,CAAC;KACd,CAAC;IACF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;IACnF,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC5B,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;AAC3B,CAAC;AAED,SAAS,sBAAsB,CAAC,aAAqB;IACpD,OAAO,GAAG,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,mCAAmC,CAC3C,IAAmB,EACnB,iBAAyB,EACzB,WAAkB;IAElB,MAAM,QAAQ,GAAG;QAChB,MAAM,EAAE,SAAS;QACjB,WAAW,EAAE,YAAY;QACzB,WAAW,EAAE,CAAC;KACd,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;IACxF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;QAC3C,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,MAAM,CACZ,CAAC,EACD,yBAAyB,CAAC;YACzB,IAAI,EAAE,WAAW,CAAC,IAAI;YACtB,KAAK,EAAE,WAAW;YAClB,MAAM,EAAE;gBACP,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;aAC7C;SACD,CAAC,CACF,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;KAC1B;AACF,CAAC;AAED,SAAS,8BAA8B,CACtC,IAAmB,EACnB,iBAAyB,EACzB,WAAkB;IAElB,MAAM,QAAQ,GAAG;QAChB,MAAM,EAAE,SAAS;QACjB,WAAW,EAAE,YAAY;QACzB,WAAW,EAAE,CAAC;KACd,CAAC;IACF,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;IACxF,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;QAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,MAAM,CAAC,MAAM,CACZ,CAAC,EACD,yBAAyB,CAAC;YACzB,IAAI,EAAE,WAAW,CAAC,IAAI;YACtB,KAAK,EAAE,WAAW;YAClB,MAAM,EAAE;gBACP,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;aAC7C;SACD,CAAC,CACF,CAAC;KACF;IACD,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;AAC3B,CAAC;AAED,IAAK,SAIJ;AAJD,WAAK,SAAS;IACb,8BAAiB,CAAA;IACjB,8BAAiB,CAAA;IACjB,0BAAa,CAAA;AACd,CAAC,EAJI,SAAS,KAAT,SAAS,QAIb;AAED,IAAK,gBAGJ;AAHD,WAAK,gBAAgB;IACpB,mEAAU,CAAA;IACV,2DAAM,CAAA;AACP,CAAC,EAHI,gBAAgB,KAAhB,gBAAgB,QAGpB;AAED;;;;;;;;GAQG;AACH,MAAM,4BAA4B,GAAG;IACpC,MAAM,EAAE;QACP,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE;YAC9B,UAAU,EAAE;gBACX,KAAK,EAAE,IAAI;aACX;SACD;QACD,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE;YAC1B,UAAU,EAAE;gBACX,KAAK,EAAE,IAAI;aACX;SACD;KACD;IACD,MAAM,EAAE;QACP,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE;YAC9B,UAAU,EAAE;gBACX,KAAK,EAAE,IAAI;aACX;SACD;QACD,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE;YAC1B,UAAU,EAAE;gBACX,KAAK,EAAE,IAAI;aACX;SACD;KACD;IACD,IAAI,EAAE;QACL,CAAC,gBAAgB,CAAC,UAAU,CAAC,EAAE;YAC9B,UAAU,EAAE;gBACX,6GAA6G;gBAC7G,KAAK,EAAE,0BAA0B,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK;aAClD;SACD;QACD,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE;YAC1B,UAAU,EAAE;gBACX,KAAK,EAAE,IAAI;aACX;SACD;KACD;CACQ,CAAC;AAEX,MAAM,uBAAuB,GAAG,CAC/B,SAAoB,EACpB,gBAAkC,EAClC,UAAkB,EACjB,EAAE;IACH,OAAO,IAAI,CAAC,KAAK,CAChB,4BAA4B,CAAC,SAAS,CAAC,CAAC,gBAAgB,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,UAAU,CACxF,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAEjC,MAAM,KAAK,GAAG;IACb,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE;IAClC,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE;IACnC,EAAE,UAAU,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE;CAClC,CAAC;AAEF,MAAM,MAAM,GAAG;IACd;QACC,WAAW,EAAE,mBAAmB;QAChC,KAAK,EAAE,gBAAgB,CAAC,UAAU;QAClC,gBAAgB,EAAE,GAAG,oBAAoB,eAAe;KACxD;IACD;QACC,WAAW,EAAE,oBAAoB;QACjC,KAAK,EAAE,gBAAgB,CAAC,MAAM;QAC9B,gBAAgB,EAAE,eAAe;KACjC;CACD,CAAC;AAEF,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACxB,MAAM,kBAAkB,GAA6C,IAAI,GAAG,EAAE,CAAC;IAC/E,IAAI,oBAAoB,GAAG,EAAE,CAAC;IAC9B,MAAM,cAAc,GAAgC,EAAE,CAAC;IAEvD,SAAS,kBAAkB,CAAC,IAAiB,EAAE,WAAwC;QACtF,4EAA4E;QAC5E,MAAM,qBAAqB,GAAI,IAAY,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1E,SAAS,kBAAkB,CAAC,OAAY,EAAE,kBAA2B,SAAS;YAC7E,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1B,qBAAqB,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;QACjD,CAAC;QACA,IAAY,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;IACvD,CAAC;IAED,MAAM,kBAAkB,GAAG,CAAC,UAAuC,EAAE,EAAE;QACtE,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAC5C,UAAU,CAAC,SAA8C,CAAC,CAC1D,CAAC;QACF,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAE5C,OAAO;YACN,uBAAuB,EAAE,YAAY;YACrC,qBAAqB,EAAE,cAAc;YACrC,YAAY,EAAE,UAAU,CAAC,MAAM;SAC/B,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,0BAA0B,GAAG,CAAC,IAAiB,EAAE,EAAE;QACxD,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,kBAAkB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IAC1C,CAAC,CAAC;IAEF,MAAM,sBAAsB,GAAG,GAAG,EAAE;QACnC,cAAc,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAC7B,kBAAkB,CAAC,kBAAkB,EAAE,oBAAoB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CACrE,CAAC;QACF,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,CAAC,CAAC;IAEF,MAAM,gBAAgB,GAAG,GAAG,EAAE;QAC7B,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,CAAC,CAAC;IAEF,UAAU,CAAC;QACV,oBAAoB,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC;QAC/D,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,SAAS,CAAC,GAAG,EAAE;QACd,2IAA2I;QAC3I,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;QACpC,cAAc,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAC7B,kBAAkB,CAAC,kBAAkB,EAAE,oBAAoB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CACrE,CAAC;QACF,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,KAAK,CAAC,GAAG,EAAE;QACV,MAAM,mBAAmB,GAAU,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,IAAI,kBAAkB,EAAE;YACtD,mBAAmB,CAAC,IAAI,CAAC;gBACxB,WAAW,EAAE,aAAa;gBAC1B,GAAG,kBAAkB,CAAC,GAAG,CAAC;aAC1B,CAAC,CAAC;SACH;QACD,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;QAC1B,mBAAmB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YACpC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/D,KAAK,CAAC,MAAM,EAAE,CAAC;QAChB,CAAC,CAAC,CAAC;QACH,KAAK,CAAC,IAAI,CAAC,CAAC,0BAA0B,CAAC,CAAC,CAAC;QAEzC,OAAO,CAAC,GAAG,CAAC,qCAAqC,CAAC,CAAC;QACnD,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,SAAS,YAAY,CAAC,gBAAkC,EAAE,UAAkB;YAC3E,MAAM,IAAI,GAAG,mBAAmB,EAAE,CAAC;YACnC,0BAA0B,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,IAAI,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;YACtC,gBAAgB,EAAE,CAAC,CAAC,8DAA8D;YAClF,MAAM,QAAQ,GAAG,kBAAkB,CAClC,uBAAuB,CAAC,SAAS,CAAC,MAAM,EAAE,gBAAgB,EAAE,UAAU,CAAC,CACvE,CAAC;YACF,MAAM,KAAK,GACV,gBAAgB,KAAK,gBAAgB,CAAC,UAAU;gBAC/C,CAAC,CAAC,qCAAqC;gBACvC,CAAC,CAAC,gCAAgC,CAAC;YAErC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,oBAAoB,CAAC,CAAC;YAC5C,oBAAoB,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC;QAClD,CAAC;QAED,KAAK,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,gBAAgB,EAAE,IAAI,MAAM,EAAE;YAC9D,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;gBAC1B,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE;oBACzC,EAAE,CAAC,GAAG,oBAAoB,IAAI,IAAI,aAAa,gBAAgB,EAAE,EAAE,GAAG,EAAE;wBACvE,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;oBACjC,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,SAAS,YAAY,CAAC,gBAAkC,EAAE,UAAkB;YAC3E,MAAM,IAAI,GAAG,mBAAmB,EAAE,CAAC;YACnC,0BAA0B,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,aAAa,GAAG,uBAAuB,CAC5C,SAAS,CAAC,MAAM,EAChB,gBAAgB,EAChB,UAAU,CACV,CAAC;YACF,MAAM,IAAI,GAAG,kBAAkB,CAAC,IAAI,EAAE,iBAAiB,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC;YAC7E,gBAAgB,EAAE,CAAC,CAAC,8DAA8D;YAClF,IAAI,gBAAgB,KAAK,gBAAgB,CAAC,UAAU,EAAE;gBACrD,qCAAqC,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;aACpD;iBAAM;gBACN,gCAAgC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;aAC5C;YACD,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC;QAED,KAAK,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,gBAAgB,EAAE,IAAI,MAAM,EAAE;YAC9D,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;gBAC1B,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE;oBACzC,EAAE,CAAC,GAAG,oBAAoB,IAAI,IAAI,aACjC,KAAK,KAAK,gBAAgB,CAAC,UAAU;wBACpC,CAAC,CAAC,gBAAgB;wBAClB,CAAC,CAAC,0CAA0C,oBAAoB,QAClE,EAAE,EAAE,GAAG,EAAE;wBACR,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;oBACjC,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC3B,SAAS,YAAY,CAAC,gBAAkC,EAAE,UAAkB;YAC3E,MAAM,IAAI,GAAG,mBAAmB,EAAE,CAAC;YACnC,0BAA0B,CAAC,IAAI,CAAC,CAAC;YACjC,oFAAoF;YACpF,MAAM,IAAI,GAAG,kBAAkB,CAAC,IAAI,EAAE,iBAAiB,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAC,CAAC;YACrF,gBAAgB,EAAE,CAAC,CAAC,8DAA8D;YAClF,MAAM,WAAW,GAAG,sBAAsB,CACzC,uBAAuB,CAAC,SAAS,CAAC,IAAI,EAAE,gBAAgB,EAAE,UAAU,CAAC,CACrE,CAAC;YACF,IAAI,gBAAgB,KAAK,gBAAgB,CAAC,UAAU,EAAE;gBACrD,mCAAmC,CAAC,IAAI,EAAE,oBAAoB,EAAE,WAAW,CAAC,CAAC;aAC7E;iBAAM;gBACN,8BAA8B,CAAC,IAAI,EAAE,oBAAoB,EAAE,WAAW,CAAC,CAAC;aACxE;YACD,oBAAoB,CAAC,IAAI,EAAE,WAAW,EAAE,oBAAoB,CAAC,CAAC;QAC/D,CAAC;QAED,KAAK,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,gBAAgB,EAAE,IAAI,MAAM,EAAE;YAC9D,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;gBAC1B,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE;oBACzC,EAAE,CAAC,GAAG,oBAAoB,IAAI,IAAI,eAAe,gBAAgB,eAChE,KAAK,KAAK,gBAAgB,CAAC,UAAU;wBACpC,CAAC,CAAC,QAAQ;wBACV,CAAC,CAAC,GAAG,oBAAoB,QAC3B,EAAE,EAAE,GAAG,EAAE;wBACR,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;oBACjC,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;QAC5C,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,GAAG,GAAG,CAAC,CAAC;QACnE,MAAM,mBAAmB,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAAC;QAMpE,MAAM,aAAa,GAAyB;YAC3C;gBACC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,iBAAiB;gBACrC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,iBAAiB;gBACnC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,iBAAiB;aACrC;YACD;gBACC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,mBAAmB;gBACvC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,mBAAmB;gBACrC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,mBAAmB;aACvC;YACD;gBACC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,mBAAmB;gBACvC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,mBAAmB;gBACrC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,mBAAmB;aACvC;YACD;gBACC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,mBAAmB;gBACvC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,mBAAmB;gBACrC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,mBAAmB;aACvC;SACD,CAAC;QAEF,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;YACxC,MAAM,8CAA8C,GAAG,CACtD,UAAkB,EAClB,YAAgC,EAC/B,EAAE;gBACH,MAAM,EACL,MAAM,EAAE,eAAe,EACvB,MAAM,EAAE,eAAe,EACvB,IAAI,EAAE,aAAa,GACnB,GAAG,YAAY,CAAC;gBAEjB,MAAM,IAAI,GAAG,mBAAmB,EAAE,CAAC;gBACnC,0BAA0B,CAAC,IAAI,CAAC,CAAC;gBAEjC,SAAS;gBACT,MAAM,aAAa,GAAG,uBAAuB,CAC5C,SAAS,CAAC,MAAM,EAChB,gBAAgB,CAAC,UAAU,EAC3B,UAAU,CACV,CAAC;gBACF,MAAM,IAAI,GAAG,kBAAkB,CAC9B,IAAI,EACJ,iBAAiB,CAAC,eAAe,EAAE,aAAa,CAAC,CACjD,CAAC;gBACF,gBAAgB,EAAE,CAAC,CAAC,8DAA8D;gBAClF,qCAAqC,CAAC,IAAI,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC;gBAChE,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAE9B,SAAS;gBACT,MAAM,eAAe,GAAG,kBAAkB,CACzC,uBAAuB,CACtB,SAAS,CAAC,MAAM,EAChB,gBAAgB,CAAC,UAAU,EAC3B,UAAU,CACV,CACD,CAAC;gBACF,qCAAqC,CAAC,IAAI,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;gBAC9E,oBAAoB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;gBAE5C,OAAO;gBACP,wJAAwJ;gBACxJ,IAAI,eAAe,GAAG,aAAa,EAAE;oBACpC,MAAM,SAAS,GAAG,aAAa,GAAG,eAAe,CAAC;oBAClD,sBAAsB,EAAE,CAAC;oBACzB,qCAAqC,CACpC,IAAI,EACJ,kBAAkB,CAAC,aAAa,CAAC,EACjC,SAAS,CACT,CAAC;oBACF,gBAAgB,EAAE,CAAC,CAAC,iEAAiE;iBACrF;gBACD,MAAM,WAAW,GAAG,sBAAsB,CACzC,uBAAuB,CACtB,SAAS,CAAC,IAAI,EACd,gBAAgB,CAAC,UAAU,EAC3B,UAAU,CACV,CACD,CAAC;gBACF,mCAAmC,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;gBACtE,oBAAoB,CAAC,IAAI,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;YACxD,CAAC,CAAC;YAEF,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;gBACzC,MAAM,gBAAgB,GAAG,iBAAiB,YAAY,CAAC,MAAM,aAAa,YAAY,CAAC,IAAI,WAAW,YAAY,CAAC,MAAM,UAAU,CAAC;gBACpI,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;oBAC/B,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,KAAK,EAAE;wBACnC,EAAE,CAAC,eAAe,UAAU,EAAE,EAAE,GAAG,EAAE;4BACpC,8CAA8C,CAC7C,UAAU,EACV,YAAY,CACZ,CAAC;wBACH,CAAC,CAAC,CAAC;qBACH;gBACF,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,QAAQ;QACR,kFAAkF;QAClF,iGAAiG;QACjG,8GAA8G;QAC9G,qHAAqH;QACrH,8FAA8F;QAC9F,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;YACpC,MAAM,2CAA2C,GAAG,CACnD,UAAkB,EAClB,YAAgC,EAC/B,EAAE;gBACH,MAAM,EACL,MAAM,EAAE,gBAAgB,EACxB,MAAM,EAAE,eAAe,EACvB,IAAI,EAAE,aAAa,GACnB,GAAG,YAAY,CAAC;gBAEjB,MAAM,IAAI,GAAG,mBAAmB,EAAE,CAAC;gBACnC,0BAA0B,CAAC,IAAI,CAAC,CAAC;gBAEjC,SAAS;gBACT,MAAM,aAAa,GAAG,uBAAuB,CAC5C,SAAS,CAAC,MAAM,EAChB,gBAAgB,CAAC,MAAM,EACvB,UAAU,CACV,CAAC;gBACF,MAAM,IAAI,GAAG,kBAAkB,CAC9B,IAAI,EACJ,iBAAiB,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAClD,CAAC;gBACF,gBAAgB,EAAE,CAAC,CAAC,8DAA8D;gBAClF,gCAAgC,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;gBACzD,oBAAoB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAE9B,SAAS;gBACT,MAAM,eAAe,GAAG,kBAAkB,CACzC,uBAAuB,CAAC,SAAS,CAAC,MAAM,EAAE,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAC,CAC9E,CAAC;gBACF,gCAAgC,CAAC,IAAI,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;gBACzE,oBAAoB,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;gBAE5C,OAAO;gBACP,wJAAwJ;gBACxJ,mJAAmJ;gBACnJ,IAAI,eAAe,GAAG,aAAa,EAAE;oBACpC,MAAM,SAAS,GAAG,aAAa,GAAG,eAAe,CAAC;oBAClD,sBAAsB,EAAE,CAAC;oBACzB,qCAAqC,CACpC,IAAI,EACJ,kBAAkB,CAAC,aAAa,CAAC,EACjC,SAAS,CACT,CAAC;oBACF,gBAAgB,EAAE,CAAC,CAAC,iEAAiE;iBACrF;gBACD,MAAM,WAAW,GAAG,sBAAsB,CACzC,uBAAuB,CAAC,SAAS,CAAC,IAAI,EAAE,gBAAgB,CAAC,MAAM,EAAE,UAAU,CAAC,CAC5E,CAAC;gBACF,8BAA8B,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC;gBACjE,oBAAoB,CAAC,IAAI,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC;YACxD,CAAC,CAAC;YAEF,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;gBACzC,MAAM,gBAAgB,GAAG,iBAAiB,YAAY,CAAC,MAAM,aAAa,YAAY,CAAC,IAAI,WAAW,YAAY,CAAC,MAAM,UAAU,CAAC;gBACpI,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;oBAC/B,KAAK,MAAM,EAAE,UAAU,EAAE,IAAI,KAAK,EAAE;wBACnC,EAAE,CAAC,eAAe,UAAU,EAAE,EAAE,GAAG,EAAE;4BACpC,2CAA2C,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;wBACvE,CAAC,CAAC,CAAC;qBACH;gBACF,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;IACJ,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, fail } from \"assert\";\nimport Table from \"easy-table\";\nimport { isInPerformanceTestingMode } from \"@fluid-tools/benchmark\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport {\n\tMockContainerRuntimeFactory,\n\tMockFluidDataStoreRuntime,\n\tMockStorage,\n} from \"@fluidframework/test-runtime-utils\";\nimport { createIdCompressor } from \"@fluidframework/id-compressor\";\nimport {\n\tTreeCompressionStrategy,\n\tcursorForJsonableTreeNode,\n} from \"../../feature-libraries/index.js\";\nimport { ISharedTree, ITreeCheckout, SharedTree } from \"../../shared-tree/index.js\";\nimport { JsonCompatibleReadOnly, brand, getOrAddEmptyToMap } from \"../../util/index.js\";\nimport {\n\tAllowedUpdateType,\n\tFieldKey,\n\tforEachNode,\n\tJsonableTree,\n\tmoveToDetachedField,\n\trootFieldKey,\n\tValue,\n} from \"../../core/index.js\";\nimport { SchemaBuilder, leaf } from \"../../domains/index.js\";\nimport { schematizeFlexTree, treeTestFactory } from \"../utils.js\";\nimport { typeboxValidator } from \"../../external-utilities/index.js\";\n\n// Notes:\n// 1. Within this file \"percentile\" is commonly used, and seems to refer to a portion (0 to 1) or some maximum size.\n// While it would be useful and interesting to have some distribution of op sizes and measure some percentile from that distribution,\n// that does not appear to be what these tests are doing.\n// 2. Data from these tests are just printed: no other data collection is done. If a comparison is desired, manually run the tests before and after.\n// 3. Major changes in these sizes (regressions, optimizations or the tests not collecting what they should) do not make these tests fail.\n// 4. These tests are currently implemented as integration tests, meaning they use lots of dependencies and high level APIs.\n// They could be reimplemented targeted the lower level APIs if desired.\n// 5. \"large\" node just get a long repeated string value, not a complex tree, so tree encoding is not really covered here.\n// TODO: fix above issues.\n\nconst builder = new SchemaBuilder({ scope: \"opSize\" });\n\nconst childSchema = builder.object(\"Test:Opsize-Bench-Child\", {\n\tdata: leaf.string,\n});\nconst parentSchema = builder.object(\"Test:Opsize-Bench-Root\", {\n\tchildren: builder.sequence(childSchema),\n});\n\nconst fullSchemaData = builder.intoSchema(parentSchema);\n\nconst initialTestJsonTree = {\n\ttype: parentSchema.name,\n};\n\nconst childrenFieldKey: FieldKey = brand(\"children\");\n\n/**\n * Create a default attached tree for op submission\n */\nfunction createConnectedTree(): SharedTree {\n\tconst containerRuntimeFactory = new MockContainerRuntimeFactory();\n\tconst dataStoreRuntime = new MockFluidDataStoreRuntime({\n\t\tidCompressor: createIdCompressor(),\n\t});\n\tcontainerRuntimeFactory.createContainerRuntime(dataStoreRuntime);\n\tconst tree = treeTestFactory({\n\t\truntime: dataStoreRuntime,\n\t\toptions: {\n\t\t\tjsonValidator: typeboxValidator,\n\t\t\ttreeEncodeType: TreeCompressionStrategy.Uncompressed,\n\t\t},\n\t});\n\ttree.connect({\n\t\tdeltaConnection: dataStoreRuntime.createDeltaConnection(),\n\t\tobjectStorage: new MockStorage(),\n\t});\n\treturn tree;\n}\n\n/*\n * Updates the given `tree` to the given `schema` and inserts `state` as its root.\n */\nfunction initializeTestTree(\n\ttree: SharedTree,\n\tstate: JsonableTree = initialTestJsonTree,\n): ITreeCheckout {\n\tconst writeCursor = cursorForJsonableTreeNode(state);\n\treturn schematizeFlexTree(tree, {\n\t\tallowedSchemaModifications: AllowedUpdateType.Initialize,\n\t\tinitialTree: [writeCursor],\n\t\tschema: fullSchemaData,\n\t}).checkout;\n}\n\nfunction utf8Length(data: JsonCompatibleReadOnly): number {\n\treturn new TextEncoder().encode(JSON.stringify(data)).length;\n}\n\n/**\n * Creates a {@link JsonableTree} that matches the `parentSchema` and when run through `JSON.stringify` has the requested length in bytes when encoded as utf8.\n */\nfunction createTreeWithSize(desiredByteSize: number): JsonableTree {\n\tconst node = {\n\t\ttype: childSchema.name,\n\t\tfields: {\n\t\t\tdata: [{ value: \"\", type: leaf.string.name }],\n\t\t},\n\t};\n\n\tconst initialNodeByteSize = utf8Length(node);\n\tnode.fields.data[0].value = createStringFromLength(desiredByteSize - initialNodeByteSize);\n\tassert(utf8Length(node) === desiredByteSize);\n\treturn node;\n}\n\nfunction getChildrenLength(tree: ITreeCheckout): number {\n\tconst cursor = tree.forest.allocateCursor();\n\tmoveToDetachedField(tree.forest, cursor);\n\tcursor.enterNode(0);\n\tcursor.enterField(childrenFieldKey);\n\tconst length = cursor.getFieldLength();\n\tcursor.free();\n\treturn length;\n}\n\nfunction assertChildNodeCount(tree: ITreeCheckout, nodeCount: number): void {\n\tconst cursor = tree.forest.allocateCursor();\n\tmoveToDetachedField(tree.forest, cursor);\n\tcursor.enterNode(0);\n\tcursor.enterField(childrenFieldKey);\n\tassert.equal(cursor.getFieldLength(), nodeCount);\n\tcursor.free();\n}\n\n/**\n * Checks that the first `childCount` values under \"children\" have the provided value.\n */\nfunction expectChildrenValues(tree: ITreeCheckout, expected: Value, childCount: number): void {\n\tconst cursor = tree.forest.allocateCursor();\n\tmoveToDetachedField(tree.forest, cursor);\n\tcursor.enterNode(0);\n\tcursor.enterField(childrenFieldKey);\n\tassert(cursor.getFieldLength() >= childCount);\n\tforEachNode(cursor, () => {\n\t\tif (cursor.fieldIndex < childCount) {\n\t\t\tassert.equal(cursor.value, expected);\n\t\t}\n\t});\n\tcursor.free();\n}\n\n/**\n * Creates a jsonable tree with the desired number of children and the size of each child in bytes.\n */\nfunction createInitialTree(childNodes: number, childNodeByteSize: number): JsonableTree {\n\tconst childNode = createTreeWithSize(childNodeByteSize);\n\tconst jsonTree: JsonableTree = {\n\t\ttype: parentSchema.name,\n\t\tfields: {\n\t\t\tchildren: new Array(childNodes).fill(childNode),\n\t\t},\n\t};\n\treturn jsonTree;\n}\n\nfunction insertNodesWithIndividualTransactions(\n\ttree: ITreeCheckout,\n\tjsonNode: JsonableTree,\n\tcount: number,\n): void {\n\tfor (let i = 0; i < count; i++) {\n\t\ttree.transaction.start();\n\t\tconst path = {\n\t\t\tparent: undefined,\n\t\t\tparentField: rootFieldKey,\n\t\t\tparentIndex: 0,\n\t\t};\n\t\tconst writeCursor = cursorForJsonableTreeNode(jsonNode);\n\t\tconst field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });\n\t\tfield.insert(0, writeCursor);\n\t\ttree.transaction.commit();\n\t}\n}\n\nfunction insertNodesWithSingleTransaction(\n\ttree: ITreeCheckout,\n\tjsonNode: JsonableTree,\n\tcount: number,\n): void {\n\ttree.transaction.start();\n\tconst path = {\n\t\tparent: undefined,\n\t\tparentField: rootFieldKey,\n\t\tparentIndex: 0,\n\t};\n\tconst field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });\n\tfor (let i = 0; i < count; i++) {\n\t\tfield.insert(0, cursorForJsonableTreeNode(jsonNode));\n\t}\n\ttree.transaction.commit();\n}\n\nfunction removeNodesWithIndividualTransactions(\n\ttree: ITreeCheckout,\n\tnumRemovals: number,\n\tremovalsPerTransaction: number,\n): void {\n\tfor (let i = 0; i < numRemovals; i++) {\n\t\ttree.transaction.start();\n\t\tconst path = {\n\t\t\tparent: undefined,\n\t\t\tparentField: rootFieldKey,\n\t\t\tparentIndex: 0,\n\t\t};\n\t\tconst field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });\n\t\tfield.remove(getChildrenLength(tree) - 1, removalsPerTransaction);\n\t\ttree.transaction.commit();\n\t}\n}\n\nfunction removeNodesWithSingleTransaction(tree: ITreeCheckout, numRemoved: number): void {\n\ttree.transaction.start();\n\tconst path = {\n\t\tparent: undefined,\n\t\tparentField: rootFieldKey,\n\t\tparentIndex: 0,\n\t};\n\tconst field = tree.editor.sequenceField({ parent: path, field: childrenFieldKey });\n\tfield.remove(0, numRemoved);\n\ttree.transaction.commit();\n}\n\nfunction createStringFromLength(numberOfBytes: number): string {\n\treturn \"a\".repeat(numberOfBytes);\n}\n\nfunction editNodesWithIndividualTransactions(\n\ttree: ITreeCheckout,\n\tnumChildrenToEdit: number,\n\teditPayload: Value,\n): void {\n\tconst rootPath = {\n\t\tparent: undefined,\n\t\tparentField: rootFieldKey,\n\t\tparentIndex: 0,\n\t};\n\tconst editor = tree.editor.sequenceField({ parent: rootPath, field: childrenFieldKey });\n\tfor (let i = 0; i < numChildrenToEdit; i++) {\n\t\ttree.transaction.start();\n\t\teditor.remove(i, 1);\n\t\teditor.insert(\n\t\t\ti,\n\t\t\tcursorForJsonableTreeNode({\n\t\t\t\ttype: childSchema.name,\n\t\t\t\tvalue: editPayload,\n\t\t\t\tfields: {\n\t\t\t\t\tdata: [{ value: \"\", type: leaf.string.name }],\n\t\t\t\t},\n\t\t\t}),\n\t\t);\n\t\ttree.transaction.commit();\n\t}\n}\n\nfunction editNodesWithSingleTransaction(\n\ttree: ITreeCheckout,\n\tnumChildrenToEdit: number,\n\teditPayload: Value,\n): void {\n\tconst rootPath = {\n\t\tparent: undefined,\n\t\tparentField: rootFieldKey,\n\t\tparentIndex: 0,\n\t};\n\tconst editor = tree.editor.sequenceField({ parent: rootPath, field: childrenFieldKey });\n\ttree.transaction.start();\n\tfor (let i = 0; i < numChildrenToEdit; i++) {\n\t\teditor.remove(i, 1);\n\t\teditor.insert(\n\t\t\ti,\n\t\t\tcursorForJsonableTreeNode({\n\t\t\t\ttype: childSchema.name,\n\t\t\t\tvalue: editPayload,\n\t\t\t\tfields: {\n\t\t\t\t\tdata: [{ value: \"\", type: leaf.string.name }],\n\t\t\t\t},\n\t\t\t}),\n\t\t);\n\t}\n\ttree.transaction.commit();\n}\n\nenum Operation {\n\tInsert = \"Insert\",\n\tRemove = \"Remove\",\n\tEdit = \"Edit\",\n}\n\nenum TransactionStyle {\n\tIndividual,\n\tSingle,\n}\n\n/**\n * The following byte sizes in utf-8 encoded bytes of JsonableTree were found to be the maximum size that could be successfully\n * inserted/removed/edited using the following node counts and either individual of singular (bulk) transactions.\n *\n * Using any larger of a byte size of JsonableTree children causes the \"BatchToLarge\" error; this would require either:\n * Adding artificial wait, for e.x. by using a for-loop to segment our transactions into batches of less than the given node count.\n * OR\n * Making the size in bytes of the children smaller.\n */\nconst MAX_SUCCESSFUL_OP_BYTE_SIZES = {\n\tInsert: {\n\t\t[TransactionStyle.Individual]: {\n\t\t\tnodeCounts: {\n\t\t\t\t\"100\": 8900,\n\t\t\t},\n\t\t},\n\t\t[TransactionStyle.Single]: {\n\t\t\tnodeCounts: {\n\t\t\t\t\"100\": 9600,\n\t\t\t},\n\t\t},\n\t},\n\tRemove: {\n\t\t[TransactionStyle.Individual]: {\n\t\t\tnodeCounts: {\n\t\t\t\t\"100\": 9700,\n\t\t\t},\n\t\t},\n\t\t[TransactionStyle.Single]: {\n\t\t\tnodeCounts: {\n\t\t\t\t\"100\": 9700,\n\t\t\t},\n\t\t},\n\t},\n\tEdit: {\n\t\t[TransactionStyle.Individual]: {\n\t\t\tnodeCounts: {\n\t\t\t\t// Edit benchmarks use 1/10 of the actual max sizes outside of perf mode because it takes so long to execute.\n\t\t\t\t\"100\": isInPerformanceTestingMode ? 800000 : 80000,\n\t\t\t},\n\t\t},\n\t\t[TransactionStyle.Single]: {\n\t\t\tnodeCounts: {\n\t\t\t\t\"100\": 8600,\n\t\t\t},\n\t\t},\n\t},\n} as const;\n\nconst getSuccessfulOpByteSize = (\n\toperation: Operation,\n\ttransactionStyle: TransactionStyle,\n\tpercentile: number,\n) => {\n\treturn Math.floor(\n\t\tMAX_SUCCESSFUL_OP_BYTE_SIZES[operation][transactionStyle].nodeCounts[\"100\"] * percentile,\n\t);\n};\n\nconst BENCHMARK_NODE_COUNT = 100;\n\nconst sizes = [\n\t{ percentile: 0.1, word: \"small\" },\n\t{ percentile: 0.5, word: \"medium\" },\n\t{ percentile: 1.0, word: \"large\" },\n];\n\nconst styles = [\n\t{\n\t\tdescription: \"Many Transactions\",\n\t\tstyle: TransactionStyle.Individual,\n\t\textraDescription: `${BENCHMARK_NODE_COUNT} transactions`,\n\t},\n\t{\n\t\tdescription: \"Single Transaction\",\n\t\tstyle: TransactionStyle.Single,\n\t\textraDescription: `1 transaction`,\n\t},\n];\n\ndescribe(\"Op Size\", () => {\n\tconst opsByBenchmarkName: Map<string, ISequencedDocumentMessage[]> = new Map();\n\tlet currentBenchmarkName = \"\";\n\tconst currentTestOps: ISequencedDocumentMessage[] = [];\n\n\tfunction registerOpListener(tree: ISharedTree, resultArray: ISequencedDocumentMessage[]): void {\n\t\t// TODO: better way to hook this up. Needs to detect local ops exactly once.\n\t\tconst oldSubmitLocalMessage = (tree as any).submitLocalMessage.bind(tree);\n\t\tfunction submitLocalMessage(content: any, localOpMetadata: unknown = undefined): void {\n\t\t\tresultArray.push(content);\n\t\t\toldSubmitLocalMessage(content, localOpMetadata);\n\t\t}\n\t\t(tree as any).submitLocalMessage = submitLocalMessage;\n\t}\n\n\tconst getOperationsStats = (operations: ISequencedDocumentMessage[]) => {\n\t\tconst lengths = operations.map((operation) =>\n\t\t\tutf8Length(operation as unknown as JsonCompatibleReadOnly),\n\t\t);\n\t\tconst totalOpBytes = lengths.reduce((a, b) => a + b, 0);\n\t\tconst maxOpSizeBytes = Math.max(...lengths);\n\n\t\treturn {\n\t\t\t\"Total Op Size (Bytes)\": totalOpBytes,\n\t\t\t\"Max Op Size (Bytes)\": maxOpSizeBytes,\n\t\t\t\"Total Ops:\": operations.length,\n\t\t};\n\t};\n\n\tconst initializeOpDataCollection = (tree: ISharedTree) => {\n\t\tcurrentTestOps.length = 0;\n\t\tregisterOpListener(tree, currentTestOps);\n\t};\n\n\tconst saveAndResetCurrentOps = () => {\n\t\tcurrentTestOps.forEach((op) =>\n\t\t\tgetOrAddEmptyToMap(opsByBenchmarkName, currentBenchmarkName).push(op),\n\t\t);\n\t\tcurrentTestOps.length = 0;\n\t};\n\n\tconst deleteCurrentOps = () => {\n\t\tcurrentTestOps.length = 0;\n\t};\n\n\tbeforeEach(function (): void {\n\t\tcurrentBenchmarkName = this.currentTest?.fullTitle() ?? fail();\n\t\tcurrentTestOps.length = 0;\n\t});\n\n\tafterEach(() => {\n\t\t// Currently tests can pass when no data is collected, so throw here in that case to ensure tests don't break and start collecting no data.\n\t\tassert(currentTestOps.length !== 0);\n\t\tcurrentTestOps.forEach((op) =>\n\t\t\tgetOrAddEmptyToMap(opsByBenchmarkName, currentBenchmarkName).push(op),\n\t\t);\n\t\tcurrentTestOps.length = 0;\n\t});\n\n\tafter(() => {\n\t\tconst allBenchmarkOpStats: any[] = [];\n\t\tfor (const [benchmarkName, ops] of opsByBenchmarkName) {\n\t\t\tallBenchmarkOpStats.push({\n\t\t\t\t\"Test name\": benchmarkName,\n\t\t\t\t...getOperationsStats(ops),\n\t\t\t});\n\t\t}\n\t\tconst table = new Table();\n\t\tallBenchmarkOpStats.forEach((data) => {\n\t\t\tObject.keys(data).forEach((key) => table.cell(key, data[key]));\n\t\t\ttable.newRow();\n\t\t});\n\t\ttable.sort([\"Avg. Op Size (Bytes)|des\"]);\n\n\t\tconsole.log(\"-- Op Size Benchmark Statistics -- \");\n\t\tconsole.log(table.toString());\n\t});\n\n\tdescribe(\"Insert Nodes\", () => {\n\t\tfunction benchmarkOps(transactionStyle: TransactionStyle, percentile: number): void {\n\t\t\tconst tree = createConnectedTree();\n\t\t\tinitializeOpDataCollection(tree);\n\t\t\tconst view = initializeTestTree(tree);\n\t\t\tdeleteCurrentOps(); // We don't want to record any ops from initializing the tree.\n\t\t\tconst jsonNode = createTreeWithSize(\n\t\t\t\tgetSuccessfulOpByteSize(Operation.Insert, transactionStyle, percentile),\n\t\t\t);\n\t\t\tconst apply =\n\t\t\t\ttransactionStyle === TransactionStyle.Individual\n\t\t\t\t\t? insertNodesWithIndividualTransactions\n\t\t\t\t\t: insertNodesWithSingleTransaction;\n\n\t\t\tapply(view, jsonNode, BENCHMARK_NODE_COUNT);\n\t\t\tassertChildNodeCount(view, BENCHMARK_NODE_COUNT);\n\t\t}\n\n\t\tfor (const { description, style, extraDescription } of styles) {\n\t\t\tdescribe(description, () => {\n\t\t\t\tfor (const { percentile, word } of sizes) {\n\t\t\t\t\tit(`${BENCHMARK_NODE_COUNT} ${word} nodes in ${extraDescription}`, () => {\n\t\t\t\t\t\tbenchmarkOps(style, percentile);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"Remove Nodes\", () => {\n\t\tfunction benchmarkOps(transactionStyle: TransactionStyle, percentile: number): void {\n\t\t\tconst tree = createConnectedTree();\n\t\t\tinitializeOpDataCollection(tree);\n\t\t\tconst childByteSize = getSuccessfulOpByteSize(\n\t\t\t\tOperation.Remove,\n\t\t\t\ttransactionStyle,\n\t\t\t\tpercentile,\n\t\t\t);\n\t\t\tconst view = initializeTestTree(tree, createInitialTree(100, childByteSize));\n\t\t\tdeleteCurrentOps(); // We don't want to record any ops from initializing the tree.\n\t\t\tif (transactionStyle === TransactionStyle.Individual) {\n\t\t\t\tremoveNodesWithIndividualTransactions(view, 100, 1);\n\t\t\t} else {\n\t\t\t\tremoveNodesWithSingleTransaction(view, 100);\n\t\t\t}\n\t\t\tassertChildNodeCount(view, 0);\n\t\t}\n\n\t\tfor (const { description, style, extraDescription } of styles) {\n\t\t\tdescribe(description, () => {\n\t\t\t\tfor (const { percentile, word } of sizes) {\n\t\t\t\t\tit(`${BENCHMARK_NODE_COUNT} ${word} nodes in ${\n\t\t\t\t\t\tstyle === TransactionStyle.Individual\n\t\t\t\t\t\t\t? extraDescription\n\t\t\t\t\t\t\t: `1 transactions containing 1 removal of ${BENCHMARK_NODE_COUNT} nodes`\n\t\t\t\t\t}`, () => {\n\t\t\t\t\t\tbenchmarkOps(style, percentile);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"Edit Nodes\", () => {\n\t\tfunction benchmarkOps(transactionStyle: TransactionStyle, percentile: number): void {\n\t\t\tconst tree = createConnectedTree();\n\t\t\tinitializeOpDataCollection(tree);\n\t\t\t// Note that the child node byte size for the initial tree here should be arbitrary.\n\t\t\tconst view = initializeTestTree(tree, createInitialTree(BENCHMARK_NODE_COUNT, 1000));\n\t\t\tdeleteCurrentOps(); // We don't want to record any ops from initializing the tree.\n\t\t\tconst editPayload = createStringFromLength(\n\t\t\t\tgetSuccessfulOpByteSize(Operation.Edit, transactionStyle, percentile),\n\t\t\t);\n\t\t\tif (transactionStyle === TransactionStyle.Individual) {\n\t\t\t\teditNodesWithIndividualTransactions(view, BENCHMARK_NODE_COUNT, editPayload);\n\t\t\t} else {\n\t\t\t\teditNodesWithSingleTransaction(view, BENCHMARK_NODE_COUNT, editPayload);\n\t\t\t}\n\t\t\texpectChildrenValues(view, editPayload, BENCHMARK_NODE_COUNT);\n\t\t}\n\n\t\tfor (const { description, style, extraDescription } of styles) {\n\t\t\tdescribe(description, () => {\n\t\t\t\tfor (const { percentile, word } of sizes) {\n\t\t\t\t\tit(`${BENCHMARK_NODE_COUNT} ${word} changes in ${extraDescription} containing ${\n\t\t\t\t\t\tstyle === TransactionStyle.Individual\n\t\t\t\t\t\t\t? \"1 edit\"\n\t\t\t\t\t\t\t: `${BENCHMARK_NODE_COUNT} edits`\n\t\t\t\t\t}`, () => {\n\t\t\t\t\t\tbenchmarkOps(style, percentile);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"Insert, Remove & Edit Nodes\", () => {\n\t\tconst oneThirdNodeCount = Math.floor(BENCHMARK_NODE_COUNT * (1 / 3));\n\t\tconst seventyPercentCount = Math.floor(BENCHMARK_NODE_COUNT * 0.7);\n\t\tconst fifteenPercentCount = Math.floor(BENCHMARK_NODE_COUNT * 0.15);\n\n\t\ttype OpKindDistribution = {\n\t\t\treadonly [OpKind in keyof typeof Operation]: number;\n\t\t};\n\n\t\tconst distributions: OpKindDistribution[] = [\n\t\t\t{\n\t\t\t\t[Operation.Insert]: oneThirdNodeCount,\n\t\t\t\t[Operation.Edit]: oneThirdNodeCount,\n\t\t\t\t[Operation.Remove]: oneThirdNodeCount,\n\t\t\t},\n\t\t\t{\n\t\t\t\t[Operation.Insert]: seventyPercentCount,\n\t\t\t\t[Operation.Edit]: fifteenPercentCount,\n\t\t\t\t[Operation.Remove]: fifteenPercentCount,\n\t\t\t},\n\t\t\t{\n\t\t\t\t[Operation.Insert]: fifteenPercentCount,\n\t\t\t\t[Operation.Edit]: seventyPercentCount,\n\t\t\t\t[Operation.Remove]: fifteenPercentCount,\n\t\t\t},\n\t\t\t{\n\t\t\t\t[Operation.Insert]: fifteenPercentCount,\n\t\t\t\t[Operation.Edit]: fifteenPercentCount,\n\t\t\t\t[Operation.Remove]: seventyPercentCount,\n\t\t\t},\n\t\t];\n\n\t\tdescribe(\"Individual Transactions\", () => {\n\t\t\tconst benchmarkInsertRemoveEditNodesWithInvidiualTxs = (\n\t\t\t\tpercentile: number,\n\t\t\t\tdistribution: OpKindDistribution,\n\t\t\t) => {\n\t\t\t\tconst {\n\t\t\t\t\tRemove: removeNodeCount,\n\t\t\t\t\tInsert: insertNodeCount,\n\t\t\t\t\tEdit: editNodeCount,\n\t\t\t\t} = distribution;\n\n\t\t\t\tconst tree = createConnectedTree();\n\t\t\t\tinitializeOpDataCollection(tree);\n\n\t\t\t\t// remove\n\t\t\t\tconst childByteSize = getSuccessfulOpByteSize(\n\t\t\t\t\tOperation.Remove,\n\t\t\t\t\tTransactionStyle.Individual,\n\t\t\t\t\tpercentile,\n\t\t\t\t);\n\t\t\t\tconst view = initializeTestTree(\n\t\t\t\t\ttree,\n\t\t\t\t\tcreateInitialTree(removeNodeCount, childByteSize),\n\t\t\t\t);\n\t\t\t\tdeleteCurrentOps(); // We don't want to record the ops from initializing the tree.\n\t\t\t\tremoveNodesWithIndividualTransactions(view, removeNodeCount, 1);\n\t\t\t\tassertChildNodeCount(view, 0);\n\n\t\t\t\t// insert\n\t\t\t\tconst insertChildNode = createTreeWithSize(\n\t\t\t\t\tgetSuccessfulOpByteSize(\n\t\t\t\t\t\tOperation.Insert,\n\t\t\t\t\t\tTransactionStyle.Individual,\n\t\t\t\t\t\tpercentile,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\tinsertNodesWithIndividualTransactions(view, insertChildNode, insertNodeCount);\n\t\t\t\tassertChildNodeCount(view, insertNodeCount);\n\n\t\t\t\t// edit\n\t\t\t\t// The editing function iterates over each child node and performs an edit so we have to make sure we have enough children to avoid going out of bounds.\n\t\t\t\tif (insertNodeCount < editNodeCount) {\n\t\t\t\t\tconst remainder = editNodeCount - insertNodeCount;\n\t\t\t\t\tsaveAndResetCurrentOps();\n\t\t\t\t\tinsertNodesWithIndividualTransactions(\n\t\t\t\t\t\tview,\n\t\t\t\t\t\tcreateTreeWithSize(childByteSize),\n\t\t\t\t\t\tremainder,\n\t\t\t\t\t);\n\t\t\t\t\tdeleteCurrentOps(); // We don't want to record the ops from re-initializing the tree.\n\t\t\t\t}\n\t\t\t\tconst editPayload = createStringFromLength(\n\t\t\t\t\tgetSuccessfulOpByteSize(\n\t\t\t\t\t\tOperation.Edit,\n\t\t\t\t\t\tTransactionStyle.Individual,\n\t\t\t\t\t\tpercentile,\n\t\t\t\t\t),\n\t\t\t\t);\n\t\t\t\teditNodesWithIndividualTransactions(view, editNodeCount, editPayload);\n\t\t\t\texpectChildrenValues(view, editPayload, editNodeCount);\n\t\t\t};\n\n\t\t\tfor (const distribution of distributions) {\n\t\t\t\tconst suiteDescription = `Distribution: ${distribution.Insert}% insert, ${distribution.Edit}% edit, ${distribution.Remove}% remove`;\n\t\t\t\tdescribe(suiteDescription, () => {\n\t\t\t\t\tfor (const { percentile } of sizes) {\n\t\t\t\t\t\tit(`Percentile: ${percentile}`, () => {\n\t\t\t\t\t\t\tbenchmarkInsertRemoveEditNodesWithInvidiualTxs(\n\t\t\t\t\t\t\t\tpercentile,\n\t\t\t\t\t\t\t\tdistribution,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\t// TODO:\n\t\t// These tests don't actually do a single transaction (they do one per edit type).\n\t\t// Therefor they are failing to test the size of transactions mixing inserts, removals and edits.\n\t\t// These tests also fail to clarify if the nodes being removed are ones which were inserted or edited earlier,\n\t\t// so it can't be used to test compaction of transient data within a transaction even if it was a single transaction.\n\t\t// Instead correctness tests should cover that, and maybe this suite should simply be removed?\n\t\tdescribe(\"Single Transactions\", () => {\n\t\t\tconst benchmarkInsertRemoveEditNodesWithSingleTxs = (\n\t\t\t\tpercentile: number,\n\t\t\t\tdistribution: OpKindDistribution,\n\t\t\t) => {\n\t\t\t\tconst {\n\t\t\t\t\tRemove: removedNodeCount,\n\t\t\t\t\tInsert: insertNodeCount,\n\t\t\t\t\tEdit: editNodeCount,\n\t\t\t\t} = distribution;\n\n\t\t\t\tconst tree = createConnectedTree();\n\t\t\t\tinitializeOpDataCollection(tree);\n\n\t\t\t\t// remove\n\t\t\t\tconst childByteSize = getSuccessfulOpByteSize(\n\t\t\t\t\tOperation.Remove,\n\t\t\t\t\tTransactionStyle.Single,\n\t\t\t\t\tpercentile,\n\t\t\t\t);\n\t\t\t\tconst view = initializeTestTree(\n\t\t\t\t\ttree,\n\t\t\t\t\tcreateInitialTree(removedNodeCount, childByteSize),\n\t\t\t\t);\n\t\t\t\tdeleteCurrentOps(); // We don't want to record the ops from initializing the tree.\n\t\t\t\tremoveNodesWithSingleTransaction(view, removedNodeCount);\n\t\t\t\tassertChildNodeCount(view, 0);\n\n\t\t\t\t// insert\n\t\t\t\tconst insertChildNode = createTreeWithSize(\n\t\t\t\t\tgetSuccessfulOpByteSize(Operation.Insert, TransactionStyle.Single, percentile),\n\t\t\t\t);\n\t\t\t\tinsertNodesWithSingleTransaction(view, insertChildNode, insertNodeCount);\n\t\t\t\tassertChildNodeCount(view, insertNodeCount);\n\n\t\t\t\t// edit\n\t\t\t\t// The editing function iterates over each child node and performs an edit so we have to make sure we have enough children to avoid going out of bounds.\n\t\t\t\t// TODO: if actually making this do a single transaction like its supposed to, this would be an issue as it would get included in that transaction.\n\t\t\t\tif (insertNodeCount < editNodeCount) {\n\t\t\t\t\tconst remainder = editNodeCount - insertNodeCount;\n\t\t\t\t\tsaveAndResetCurrentOps();\n\t\t\t\t\tinsertNodesWithIndividualTransactions(\n\t\t\t\t\t\tview,\n\t\t\t\t\t\tcreateTreeWithSize(childByteSize),\n\t\t\t\t\t\tremainder,\n\t\t\t\t\t);\n\t\t\t\t\tdeleteCurrentOps(); // We don't want to record the ops from re-initializing the tree.\n\t\t\t\t}\n\t\t\t\tconst editPayload = createStringFromLength(\n\t\t\t\t\tgetSuccessfulOpByteSize(Operation.Edit, TransactionStyle.Single, percentile),\n\t\t\t\t);\n\t\t\t\teditNodesWithSingleTransaction(view, editNodeCount, editPayload);\n\t\t\t\texpectChildrenValues(view, editPayload, editNodeCount);\n\t\t\t};\n\n\t\t\tfor (const distribution of distributions) {\n\t\t\t\tconst suiteDescription = `Distribution: ${distribution.Insert}% insert, ${distribution.Edit}% edit, ${distribution.Remove}% remove`;\n\t\t\t\tdescribe(suiteDescription, () => {\n\t\t\t\t\tfor (const { percentile } of sizes) {\n\t\t\t\t\t\tit(`Percentile: ${percentile}`, () => {\n\t\t\t\t\t\t\tbenchmarkInsertRemoveEditNodesWithSingleTxs(percentile, distribution);\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\t});\n});\n"]}

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

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